| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Paul Bonsma, Arthur M. Farley, Andrzej Proskurowski |
Extremal graphs having no matching cuts.  |
Journal of Graph Theory  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Pinar Heggernes, Jan Kratochvíl, Andrzej Proskurowski |
Guest editors' foreword. |
Discrete Applied Mathematics |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Pinar Heggernes, Daniel Meister, Andrzej Proskurowski |
Computing minimum distortion embeddings into a path for bipartite permutation graphs and threshold graphs. |
Theor. Comput. Sci. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Isolde Adler, Arthur M. Farley, Andrzej Proskurowski |
Obstructions for linear rankwidth at most 1 |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Binh-Minh Bui-Xuan, Pinar Heggernes, Daniel Meister, Andrzej Proskurowski |
A Generic Approach to Decomposition Algorithms, with an Application to Digraph Decomposition. |
COCOON |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Pinar Heggernes, Jan Kratochvíl, Andrzej Proskurowski |
Guest Editors' Foreword. |
Discrete Applied Mathematics |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Sarah A. Douglas, Arthur M. Farley, Ginnie Lo, Andrzej Proskurowski, Michal Young |
Internationalization of computer science education. |
SIGCSE |
2010 |
DBLP DOI BibTeX RDF |
computers in society, computer science education, internationalization |
| 1 | Jan Kratochvíl, Andrzej Proskurowski, Oriol Serra |
Guest editors' foreword. |
Discrete Applied Mathematics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Pinar Heggernes, Daniel Meister, Andrzej Proskurowski |
Minimum Distortion Embeddings into a Path of Bipartite Permutation and Threshold Graphs. |
SWAT |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniel Král, Jan Kratochvíl, Andrzej Proskurowski, Heinz-Jürgen Voss |
Coloring mixed hypertrees. |
Discrete Applied Mathematics |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Christophe Paul, Andrzej Proskurowski, Jan Arne Telle |
Generation of Graphs with Bounded Branchwidth. |
WG |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Juan J. Flores, Andrzej Proskurowski |
Qualitative Reasoning and Bifurcations in Dynamic Systems. |
MICAI |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Arthur M. Farley, Andrzej Proskurowski |
Priority-Consistent Graphs. |
Electronic Notes in Discrete Mathematics |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Michele Flammini, Alfredo Navarra, Andrzej Proskurowski |
On routing of wavebands for all-to-all communications in all-optical paths and cycles. |
Theor. Comput. Sci. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Arvind Gupta, Naomi Nishimura, Andrzej Proskurowski, Prabhakar Ragde |
Embeddings of k-connected graphs of pathwidth k. |
Discrete Applied Mathematics |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Jan Kratochvíl, Andrzej Proskurowski, Oriol Serra |
Structural decompositions, width parameters, and graph labelings. |
Discrete Applied Mathematics |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Jirí Fiala, Jan Kratochvíl, Andrzej Proskurowski |
Systems of distant representatives. |
Discrete Applied Mathematics |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | H. Brendan McMahan, Andrzej Proskurowski |
Multi-source spanning trees: algorithms for minimizing source eccentricities. |
Discrete Applied Mathematics |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Arthur M. Farley, Andrzej Proskurowski, Daniel Zappala, Kurt J. Windisch |
Spanners and message distribution in networks. |
Discrete Applied Mathematics |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Magnús M. Halldórsson, Guy Kortsarz, Andrzej Proskurowski, Ravit Salman, Hadas Shachnai, Jan Arne Telle |
Multicoloring trees. |
Inf. Comput. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Harold S. Connamacher, Andrzej Proskurowski |
The complexity of minimizing certain cost metrics for k-source spanning trees. |
Discrete Applied Mathematics |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Michele Flammini, Alfredo Navarra, Andrzej Proskurowski |
On Routing of Wavebands for Gossiping in All-Optical Paths and Cycles. |
SIROCCO |
2003 |
DBLP BibTeX RDF |
|
| 1 | Jirí Fiala, Jan Kratochvíl, Andrzej Proskurowski |
Geometric Systems of Disjoint Representatives. |
Graph Drawing |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Leizhen Cai, Derek G. Corneil, Andrzej Proskurowski |
Stable 2-pairs and (X, Y)-intersection graphs. |
Discrete Mathematics |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Jirí Fiala, Jan Kratochvíl, Andrzej Proskurowski |
Distance Constrained Labeling of Precolored Trees. |
ICTCS |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Anders Dessmark, Andrzej Lingas, Andrzej Proskurowski |
Maximum packing for k-connected partial k-trees in polynomial time. |
Theor. Comput. Sci. |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Anders Dessmark, Andrzej Lingas, Andrzej Proskurowski |
Faster Algorithms for Subgraph Isomorphism of k-Connected Partial k-Trees. |
Algorithmica |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Bengt Aspvall, Jan Arne Telle, Andrzej Proskurowski |
Memory Requirements for Table Computations in Partial k-Tree Algorithms. |
Algorithmica |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Arthur M. Farley, Paraskevi Fragopoulou, David W. Krumme, Andrzej Proskurowski, Dana Richards |
Multi-Source Spanning Tree Problems. |
Journal of Interconnection Networks |
2000 |
DBLP BibTeX RDF |
|
| 1 | Daniel Král, Jan Kratochvíl, Andrzej Proskurowski, Heinz-Jürgen Voss |
Coloring Mixed Hypertrees. |
WG |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Arvind Gupta, Naomi Nishimura, Andrzej Proskurowski, Prabhakar Ragde |
Embeddings of k-Connected Graphs of Pathwidth k. |
SWAT |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrzej Proskurowski, Jan Arne Telle |
Classes of graphs with restricted interval models. |
Discrete Mathematics & Theoretical Computer Science |
1999 |
DBLP BibTeX RDF |
|
| 1 | Arthur M. Farley, Andrzej Proskurowski, Miroslawa Skowronska, Maciej M. Syslo |
Hamiltonicity of Amalgams. |
Graphs and Combinatorics |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Arthur M. Farley, Paraskevi Fragopoulou, David W. Krumme, Andrzej Proskurowski, Dana Richards |
Multi-Source Spanning Tree Problems. |
SIROCCO |
1999 |
DBLP BibTeX RDF |
|
| 1 | Magnús M. Halldórsson, Guy Kortsarz, Andrzej Proskurowski, Ravit Salman, Hadas Shachnai, Jan Arne Telle |
Multi-coloring Trees. |
COCOON |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrzej Proskurowski, Frank Ruskey, Malcolm Smith |
Analysis of Algorithms for Listing Equivalence Classes of k-ary Strings. |
SIAM J. Discrete Math. |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Arthur M. Farley, Andrzej Pelc, Andrzej Proskurowski |
Minimum-time multidrop broadcast. |
Discrete Applied Mathematics |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Jan Kratochvíl, Andrzej Proskurowski, Jan Arne Telle |
On the Complexity of Graph Covering Problems. |
Nord. J. Comput. |
1998 |
DBLP BibTeX RDF |
|
| 1 | Bengt Aspvall, Andrzej Proskurowski, Jan Arne Telle |
Memory Requirements for Table Computations in Partial k-tree Algorithms. |
SWAT |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Jan Kratochvíl, Andrzej Proskurowski, Jan Arne Telle |
Covering Regular Graphs. |
J. Comb. Theory, Ser. B |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Jan Arne Telle, Andrzej Proskurowski |
Algorithms for Vertex Partitioning Problems on Partial k-Trees. |
SIAM J. Discrete Math. |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Jan Kratochvíl, Andrzej Proskurowski, Jan Arne Telle |
Complexity of Colored Graph Covers I. Colored Directed Multigraphs. |
WG |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Joost Engelfriet, Tero Harju, Andrzej Proskurowski, Grzegorz Rozenberg |
Characterization and Complexity of Uniformly Non Primitive Labeled 2-Structures. |
Theor. Comput. Sci. |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrzej Proskurowski, Maciej M. Syslo, Pawel Winter |
Plane Embeddings of 2-trees and Biconnected Partial 2-Trees. |
SIAM J. Discrete Math. |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Anders Dessmark, Andrzej Lingas, Andrzej Proskurowski |
Faster Algorithms for Subgraph Isomorphism of k-Connected Partial k-Trees. |
ESA |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Arthur M. Farley, Andrzej Proskurowski |
Bounded-call broadcasting. |
Discrete Applied Mathematics |
1994 |
DBLP BibTeX RDF |
|
| 1 | Jan Kratochvíl, Andrzej Proskurowski, Jan Arne Telle |
Complexity of Graph Covering Problems. |
WG |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Stefan Arnborg, Andrzej Proskurowski |
A Technique for Recognizing Graphs of Bounded Treewidth with Application to Subclasses of Partial 2-Paths. |
TAGT |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Stefan Arnborg, Bruno Courcelle, Andrzej Proskurowski, Detlef Seese |
An Algebraic Theory of Graph Reduction. |
J. ACM |
1993 |
DBLP DOI BibTeX RDF |
graph algebra, regular set of graphs, treewidth, graph rewriting, monadic second-order logic |
| 1 | Arthur M. Farley, Andrzej Proskurowski |
Self-Repairing Networks. |
Parallel Processing Letters |
1993 |
DBLP BibTeX RDF |
|
| 1 | Jan Arne Telle, Andrzej Proskurowski |
Efficient Sets in Partial k-Trees. |
Discrete Applied Mathematics |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Jan Arne Telle, Andrzej Proskurowski |
Practical Algorithms on Partial k-Trees with an Application to Domination-like Problems. |
WADS |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Stefan Arnborg, Andrzej Proskurowski |
Canonical Representations of Partial 2- and 3-Trees. |
BIT |
1992 |
DBLP BibTeX RDF |
|
| 1 | Andrzej Proskurowski |
Graph reductions, and techniques for finding minimal forbidden minors. |
Graph Structure Theory |
1991 |
DBLP BibTeX RDF |
|
| 1 | Stefan Arnborg, Andrzej Proskurowski, Derek G. Corneil |
Forbidden minors characterization of partial 3-trees. |
Discrete Mathematics |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | Frank Ruskey, Andrzej Proskurowski |
Generating Binary Trees by Transpositions. |
J. Algorithms |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrzej Proskurowski |
Report on GRA-GRA: 4th international workshop on graph grammars and their applications to computer science. |
SIGACT News |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | Stefan Arnborg, Bruno Courcelle, Andrzej Proskurowski, Detlef Seese |
An Algebraic Theory of Graph Reduction. |
Graph-Grammars and Their Application to Computer Science |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | Stefan Arnborg, Andrzej Proskurowski |
Canonical Representation of Partial 2- and 3-Trees. |
SWAT |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | Stefan Arnborg, Andrzej Proskurowski, Detlef Seese |
Monadic Second Order Logic, Tree Automata and Forbidden Minors. |
CSL |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | Grant A. Cheston, Arthur M. Farley, Stephen T. Hedetniemi, Andrzej Proskurowski |
Centering a Spanning Tree of a Biconnected Graph. |
Inf. Process. Lett. |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrzej Lingas, Andrzej Proskurowski |
On Parallel Complexity of the Subgraph Homeomorphism and the Subgraph Isomorphism Problem for Classes of Planar Graphs. |
Theor. Comput. Sci. |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Stefan Arnborg, Andrzej Proskurowski |
Linear time algorithms for NP-hard problems restricted to partial k-trees. |
Discrete Applied Mathematics |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrzej Proskurowski, Frank Ruskey |
Generating Binary Trees by Transpositions. |
SWAT |
1988 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrzej Lingas, Andrzej Proskurowski |
Fast Parallel Algorithms for the Subgraph Homophormism and the Subgraph Isomorphism Problem for Classes of Planat Graphs. |
FSTTCS |
1987 |
DBLP DOI BibTeX RDF |
|
| 1 | Sandra Mitchell Hedetniemi, Andrzej Proskurowski, Maciej M. Syslo |
Interior graphs of maximal outerplane graphs. |
J. Comb. Theory, Ser. B |
1985 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrzej Proskurowski, Frank Ruskey |
Binary Tree Gray Codes. |
J. Algorithms |
1985 |
DBLP DOI BibTeX RDF |
|
| 1 | Stefan Arnborg, Andrzej Proskurowski |
Problems on graphs with bounded decomposability. |
Bulletin of the EATCS |
1985 |
DBLP BibTeX RDF |
|
| 1 | Andrzej Proskurowski |
Separating subgraphs in k-trees: Cables and caterpillars. |
Discrete Mathematics |
1984 |
DBLP DOI BibTeX RDF |
|
| 1 | Charles J. Colbourn, Andrzej Proskurowski |
Concurrent Transmissions in Broadcast Networks. |
ICALP |
1984 |
DBLP DOI BibTeX RDF |
|
| 1 | Arthur M. Farley, Andrzej Proskurowski |
Directed Maximal-Cut Problems. |
Inf. Process. Lett. |
1982 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrzej Proskurowski, Maciej M. Syslo |
Minimum dominating cycles in outerplanar graphs. |
International Journal of Parallel Programming |
1981 |
DBLP DOI BibTeX RDF |
|
| 1 | Arthur Parley, Stephen T. Hedetniemi, Andrzej Proskurowski |
Partitioning trees: Matching, domination, and maximum diameter. |
International Journal of Parallel Programming |
1981 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrzej Proskurowski |
Minimum Broadcast Trees. |
IEEE Trans. Computers |
1981 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrzej Proskurowski |
Recursive Graphs, Recursive Labelings and Shortest Paths. |
SIAM J. Comput. |
1981 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrzej Proskurowski |
On the Generation of Binary Trees. |
J. ACM |
1980 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrzej Proskurowski |
Minimum dominating cycles in 2-trees. |
International Journal of Parallel Programming |
1979 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")