default search action
Andrzej Proskurowski
Person information
- affiliation: University of Oregon, Eugene, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2023
- [j65]Tínaz Ekim, Arthur M. Farley, Andrzej Proskurowski, Mordechai Shalom
:
Defensive domination in proper interval graphs. Discret. Appl. Math. 331: 59-69 (2023) - 2020
- [j64]Derek G. Corneil, Robert Ganian, Andrzej Proskurowski:
Foreword: Eighth Workshop on Graph Classes, Optimization, and Width Parameters, Toronto, Ontario, Canada. Discret. Appl. Math. 278: 1-2 (2020) - [j63]Tínaz Ekim, Arthur M. Farley, Andrzej Proskurowski:
The complexity of the defensive domination problem in special graph classes. Discret. Math. 343(2): 111665 (2020) - [c28]Stefan Arnborg, Andrzej Proskurowski:
Seeing Arboretum for the (partial k-) Trees. Treewidth, Kernels, and Algorithms 2020: 3-6 - [i3]Tínaz Ekim, Arthur M. Farley, Andrzej Proskurowski, Mordechai Shalom:
Defensive Domination in Proper Interval Graphs. CoRR abs/2010.03865 (2020)
2010 – 2019
- 2016
- [j62]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: 1-2 (2016) - 2015
- [j61]Hajo Broersma
Linear-Time Algorithms for Scattering Number and Hamilton-Connectivity of Interval Graphs. J. Graph Theory 79(4): 282-299 (2015) - 2014
- [j60]Isolde Adler, Arthur M. Farley, Andrzej Proskurowski:
Obstructions for linear rank-width at most 1. Discret. Appl. Math. 168: 3-13 (2014) - [j59]Héctor Rodríguez, Arthur M. Farley, Juan J. Flores
Qualitative bifurcation diagrams. Expert Syst. J. Knowl. Eng. 31(4): 319-334 (2014) - 2013
- [c27]Hajo Broersma
Linear-Time Algorithms for Scattering Number and Hamilton-Connectivity of Interval Graphs. WG 2013: 127-138 - [i2]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 abs/1301.5953 (2013) - 2012
- [j58]Pinar Heggernes
Guest editors' foreword. Discret. Appl. Math. 160(6): 683-684 (2012) - [j57]Paul S. Bonsma, Arthur M. Farley, Andrzej Proskurowski:
Extremal graphs having no matching cuts. J. Graph Theory 69(2): 206-222 (2012) - [c26]Arthur M. Farley, Stuart R. Faulk, Virginia Lo, Andrzej Proskurowski, Michal Young:
Intensive international Summer Schools in Global Distributed Software Development. FIE 2012: 1-6 - 2011
- [j56]Pinar Heggernes
Computing minimum distortion embeddings into a path for bipartite permutation graphs and threshold graphs. Theor. Comput. Sci. 412(12-14): 1275-1297 (2011) - [c25]Binh-Minh Bui-Xuan, Pinar Heggernes
A Generic Approach to Decomposition Algorithms, with an Application to Digraph Decomposition. COCOON 2011: 331-342 - [i1]Isolde Adler, Arthur M. Farley, Andrzej Proskurowski:
Obstructions for linear rankwidth at most 1. CoRR abs/1106.2533 (2011) - 2010
- [j55]Pinar Heggernes
Guest Editors' Foreword. Discret. Appl. Math. 158(7): 729-730 (2010) - [c24]Sarah A. Douglas, Arthur M. Farley, Ginnie Lo, Andrzej Proskurowski, Michal Young:
Internationalization of computer science education. SIGCSE 2010: 411-415
2000 – 2009
- 2009
- [j54]Jan Kratochvíl
Guest editors' foreword. Discret. Appl. Math. 157(12): 2575-2576 (2009) - 2008
- [c23]Pinar Heggernes
Minimum Distortion Embeddings into a Path of Bipartite Permutation and Threshold Graphs. SWAT 2008: 331-342 - 2006
- [j53]Daniel Král
Coloring mixed hypertrees. Discret. Appl. Math. 154(4): 660-672 (2006) - [c22]Juan J. Flores
Qualitative Reasoning and Bifurcations in Dynamic Systems. MICAI 2006: 259-271 - [c21]Christophe Paul, Andrzej Proskurowski, Jan Arne Telle:
Generation of Graphs with Bounded Branchwidth. WG 2006: 205-216 - 2005
- [j52]Jan Kratochvíl
Structural decompositions, width parameters, and graph labelings. Discret. Appl. Math. 145(2): 141-142 (2005) - [j51]Arvind Gupta, Naomi Nishimura, Andrzej Proskurowski, Prabhakar Ragde:
Embeddings of k-connected graphs of pathwidth k. Discret. Appl. Math. 145(2): 242-265 (2005) - [j50]Jirí Fiala, Jan Kratochvíl
Systems of distant representatives. Discret. Appl. Math. 145(2): 306-316 (2005) - [j49]Arthur M. Farley, Andrzej Proskurowski:
Priority-Consistent Graphs. Electron. Notes Discret. Math. 22: 521-526 (2005) - [j48]Michele Flammini
On routing of wavebands for all-to-all communications in all-optical paths and cycles. Theor. Comput. Sci. 333(3): 401-413 (2005) - 2004
- [j47]Arthur M. Farley, Andrzej Proskurowski, Daniel Zappala, Kurt J. Windisch:
Spanners and message distribution in networks. Discret. Appl. Math. 137(2): 159-171 (2004) - [j46]H. Brendan McMahan, Andrzej Proskurowski:
Multi-source spanning trees: algorithms for minimizing source eccentricities. Discret. Appl. Math. 137(2): 213-222 (2004) - 2003
- [j45]Harold S. Connamacher
The complexity of minimizing certain cost metrics for k-source spanning trees. Discret. Appl. Math. 131(1): 113-127 (2003) - [j44]Magnús M. Halldórsson
Multicoloring trees. Inf. Comput. 180(2): 113-129 (2003) - [c20]Michele Flammini, Alfredo Navarra, Andrzej Proskurowski:
On Routing of Wavebands for Gossiping in All-Optical Paths and Cycles. SIROCCO 2003: 133-145 - 2002
- [c19]Jirí Fiala, Jan Kratochvíl, Andrzej Proskurowski:
Geometric Systems of Disjoint Representatives. GD 2002: 110-117 - 2001
- [j43]Leizhen Cai, Derek G. Corneil, Andrzej Proskurowski:
Stable 2-pairs and (X, Y)-intersection graphs. Discret. Math. 230(1-3): 119-131 (2001) - [c18]Jirí Fiala, Jan Kratochvíl, Andrzej Proskurowski:
Distance Constrained Labeling of Precolored Trees. ICTCS 2001: 285-292 - 2000
- [j42]Anders Dessmark, Andrzej Lingas, Andrzej Proskurowski:
Faster Algorithms for Subgraph Isomorphism of k-Connected Partial k-Trees. Algorithmica 27(3): 337-347 (2000) - [j41]Bengt Aspvall, Jan Arne Telle, Andrzej Proskurowski:
Memory Requirements for Table Computations in Partial k-Tree Algorithms. Algorithmica 27(3): 382-394 (2000) - [j40]Arthur M. Farley, Paraskevi Fragopoulou, David W. Krumme, Andrzej Proskurowski, Dana Richards:
Multi-Source Spanning Tree Problems. J. Interconnect. Networks 1(1): 61-71 (2000) - [j39]Anders 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) - [c17]Arvind Gupta, Naomi Nishimura, Andrzej Proskurowski, Prabhakar Ragde:
Embeddings of k-Connected Graphs of Pathwidth k. SWAT 2000: 111-124 - [c16]Daniel Král
Coloring Mixed Hypertrees. WG 2000: 279-289
1990 – 1999
- 1999
- [j38]Andrzej Proskurowski, Jan Arne Telle:
Classes of graphs with restricted interval models. Discret. Math. Theor. Comput. Sci. 3(4): 167-176 (1999) - [j37]Arthur M. Farley, Andrzej Proskurowski, Miroslawa Skowronska, Maciej M. Syslo:
Hamiltonicity of Amalgams. Graphs Comb. 15(4): 393-404 (1999) - [c15]Magnús M. Halldórsson
Multi-coloring Trees. COCOON 1999: 271-280 - [c14]Arthur M. Farley, Paraskevi Fragopoulou, David W. Krumme, Andrzej Proskurowski, Dana Richards:
Multi-Source Spanning Tree Problems. SIROCCO 1999: 126-136 - 1998
- [j36]Jan Kratochvíl, Paul D. Manuel, Mirka Miller, Andrzej Proskurowski:
Disjoint and unfolding domination in graphs. Australas. J Comb. 18: 277-292 (1998) - [j35]Arthur M. Farley, Andrzej Pelc, Andrzej Proskurowski:
Minimum-time multidrop broadcast. Discret. Appl. Math. 83(1-3): 61-77 (1998) - [j34]Jan Kratochvíl, Andrzej Proskurowski, Jan Arne Telle:
On the Complexity of Graph Covering Problems. Nord. J. Comput. 5(3): 173-195 (1998) - [j33]Andrzej Proskurowski, Frank Ruskey
Analysis of Algorithms for Listing Equivalence Classes of k-ary Strings. SIAM J. Discret. Math. 11(1): 94-109 (1998) - [c13]Bengt Aspvall, Andrzej Proskurowski, Jan Arne Telle:
Memory Requirements for Table Computations in Partial k-tree Algorithms. SWAT 1998: 222-233 - 1997
- [j32]Arthur M. Farley, Andrzej Proskurowski:
Minimum Self-Repairing Graphs. Graphs Comb. 13(4): 345-351 (1997) - [j31]Jan Kratochvíl
Covering Regular Graphs. J. Comb. Theory B 71(1): 1-16 (1997) - [j30]Jan Arne Telle, Andrzej Proskurowski:
Algorithms for Vertex Partitioning Problems on Partial k-Trees. SIAM J. Discret. Math. 10(4): 529-550 (1997) - [c12]Jan Kratochvíl, Andrzej Proskurowski, Jan Arne Telle:
Complexity of Colored Graph Covers I. Colored Directed Multigraphs. WG 1997: 242-257 - 1996
- [j29]Leizhen Cai, Derek G. Corneil, Andrzej Proskurowski:
A generalization of line graphs: (X, Y)-intersection graphs. J. Graph Theory 21(3): 267-287 (1996) - [j28]Andrzej Proskurowski, Maciej M. Syslo, Pawel Winter:
Plane Embeddings of 2-trees and Biconnected Partial 2-Trees. SIAM J. Discret. Math. 9(4): 577-596 (1996) - [j27]Joost Engelfriet, Tero Harju
Characterization and Complexity of Uniformly Non Primitive Labeled 2-Structures. Theor. Comput. Sci. 154(2): 247-282 (1996) - [c11]Anders Dessmark, Andrzej Lingas, Andrzej Proskurowski:
Faster Algorithms for Subgraph Isomorphism of k-Connected Partial k-Trees. ESA 1996: 501-513 - 1994
- [j26]Arthur M. Farley, Andrzej Proskurowski:
Bounded-call broadcasting. Discret. Appl. Math. 53(1-3): 37-53 (1994) - [c10]Stefan Arnborg, Andrzej Proskurowski:
A Technique for Recognizing Graphs of Bounded Treewidth with Application to Subclasses of Partial 2-Paths. TAGT 1994: 469-486 - [c9]Jan Kratochvíl, Andrzej Proskurowski, Jan Arne Telle:
Complexity of Graph Covering Problems. WG 1994: 93-105 - 1993
- [j25]Jan Arne Telle, Andrzej Proskurowski:
Efficient Sets in Partial k-Trees. Discret. Appl. Math. 44(1-3): 109-117 (1993) - [j24]Stefan Arnborg, Bruno Courcelle, Andrzej Proskurowski, Detlef Seese:
An Algebraic Theory of Graph Reduction. J. ACM 40(5): 1134-1164 (1993) - [j23]Arthur M. Farley, Andrzej Proskurowski:
Self-Repairing Networks. Parallel Process. Lett. 3: 381-391 (1993) - [c8]Jan Arne Telle, Andrzej Proskurowski:
Practical Algorithms on Partial k-Trees with an Application to Domination-like Problems. WADS 1993: 610-621 - 1992
- [j22]Stefan Arnborg, Andrzej Proskurowski:
Canonical Representations of Partial 2- and 3-Trees. BIT 32(2): 197-214 (1992) - 1991
- [c7]Andrzej Proskurowski:
Graph reductions, and techniques for finding minimal forbidden minors. Graph Structure Theory 1991: 591-600 - 1990
- [j21]Stefan Arnborg, Andrzej Proskurowski, Derek G. Corneil:
Forbidden minors characterization of partial 3-trees. Discret. Math. 80(1): 1-19 (1990) - [j20]Frank Ruskey
Generating Binary Trees by Transpositions. J. Algorithms 11(1): 68-84 (1990) - [j19]Andrzej Proskurowski:
Report on GRA-GRA: 4th international workshop on graph grammars and their applications to computer science. SIGACT News 21(2): 39 (1990) - [c6]Stefan Arnborg, Andrzej Proskurowski, Detlef Seese:
Monadic Second Order Logic, Tree Automata and Forbidden Minors. CSL 1990: 1-16 - [c5]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 - [c4]Stefan Arnborg, Andrzej Proskurowski:
Canonical Representation of Partial 2- and 3-Trees. SWAT 1990: 310-319
1980 – 1989
- 1989
- [j18]Stefan Arnborg, Andrzej Proskurowski:
Linear time algorithms for NP-hard problems restricted to partial k-trees. Discret. Appl. Math. 23(1): 11-24 (1989) - [j17]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) - [j16]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
- [c3]Andrzej Proskurowski, Frank Ruskey
Generating Binary Trees by Transpositions. SWAT 1988: 199-207 - 1987
- [c2]Andrzej 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
- [j15]Stefan Arnborg, Andrzej Proskurowski:
Problems on graphs with bounded decomposability. Bull. EATCS 25: 7-10 (1985) - [j14]Andrzej Proskurowski, Frank Ruskey
Binary Tree Gray Codes. J. Algorithms 6(2): 225-238 (1985) - [j13]Sandra Mitchell Hedetniemi, Andrzej Proskurowski, Maciej M. Syslo:
Interior graphs of maximal outerplane graphs. J. Comb. Theory B 38(2): 156-167 (1985) - 1984
- [j12]Andrzej Proskurowski:
Separating subgraphs in k-trees: Cables and caterpillars. Discret. Math. 49(3): 275-285 (1984) - [c1]Charles J. Colbourn, Andrzej Proskurowski:
Concurrent Transmissions in Broadcast Networks. ICALP 1984: 128-136 - 1982
- [j11]Arthur M. Farley, Andrzej Proskurowski:
Directed Maximal-Cut Problems. Inf. Process. Lett. 15(5): 238-241 (1982) - [j10]Arthur M. Farley, Andrzej Proskurowski:
Networks immune to isolated line failures. Networks 12(4): 393-403 (1982) - 1981
- [j9]Arthur M. Farley, Stephen T. Hedetniemi, Andrzej Proskurowski:
Partitioning trees: Matching, domination, and maximum diameter. Int. J. Parallel Program. 10(1): 55-61 (1981) - [j8]Andrzej Proskurowski, Maciej M. Syslo:
Minimum dominating cycles in outerplanar graphs. Int. J. Parallel Program. 10(2): 127-139 (1981) - [j7]Andrzej Proskurowski:
Recursive Graphs, Recursive Labelings and Shortest Paths. SIAM J. Comput. 10(2): 391-397 (1981) - [j6]Andrzej Proskurowski:
Minimum Broadcast Trees. IEEE Trans. Computers 30(5): 363-366 (1981) - 1980
- [j5]Arthur M. Farley, Andrzej Proskurowski:
Computation of the center and diameter of outerplanar graphs. Discret. Appl. Math. 2(3): 185-191 (1980) - [j4]Andrzej Proskurowski:
On the Generation of Binary Trees. J. ACM 27(1): 1-2 (1980) - [j3]Andrzej Proskurowski:
Centers of maximal outerplanar graphs. J. Graph Theory 4(1): 75-79 (1980)
1970 – 1979
- 1979
- [j2]Arthur M. Farley, Stephen T. Hedetniemi, Sandra Mitchell Mitchell, Andrzej Proskurowski:
Minimum broadcast graphs. Discret. Math. 25(2): 189-193 (1979) - [j1]Andrzej Proskurowski:
Minimum dominating cycles in 2-trees. Int. J. Parallel Program. 8(5): 405-417 (1979)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 21:26 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: