dblp.uni-trier.dewww.uni-trier.de

Andrzej Proskurowski Vis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

*2009
65EEJan Kratochvíl, Andrzej Proskurowski, Oriol Serra: Guest editors' foreword. Discrete Applied Mathematics 157(12): 2575-2576 (2009)
2008
64EEPinar Heggernes, Daniel Meister, Andrzej Proskurowski: Minimum Distortion Embeddings into a Path of Bipartite Permutation and Threshold Graphs. SWAT 2008: 331-342
2006
63EEJuan J. Flores, Andrzej Proskurowski: Qualitative Reasoning and Bifurcations in Dynamic Systems. MICAI 2006: 259-271
62EEChristophe Paul, Andrzej Proskurowski, Jan Arne Telle: Generation of Graphs with Bounded Branchwidth. WG 2006: 205-216
61EEDaniel Král, Jan Kratochvíl, Andrzej Proskurowski, Heinz-Jürgen Voss: Coloring mixed hypertrees. Discrete Applied Mathematics 154(4): 660-672 (2006)
2005
60EEJan Kratochvíl, Andrzej Proskurowski, Oriol Serra: Structural decompositions, width parameters, and graph labelings. Discrete Applied Mathematics 145(2): 141-142 (2005)
59EEArvind Gupta, Naomi Nishimura, Andrzej Proskurowski, Prabhakar Ragde: Embeddings of k-connected graphs of pathwidth k. Discrete Applied Mathematics 145(2): 242-265 (2005)
58EEJirí Fiala, Jan Kratochvíl, Andrzej Proskurowski: Systems of distant representatives. Discrete Applied Mathematics 145(2): 306-316 (2005)
57EEArthur M. Farley, Andrzej Proskurowski: Priority-Consistent Graphs. Electronic Notes in Discrete Mathematics 22: 521-526 (2005)
56EEMichele 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)
2004
55EEArthur M. Farley, Andrzej Proskurowski, Daniel Zappala, Kurt J. Windisch: Spanners and message distribution in networks. Discrete Applied Mathematics 137(2): 159-171 (2004)
54EEH. Brendan McMahan, Andrzej Proskurowski: Multi-source spanning trees: algorithms for minimizing source eccentricities. Discrete Applied Mathematics 137(2): 213-222 (2004)
2003
53 Michele Flammini, Alfredo Navarra, Andrzej Proskurowski: On Routing of Wavebands for Gossiping in All-Optical Paths and Cycles. SIROCCO 2003: 133-145
52EEHarold S. Connamacher, Andrzej Proskurowski: The complexity of minimizing certain cost metrics for k-source spanning trees. Discrete Applied Mathematics 131(1): 113-127 (2003)
51EEMagnús M. Halldórsson, Guy Kortsarz, Andrzej Proskurowski, Ravit Salman, Hadas Shachnai, Jan Arne Telle: Multicoloring trees. Inf. Comput. 180(2): 113-129 (2003)
2002
50EEJirí Fiala, Jan Kratochvíl, Andrzej Proskurowski: Geometric Systems of Disjoint Representatives. Graph Drawing 2002: 110-117
2001
49EEJirí Fiala, Jan Kratochvíl, Andrzej Proskurowski: Distance Constrained Labeling of Precolored Trees. ICTCS 2001: 285-292
48EELeizhen Cai, Derek G. Corneil, Andrzej Proskurowski: Stable 2-pairs and (X, Y)-intersection graphs. Discrete Mathematics 230(1-3): 119-131 (2001)
2000
47EEArvind Gupta, Naomi Nishimura, Andrzej Proskurowski, Prabhakar Ragde: Embeddings of k-Connected Graphs of Pathwidth k. SWAT 2000: 111-124
46EEDaniel Král, Jan Kratochvíl, Andrzej Proskurowski, Heinz-Jürgen Voss: Coloring Mixed Hypertrees. WG 2000: 279-289
45EEAnders Dessmark, Andrzej Lingas, Andrzej Proskurowski: Faster Algorithms for Subgraph Isomorphism of k-Connected Partial k-Trees. Algorithmica 27(3): 337-347 (2000)
44EEBengt Aspvall, Jan Arne Telle, Andrzej Proskurowski: Memory Requirements for Table Computations in Partial k-Tree Algorithms. Algorithmica 27(3): 382-394 (2000)
43 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)
42EEAnders 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)
1999
41EEMagnús M. Halldórsson, Guy Kortsarz, Andrzej Proskurowski, Ravit Salman, Hadas Shachnai, Jan Arne Telle: Multi-coloring Trees. COCOON 1999: 271-280
40 Arthur M. Farley, Paraskevi Fragopoulou, David W. Krumme, Andrzej Proskurowski, Dana Richards: Multi-Source Spanning Tree Problems. SIROCCO 1999: 126-136
39EEAndrzej Proskurowski, Jan Arne Telle: Classes of graphs with restricted interval models. Discrete Mathematics & Theoretical Computer Science 3(4): 167-176 (1999)
1998
38EEBengt Aspvall, Andrzej Proskurowski, Jan Arne Telle: Memory Requirements for Table Computations in Partial k-tree Algorithms. SWAT 1998: 222-233
37EEArthur M. Farley, Andrzej Pelc, Andrzej Proskurowski: Minimum-time multidrop broadcast. Discrete Applied Mathematics 83(1-3): 61-77 (1998)
36 Jan Kratochvíl, Andrzej Proskurowski, Jan Arne Telle: On the Complexity of Graph Covering Problems. Nord. J. Comput. 5(3): 173-195 (1998)
35EEAndrzej 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)
1997
34EEJan Kratochvíl, Andrzej Proskurowski, Jan Arne Telle: Complexity of Colored Graph Covers I. Colored Directed Multigraphs. WG 1997: 242-257
33EEJan Kratochvíl, Andrzej Proskurowski, Jan Arne Telle: Covering Regular Graphs. J. Comb. Theory, Ser. B 71(1): 1-16 (1997)
32EEJan Arne Telle, Andrzej Proskurowski: Algorithms for Vertex Partitioning Problems on Partial k-Trees. SIAM J. Discrete Math. 10(4): 529-550 (1997)
1996
31EEAnders Dessmark, Andrzej Lingas, Andrzej Proskurowski: Faster Algorithms for Subgraph Isomorphism of k-Connected Partial k-Trees. ESA 1996: 501-513
30EEAndrzej 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)
29EEJoost 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)
1994
28 Stefan Arnborg, Andrzej Proskurowski: A Technique for Recognizing Graphs of Bounded Treewidth with Application to Subclasses of Partial 2-Paths. TAGT 1994: 469-486
27EEJan Kratochvíl, Andrzej Proskurowski, Jan Arne Telle: Complexity of Graph Covering Problems. WG 1994: 93-105
26 Arthur M. Farley, Andrzej Proskurowski: Bounded-call broadcasting. Discrete Applied Mathematics 53(1-3): 37-53 (1994)
1993
25 Jan Arne Telle, Andrzej Proskurowski: Practical Algorithms on Partial k-Trees with an Application to Domination-like Problems. WADS 1993: 610-621
24EEJan Arne Telle, Andrzej Proskurowski: Efficient Sets in Partial k-Trees. Discrete Applied Mathematics 44(1-3): 109-117 (1993)
23EEStefan Arnborg, Bruno Courcelle, Andrzej Proskurowski, Detlef Seese: An Algebraic Theory of Graph Reduction. J. ACM 40(5): 1134-1164 (1993)
22 Arthur M. Farley, Andrzej Proskurowski: Self-Repairing Networks. Parallel Processing Letters 3: 381-391 (1993)
1992
21 Stefan Arnborg, Andrzej Proskurowski: Canonical Representations of Partial 2- and 3-Trees. BIT 32(2): 197-214 (1992)
1991
20 Andrzej Proskurowski: Graph reductions, and techniques for finding minimal forbidden minors. Graph Structure Theory 1991: 591-600
1990
19EEStefan Arnborg, Andrzej Proskurowski, Detlef Seese: Monadic Second Order Logic, Tree Automata and Forbidden Minors. CSL 1990: 1-16
18 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
17EEStefan Arnborg, Andrzej Proskurowski: Canonical Representation of Partial 2- and 3-Trees. SWAT 1990: 310-319
16EEStefan Arnborg, Andrzej Proskurowski, Derek G. Corneil: Forbidden minors characterization of partial 3-trees. Discrete Mathematics 80(1): 1-19 (1990)
15 Frank Ruskey, Andrzej Proskurowski: Generating Binary Trees by Transpositions. J. Algorithms 11(1): 68-84 (1990)
1989
14EEStefan Arnborg, Andrzej Proskurowski: Linear time algorithms for NP-hard problems restricted to partial k-trees. Discrete Applied Mathematics 23(1): 11-24 (1989)
13 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)
12 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)
1988
11EEAndrzej Proskurowski, Frank Ruskey: Generating Binary Trees by Transpositions. SWAT 1988: 199-207
1987
10EEAndrzej Lingas, Andrzej Proskurowski: Fast Parallel Algorithms for the Subgraph Homophormism and the Subgraph Isomorphism Problem for Classes of Planat Graphs. FSTTCS 1987: 79-94
1985
9 Stefan Arnborg, Andrzej Proskurowski: Problems on graphs with bounded decomposability. Bulletin of the EATCS 25: 7-10 (1985)
8 Andrzej Proskurowski, Frank Ruskey: Binary Tree Gray Codes. J. Algorithms 6(2): 225-238 (1985)
7EESandra Mitchell Hedetniemi, Andrzej Proskurowski, Maciej M. Syslo: Interior graphs of maximal outerplane graphs. J. Comb. Theory, Ser. B 38(2): 156-167 (1985)
1984
6EECharles J. Colbourn, Andrzej Proskurowski: Concurrent Transmissions in Broadcast Networks. ICALP 1984: 128-136
5EEAndrzej Proskurowski: Separating subgraphs in k-trees: Cables and caterpillars. Discrete Mathematics 49(3): 275-285 (1984)
1982
4 Arthur M. Farley, Andrzej Proskurowski: Directed Maximal-Cut Problems. Inf. Process. Lett. 15(5): 238-241 (1982)
1981
3 Andrzej Proskurowski: Minimum Broadcast Trees. IEEE Trans. Computers 30(5): 363-366 (1981)
2 Andrzej Proskurowski: Recursive Graphs, Recursive Labelings and Shortest Paths. SIAM J. Comput. 10(2): 391-397 (1981)
1980
1EEAndrzej Proskurowski: On the Generation of Binary Trees. J. ACM 27(1): 1-2 (1980)

Coauthor Index

1Stefan Arnborg [9] [14] [16] [17] [18] [19] [21] [23] [28]
2Bengt Aspvall [38] [44]
3Leizhen Cai [48]
4Grant A. Cheston [13]
5Charles J. Colbourn [6]
6Harold S. Connamacher [52]
7Derek G. Corneil [16] [48]
8Bruno Courcelle [18] [23]
9Anders Dessmark [31] [42] [45]
10Joost Engelfriet [29]
11Arthur M. Farley [4] [13] [22] [26] [37] [40] [43] [55] [57]
12Jirí Fiala [49] [50] [58]
13Michele Flammini [53] [56]
14Juan J. Flores [63]
15Paraskevi Fragopoulou [40] [43]
16Arvind Gupta [47] [59]
17Magnús M. Halldórsson [41] [51]
18Tero Harju [29]
19Sandra Mitchell Hedetniemi (Sandra L. Mitchell) [7]
20Stephen T. Hedetniemi [13]
21Pinar Heggernes [64]
22Guy Kortsarz [41] [51]
23Daniel Král [46] [61]
24Jan Kratochvíl [27] [33] [34] [36] [46] [49] [50] [58] [60] [61] [65]
25David W. Krumme [40] [43]
26Andrzej Lingas [10] [12] [31] [42] [45]
27H. Brendan McMahan [54]
28Daniel Meister [64]
29Alfredo Navarra [53] [56]
30Naomi Nishimura [47] [59]
31Christophe Paul [62]
32Andrzej Pelc [37]
33Prabhakar Ragde [47] [59]
34Dana Richards [40] [43]
35Grzegorz Rozenberg [29]
36Frank Ruskey [8] [11] [15] [35]
37Ravit Salman [41] [51]
38Detlef Seese [18] [19] [23]
39Oriol Serra [60] [65]
40Hadas Shachnai [41] [51]
41Malcolm Smith [35]
42Maciej M. Syslo [7] [30]
43Jan Arne Telle [24] [25] [27] [32] [33] [34] [36] [38] [39] [41] [44] [51] [62]
44Heinz-Jürgen Voss [46] [61]
45Kurt J. Windisch [55]
46Pawel Winter [30]
47Daniel Zappala [55]

Colors in the list of coauthors

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)