Andrzej Proskurowski

According to our database, Andrzej Proskurowski authored at least 84 papers between 1979 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2023

Defensive domination in proper interval graphs.

Tínaz Ekim, Arthur M. Farley, Andrzej Proskurowski, Mordechai Shalom

Discret. Appl. Math., May, 2023

2020

The complexity of the defensive domination problem in special graph classes.

Tínaz Ekim, Arthur M. Farley, Andrzej Proskurowski

Discret. Math., 2020

Foreword: Eighth Workshop on Graph Classes, Optimization, and Width Parameters, Toronto, Ontario, Canada.

Derek G. Corneil, Robert Ganian, Andrzej Proskurowski

Discret. Appl. Math., 2020

Seeing Arboretum for the (partial k-) Trees.

Stefan Arnborg, Andrzej Proskurowski

Proceedings of the Treewidth, Kernels, and Algorithms, 2020

2016

Foreword: Sixth Workshop on Graph Classes, Optimization, and Width Parameters, Santorini, Greece, October 2013.

Pinar Heggernes, Andrzej Proskurowski, Dimitrios M. Thilikos

Discret. Appl. Math., 2016

2015

Linear-Time Algorithms for Scattering Number and Hamilton-Connectivity of Interval Graphs.

Hajo Broersma, Jirí Fiala, Petr A. Golovach, Tomás Kaiser, Daniël Paulusma, Andrzej Proskurowski

J. Graph Theory, 2015

2014

Qualitative bifurcation diagrams.

Héctor Rodríguez, Arthur M. Farley, Juan J. Flores, Andrzej Proskurowski

Expert Syst. J. Knowl. Eng., 2014

Obstructions for linear rank-width at most 1.

Isolde Adler, Arthur M. Farley, Andrzej Proskurowski

Discret. Appl. Math., 2014

2012

Extremal graphs having no matching cuts.

Paul S. Bonsma, Arthur M. Farley, Andrzej Proskurowski

J. Graph Theory, 2012

Intensive international Summer Schools in Global Distributed Software Development.

Arthur M. Farley, Stuart R. Faulk, Virginia Lo, Andrzej Proskurowski, Michal Young

Proceedings of the IEEE Frontiers in Education Conference, 2012

2011

Computing minimum distortion embeddings into a path for bipartite permutation graphs and threshold graphs.

Pinar Heggernes, Daniel Meister, Andrzej Proskurowski

Theor. Comput. Sci., 2011

Obstructions for linear rankwidth at most 1

Isolde Adler, Arthur M. Farley, Andrzej Proskurowski

CoRR, 2011

A Generic Approach to Decomposition Algorithms, with an Application to Digraph Decomposition.

Binh-Minh Bui-Xuan, Pinar Heggernes, Daniel Meister, Andrzej Proskurowski

Proceedings of the Computing and Combinatorics - 17th Annual International Conference, 2011

2010

Guest Editors' Foreword.

Pinar Heggernes, Jan Kratochvíl, Andrzej Proskurowski

Discret. Appl. Math., 2010

Internationalization of computer science education.

Sarah A. Douglas, Arthur M. Farley, Ginnie Lo, Andrzej Proskurowski, Michal Young

Proceedings of the 41st ACM technical symposium on Computer science education, 2010

2009

Guest editors' foreword.

Jan Kratochvíl, Andrzej Proskurowski, Oriol Serra

Discret. Appl. Math., 2009

2008

Minimum Distortion Embeddings into a Path of Bipartite Permutation and Threshold Graphs.

Pinar Heggernes, Daniel Meister, Andrzej Proskurowski

Proceedings of the Algorithm Theory, 2008

2006

Coloring mixed hypertrees.

Daniel Král, Jan Kratochvíl, Andrzej Proskurowski, Heinz-Jürgen Voss

Discret. Appl. Math., 2006

Generation of Graphs with Bounded Branchwidth.

Christophe Paul, Andrzej Proskurowski, Jan Arne Telle

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2006

Qualitative Reasoning and Bifurcations in Dynamic Systems.

Juan J. Flores, Andrzej Proskurowski

Proceedings of the MICAI 2006: Advances in Artificial Intelligence, 2006

2005

On routing of wavebands for all-to-all communications in all-optical paths and cycles.

Michele Flammini, Alfredo Navarra, Andrzej Proskurowski

Theor. Comput. Sci., 2005

Priority-Consistent Graphs.

Arthur M. Farley, Andrzej Proskurowski

Electron. Notes Discret. Math., 2005

Structural decompositions, width parameters, and graph labelings.

Jan Kratochvíl, Andrzej Proskurowski, Oriol Serra

Discret. Appl. Math., 2005

Embeddings of <i>k</i>-connected graphs of pathwidth <i>k</i>.

Arvind Gupta, Naomi Nishimura, Andrzej Proskurowski, Prabhakar Ragde

Discret. Appl. Math., 2005

Systems of distant representatives.

Jirí Fiala, Jan Kratochvíl, Andrzej Proskurowski

Discret. Appl. Math., 2005

2004

Multi-source spanning trees: algorithms for minimizing source eccentricities.

H. Brendan McMahan, Andrzej Proskurowski

Discret. Appl. Math., 2004

Spanners and message distribution in networks.

Arthur M. Farley, Andrzej Proskurowski, Daniel Zappala, Kurt J. Windisch

Discret. Appl. Math., 2004

2003

Multicoloring trees.

Magnús M. Halldórsson, Guy Kortsarz, Andrzej Proskurowski, Ravit Salman, Hadas Shachnai, Jan Arne Telle

Inf. Comput., 2003

The complexity of minimizing certain cost metrics for k-source spanning trees.

Harold S. Connamacher, Andrzej Proskurowski

Discret. Appl. Math., 2003

On Routing of Wavebands for Gossiping in All-Optical Paths and Cycles.

Michele Flammini, Alfredo Navarra, Andrzej Proskurowski

Proceedings of the SIROCCO 10: Proceedings of the 10th Internaltional Colloquium on Structural Information Complexity, 2003

2002

Geometric Systems of Disjoint Representatives.

Jirí Fiala, Jan Kratochvíl, Andrzej Proskurowski

Proceedings of the Graph Drawing, 10th International Symposium, 2002

2001

Stable 2-pairs and (<i>X, Y</i>)-intersection graphs.

Leizhen Cai, Derek G. Corneil, Andrzej Proskurowski

Discret. Math., 2001

Distance Constrained Labeling of Precolored Trees.

Jirí Fiala, Jan Kratochvíl, Andrzej Proskurowski

Proceedings of the Theoretical Computer Science, 7th Italian Conference, 2001

2000

Maximum packing for k-connected partial k-trees in polynomial time.

Anders Dessmark, Andrzej Lingas, Andrzej Proskurowski

Theor. Comput. Sci., 2000

Multi-Source Spanning Tree Problems.

Arthur M. Farley, Paraskevi Fragopoulou, David W. Krumme, Andrzej Proskurowski, Dana Richards

J. Interconnect. Networks, 2000

Faster Algorithms for Subgraph Isomorphism of k-Connected Partial k-Trees.

Anders Dessmark, Andrzej Lingas, Andrzej Proskurowski

Algorithmica, 2000

Memory Requirements for Table Computations in Partial k-Tree Algorithms.

Bengt Aspvall, Jan Arne Telle, Andrzej Proskurowski

Algorithmica, 2000

1999

Hamiltonicity of Amalgams.

Arthur M. Farley, Andrzej Proskurowski, Miroslawa Skowronska, Maciej M. Syslo

Graphs Comb., 1999

Classes of graphs with restricted interval models.

Andrzej Proskurowski, Jan Arne Telle

Discret. Math. Theor. Comput. Sci., 1999

Multi-coloring Trees.

Magnús M. Halldórsson, Guy Kortsarz, Andrzej Proskurowski, Ravit Salman, Hadas Shachnai, Jan Arne Telle

Proceedings of the Computing and Combinatorics, 5th Annual International Conference, 1999

1998

Analysis of Algorithms for Listing Equivalence Classes of <i>k</i>-ary Strings.

Andrzej Proskurowski, Frank Ruskey, Malcolm Smith

SIAM J. Discret. Math., 1998

On the Complexity of Graph Covering Problems.

Jan Kratochvíl, Andrzej Proskurowski, Jan Arne Telle

Nord. J. Comput., 1998

Minimum-time multidrop broadcast.

Arthur M. Farley, Andrzej Pelc, Andrzej Proskurowski

Discret. Appl. Math., 1998

Disjoint and unfolding domination in graphs.

Jan Kratochvíl, Paul D. Manuel, Mirka Miller, Andrzej Proskurowski

Australas. J Comb., 1998

1997

Algorithms for Vertex Partitioning Problems on Partial <i>k</i>-Trees.

Jan Arne Telle, Andrzej Proskurowski

SIAM J. Discret. Math., 1997

Covering Regular Graphs.

Jan Kratochvíl, Andrzej Proskurowski, Jan Arne Telle

J. Comb. Theory B, 1997

Minimum Self-Repairing Graphs.

Arthur M. Farley, Andrzej Proskurowski

Graphs Comb., 1997

Complexity of Colored Graph Covers I. Colored Directed Multigraphs.

Jan Kratochvíl, Andrzej Proskurowski, Jan Arne Telle

Proceedings of the Graph-Theoretic Concepts in Computer Science, 1997

1996

Characterization and Complexity of Uniformly Non Primitive Labeled 2-Structures.

Joost Engelfriet, Tero Harju, Andrzej Proskurowski, Grzegorz Rozenberg

Theor. Comput. Sci., 1996

Plane Embeddings of 2-trees and Biconnected Partial 2-Trees.

Andrzej Proskurowski, Maciej M. Syslo, Pawel Winter

SIAM J. Discret. Math., 1996

A generalization of line graphs: (<i>X, Y</i>)-intersection graphs.

Leizhen Cai, Derek G. Corneil, Andrzej Proskurowski

J. Graph Theory, 1996

1994

Bounded-call broadcasting.

Arthur M. Farley, Andrzej Proskurowski

Discret. Appl. Math., 1994

A Technique for Recognizing Graphs of Bounded Treewidth with Application to Subclasses of Partial 2-Paths.

Stefan Arnborg, Andrzej Proskurowski

Proceedings of the Graph Gramars and Their Application to Computer Science, 1994

1993

Self-Repairing Networks.

Arthur M. Farley, Andrzej Proskurowski

Parallel Process. Lett., 1993

An Algebraic Theory of Graph Reduction.

Stefan Arnborg, Bruno Courcelle, Andrzej Proskurowski, Detlef Seese

J. ACM, 1993

Efficient Sets in Partial <i>k</i>-Trees.

Jan Arne Telle, Andrzej Proskurowski

Discret. Appl. Math., 1993

Practical Algorithms on Partial k-Trees with an Application to Domination-like Problems.

Jan Arne Telle, Andrzej Proskurowski

Proceedings of the Algorithms and Data Structures, Third Workshop, 1993

1992

Canonical Representations of Partial 2- and 3-Trees.

Stefan Arnborg, Andrzej Proskurowski

BIT, 1992

1991

Graph reductions, and techniques for finding minimal forbidden minors.

Andrzej Proskurowski

Proceedings of the Graph Structure Theory, 1991

1990

Report on GRA-GRA: 4th international workshop on graph grammars and their applications to computer science.

Andrzej Proskurowski

SIGACT News, 1990

Generating Binary Trees by Transpositions.

Frank Ruskey, Andrzej Proskurowski

J. Algorithms, 1990

Forbidden minors characterization of partial 3-trees.

Stefan Arnborg, Andrzej Proskurowski, Derek G. Corneil

Discret. Math., 1990

Canonical Representation of Partial 2- and 3-Trees.

Stefan Arnborg, Andrzej Proskurowski

Proceedings of the SWAT 90, 1990

Monadic Second Order Logic, Tree Automata and Forbidden Minors.

Stefan Arnborg, Andrzej Proskurowski, Detlef Seese

Proceedings of the Computer Science Logic, 4th Workshop, 1990

1989

On Parallel Complexity of the Subgraph Homeomorphism and the Subgraph Isomorphism Problem for Classes of Planar Graphs.

Andrzej Lingas, Andrzej Proskurowski

Theor. Comput. Sci., 1989

Centering a Spanning Tree of a Biconnected Graph.

Grant A. Cheston, Arthur M. Farley, Stephen T. Hedetniemi, Andrzej Proskurowski

Inf. Process. Lett., 1989

Linear time algorithms for NP-hard problems restricted to partial k-trees.

Stefan Arnborg, Andrzej Proskurowski

Discret. Appl. Math., 1989

1987

Fast Parallel Algorithms for the Subgraph Homophormism and the Subgraph Isomorphism Problem for Classes of Planat Graphs.

Andrzej Lingas, Andrzej Proskurowski

Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1987

1985

Interior graphs of maximal outerplane graphs.

Sandra Mitchell Hedetniemi, Andrzej Proskurowski, Maciej M. Syslo

J. Comb. Theory B, 1985

Binary Tree Gray Codes.

Andrzej Proskurowski, Frank Ruskey

J. Algorithms, 1985

Problems on graphs with bounded decomposability.

Stefan Arnborg, Andrzej Proskurowski

Bull. EATCS, 1985

1984

Separating subgraphs in k-trees: Cables and caterpillars.

Andrzej Proskurowski

Discret. Math., 1984

Concurrent Transmissions in Broadcast Networks.

Charles J. Colbourn, Andrzej Proskurowski

Proceedings of the Automata, 1984

1982

Networks immune to isolated line failures.

Arthur M. Farley, Andrzej Proskurowski

Networks, 1982

Directed Maximal-Cut Problems.

Arthur M. Farley, Andrzej Proskurowski

Inf. Process. Lett., 1982

1981

Minimum Broadcast Trees.

Andrzej Proskurowski

IEEE Trans. Computers, 1981

Recursive Graphs, Recursive Labelings and Shortest Paths.

Andrzej Proskurowski

SIAM J. Comput., 1981

Minimum dominating cycles in outerplanar graphs.

Andrzej Proskurowski, Maciej M. Syslo

Int. J. Parallel Program., 1981

Partitioning trees: Matching, domination, and maximum diameter.

Arthur M. Farley, Stephen T. Hedetniemi, Andrzej Proskurowski

Int. J. Parallel Program., 1981

1980

Centers of maximal outerplanar graphs.

Andrzej Proskurowski

J. Graph Theory, 1980

On the Generation of Binary Trees.

Andrzej Proskurowski

J. ACM, 1980

Computation of the center and diameter of outerplanar graphs.

Arthur M. Farley, Andrzej Proskurowski

Discret. Appl. Math., 1980

1979

Minimum dominating cycles in 2-trees.

Andrzej Proskurowski

Int. J. Parallel Program., 1979

Minimum broadcast graphs.

Arthur M. Farley, Stephen T. Hedetniemi, Sandra Mitchell Mitchell, Andrzej Proskurowski

Discret. Math., 1979