Andrzej Proskurowski

Hajo Broersma, Jirí Fiala, Petr A. Golovach, Tomás Kaiser, Daniël Paulusma, Andrzej Proskurowski: Linear-Time Algorithms for Scattering Number and Hamilton-Connectivity of Interval Graphs. CoRR abs/1301.5953 (2013)

Pinar Heggernes, Jan Kratochvíl, Andrzej Proskurowski: Guest editors' foreword. Discrete Applied Mathematics 160(6): 683-684 (2012)

Paul Bonsma, Arthur M. Farley, Andrzej Proskurowski: Extremal graphs having no matching cuts. Journal of Graph Theory 69(2): 206-222 (2012)

Pinar Heggernes, Daniel Meister, Andrzej Proskurowski: Computing minimum distortion embeddings into a path for bipartite permutation graphs and threshold graphs. Theor. Comput. Sci. 412(12-14): 1275-1297 (2011)

Binh-Minh Bui-Xuan, Pinar Heggernes, Daniel Meister, Andrzej Proskurowski: A Generic Approach to Decomposition Algorithms, with an Application to Digraph Decomposition. COCOON 2011: 331-342

Isolde Adler, Arthur M. Farley, Andrzej Proskurowski: Obstructions for linear rankwidth at most 1. CoRR abs/1106.2533 (2011)

Pinar Heggernes, Jan Kratochvíl, Andrzej Proskurowski: Guest Editors' Foreword. Discrete Applied Mathematics 158(7): 729-730 (2010)

Sarah A. Douglas, Arthur M. Farley, Ginnie Lo, Andrzej Proskurowski, Michal Young: Internationalization of computer science education. SIGCSE 2010: 411-415

Jan Kratochvíl, Andrzej Proskurowski, Oriol Serra: Guest editors' foreword. Discrete Applied Mathematics 157(12): 2575-2576 (2009)

Pinar Heggernes, Daniel Meister, Andrzej Proskurowski: Minimum Distortion Embeddings into a Path of Bipartite Permutation and Threshold Graphs. SWAT 2008: 331-342

Daniel Král, Jan Kratochvíl, Andrzej Proskurowski, Heinz-Jürgen Voss: Coloring mixed hypertrees. Discrete Applied Mathematics 154(4): 660-672 (2006)

Juan J. Flores, Andrzej Proskurowski: Qualitative Reasoning and Bifurcations in Dynamic Systems. MICAI 2006: 259-271

Christophe Paul, Andrzej Proskurowski, Jan Arne Telle: Generation of Graphs with Bounded Branchwidth. WG 2006: 205-216

Jan Kratochvíl, Andrzej Proskurowski, Oriol Serra: Structural decompositions, width parameters, and graph labelings. Discrete Applied Mathematics 145(2): 141-142 (2005)

Arvind Gupta, Naomi Nishimura, Andrzej Proskurowski, Prabhakar Ragde: Embeddings of k-connected graphs of pathwidth k. Discrete Applied Mathematics 145(2): 242-265 (2005)

Jirí Fiala, Jan Kratochvíl, Andrzej Proskurowski: Systems of distant representatives. Discrete Applied Mathematics 145(2): 306-316 (2005)

Arthur M. Farley, Andrzej Proskurowski: Priority-Consistent Graphs. Electronic Notes in Discrete Mathematics 22: 521-526 (2005)

Michele Flammini, Alfredo Navarra, Andrzej Proskurowski: On routing of wavebands for all-to-all communications in all-optical paths and cycles. Theor. Comput. Sci. 333(3): 401-413 (2005)

Arthur M. Farley, Andrzej Proskurowski, Daniel Zappala, Kurt J. Windisch: Spanners and message distribution in networks. Discrete Applied Mathematics 137(2): 159-171 (2004)

H. Brendan McMahan, Andrzej Proskurowski: Multi-source spanning trees: algorithms for minimizing source eccentricities. Discrete Applied Mathematics 137(2): 213-222 (2004)

Harold S. Connamacher, Andrzej Proskurowski: The complexity of minimizing certain cost metrics for k-source spanning trees. Discrete Applied Mathematics 131(1): 113-127 (2003)

Magnús M. Halldórsson, Guy Kortsarz, Andrzej Proskurowski, Ravit Salman, Hadas Shachnai, Jan Arne Telle: Multicoloring trees. Inf. Comput. 180(2): 113-129 (2003)

Michele Flammini, Alfredo Navarra, Andrzej Proskurowski: On Routing of Wavebands for Gossiping in All-Optical Paths and Cycles. SIROCCO 2003: 133-145

Jirí Fiala, Jan Kratochvíl, Andrzej Proskurowski: Geometric Systems of Disjoint Representatives. Graph Drawing 2002: 110-117

Leizhen Cai, Derek G. Corneil, Andrzej Proskurowski: Stable 2-pairs and (X, Y)-intersection graphs. Discrete Mathematics 230(1-3): 119-131 (2001)

Jirí Fiala, Jan Kratochvíl, Andrzej Proskurowski: Distance Constrained Labeling of Precolored Trees. ICTCS 2001: 285-292

Anders Dessmark, Andrzej Lingas, Andrzej Proskurowski: Faster Algorithms for Subgraph Isomorphism of k-Connected Partial k-Trees. Algorithmica 27(3): 337-347 (2000)

Bengt Aspvall, Jan Arne Telle, Andrzej Proskurowski: Memory Requirements for Table Computations in Partial k-Tree Algorithms. Algorithmica 27(3): 382-394 (2000)

Arthur M. Farley, Paraskevi Fragopoulou, David W. Krumme, Andrzej Proskurowski, Dana Richards: Multi-Source Spanning Tree Problems. Journal of Interconnection Networks 1(1): 61-71 (2000)

Anders Dessmark, Andrzej Lingas, Andrzej Proskurowski: Maximum packing for k-connected partial k-trees in polynomial time. Theor. Comput. Sci. 236(1-2): 179-191 (2000)

Arvind Gupta, Naomi Nishimura, Andrzej Proskurowski, Prabhakar Ragde: Embeddings of k-Connected Graphs of Pathwidth k. SWAT 2000: 111-124

Daniel Král, Jan Kratochvíl, Andrzej Proskurowski, Heinz-Jürgen Voss: Coloring Mixed Hypertrees. WG 2000: 279-289

Andrzej Proskurowski, Jan Arne Telle: Classes of graphs with restricted interval models. Discrete Mathematics & Theoretical Computer Science 3(4): 167-176 (1999)

Arthur M. Farley, Andrzej Proskurowski, Miroslawa Skowronska, Maciej M. Syslo: Hamiltonicity of Amalgams. Graphs and Combinatorics 15(4): 393-404 (1999)

Magnús M. Halldórsson, Guy Kortsarz, Andrzej Proskurowski, Ravit Salman, Hadas Shachnai, Jan Arne Telle: Multi-coloring Trees. COCOON 1999: 271-280

Arthur M. Farley, Paraskevi Fragopoulou, David W. Krumme, Andrzej Proskurowski, Dana Richards: Multi-Source Spanning Tree Problems. SIROCCO 1999: 126-136

Arthur M. Farley, Andrzej Pelc, Andrzej Proskurowski: Minimum-time multidrop broadcast. Discrete Applied Mathematics 83(1-3): 61-77 (1998)

Jan Kratochvíl, Andrzej Proskurowski, Jan Arne Telle: On the Complexity of Graph Covering Problems. Nord. J. Comput. 5(3): 173-195 (1998)

Andrzej Proskurowski, Frank Ruskey, Malcolm Smith: Analysis of Algorithms for Listing Equivalence Classes of k-ary Strings. SIAM J. Discrete Math. 11(1): 94-109 (1998)

Bengt Aspvall, Andrzej Proskurowski, Jan Arne Telle: Memory Requirements for Table Computations in Partial k-tree Algorithms. SWAT 1998: 222-233

Jan Kratochvíl, Andrzej Proskurowski, Jan Arne Telle: Covering Regular Graphs. J. Comb. Theory, Ser. B 71(1): 1-16 (1997)

Jan Arne Telle, Andrzej Proskurowski: Algorithms for Vertex Partitioning Problems on Partial k-Trees. SIAM J. Discrete Math. 10(4): 529-550 (1997)

Jan Kratochvíl, Andrzej Proskurowski, Jan Arne Telle: Complexity of Colored Graph Covers I. Colored Directed Multigraphs. WG 1997: 242-257

Leizhen Cai, Derek G. Corneil, Andrzej Proskurowski: A generalization of line graphs: (X, Y)-intersection graphs. Journal of Graph Theory 21(3): 267-287 (1996)

Andrzej Proskurowski, Maciej M. Syslo, Pawel Winter: Plane Embeddings of 2-trees and Biconnected Partial 2-Trees. SIAM J. Discrete Math. 9(4): 577-596 (1996)

Joost Engelfriet, Tero Harju, Andrzej Proskurowski, Grzegorz Rozenberg: Characterization and Complexity of Uniformly Non Primitive Labeled 2-Structures. Theor. Comput. Sci. 154(2): 247-282 (1996)

Anders Dessmark, Andrzej Lingas, Andrzej Proskurowski: Faster Algorithms for Subgraph Isomorphism of k-Connected Partial k-Trees. ESA 1996: 501-513

Arthur M. Farley, Andrzej Proskurowski: Bounded-call broadcasting. Discrete Applied Mathematics 53(1-3): 37-53 (1994)

Stefan Arnborg, Andrzej Proskurowski: A Technique for Recognizing Graphs of Bounded Treewidth with Application to Subclasses of Partial 2-Paths. TAGT 1994: 469-486

Jan Kratochvíl, Andrzej Proskurowski, Jan Arne Telle: Complexity of Graph Covering Problems. WG 1994: 93-105

Jan Arne Telle, Andrzej Proskurowski: Efficient Sets in Partial k-Trees. Discrete Applied Mathematics 44(1-3): 109-117 (1993)

Stefan Arnborg, Bruno Courcelle, Andrzej Proskurowski, Detlef Seese: An Algebraic Theory of Graph Reduction. J. ACM 40(5): 1134-1164 (1993)

Arthur M. Farley, Andrzej Proskurowski: Self-Repairing Networks. Parallel Processing Letters 3: 381-391 (1993)

Jan Arne Telle, Andrzej Proskurowski: Practical Algorithms on Partial k-Trees with an Application to Domination-like Problems. WADS 1993: 610-621

Stefan Arnborg, Andrzej Proskurowski: Canonical Representations of Partial 2- and 3-Trees. BIT 32(2): 197-214 (1992)

Andrzej Proskurowski: Graph reductions, and techniques for finding minimal forbidden minors. Graph Structure Theory 1991: 591-600

Stefan Arnborg, Andrzej Proskurowski, Derek G. Corneil: Forbidden minors characterization of partial 3-trees. Discrete Mathematics 80(1): 1-19 (1990)

Frank Ruskey, Andrzej Proskurowski: Generating Binary Trees by Transpositions. J. Algorithms 11(1): 68-84 (1990)

Andrzej Proskurowski: Report on GRA-GRA: 4th international workshop on graph grammars and their applications to computer science. SIGACT News 21(2): 39 (1990)

Stefan Arnborg, Andrzej Proskurowski, Detlef Seese: Monadic Second Order Logic, Tree Automata and Forbidden Minors. CSL 1990: 1-16

Stefan Arnborg, Bruno Courcelle, Andrzej Proskurowski, Detlef Seese: An Algebraic Theory of Graph Reduction. Graph-Grammars and Their Application to Computer Science 1990: 70-83

Stefan Arnborg, Andrzej Proskurowski: Canonical Representation of Partial 2- and 3-Trees. SWAT 1990: 310-319

Stefan Arnborg, Andrzej Proskurowski: Linear time algorithms for NP-hard problems restricted to partial k-trees. Discrete Applied Mathematics 23(1): 11-24 (1989)

Grant A. Cheston, Arthur M. Farley, Stephen T. Hedetniemi, Andrzej Proskurowski: Centering a Spanning Tree of a Biconnected Graph. Inf. Process. Lett. 32(5): 247-250 (1989)

Andrzej Lingas, Andrzej Proskurowski: On Parallel Complexity of the Subgraph Homeomorphism and the Subgraph Isomorphism Problem for Classes of Planar Graphs. Theor. Comput. Sci. 68(2): 155-173 (1989)

Andrzej Proskurowski, Frank Ruskey: Generating Binary Trees by Transpositions. SWAT 1988: 199-207

Andrzej Lingas, Andrzej Proskurowski: Fast Parallel Algorithms for the Subgraph Homophormism and the Subgraph Isomorphism Problem for Classes of Planat Graphs. FSTTCS 1987: 79-94

Stefan Arnborg, Andrzej Proskurowski: Problems on graphs with bounded decomposability. Bulletin of the EATCS 25: 7-10 (1985)

Andrzej Proskurowski, Frank Ruskey: Binary Tree Gray Codes. J. Algorithms 6(2): 225-238 (1985)

Sandra Mitchell Hedetniemi, Andrzej Proskurowski, Maciej M. Syslo: Interior graphs of maximal outerplane graphs. J. Comb. Theory, Ser. B 38(2): 156-167 (1985)

Andrzej Proskurowski: Separating subgraphs in k-trees: Cables and caterpillars. Discrete Mathematics 49(3): 275-285 (1984)

Charles J. Colbourn, Andrzej Proskurowski: Concurrent Transmissions in Broadcast Networks. ICALP 1984: 128-136

Arthur M. Farley, Andrzej Proskurowski: Directed Maximal-Cut Problems. Inf. Process. Lett. 15(5): 238-241 (1982)

Arthur M. Farley, Andrzej Proskurowski: Networks immune to isolated line failures. Networks 12(4): 393-403 (1982)

Arthur Parley, Stephen T. Hedetniemi, Andrzej Proskurowski: Partitioning trees: Matching, domination, and maximum diameter. International Journal of Parallel Programming 10(1): 55-61 (1981)

Andrzej Proskurowski, Maciej M. Syslo: Minimum dominating cycles in outerplanar graphs. International Journal of Parallel Programming 10(2): 127-139 (1981)

Andrzej Proskurowski: Recursive Graphs, Recursive Labelings and Shortest Paths. SIAM J. Comput. 10(2): 391-397 (1981)

Andrzej Proskurowski: Minimum Broadcast Trees. IEEE Trans. Computers 30(5): 363-366 (1981)

Andrzej Proskurowski: On the Generation of Binary Trees. J. ACM 27(1): 1-2 (1980)

Andrzej Proskurowski: Minimum dominating cycles in 2-trees. International Journal of Parallel Programming 8(5): 405-417 (1979)