Andrzej Proskurowski

Publication Activity (10 Years)

Years Active: 1979-2023
Publications (10 Years): 6

Top Topics

Polynomial Time Complexity

Execution Times

Unordered Trees

Graph Theoretic

Top Venues

Discret. Appl. Math.

Expert Syst. J. Knowl. Eng.

Publications

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