S. Arnborg and A. Proskurowski, Seeing Arboretum for the (partial k-) Trees, in F. V. Fomin et al. (Eds.): Bodlaender Festschrift, LNCS 12160, pp. 1-4 (2020);
D.G. Corneil, R. Ganian and A. Proskurowski, Eighth Workshop on Graph Classes, Optimization, and Width Parameters, Guest Editors' Foreword, in Special Issue of Discrete Applied Mathematics, to appear (2020)
T. Ekim, A. M. Farley and A. Proskurowski, The complexity of the defensive domination problem in special graph classes, Discrete Mathematics 343(2), pp. (2019);
P. Heggernes, J. Kratochvil and A. Proskurowski, Fifth Workshop on Graph Classes, Optimization, and Width Parameters, Guest Editors' Foreword, in Special Issue of Discrete Applied Mathematics 199, pp.1-2 (2016)
H. Broersma, J. Fiala, P. Golovach, T. Kaiser, D. Paulusma and A. Proskurowski, Linear-Time Algorithms for Scattering Number and Hamilton-Connectivity of Interval Graphs, Journal of Graph Theory 79(4), pp. 282-299, (2015);
H. Rodriguez, A. M. Farley, J. J. Flores, Andrzej Proskurowski, Qualitative Bifurcation Diagrams, Expert Systems 31(4) pp. 319-334, (2014)
I. Adler, A.M. Farley, A. Proskurowski, Obstructions for linear rank-width at most 1, Discrete Applied Mathematics 168, pp. 3-13 (2014);
H. Broersma, J. Fiala, P. Golovach, T. Kaiser, D. Paulusma and A. Proskurowski, Linear-Time Algorithms for Scattering Number and Hamilton-Connectivity of Interval Graphs, in Proceedings of 39th International Workshop WG 2013, Springer-Verlag, A. Brandstaedt, K. Jansen, and R. Reischuk (Eds.), LNCS 8165, pp. 127-138 (2013);
A. Farley, S. Faulk, V. Lo, A. Proskurowski, M. Young, Intensive International Summer Schools in Global Distributed Software Development, Proceedings of 2012 Frontiers in Education Conference FIE'12, pp. 772-777 (2012);
P. Heggernes, J. Kratochvil and A. Proskurowski, Fourth Workshop on Graph Classes, Optimization, and Width Parameters, Guest Editors' Foreword, in Special Issue
of Discrete Applied Mathematics 160(6), pp. 683-684 (2012)
P. Bonsma, A. Farley, and A. Proskurowski, Extremal graphs having no matching cuts, Journal of Graph Theory 69(2), pp. 206-222, (2012);
Binh-Minh Bui-Xuan, Pinar Heggernes, Daniel Meister, and
Andrzej Proskurowski, A generic approach to decomposition algorithms, with an application
to digraph decomposition, Proceedings of COCOON 2011, Bin Fu, Ding-Zhu Du (Eds.), Springer-Verlag, Lecture Notes in Computer Science 6842, pp. 331-342 (2011)
P. Heggernes, D. Meister, and A. Proskurowski, Computing minimum distortion embeddings into a path for bipartite permutation graphs and threshold graphs, Theoretical Computer Science 412(12-14), pp. 1275-1297(2011);
S. Douglas, A. Farley, V. Lo, A. Proskurowski, M. Young. Internationalization of Computer Science Education. Proceedings of the 41st ACM Technical Symposium on Computer Science Education, SIGCSE'10, G. Lewandowski, S. Wolfman, T.J. Cortina, E.L. Walker, D.R. Musikant, Eds., pp. 411-415 (2010)
P. Heggernes, J. Kratochvil and A. Proskurowski, Third Workshop on Graph Classes, Optimization, and Width Parameters, Guest Editors' Foreword, in Special Issue
of Discrete Applied Mathematics 158(7), pp. 729-730 (2010)
J. Kratochvil, A. Proskurowski and O. Serra, Second Workshop on Graph Classes, Optimization, and Width Parameters, Guest Editors' Foreword, in Special Issue
of Discrete Applied Mathematics 157(12), pp. 2575-2576 (2009);
P. Heggernes, D. Meister, and A. Proskurowski. Minmum distortion embeddings into a path of bipartite permutation graphs and threshold graphs. Proceedings of 11th Scandinavian Workshop on Algorithm Theory (SWAT 2008), J. Gudmundsson, (Ed.), Springer-Verlag, Lecture Notes in Computer Science 5124, pp. 331-342 (2008);
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, Qualitative Reasoning and Bifurcations in Dynamic Systems, in MICAI 2006: Advances in Artificial Intelligence, A. Gelbukhand C. Reyes-Garcia Eds., Lecture Notes in Computer Science 4293, pp 259-271 (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);