Search the dblp DataBase
Andrzej Proskurowski :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
Magnús M. Halldórsson , Guy Kortsarz , Andrzej Proskurowski , Ravit Salman , Hadas Shachnai , Jan Arne Telle Multi-coloring Trees. [Citation Graph (0, 0)][DBLP ] COCOON, 1999, pp:271-280 [Conf ] Stefan Arnborg , Andrzej Proskurowski , Detlef Seese Monadic Second Order Logic, Tree Automata and Forbidden Minors. [Citation Graph (0, 0)][DBLP ] CSL, 1990, pp:1-16 [Conf ] Anders Dessmark , Andrzej Lingas , Andrzej Proskurowski Faster Algorithms for Subgraph Isomorphism of k-Connected Partial k-Trees. [Citation Graph (0, 0)][DBLP ] ESA, 1996, pp:501-513 [Conf ] Andrzej Lingas , Andrzej Proskurowski Fast Parallel Algorithms for the Subgraph Homophormism and the Subgraph Isomorphism Problem for Classes of Planat Graphs. [Citation Graph (0, 0)][DBLP ] FSTTCS, 1987, pp:79-94 [Conf ] Jirí Fiala , Jan Kratochvíl , Andrzej Proskurowski Geometric Systems of Disjoint Representatives. [Citation Graph (0, 0)][DBLP ] Graph Drawing, 2002, pp:110-117 [Conf ] Stefan Arnborg , Bruno Courcelle , Andrzej Proskurowski , Detlef Seese An Algebraic Theory of Graph Reduction. [Citation Graph (0, 0)][DBLP ] Graph-Grammars and Their Application to Computer Science, 1990, pp:70-83 [Conf ] Andrzej Proskurowski Graph reductions, and techniques for finding minimal forbidden minors. [Citation Graph (0, 0)][DBLP ] Graph Structure Theory, 1991, pp:591-600 [Conf ] Charles J. Colbourn , Andrzej Proskurowski Concurrent Transmissions in Broadcast Networks. [Citation Graph (0, 0)][DBLP ] ICALP, 1984, pp:128-136 [Conf ] Jirí Fiala , Jan Kratochvíl , Andrzej Proskurowski Distance Constrained Labeling of Precolored Trees. [Citation Graph (0, 0)][DBLP ] ICTCS, 2001, pp:285-292 [Conf ] Juan J. Flores , Andrzej Proskurowski Qualitative Reasoning and Bifurcations in Dynamic Systems. [Citation Graph (0, 0)][DBLP ] MICAI, 2006, pp:259-271 [Conf ] Arthur M. Farley , Paraskevi Fragopoulou , David W. Krumme , Andrzej Proskurowski , Dana Richards Multi-Source Spanning Tree Problems. [Citation Graph (0, 0)][DBLP ] SIROCCO, 1999, pp:126-136 [Conf ] Michele Flammini , Alfredo Navarra , Andrzej Proskurowski On Routing of Wavebands for Gossiping in All-Optical Paths and Cycles. [Citation Graph (0, 0)][DBLP ] SIROCCO, 2003, pp:133-145 [Conf ] Stefan Arnborg , Andrzej Proskurowski Canonical Representation of Partial 2- and 3-Trees. [Citation Graph (0, 0)][DBLP ] SWAT, 1990, pp:310-319 [Conf ] Bengt Aspvall , Andrzej Proskurowski , Jan Arne Telle Memory Requirements for Table Computations in Partial k-tree Algorithms. [Citation Graph (0, 0)][DBLP ] SWAT, 1998, pp:222-233 [Conf ] Arvind Gupta , Naomi Nishimura , Andrzej Proskurowski , Prabhakar Ragde Embeddings of k -Connected Graphs of Pathwidth k . [Citation Graph (0, 0)][DBLP ] SWAT, 2000, pp:111-124 [Conf ] Andrzej Proskurowski , Frank Ruskey Generating Binary Trees by Transpositions. [Citation Graph (0, 0)][DBLP ] SWAT, 1988, pp:199-207 [Conf ] Stefan Arnborg , Andrzej Proskurowski A Technique for Recognizing Graphs of Bounded Treewidth with Application to Subclasses of Partial 2-Paths. [Citation Graph (0, 0)][DBLP ] TAGT, 1994, pp:469-486 [Conf ] Jan Arne Telle , Andrzej Proskurowski Practical Algorithms on Partial k-Trees with an Application to Domination-like Problems. [Citation Graph (0, 0)][DBLP ] WADS, 1993, pp:610-621 [Conf ] Daniel Král , Jan Kratochvíl , Andrzej Proskurowski , Heinz-Jürgen Voss Coloring Mixed Hypertrees. [Citation Graph (0, 0)][DBLP ] WG, 2000, pp:279-289 [Conf ] Jan Kratochvíl , Andrzej Proskurowski , Jan Arne Telle Complexity of Graph Covering Problems. [Citation Graph (0, 0)][DBLP ] WG, 1994, pp:93-105 [Conf ] Jan Kratochvíl , Andrzej Proskurowski , Jan Arne Telle Complexity of Colored Graph Covers I. Colored Directed Multigraphs. [Citation Graph (0, 0)][DBLP ] WG, 1997, pp:242-257 [Conf ] Christophe Paul , Andrzej Proskurowski , Jan Arne Telle Generation of Graphs with Bounded Branchwidth. [Citation Graph (0, 0)][DBLP ] WG, 2006, pp:205-216 [Conf ] Bengt Aspvall , Jan Arne Telle , Andrzej Proskurowski Memory Requirements for Table Computations in Partial k-Tree Algorithms. [Citation Graph (0, 0)][DBLP ] Algorithmica, 2000, v:27, n:3, pp:382-394 [Journal ] Anders Dessmark , Andrzej Lingas , Andrzej Proskurowski Faster Algorithms for Subgraph Isomorphism of k-Connected Partial k-Trees. [Citation Graph (0, 0)][DBLP ] Algorithmica, 2000, v:27, n:3, pp:337-347 [Journal ] Stefan Arnborg , Andrzej Proskurowski Canonical Representations of Partial 2- and 3-Trees. [Citation Graph (0, 0)][DBLP ] BIT, 1992, v:32, n:2, pp:197-214 [Journal ] Harold S. Connamacher , Andrzej Proskurowski The complexity of minimizing certain cost metrics for k-source spanning trees. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 2003, v:131, n:1, pp:113-127 [Journal ] Arthur M. Farley , Andrzej Proskurowski Bounded-call broadcasting. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 1994, v:53, n:1-3, pp:37-53 [Journal ] Arthur M. Farley , Andrzej Pelc , Andrzej Proskurowski Minimum-time multidrop broadcast. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 1998, v:83, n:1-3, pp:61-77 [Journal ] Arthur M. Farley , Andrzej Proskurowski , Daniel Zappala , Kurt J. Windisch Spanners and message distribution in networks. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 2004, v:137, n:2, pp:159-171 [Journal ] Jirí Fiala , Jan Kratochvíl , Andrzej Proskurowski Systems of distant representatives. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 2005, v:145, n:2, pp:306-316 [Journal ] Arvind Gupta , Naomi Nishimura , Andrzej Proskurowski , Prabhakar Ragde Embeddings of k -connected graphs of pathwidth k . [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 2005, v:145, n:2, pp:242-265 [Journal ] Daniel Král , Jan Kratochvíl , Andrzej Proskurowski , Heinz-Jürgen Voss Coloring mixed hypertrees. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 2006, v:154, n:4, pp:660-672 [Journal ] Jan Kratochvíl , Andrzej Proskurowski , Oriol Serra Structural decompositions, width parameters, and graph labelings. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 2005, v:145, n:2, pp:141-142 [Journal ] H. Brendan McMahan , Andrzej Proskurowski Multi-source spanning trees: algorithms for minimizing source eccentricities. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 2004, v:137, n:2, pp:213-222 [Journal ] Jan Arne Telle , Andrzej Proskurowski Efficient Sets in Partial k -Trees. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 1993, v:44, n:1-3, pp:109-117 [Journal ] Leizhen Cai , Derek G. Corneil , Andrzej Proskurowski Stable 2-pairs and (X, Y )-intersection graphs. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2001, v:230, n:1-3, pp:119-131 [Journal ] Andrzej Proskurowski , Jan Arne Telle Classes of graphs with restricted interval models. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics & Theoretical Computer Science, 1999, v:3, n:4, pp:167-176 [Journal ] Stefan Arnborg , Andrzej Proskurowski Problems on graphs with bounded decomposability. [Citation Graph (0, 0)][DBLP ] Bulletin of the EATCS, 1985, v:25, n:, pp:7-10 [Journal ] Magnús M. Halldórsson , Guy Kortsarz , Andrzej Proskurowski , Ravit Salman , Hadas Shachnai , Jan Arne Telle Multicoloring trees. [Citation Graph (0, 0)][DBLP ] Inf. Comput., 2003, v:180, n:2, pp:113-129 [Journal ] Grant A. Cheston , Arthur M. Farley , Stephen T. Hedetniemi , Andrzej Proskurowski Centering a Spanning Tree of a Biconnected Graph. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1989, v:32, n:5, pp:247-250 [Journal ] Arthur M. Farley , Andrzej Proskurowski Directed Maximal-Cut Problems. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1982, v:15, n:5, pp:238-241 [Journal ] Stefan Arnborg , Bruno Courcelle , Andrzej Proskurowski , Detlef Seese An Algebraic Theory of Graph Reduction. [Citation Graph (0, 0)][DBLP ] J. ACM, 1993, v:40, n:5, pp:1134-1164 [Journal ] Andrzej Proskurowski On the Generation of Binary Trees. [Citation Graph (0, 0)][DBLP ] J. ACM, 1980, v:27, n:1, pp:1-2 [Journal ] Frank Ruskey , Andrzej Proskurowski Generating Binary Trees by Transpositions. [Citation Graph (0, 0)][DBLP ] J. Algorithms, 1990, v:11, n:1, pp:68-84 [Journal ] Andrzej Proskurowski , Frank Ruskey Binary Tree Gray Codes. [Citation Graph (0, 0)][DBLP ] J. Algorithms, 1985, v:6, n:2, pp:225-238 [Journal ] Sandra Mitchell Hedetniemi , Andrzej Proskurowski , Maciej M. Syslo Interior graphs of maximal outerplane graphs. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. B, 1985, v:38, n:2, pp:156-167 [Journal ] Jan Kratochvíl , Andrzej Proskurowski , Jan Arne Telle Covering Regular Graphs. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. B, 1997, v:71, n:1, pp:1-16 [Journal ] Arthur M. Farley , Paraskevi Fragopoulou , David W. Krumme , Andrzej Proskurowski , Dana Richards Multi-Source Spanning Tree Problems. [Citation Graph (0, 0)][DBLP ] Journal of Interconnection Networks, 2000, v:1, n:1, pp:61-71 [Journal ] Jan Kratochvíl , Andrzej Proskurowski , Jan Arne Telle On the Complexity of Graph Covering Problems. [Citation Graph (0, 0)][DBLP ] Nord. J. Comput., 1998, v:5, n:3, pp:173-195 [Journal ] Arthur M. Farley , Andrzej Proskurowski Self-Repairing Networks. [Citation Graph (0, 0)][DBLP ] Parallel Processing Letters, 1993, v:3, n:, pp:381-391 [Journal ] Andrzej Proskurowski Recursive Graphs, Recursive Labelings and Shortest Paths. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1981, v:10, n:2, pp:391-397 [Journal ] Andrzej Proskurowski , Frank Ruskey , Malcolm Smith Analysis of Algorithms for Listing Equivalence Classes of k -ary Strings. [Citation Graph (0, 0)][DBLP ] SIAM J. Discrete Math., 1998, v:11, n:1, pp:94-109 [Journal ] Andrzej Proskurowski , Maciej M. Syslo , Pawel Winter Plane Embeddings of 2-trees and Biconnected Partial 2-Trees. [Citation Graph (0, 0)][DBLP ] SIAM J. Discrete Math., 1996, v:9, n:4, pp:577-596 [Journal ] Jan Arne Telle , Andrzej Proskurowski Algorithms for Vertex Partitioning Problems on Partial k -Trees. [Citation Graph (0, 0)][DBLP ] SIAM J. Discrete Math., 1997, v:10, n:4, pp:529-550 [Journal ] Andrzej Proskurowski Minimum Broadcast Trees. [Citation Graph (0, 0)][DBLP ] IEEE Trans. Computers, 1981, v:30, n:5, pp:363-366 [Journal ] Anders Dessmark , Andrzej Lingas , Andrzej Proskurowski Maximum packing for k-connected partial k-trees in polynomial time. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2000, v:236, n:1-2, pp:179-191 [Journal ] Joost Engelfriet , Tero Harju , Andrzej Proskurowski , Grzegorz Rozenberg Characterization and Complexity of Uniformly Non Primitive Labeled 2-Structures. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1996, v:154, n:2, pp:247-282 [Journal ] Michele Flammini , Alfredo Navarra , Andrzej Proskurowski On routing of wavebands for all-to-all communications in all-optical paths and cycles. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2005, v:333, n:3, pp:401-413 [Journal ] Andrzej Lingas , Andrzej Proskurowski On Parallel Complexity of the Subgraph Homeomorphism and the Subgraph Isomorphism Problem for Classes of Planar Graphs. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1989, v:68, n:2, pp:155-173 [Journal ] Andrzej Proskurowski Separating subgraphs in k-trees: Cables and caterpillars. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1984, v:49, n:3, pp:275-285 [Journal ] Stefan Arnborg , Andrzej Proskurowski , Derek G. Corneil Forbidden minors characterization of partial 3-trees. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1990, v:80, n:1, pp:1-19 [Journal ] Internationalization of computer science education. [Citation Graph (, )][DBLP ] Minimum Distortion Embeddings into a Path of Bipartite Permutation and Threshold Graphs. [Citation Graph (, )][DBLP ] Linear time algorithms for NP-hard problems restricted to partial k-trees. [Citation Graph (, )][DBLP ] Guest editors' foreword. [Citation Graph (, )][DBLP ] Guest Editors' Foreword. [Citation Graph (, )][DBLP ] Search in 0.022secs, Finished in 0.027secs