P. Boothe, Z. Dvorak, A.M. Farley, and A. Proskurowski. Graph covering via shortest paths. Congressus Numerantium 187, pp. 145-155 (2007);
C. Paul, A. Proskurowski and J.A. Telle. Generation of edge-maximal graphs with bounded branchwidth, in Proceedings of 32nd International Workshop WG 2006, Fedor V. Fomin (Ed.), Springer-Verlag, Lecture Notes in Computer Science 4271, pp. 206-216 (2006);
J.J. Flores and A. Proskurowski, Reasoning about Dynamic Systems and Bifurcations, in Collection of working papers of QR-06, the 20th International Workshop on Qualitative Reasoning, C. Bailey-Kellogg and B. Kuipers, Eds., pp. 61-69 (2006);
D. Kral, J. Kratochvil, A. Proskurowski and H.-J. Voss, Coloring mixed hypertrees, Discrete Applied Mathematics 154(4), pp. 660-672 (2006);
A.M. Farley and A. Proskurowski, Priority-Consistent Graphs, in
Proceedings of 7th International Colloquium on Graph Theory,
Electronic Notes in Discrete Mathematics 22, pp. 521-526
(2005);
M. Flammini, A. Navarra and A. Proskurowski, On
Routing of Wavebands for Gossiping in All-Optical Paths and Cycles,
Theoretical Computer Science 333(3), pp. 401-413 (2005);
J.
Kratochvil, A. Proskurowski and O. Serra, Structural decompositions,
width parameters and graph labelings, Editorial, in Special Issue
of Discrete Applied Mathematics 145(2), 141-142, (2005);
A. Gupta, N. Nishimura, A. Proskurowski and P. Ragde,
Embeddings of k-connected graphs of pathwidth k, Discrete
Applied Mathematics 145(2), pp. 242-265 (2005);
J. Fiala,
J. Kratochvil and A. Proskurowski, Systems of distant representatives,
Discrete Applied Mathematics 145(2), pp. 306-316 (2005);
A.M. Farley and A. Proskurowski, Defensive Domination, Congressus
Numerantium 168 pp. 97-107 (2004);
A.M.
Farley, A. Proskurowski, D. Zappala and K. Windish, Spanners
and message distribution in networks, Discrete Applied
Mathematics 137(2) pp. 159-171 (2004);
B. McMahan and A.
Proskurowski, Multi-source spanning trees:
algorithms for minimizing source eccentricities Discrete
Applied Mathematics 137(2) pp. 213-222 (2003);
Harold S.
Connamacher and Andrzej Proskurowski, The
complexity of minimizing certain cost metrics for k-source spanning
trees, Discrete Applied Mathematics 131(1) pp. 113-127
(2003);
M. Flammini, A. Navarra and A. Proskurowski,
On Routing of Wavebands for Gossiping in All-Optical Paths and
Cycles, in Proceedings of SIROCCO'03 (Proceedings in
Informatics 17), Jop F. Sibeyn, Ed., pp. 133-145 (2003);
M.
Hálldórsson, G. Kortsarz, A. Proskurowski, R. Salman,
H. Shachnai and J.A. Telle, Multicoloring trees,
Information and Computation 180 pp. 113-129 (2003);
J.
Fiala, J. Kratochvil and A. Proskurowski, Geometric systems of
disjoint representatives, in Proceedings of 10th International
Symposium on Graph Drawing, GD 2002, M.T. Goodrich and S.G.
Kobourov (Eds.) Springer-Verlag, Lecture Notes in Computer Science
2528, 110-117 (2002);
J. Fiala, J. Kratochvil and A.
Proskurowski, Distance constrained labeling of precolored trees, in
Proceedings of 7th Italian Conference, ICTCS 2001, A. Restivo,
S. Ronchi Della Rocca, L. Roversi (Eds.), Springer-Verlag, Lecture
Notes in Computer Science 2202, 285-292 (2001);
L. Cai, D.G.
Corneil and A. Proskurowski, Stable 2-pairs and (X,Y)-intersection
graphs, Discrete Mathematics 230(1-3) pp. 119-131 (2001);