Andrzej Proskurowski

96 papers A* 1A 3B 9C 1Misc 2Journal 68Unranked 12

Year	Rank	Type	Title / Venue / Authors
2023	J	`jnl`	Defensive domination in proper interval graphs. Discret. Appl. Math. Tínaz Ekim, Arthur M. Farley, Andrzej Proskurowski, Mordechai Shalom
2020	J	`jnl`	Defensive Domination in Proper Interval Graphs. CoRR Tínaz Ekim, Arthur M. Farley, Andrzej Proskurowski, Mordechai Shalom
2020	J	`jnl`	Foreword: Eighth Workshop on Graph Classes, Optimization, and Width Parameters, Toronto, Ontario, Canada. Discret. Appl. Math. Derek G. Corneil, Robert Ganian, Andrzej Proskurowski
2020	—	`conf`	Seeing Arboretum for the (partial k-) Trees. Treewidth, Kernels, and Algorithms Stefan Arnborg, Andrzej Proskurowski
2020	J	`jnl`	The complexity of the defensive domination problem in special graph classes. Discret. Math. Tínaz Ekim, Arthur M. Farley, Andrzej Proskurowski
2016	J	`jnl`	Foreword: Sixth Workshop on Graph Classes, Optimization, and Width Parameters, Santorini, Greece, October 2013. Discret. Appl. Math. Pinar Heggernes, Andrzej Proskurowski, Dimitrios M. Thilikos
2015	J	`jnl`	Linear-Time Algorithms for Scattering Number and Hamilton-Connectivity of Interval Graphs. J. Graph Theory Hajo Broersma, Jirí Fiala, Petr A. Golovach, Tomás Kaiser, Daniël Paulusma, Andrzej Proskurowski
2014	J	`jnl`	Obstructions for linear rank-width at most 1. Discret. Appl. Math. Isolde Adler, Arthur M. Farley, Andrzej Proskurowski
2014	J	`jnl`	Qualitative bifurcation diagrams. Expert Syst. J. Knowl. Eng. Héctor Rodríguez, Arthur M. Farley, Juan J. Flores, Andrzej Proskurowski
2013	J	`jnl`	Linear-Time Algorithms for Scattering Number and Hamilton-Connectivity of Interval Graphs CoRR Hajo Broersma, Jirí Fiala, Petr A. Golovach, Tomás Kaiser, Daniël Paulusma, Andrzej Proskurowski
2013	B	`conf`	Linear-Time Algorithms for Scattering Number and Hamilton-Connectivity of Interval Graphs. WG Hajo Broersma, Jirí Fiala, Petr A. Golovach, Tomás Kaiser, Daniël Paulusma, Andrzej Proskurowski
2012	J	`jnl`	Extremal graphs having no matching cuts. J. Graph Theory Paul S. Bonsma, Arthur M. Farley, Andrzej Proskurowski
2012	J	`jnl`	Guest editors' foreword. Discret. Appl. Math. Pinar Heggernes, Jan Kratochvíl, Andrzej Proskurowski
2012	C	`conf`	Intensive international Summer Schools in Global Distributed Software Development. FIE Arthur M. Farley, Stuart R. Faulk, Virginia Lo, Andrzej Proskurowski, Michal Young
2011	Misc	`conf`	A Generic Approach to Decomposition Algorithms, with an Application to Digraph Decomposition. COCOON Binh-Minh Bui-Xuan, Pinar Heggernes, Daniel Meister, Andrzej Proskurowski
2011	J	`jnl`	Computing minimum distortion embeddings into a path for bipartite permutation graphs and threshold graphs. Theor. Comput. Sci. Pinar Heggernes, Daniel Meister, Andrzej Proskurowski
2011	J	`jnl`	Obstructions for linear rankwidth at most 1 CoRR Isolde Adler, Arthur M. Farley, Andrzej Proskurowski
2010	J	`jnl`	Guest Editors' Foreword. Discret. Appl. Math. Pinar Heggernes, Jan Kratochvíl, Andrzej Proskurowski
2010	A	`conf`	Internationalization of computer science education. SIGCSE Sarah A. Douglas, Arthur M. Farley, Ginnie Lo, Andrzej Proskurowski, Michal Young
2009	J	`jnl`	Guest editors' foreword. Discret. Appl. Math. Jan Kratochvíl, Andrzej Proskurowski, Oriol Serra
2008	—	`conf`	Minimum Distortion Embeddings into a Path of Bipartite Permutation and Threshold Graphs. SWAT Pinar Heggernes, Daniel Meister, Andrzej Proskurowski
2006	J	`jnl`	Coloring mixed hypertrees. Discret. Appl. Math. Daniel Král, Jan Kratochvíl, Andrzej Proskurowski, Heinz-Jürgen Voss
2006	B	`conf`	Generation of Graphs with Bounded Branchwidth. WG Christophe Paul, Andrzej Proskurowski, Jan Arne Telle
2006	—	`conf`	Qualitative Reasoning and Bifurcations in Dynamic Systems. MICAI Juan J. Flores, Andrzej Proskurowski
2005	J	`jnl`	Embeddings of Discret. Appl. Math. Arvind Gupta, Naomi Nishimura, Andrzej Proskurowski, Prabhakar Ragde
2005	J	`jnl`	On routing of wavebands for all-to-all communications in all-optical paths and cycles. Theor. Comput. Sci. Michele Flammini, Alfredo Navarra, Andrzej Proskurowski
2005	J	`jnl`	Priority-Consistent Graphs. Electron. Notes Discret. Math. Arthur M. Farley, Andrzej Proskurowski
2005	J	`jnl`	Structural decompositions, width parameters, and graph labelings. Discret. Appl. Math. Jan Kratochvíl, Andrzej Proskurowski, Oriol Serra
2005	J	`jnl`	Systems of distant representatives. Discret. Appl. Math. Jirí Fiala, Jan Kratochvíl, Andrzej Proskurowski
2004	J	`jnl`	Multi-source spanning trees: algorithms for minimizing source eccentricities. Discret. Appl. Math. H. Brendan McMahan, Andrzej Proskurowski
2004	J	`jnl`	Spanners and message distribution in networks. Discret. Appl. Math. Arthur M. Farley, Andrzej Proskurowski, Daniel Zappala, Kurt J. Windisch
2003	J	`jnl`	Multicoloring trees. Inf. Comput. Magnús M. Halldórsson, Guy Kortsarz, Andrzej Proskurowski, Ravit Salman, Hadas Shachnai, Jan Arne Telle
2003	B	`conf`	On Routing of Wavebands for Gossiping in All-Optical Paths and Cycles. SIROCCO Michele Flammini, Alfredo Navarra, Andrzej Proskurowski
2003	J	`jnl`	The complexity of minimizing certain cost metrics for k-source spanning trees. Discret. Appl. Math. Harold S. Connamacher, Andrzej Proskurowski
2002	A	`conf`	Geometric Systems of Disjoint Representatives. GD Jirí Fiala, Jan Kratochvíl, Andrzej Proskurowski
2001	—	`conf`	Distance Constrained Labeling of Precolored Trees. ICTCS Jirí Fiala, Jan Kratochvíl, Andrzej Proskurowski
2001	J	`jnl`	Stable 2-pairs and ( Discret. Math. Leizhen Cai, Derek G. Corneil, Andrzej Proskurowski
2000	B	`conf`	Coloring Mixed Hypertrees. WG Daniel Král, Jan Kratochvíl, Andrzej Proskurowski, Heinz-Jürgen Voss
2000	—	`conf`	Embeddings of SWAT Arvind Gupta, Naomi Nishimura, Andrzej Proskurowski, Prabhakar Ragde
2000	J	`jnl`	Faster Algorithms for Subgraph Isomorphism of k-Connected Partial k-Trees. Algorithmica Anders Dessmark, Andrzej Lingas, Andrzej Proskurowski
2000	J	`jnl`	Maximum packing for k-connected partial k-trees in polynomial time. Theor. Comput. Sci. Anders Dessmark, Andrzej Lingas, Andrzej Proskurowski
2000	J	`jnl`	Memory Requirements for Table Computations in Partial k-Tree Algorithms. Algorithmica Bengt Aspvall, Jan Arne Telle, Andrzej Proskurowski
2000	J	`jnl`	Multi-Source Spanning Tree Problems. J. Interconnect. Networks Arthur M. Farley, Paraskevi Fragopoulou, David W. Krumme, Andrzej Proskurowski, Dana Richards
1999	J	`jnl`	Classes of graphs with restricted interval models. Discret. Math. Theor. Comput. Sci. Andrzej Proskurowski, Jan Arne Telle
1999	J	`jnl`	Hamiltonicity of Amalgams. Graphs Comb. Arthur M. Farley, Andrzej Proskurowski, Miroslawa Skowronska, Maciej M. Syslo
1999	B	`conf`	Multi-Source Spanning Tree Problems. SIROCCO Arthur M. Farley, Paraskevi Fragopoulou, David W. Krumme, Andrzej Proskurowski, Dana Richards
1999	Misc	`conf`	Multi-coloring Trees. COCOON Magnús M. Halldórsson, Guy Kortsarz, Andrzej Proskurowski, Ravit Salman, Hadas Shachnai, Jan Arne Telle
1998	J	`jnl`	Analysis of Algorithms for Listing Equivalence Classes of SIAM J. Discret. Math. Andrzej Proskurowski, Frank Ruskey, Malcolm Smith
1998	J	`jnl`	Disjoint and unfolding domination in graphs. Australas. J Comb. Jan Kratochvíl, Paul D. Manuel, Mirka Miller, Andrzej Proskurowski
1998	—	`conf`	Memory Requirements for Table Computations in Partial k-tree Algorithms. SWAT Bengt Aspvall, Andrzej Proskurowski, Jan Arne Telle
1998	J	`jnl`	Minimum-time multidrop broadcast. Discret. Appl. Math. Arthur M. Farley, Andrzej Pelc, Andrzej Proskurowski
1998	J	`jnl`	On the Complexity of Graph Covering Problems. Nord. J. Comput. Jan Kratochvíl, Andrzej Proskurowski, Jan Arne Telle
1997	J	`jnl`	Algorithms for Vertex Partitioning Problems on Partial SIAM J. Discret. Math. Jan Arne Telle, Andrzej Proskurowski
1997	B	`conf`	Complexity of Colored Graph Covers I. Colored Directed Multigraphs. WG Jan Kratochvíl, Andrzej Proskurowski, Jan Arne Telle
1997	J	`jnl`	Covering Regular Graphs. J. Comb. Theory B Jan Kratochvíl, Andrzej Proskurowski, Jan Arne Telle
1997	J	`jnl`	Minimum Self-Repairing Graphs. Graphs Comb. Arthur M. Farley, Andrzej Proskurowski
1996	J	`jnl`	A generalization of line graphs: ( J. Graph Theory Leizhen Cai, Derek G. Corneil, Andrzej Proskurowski
1996	J	`jnl`	Characterization and Complexity of Uniformly Non Primitive Labeled 2-Structures. Theor. Comput. Sci. Joost Engelfriet, Tero Harju, Andrzej Proskurowski, Grzegorz Rozenberg
1996	A	`conf`	Faster Algorithms for Subgraph Isomorphism of k-Connected Partial k-Trees. ESA Anders Dessmark, Andrzej Lingas, Andrzej Proskurowski
1996	J	`jnl`	Plane Embeddings of 2-trees and Biconnected Partial 2-Trees. SIAM J. Discret. Math. Andrzej Proskurowski, Maciej M. Syslo, Pawel Winter
1994	—	`conf`	A Technique for Recognizing Graphs of Bounded Treewidth with Application to Subclasses of Partial 2-Paths. TAGT Stefan Arnborg, Andrzej Proskurowski
1994	J	`jnl`	Bounded-call broadcasting. Discret. Appl. Math. Arthur M. Farley, Andrzej Proskurowski
1994	B	`conf`	Complexity of Graph Covering Problems. WG Jan Kratochvíl, Andrzej Proskurowski, Jan Arne Telle
1993	J	`jnl`	An Algebraic Theory of Graph Reduction. J. ACM Stefan Arnborg, Bruno Courcelle, Andrzej Proskurowski, Detlef Seese
1993	J	`jnl`	Efficient Sets in Partial Discret. Appl. Math. Jan Arne Telle, Andrzej Proskurowski
1993	B	`conf`	Practical Algorithms on Partial k-Trees with an Application to Domination-like Problems. WADS Jan Arne Telle, Andrzej Proskurowski
1993	J	`jnl`	Self-Repairing Networks. Parallel Process. Lett. Arthur M. Farley, Andrzej Proskurowski
1992	J	`jnl`	Canonical Representations of Partial 2- and 3-Trees. BIT Stefan Arnborg, Andrzej Proskurowski
1991	—	`conf`	Graph reductions, and techniques for finding minimal forbidden minors. Graph Structure Theory Andrzej Proskurowski
1990	—	`conf`	An Algebraic Theory of Graph Reduction. Graph-Grammars and Their Application to Computer Science Stefan Arnborg, Bruno Courcelle, Andrzej Proskurowski, Detlef Seese
1990	—	`conf`	Canonical Representation of Partial 2- and 3-Trees. SWAT Stefan Arnborg, Andrzej Proskurowski
1990	J	`jnl`	Forbidden minors characterization of partial 3-trees. Discret. Math. Stefan Arnborg, Andrzej Proskurowski, Derek G. Corneil
1990	J	`jnl`	Generating Binary Trees by Transpositions. J. Algorithms Frank Ruskey, Andrzej Proskurowski
1990	B	`conf`	Monadic Second Order Logic, Tree Automata and Forbidden Minors. CSL Stefan Arnborg, Andrzej Proskurowski, Detlef Seese
1990	J	`jnl`	Report on GRA-GRA: 4th international workshop on graph grammars and their applications to computer science. SIGACT News Andrzej Proskurowski
1989	J	`jnl`	Centering a Spanning Tree of a Biconnected Graph. Inf. Process. Lett. Grant A. Cheston, Arthur M. Farley, Stephen T. Hedetniemi, Andrzej Proskurowski
1989	J	`jnl`	Linear time algorithms for NP-hard problems restricted to partial k-trees. Discret. Appl. Math. Stefan Arnborg, Andrzej Proskurowski
1989	J	`jnl`	On Parallel Complexity of the Subgraph Homeomorphism and the Subgraph Isomorphism Problem for Classes of Planar Graphs. Theor. Comput. Sci. Andrzej Lingas, Andrzej Proskurowski
1988	—	`conf`	Generating Binary Trees by Transpositions. SWAT Andrzej Proskurowski, Frank Ruskey
1987	—	`conf`	Fast Parallel Algorithms for the Subgraph Homophormism and the Subgraph Isomorphism Problem for Classes of Planat Graphs. FSTTCS Andrzej Lingas, Andrzej Proskurowski
1985	J	`jnl`	Binary Tree Gray Codes. J. Algorithms Andrzej Proskurowski, Frank Ruskey
1985	J	`jnl`	Interior graphs of maximal outerplane graphs. J. Comb. Theory B Sandra Mitchell Hedetniemi, Andrzej Proskurowski, Maciej M. Syslo
1985	J	`jnl`	Problems on graphs with bounded decomposability. Bull. EATCS Stefan Arnborg, Andrzej Proskurowski
1984	A*	`conf`	Concurrent Transmissions in Broadcast Networks. ICALP Charles J. Colbourn, Andrzej Proskurowski
1984	J	`jnl`	Separating subgraphs in k-trees: Cables and caterpillars. Discret. Math. Andrzej Proskurowski
1982	J	`jnl`	Directed Maximal-Cut Problems. Inf. Process. Lett. Arthur M. Farley, Andrzej Proskurowski
1982	J	`jnl`	Networks immune to isolated line failures. Networks Arthur M. Farley, Andrzej Proskurowski
1981	J	`jnl`	Minimum Broadcast Trees. IEEE Trans. Computers Andrzej Proskurowski
1981	J	`jnl`	Minimum dominating cycles in outerplanar graphs. Int. J. Parallel Program. Andrzej Proskurowski, Maciej M. Syslo
1981	J	`jnl`	Partitioning trees: Matching, domination, and maximum diameter. Int. J. Parallel Program. Arthur M. Farley, Stephen T. Hedetniemi, Andrzej Proskurowski
1981	J	`jnl`	Recursive Graphs, Recursive Labelings and Shortest Paths. SIAM J. Comput. Andrzej Proskurowski
1980	J	`jnl`	Centers of maximal outerplanar graphs. J. Graph Theory Andrzej Proskurowski
1980	J	`jnl`	Computation of the center and diameter of outerplanar graphs. Discret. Appl. Math. Arthur M. Farley, Andrzej Proskurowski
1980	J	`jnl`	On the Generation of Binary Trees. J. ACM Andrzej Proskurowski
1979	J	`jnl`	Minimum broadcast graphs. Discret. Math. Arthur M. Farley, Stephen T. Hedetniemi, Sandra Mitchell Mitchell, Andrzej Proskurowski
1979	J	`jnl`	Minimum dominating cycles in 2-trees. Int. J. Parallel Program. Andrzej Proskurowski