×

zbMATH — the first resource for mathematics

Proskurowski, Andrzej

Compute Distance To:
Author ID: proskurowski.andrzej Recent zbMATH articles by "Proskurowski, Andrzej"
Published as: Proskurowski, Andrzej; Proskurowski, A.
Documents Indexed: 109 Publications since 1974, including 6 Books

Publications by Year

Citations contained in zbMATH Open

82 Publications have been cited 1,091 times in 862 Documents Cited by Year
Complexity of finding embeddings in a k-tree. Zbl 0611.05022
Arnborg, Stefan; Corneil, Derek G.; Proskurowski, Andrzej
252
1987
Linear time algorithms for NP-hard problems restricted to partial k- trees. Zbl 0666.68067
Arnborg, Stefan; Proskurowski, Andrzej
144
1989
Algorithms for vertex partitioning problems on partial \(k\)-trees. Zbl 0885.68118
Telle, Jan Arne; Proskurowski, Andrzej
95
1997
Characterization and recognition of partial 3-trees. Zbl 0597.05027
Arnborg, Stefan; Proskurowski, Andrzej
47
1986
Minimum broadcast graphs. Zbl 0404.05038
Farley, Arthur; Hedetniemi, Stephen; Mitchell, Sandra; Proskurowski, Andrzej
38
1979
Forbidden minors characterization of partial 3-trees. Zbl 0701.05016
Arnborg, Stefan; Proskurowski, Andrzej; Corneil, Derek G.
36
1990
An algebraic theory of graph reduction. Zbl 0795.68156
Arnborg, Stefan; Courcelle, Bruno; Proskurowski, Andrzej; Seese, Detlef
32
1993
Generating binary trees by transpositions. Zbl 0709.05016
Ruskey, Frank; Proskurowski, Andrzej
20
1990
Separating subgraphs in k-trees: Cables and caterpillars. Zbl 0543.05041
Proskurowski, Andrzej
20
1984
Covering regular graphs. Zbl 0895.05049
Kratochvíl, Jan; Proskurowski, Andrzej; Telle, Jan Arne
20
1997
Independent domination in trees. Zbl 0417.05020
Beyer, T.; Proskurowski, A.; Hedetniemi, S.; Mitchell, S.
19
1977
Complexity of graph covering problems. Zbl 0911.68076
Kratochvíl, Jan; Proskurowski, Andrzej; Telle, Jan Arne
17
1998
Networks immune to isolated line failures. Zbl 0493.94020
Farley, Arthur M.; Proskurowski, Andrzej
14
1982
Systems of distant representatives. Zbl 1084.05059
Fiala, Jiří; Kratochvíl, Jan; Proskurowski, Andrzej
14
2005
Computation of the center and diameter of outerplanar graphs. Zbl 0441.05034
Farley, Arthur M.; Proskurowski, Andrzej
13
1980
Centers of 2-trees. Zbl 0449.05018
Proskurowski, Andrzej
13
1980
Centers of maximal outerplanar graphs. Zbl 0401.05065
Proskurowski, Andrzej
12
1980
Binary tree Gray codes. Zbl 0593.68050
Proskurowski, Andrzej; Ruskey, Frank
11
1985
Recursive graphs, recursive labelings and shortest paths. Zbl 0471.05055
Proskurowski, Andrzej
10
1981
Minimum dominating cycles in outerplanar graphs. Zbl 0476.05064
Proskurowski, Andrzej; Syslo, Maciej M.
10
1981
Isomorphism testing in hookup classes. Zbl 0503.05023
Klawe, M. M.; Corneil, D. G.; Proskurowski, A.
10
1982
Gossiping in grid graphs. Zbl 0443.68049
Farley, Arthur M.; Proskurowski, Andrzej
10
1980
Classes of graphs with restricted interval models. Zbl 0930.05083
Proskurowski, Andrzej; Telle, Jan Arne
10
1999
Distance constrained labeling of precolored trees. Zbl 1042.68545
Fiala, Jiří; Kratochvíl, Jan; Proskurowski, Andrzej
10
2001
Partitioning trees: Matching, domination, and maximum diameter. Zbl 0464.68068
Farley, Arthur; Hedetniemi, Stephen; Proskurowski, Andrzej
9
1981
Monadic second order logic, tree automata and forbidden minors. Zbl 0942.68648
Arnborg, Stefan; Proskurowski, Andrzej; Seese, Detlef
9
1991
Multicoloring trees. Zbl 1054.68016
Halldórsson, Magnús M.; Kortsarz, Guy; Proskurowski, Andrzej; Salman, Ravit; Shachnai, Hadas; Telle, Jan Arne
9
2003
Efficient vertex- and edge-coloring of outerplanar graphs. Zbl 0582.05026
Proskurowski, Andrzej; Sysło, Maciej M.
9
1986
Memory requirements for table computations in partial \(k\)-tree algorithms. Zbl 0959.68096
Aspvall, B.; Proskurowski, A.; Telle, J. A.
9
2000
Broadcasting in trees with multiple originators. Zbl 0488.94044
Farley, Arthur M.; Proskurowski, Andrzej
8
1981
Linear time algorithms for NP-hard problems on graphs embedded in k- trees. Zbl 0527.68049
Arnborg, Stefan; Proskurowski, Andrzej
8
1984
Complexity of colored graph covers. I: Colored directed multigraphs. Zbl 0890.68095
Kratochvíl, Jan; Proskurowski, Andrzej; Telle, Jan Arne
8
1997
Minimum dominating cycles in 2-trees. Zbl 0433.05039
Proskurowski, Andrzej
8
1979
Obstructions for linear rank-width at most 1. Zbl 1285.05043
Adler, Isolde; Farley, Arthur M.; Proskurowski, Andrzej
8
2014
Linear-time algorithms for scattering number and Hamilton-connectivity of interval graphs. Zbl 1316.05080
Broersma, Hajo; Fiala, Jiří; Golovach, Petr A.; Kaiser, Tomáš; Paulusma, Daniël; Proskurowski, Andrzej
8
2015
Embeddings of \(k\)-connected graphs of pathwidth \(k\). Zbl 1055.05143
Gupta, Arvind; Nishimura, Naomi; Proskurowski, Andrzej; Ragde, Prabhakar
8
2005
Characterization and complexity of uniformly nonprimitive labeled 2-structures. Zbl 0873.68161
Engelfriet, J.; Harju, T.; Proskurowski, A.; Rozenberg, G.
7
1996
Coloring mixed hypertrees. Zbl 0989.05111
Král, Daniel; Kratochvíl, Jan; Proskurowski, Andrzej; Voss, Heinz-Jürgen
6
2000
On Halin graphs. Zbl 0537.05055
Sysło, Maciej M.; Proskurowski, Andrzej
5
1983
Minimum self-repairing graphs. Zbl 0890.05059
Farley, Arthur M.; Proskurowski, Andrzej
5
1997
Extremal graphs with no disconnecting matching. Zbl 0546.05037
Farley, Arthur M.; Proskurowski, Andrzej
5
1984
Canonical representations of partial 2- and 3-trees. Zbl 0761.68072
Arnborg, Stefan; Proskurowski, Andrzej
4
1992
An algebraic theory of graph reduction. Zbl 0765.68062
Arnborg, Stefan; Courcelle, Bruno; Proskurowski, Andrzej; Seese, Detlef
4
1991
A generalization of line graphs: \((X, Y)\)-intersection graphs. Zbl 0843.05087
Cai, Leizhen; Corneil, Derek; Proskurowski, Andrzej
4
1996
Faster algorithms for subgraph isomorphism of \(k\)-connected partial \(k\)-trees. Zbl 0960.05098
Dessmark, A.; Lingas, A.; Proskurowski, A.
4
2000
The complexity of minimizing certain cost metrics for \(k\)-source spanning trees. Zbl 1073.68061
Connamacher, Harold S.; Proskurowski, Andrzej
4
2003
Multi-source spanning trees: Algorithms for minimizing source eccentricities. Zbl 1062.68090
McMahan, H. Brendan; Proskurowski, Andrzej
4
2004
Directed maximal-cut problems. Zbl 0495.68057
Farley, Arthur M.; Proskurowski, Andrzej
3
1982
Graph reductions, and techniques for finding minimal forbidden minors. Zbl 0787.05032
Proskurowski, Andrzej
3
1993
Bounded-call broadcasting. Zbl 0807.94036
Farley, Arthur M.; Proskurowski, Andrzej
3
1994
Computing minimum distortion embeddings into a path for bipartite permutation graphs and threshold graphs. Zbl 1211.68287
Heggernes, Pinar; Meister, Daniel; Proskurowski, Andrzej
3
2011
Centering a spanning tree of a biconnected graph. Zbl 0677.68075
Cheston, Grant A.; Farley, Art; Hedetniemi, S. T.; Proskurowski, Andrzej
3
1989
Faster algorithms for subgraph isomorphism of \(k\)-connected partial \(k\)-trees. Zbl 1379.68255
Dessmark, Anders; Lingas, Andrzej; Proskurowski, Andrzej
3
1996
Search for a unique incidence matrix of a graph. Zbl 0285.05126
Proskurowski, Andrzej
3
1974
Concurrent transmissions in broadcast networks. Zbl 0554.94021
Colbourn, Charles J.; Proskurowski, Andrzej
3
1984
Spanners and message distribution in networks. Zbl 1062.68085
Farley, Arthur M.; Proskurowski, Andrzej; Zappala, Daniel; Windisch, Kurt
3
2004
Coloring mixed hypertrees. Zbl 1088.05031
Král, Daniel; Kratochvíl, Jan; Proskurowski, Andrzej; Voss, Heinz-Jürgen
3
2006
On parallel complexity of the subgraph homeomorphism of the subgraph isomorphism problem for classes of planar graphs. Zbl 0686.68041
Lingas, Andrzej; Proskurowski, Andrzej
2
1989
Characterization and recognition of partial k-trees. Zbl 0527.90037
Arnborg, Stefan; Proskurowski, Andrzej
2
1984
Analysis of algorithms for listing equivalence classes of \(k\)-ary strings. Zbl 0910.05005
Proskurowski, Andrzej; Ruskey, Frank; Smith, Malcolm
2
1998
Interior graphs of maximal outerplane graphs. Zbl 0566.05025
Hedetniemi, Sandra M.; Proskurowski, Andrzej; Syslo, Maciej M.
2
1985
Embeddings of \(k\)-connected graphs of pathwidth \(k\). Zbl 0966.68223
Gupta, Arvind; Nishimura, Naomi; Proskurowski, Andrzej; Ragde, Prabhakar
2
2000
Defensive domination. Zbl 1062.05106
Farley, Arthur M.; Proskurowski, Andrzej
2
2004
Minimal forbidden minor characterization of a class of graphs. Zbl 0698.05057
Arnborg, S.; Proskurowski, A.; Corneil, D. G.
1
1988
Efficient computations in tree-like graphs. Zbl 0713.68034
Proskurowski, Andrzej; Sysło, Maciej M.
1
1990
Edge-coloring of trees and unicyclic graphs. Zbl 0539.05034
Proskurowski, Andrzej; Syslo, Maciej M.
1
1983
K-trees: representations and distances. Zbl 0454.05023
Proskurowski, Andrzej
1
1980
Minimum-time multidrop broadcast. Zbl 0917.90118
Farley, Arthur M.; Pelc, Andrzej; Proskurowski, Andrzej
1
1998
Disjoint and unfolding domination in graphs. Zbl 0930.05069
Kratochvíl, Jan; Manuel, Paul; Miller, Mirka; Proskurowski, Andrzej
1
1998
Maximum packing for \(k\)-connected partial \(k\)-trees in polynomial time. Zbl 0938.68143
Dessmark, A.; Lingas, A.; Proskurowski, A.
1
2000
Efficient sets in partial \(k\)-trees. Zbl 0787.68083
Telle, Jan Arne; Proskurowski, Andrzej
1
1993
Symmetries in the graph coding problem. Zbl 0361.05036
Beyer, Terry; Proskurowski, Andrzej
1
1976
Canonical incidence matrices of graphs. Zbl 0415.68029
Overton, Michael L.; Proskurowski, Andrzej
1
1979
Complexity of finding embeddings in a k-tree. Zbl 0544.68047
Arnborg, Stefan; Corneil, Derek G.; Proskurowski, Andrzej
1
1984
A generic approach to decomposition algorithms, with an application to digraph decomposition. Zbl 1353.68291
Bui-Xuan, Binh-Minh; Heggernes, Pinar; Meister, Daniel; Proskurowski, Andrzej
1
2011
Extremal graphs having no matching cuts. Zbl 1234.05127
Bonsma, Paul; Farley, Arthur M.; Proskurowski, Andrzej
1
2012
Geometric systems of disjoint representatives. Zbl 1037.68584
Fiala, Jirí; Kratochvíl, Jan; Proskurowski, Andrzej
1
2002
Characterization and recognition of partial k-trees. Zbl 0622.05017
Arnborg, Stefan; Proskurowski, Andrzej
1
1985
Algorithms on graphs with bounded decomposability. Zbl 0626.05047
Arnborg, Stefan; Proskurowski, Andrzej
1
1986
Generating binary trees by transpositions. Zbl 0651.68081
Proskurowski, Andrzej; Ruskey, Frank
1
1988
Graph covering via shortest paths. Zbl 1137.05056
Boothe, Peter; Dvořák, Zdeněk; Farley, Arthur M.; Proskurowski, Andrzej
1
2007
Minimum distortion embeddings into a path of bipartite permutation and threshold graphs. Zbl 1155.68557
Heggernes, Pinar; Meister, Daniel; Proskurowski, Andrzej
1
2008
Linear-time algorithms for scattering number and Hamilton-connectivity of interval graphs. Zbl 1316.05080
Broersma, Hajo; Fiala, Jiří; Golovach, Petr A.; Kaiser, Tomáš; Paulusma, Daniël; Proskurowski, Andrzej
8
2015
Obstructions for linear rank-width at most 1. Zbl 1285.05043
Adler, Isolde; Farley, Arthur M.; Proskurowski, Andrzej
8
2014
Extremal graphs having no matching cuts. Zbl 1234.05127
Bonsma, Paul; Farley, Arthur M.; Proskurowski, Andrzej
1
2012
Computing minimum distortion embeddings into a path for bipartite permutation graphs and threshold graphs. Zbl 1211.68287
Heggernes, Pinar; Meister, Daniel; Proskurowski, Andrzej
3
2011
A generic approach to decomposition algorithms, with an application to digraph decomposition. Zbl 1353.68291
Bui-Xuan, Binh-Minh; Heggernes, Pinar; Meister, Daniel; Proskurowski, Andrzej
1
2011
Minimum distortion embeddings into a path of bipartite permutation and threshold graphs. Zbl 1155.68557
Heggernes, Pinar; Meister, Daniel; Proskurowski, Andrzej
1
2008
Graph covering via shortest paths. Zbl 1137.05056
Boothe, Peter; Dvořák, Zdeněk; Farley, Arthur M.; Proskurowski, Andrzej
1
2007
Coloring mixed hypertrees. Zbl 1088.05031
Král, Daniel; Kratochvíl, Jan; Proskurowski, Andrzej; Voss, Heinz-Jürgen
3
2006
Systems of distant representatives. Zbl 1084.05059
Fiala, Jiří; Kratochvíl, Jan; Proskurowski, Andrzej
14
2005
Embeddings of \(k\)-connected graphs of pathwidth \(k\). Zbl 1055.05143
Gupta, Arvind; Nishimura, Naomi; Proskurowski, Andrzej; Ragde, Prabhakar
8
2005
Multi-source spanning trees: Algorithms for minimizing source eccentricities. Zbl 1062.68090
McMahan, H. Brendan; Proskurowski, Andrzej
4
2004
Spanners and message distribution in networks. Zbl 1062.68085
Farley, Arthur M.; Proskurowski, Andrzej; Zappala, Daniel; Windisch, Kurt
3
2004
Defensive domination. Zbl 1062.05106
Farley, Arthur M.; Proskurowski, Andrzej
2
2004
Multicoloring trees. Zbl 1054.68016
Halldórsson, Magnús M.; Kortsarz, Guy; Proskurowski, Andrzej; Salman, Ravit; Shachnai, Hadas; Telle, Jan Arne
9
2003
The complexity of minimizing certain cost metrics for \(k\)-source spanning trees. Zbl 1073.68061
Connamacher, Harold S.; Proskurowski, Andrzej
4
2003
Geometric systems of disjoint representatives. Zbl 1037.68584
Fiala, Jirí; Kratochvíl, Jan; Proskurowski, Andrzej
1
2002
Distance constrained labeling of precolored trees. Zbl 1042.68545
Fiala, Jiří; Kratochvíl, Jan; Proskurowski, Andrzej
10
2001
Memory requirements for table computations in partial \(k\)-tree algorithms. Zbl 0959.68096
Aspvall, B.; Proskurowski, A.; Telle, J. A.
9
2000
Coloring mixed hypertrees. Zbl 0989.05111
Král, Daniel; Kratochvíl, Jan; Proskurowski, Andrzej; Voss, Heinz-Jürgen
6
2000
Faster algorithms for subgraph isomorphism of \(k\)-connected partial \(k\)-trees. Zbl 0960.05098
Dessmark, A.; Lingas, A.; Proskurowski, A.
4
2000
Embeddings of \(k\)-connected graphs of pathwidth \(k\). Zbl 0966.68223
Gupta, Arvind; Nishimura, Naomi; Proskurowski, Andrzej; Ragde, Prabhakar
2
2000
Maximum packing for \(k\)-connected partial \(k\)-trees in polynomial time. Zbl 0938.68143
Dessmark, A.; Lingas, A.; Proskurowski, A.
1
2000
Classes of graphs with restricted interval models. Zbl 0930.05083
Proskurowski, Andrzej; Telle, Jan Arne
10
1999
Complexity of graph covering problems. Zbl 0911.68076
Kratochvíl, Jan; Proskurowski, Andrzej; Telle, Jan Arne
17
1998
Analysis of algorithms for listing equivalence classes of \(k\)-ary strings. Zbl 0910.05005
Proskurowski, Andrzej; Ruskey, Frank; Smith, Malcolm
2
1998
Minimum-time multidrop broadcast. Zbl 0917.90118
Farley, Arthur M.; Pelc, Andrzej; Proskurowski, Andrzej
1
1998
Disjoint and unfolding domination in graphs. Zbl 0930.05069
Kratochvíl, Jan; Manuel, Paul; Miller, Mirka; Proskurowski, Andrzej
1
1998
Algorithms for vertex partitioning problems on partial \(k\)-trees. Zbl 0885.68118
Telle, Jan Arne; Proskurowski, Andrzej
95
1997
Covering regular graphs. Zbl 0895.05049
Kratochvíl, Jan; Proskurowski, Andrzej; Telle, Jan Arne
20
1997
Complexity of colored graph covers. I: Colored directed multigraphs. Zbl 0890.68095
Kratochvíl, Jan; Proskurowski, Andrzej; Telle, Jan Arne
8
1997
Minimum self-repairing graphs. Zbl 0890.05059
Farley, Arthur M.; Proskurowski, Andrzej
5
1997
Characterization and complexity of uniformly nonprimitive labeled 2-structures. Zbl 0873.68161
Engelfriet, J.; Harju, T.; Proskurowski, A.; Rozenberg, G.
7
1996
A generalization of line graphs: \((X, Y)\)-intersection graphs. Zbl 0843.05087
Cai, Leizhen; Corneil, Derek; Proskurowski, Andrzej
4
1996
Faster algorithms for subgraph isomorphism of \(k\)-connected partial \(k\)-trees. Zbl 1379.68255
Dessmark, Anders; Lingas, Andrzej; Proskurowski, Andrzej
3
1996
Bounded-call broadcasting. Zbl 0807.94036
Farley, Arthur M.; Proskurowski, Andrzej
3
1994
An algebraic theory of graph reduction. Zbl 0795.68156
Arnborg, Stefan; Courcelle, Bruno; Proskurowski, Andrzej; Seese, Detlef
32
1993
Graph reductions, and techniques for finding minimal forbidden minors. Zbl 0787.05032
Proskurowski, Andrzej
3
1993
Efficient sets in partial \(k\)-trees. Zbl 0787.68083
Telle, Jan Arne; Proskurowski, Andrzej
1
1993
Canonical representations of partial 2- and 3-trees. Zbl 0761.68072
Arnborg, Stefan; Proskurowski, Andrzej
4
1992
Monadic second order logic, tree automata and forbidden minors. Zbl 0942.68648
Arnborg, Stefan; Proskurowski, Andrzej; Seese, Detlef
9
1991
An algebraic theory of graph reduction. Zbl 0765.68062
Arnborg, Stefan; Courcelle, Bruno; Proskurowski, Andrzej; Seese, Detlef
4
1991
Forbidden minors characterization of partial 3-trees. Zbl 0701.05016
Arnborg, Stefan; Proskurowski, Andrzej; Corneil, Derek G.
36
1990
Generating binary trees by transpositions. Zbl 0709.05016
Ruskey, Frank; Proskurowski, Andrzej
20
1990
Efficient computations in tree-like graphs. Zbl 0713.68034
Proskurowski, Andrzej; Sysło, Maciej M.
1
1990
Linear time algorithms for NP-hard problems restricted to partial k- trees. Zbl 0666.68067
Arnborg, Stefan; Proskurowski, Andrzej
144
1989
Centering a spanning tree of a biconnected graph. Zbl 0677.68075
Cheston, Grant A.; Farley, Art; Hedetniemi, S. T.; Proskurowski, Andrzej
3
1989
On parallel complexity of the subgraph homeomorphism of the subgraph isomorphism problem for classes of planar graphs. Zbl 0686.68041
Lingas, Andrzej; Proskurowski, Andrzej
2
1989
Minimal forbidden minor characterization of a class of graphs. Zbl 0698.05057
Arnborg, S.; Proskurowski, A.; Corneil, D. G.
1
1988
Generating binary trees by transpositions. Zbl 0651.68081
Proskurowski, Andrzej; Ruskey, Frank
1
1988
Complexity of finding embeddings in a k-tree. Zbl 0611.05022
Arnborg, Stefan; Corneil, Derek G.; Proskurowski, Andrzej
252
1987
Characterization and recognition of partial 3-trees. Zbl 0597.05027
Arnborg, Stefan; Proskurowski, Andrzej
47
1986
Efficient vertex- and edge-coloring of outerplanar graphs. Zbl 0582.05026
Proskurowski, Andrzej; Sysło, Maciej M.
9
1986
Algorithms on graphs with bounded decomposability. Zbl 0626.05047
Arnborg, Stefan; Proskurowski, Andrzej
1
1986
Binary tree Gray codes. Zbl 0593.68050
Proskurowski, Andrzej; Ruskey, Frank
11
1985
Interior graphs of maximal outerplane graphs. Zbl 0566.05025
Hedetniemi, Sandra M.; Proskurowski, Andrzej; Syslo, Maciej M.
2
1985
Characterization and recognition of partial k-trees. Zbl 0622.05017
Arnborg, Stefan; Proskurowski, Andrzej
1
1985
Separating subgraphs in k-trees: Cables and caterpillars. Zbl 0543.05041
Proskurowski, Andrzej
20
1984
Linear time algorithms for NP-hard problems on graphs embedded in k- trees. Zbl 0527.68049
Arnborg, Stefan; Proskurowski, Andrzej
8
1984
Extremal graphs with no disconnecting matching. Zbl 0546.05037
Farley, Arthur M.; Proskurowski, Andrzej
5
1984
Concurrent transmissions in broadcast networks. Zbl 0554.94021
Colbourn, Charles J.; Proskurowski, Andrzej
3
1984
Characterization and recognition of partial k-trees. Zbl 0527.90037
Arnborg, Stefan; Proskurowski, Andrzej
2
1984
Complexity of finding embeddings in a k-tree. Zbl 0544.68047
Arnborg, Stefan; Corneil, Derek G.; Proskurowski, Andrzej
1
1984
On Halin graphs. Zbl 0537.05055
Sysło, Maciej M.; Proskurowski, Andrzej
5
1983
Edge-coloring of trees and unicyclic graphs. Zbl 0539.05034
Proskurowski, Andrzej; Syslo, Maciej M.
1
1983
Networks immune to isolated line failures. Zbl 0493.94020
Farley, Arthur M.; Proskurowski, Andrzej
14
1982
Isomorphism testing in hookup classes. Zbl 0503.05023
Klawe, M. M.; Corneil, D. G.; Proskurowski, A.
10
1982
Directed maximal-cut problems. Zbl 0495.68057
Farley, Arthur M.; Proskurowski, Andrzej
3
1982
Recursive graphs, recursive labelings and shortest paths. Zbl 0471.05055
Proskurowski, Andrzej
10
1981
Minimum dominating cycles in outerplanar graphs. Zbl 0476.05064
Proskurowski, Andrzej; Syslo, Maciej M.
10
1981
Partitioning trees: Matching, domination, and maximum diameter. Zbl 0464.68068
Farley, Arthur; Hedetniemi, Stephen; Proskurowski, Andrzej
9
1981
Broadcasting in trees with multiple originators. Zbl 0488.94044
Farley, Arthur M.; Proskurowski, Andrzej
8
1981
Computation of the center and diameter of outerplanar graphs. Zbl 0441.05034
Farley, Arthur M.; Proskurowski, Andrzej
13
1980
Centers of 2-trees. Zbl 0449.05018
Proskurowski, Andrzej
13
1980
Centers of maximal outerplanar graphs. Zbl 0401.05065
Proskurowski, Andrzej
12
1980
Gossiping in grid graphs. Zbl 0443.68049
Farley, Arthur M.; Proskurowski, Andrzej
10
1980
K-trees: representations and distances. Zbl 0454.05023
Proskurowski, Andrzej
1
1980
Minimum broadcast graphs. Zbl 0404.05038
Farley, Arthur; Hedetniemi, Stephen; Mitchell, Sandra; Proskurowski, Andrzej
38
1979
Minimum dominating cycles in 2-trees. Zbl 0433.05039
Proskurowski, Andrzej
8
1979
Canonical incidence matrices of graphs. Zbl 0415.68029
Overton, Michael L.; Proskurowski, Andrzej
1
1979
Independent domination in trees. Zbl 0417.05020
Beyer, T.; Proskurowski, A.; Hedetniemi, S.; Mitchell, S.
19
1977
Symmetries in the graph coding problem. Zbl 0361.05036
Beyer, Terry; Proskurowski, Andrzej
1
1976
Search for a unique incidence matrix of a graph. Zbl 0285.05126
Proskurowski, Andrzej
3
1974
all top 5

Cited by 1,236 Authors

29 Proskurowski, Andrzej
27 Bodlaender, Hans L.
19 Telle, Jan Arne
15 Kawarabayashi, Ken-ichi
15 Paulusma, Daniël
15 Thilikos, Dimitrios M.
14 Kratochvíl, Jan
13 Kwon, Ojoung
12 Fiala, Jiří
11 Courcelle, Bruno
11 Kratsch, Dieter
11 Vatshelle, Martin
10 Hattingh, Johannes H.
10 Joubert, Ernst J.
10 Kobayashi, Yusuke
9 Farley, Arthur M.
9 Fomin, Fedor V.
9 Nisse, Nicolas
8 Arnborg, Stefan
8 Gurski, Frank
8 Tuza, Zsolt
7 Golovach, Petr A.
7 Harutyunyan, Hovhannes A.
7 Hedetniemi, Stephen Travis
7 Kloks, Ton
7 Lê Văn Băng
6 Chang, Gerard Jennhwa
6 Corneil, Derek Gordon
6 Fellows, Michael Ralph
6 Heggernes, Pinar
6 Henning, Michael Anthony
6 Lokshtanov, Daniel
6 Müller, Haiko
6 Slater, Peter James
6 van ’t Hof, Pim
5 Broersma, Hajo J.
5 Bui-Xuan, Binh-Minh
5 Chang, Jou-Ming
5 Cygan, Marek
5 Dragan, Feodor F.
5 Jansen, Bart M. P.
5 Jansen, Klaus
5 Kanté, Mamadou Moustapha
5 Koster, Arie M. C. A.
5 Král’, Daniel
5 Liestman, Arthur L.
5 Lingas, Andrzej
5 Markenzon, Lilian
5 Meister, Daniel
5 Niedermeier, Rolf
5 Nishimura, Naomi
5 Nishizeki, Takao
5 Oum, Sang-Il
5 Pilipczuk, Marcin
5 Pilipczuk, Michał
5 Rossmanith, Peter
5 Ruskey, Frank
5 Sæther, Sigve Hortemo
5 Syslo, Maciej M.
5 Todinca, Ioan
5 Woltran, Stefan
5 Zhou, Xiao
4 Araújo, Júlio César Silva
4 Belmonte, Rémy
4 Cai, Leizhen
4 Chandran, L. Sunil
4 Chaplick, Steven
4 Dechter, Rina
4 Dinneen, Michael J.
4 Dorn, Frederic
4 Fertin, Guillaume
4 Fraigniaud, Pierre
4 Habib, Michel A.
4 Hell, Pavol
4 Jaffke, Lars
4 Kakimura, Naonori
4 Kaufmann, Michael
4 Lin, Ching-Chi
4 Makowsky, Johann-Andreas
4 Mazoit, Frédéric
4 Meeks, Kitty
4 Milanič, Martin
4 Nederlof, Jesper
4 Olariu, Stephan
4 Peters, Joseph G.
4 Rozenberg, Grzegorz
4 Strømme, Torstein J. F.
4 Tamaki, Hisao
4 Tesař, Marek
4 Thomas, Robin
4 Ventura, Jose A.
4 Villanger, Yngve
4 Voss, Heinz-Jürgen
4 Wanke, Egon
4 Whitesides, Sue H.
4 Wu, Ro-Yu
3 Averbuch, Amir Z.
3 Babel, Luitpold
3 Bienstock, Daniel
3 Borie, Richard B.
...and 1,136 more Authors
all top 5

Cited in 123 Serials

184 Discrete Applied Mathematics
101 Theoretical Computer Science
59 Discrete Mathematics
44 Algorithmica
27 Information Processing Letters
21 Journal of Combinatorial Theory. Series B
14 Graphs and Combinatorics
14 Journal of Discrete Algorithms
13 European Journal of Combinatorics
12 Artificial Intelligence
12 Journal of Computer and System Sciences
12 Networks
12 Theory of Computing Systems
10 Journal of Combinatorial Optimization
9 Information and Computation
9 Discrete Optimization
8 International Journal of Computer Mathematics
7 Journal of Graph Theory
7 SIAM Journal on Discrete Mathematics
6 Operations Research Letters
6 International Journal of Approximate Reasoning
6 Discussiones Mathematicae. Graph Theory
5 BIT
5 SIAM Journal on Algebraic and Discrete Methods
5 International Journal of Foundations of Computer Science
5 European Journal of Operational Research
4 Information Sciences
4 Mathematica Slovaca
4 SIAM Journal on Computing
4 Discrete & Computational Geometry
4 Computational Geometry
4 Prikladnaya Diskretnaya Matematika
3 Acta Informatica
3 Journal of Soviet Mathematics
3 Combinatorica
3 Computers & Operations Research
3 Annals of Operations Research
3 Linear Algebra and its Applications
3 Mathematical Programming. Series A. Series B
3 RAIRO. Operations Research
3 Discrete Mathematics, Algorithms and Applications
3 Computer Science Review
2 Applied Mathematics and Computation
2 Computing
2 International Journal of Computer & Information Sciences
2 Journal of Automated Reasoning
2 Machine Learning
2 International Journal of Computational Geometry & Applications
2 International Journal of Algebra and Computation
2 Computational Statistics and Data Analysis
2 RAIRO. Informatique Théorique et Applications
2 SIAM Journal on Optimization
2 Cybernetics and Systems Analysis
2 Combinatorics, Probability and Computing
2 Journal of Mathematical Sciences (New York)
2 Annals of Mathematics and Artificial Intelligence
2 Constraints
2 Journal of Scheduling
2 BIT. Nordisk Tidskrift for Informationsbehandling
2 Mathematics in Computer Science
2 Algorithms
2 International Journal of Combinatorics
1 Computers & Mathematics with Applications
1 Communications in Mathematical Physics
1 Israel Journal of Mathematics
1 Journal of the Franklin Institute
1 Journal of Mathematical Biology
1 Mathematical Notes
1 Periodica Mathematica Hungarica
1 Abhandlungen aus dem Mathematischen Seminar der Universität Hamburg
1 Annales Universitatis Mariae Curie-Skłodowska. Sectio A. Mathematica
1 Journal of Applied Probability
1 Journal of Combinatorial Theory. Series A
1 Journal of Optimization Theory and Applications
1 Mathematical Programming
1 Quaestiones Mathematicae
1 RAIRO, Informatique Théorique
1 Theory and Decision
1 Annals of Pure and Applied Logic
1 Order
1 Journal of Symbolic Computation
1 Journal of Complexity
1 Statistical Science
1 Asia-Pacific Journal of Operational Research
1 JETAI. Journal of Experimental & Theoretical Artificial Intelligence
1 MSCS. Mathematical Structures in Computer Science
1 Journal of Global Optimization
1 Designs, Codes and Cryptography
1 Applied Intelligence
1 Bulletin of the American Mathematical Society. New Series
1 Distributed Computing
1 ZOR. Zeitschrift für Operations Research
1 Foundations of Computing and Decision Sciences
1 The Australasian Journal of Combinatorics
1 Applied Mathematics. Series B (English Edition)
1 The Electronic Journal of Combinatorics
1 The Bulletin of Symbolic Logic
1 Complexity
1 ZOR. Mathematical Methods of Operations Research
1 International Transactions in Operational Research
...and 23 more Serials

Citations by Year