Publications - University of Limerick

Patrick Healy Curriculum Vitae
Publications:
Order of presentation of publications:
refereed journal, post-conference publications [1] – [10];
edited books, proceedings, collections [11] – [13];
book chapters [14];
refereed conference publications [15] – [41];
invited talks [42] – [44];
other conference presentations [45] – [57];
other non-peer reviewed material (technical reports, etc.) are not listed
[1] Sarmad Abassi, Patrick Healy, and Aimal Rextin. Improving the running time of embedded
upward planarity testing. Information Processing Letters, 110(7):274–278, 2010.
[2] Martin Harrigan and Patrick Healy. Using a significant spanning tree to draw a directed
graph. Journal of Graph Algorithms and Applications, 12(3), 2008.
[3] Patrick Healy. Scheduling research grant proposal evaluation meetings and the range
colouring problem. In Edmund K. Burke and Hana Rudová, editors, Practice and Theory of
Automated Timetabling, 6th International Conference, Selected Papers, Aug.–Sep., 2006,
volume 3867 of LNCS, pages 121–133, Brno, Czech Republic, 2007. Springer.
[4] Patrick Healy and Karol Lynch. Building blocks of upward planar digraphs. Journal of
Graph Algorithms and Applications, 11(1):3–44, 2007.
[5] Patrick Healy and Karol Lynch. Fixed-parameter tractable algorithms for testing upward
planarity. International Journal of Foundations of Computer Science, 17(5), October 2006.
[6] Patrick Healy, Ago Kuusik, and Sebastian Leipert. A characterisation of level planar
graphs. Discrete Mathematics, 280(1 – 3):51 – 63, 2004.
[7] Patrick Healy and Ago Kuusik. Algorithms for multi-level graph planarity testing and
layout. Theoretical Computer Science, 320(2 – 3):331 – 344, 2004.
[8] Patrick Healy, Marcus Creavin, and Ago Kuusik. An optimal algorithm for rectangle
placement. Operations Research Letters, 24:73–80, 1999.
[9] Patrick Healy and Robert N. Moll. A local optimization-based solution to the rectangle
layout problem. Journal of the Operational Research Society, 47:523 – 537, April 1996.
[10] Patrick Healy and Robert Moll. A new extension of local search applied to the Dial-A-
Ride-Problem. European Journal of Operational Research, 83(1):83 – 104, May 1995.
[11] Patrick Healy and Nikola S. Nikolov, editors. Graph Drawing, 13th International Symposium,
GD 2005, Limerick, Ireland, September 12-14, 2005, Revised Papers, volume 3843
of Lecture Notes in Computer Science. Springer, 2006.
[12] Patrick Healy and Peter Eades. Journal of Graph Algorithms and Applications; special
edition dedicated to Graph Drawing ’05, volume 11. ISSN: 1526-1719, 2007.
Page 4 of 8

Patrick Healy Curriculum Vitae
[13] Patrick Healy and Nikola S. Nikolov, editors. Discrete Mathematics; special edition dedicated
to 13th International Symposium on Graph Drawing, 2005, volume 309. Elsevier,
April 2009.
[14] Patrick Healy and Nikolov S. Nikolov. Handbook of Graph Drawing and Visualization,
chapter II.16. Hierarchical Drawing Algorithms. CRC Press, 2010. (To appear).
[15] Mihai Bilauca and Patrick Healy. Building table formatting tools. In Matthew R. B. Hardy
and Frank Wm. Tompa, editors, ACM Symposium on Document Engineering, pages 13–22.
ACM, 2011.
[16] Martin Harrigan and Patrick Healy. k-level crossing minimization is np-hard for trees. In
Proceedings of Workshop on Algorithms and Computation - 2011, pages 70–76, 2011.
[17] Mihai Bilauca and Patrick Healy. Table layout performance of document authoring tools.
In ACM Symposium on Document Engineering, pages 199–202, 2010.
[18] Mihai Bilauca and Patrick Healy. A new model for automated table layout. In ACM
Symposium on Document Engineering, pages 169–176, 2010.
[19] Mel Gorman and Patrick Healy. Performance Characteristics of Explicit Superpage Support.
In Tao Li, Onur Mutlu, and James Poe, editors, WIOSCA 2010 - Sixth Annual
Workshop on the Interaction between Operating Systems and Computer Architecture, Saint
Malo France, 2010.
[20] Aimal Rextin and Patrick Healy. Maximum upward planar subgraph of a single-source
embedded digraph. In My T. Thai and Sartaj Sahni, editors, COCOON 2010, volume
6196 of Lecture Notes in Computer Science, pages 110–119. Springer, 2010.
[21] Patrick Healy. Managing change in the era of the iPhone. In Paolo Boldi and Luisa
Gargano, editors, Proceedings of FUN 2010, volume 6099 of Lecture Notes in Computer
Science, pages 249–259, 2010.
[22] C. Cawley, P. Healy, and G. Botterweck. A discussion of three visualisation approaches to
providing cognitive support in variability management. In Frank Dölitzscher Steffen Thiel,
Christoph Reich, editor, 2nd Conference on Software Technologies and Processes (STeP).
Oldenbourg, 2010. ISBN 978-3-486-59816-2.
[23] C. Cawley, G. Botterweck, P. Healy, S. B. Abid, and S. Thiel. A 3d visualisation to enhance
cognition in software product line engineering. In 5th International Symposium on Visual
Computing (ISVC09), Las Vegas, Nevada, USA, 2009.
[24] Sarmad Abbasi, Patrick Healy, and Aimal Rextin. An improved upward planarity testing
algorithm and related applications. In Sandip Das and Ryuhei Uehara, editors, WALCOM,
volume 5431 of Lecture Notes in Computer Science, pages 334–344. Springer, 2009.
[25] Aimal Rextin and Patrick Healy. A fully dynamic algorithm to test the upward planarity
of single source embedded digraphs. In Ioannis G. Tollis and Maurizio Patrignani, editors,
Graph Drawing, volume 5417 of Lecture Notes in Computer Science, pages 254–265.
Springer, 2008.
Page 5 of 8

Patrick Healy Curriculum Vitae
[26] Daren Nestor, Steffen Thiel, Goetz Botterweck, Ciarán Cawley, and Patrick Healy. Applying
visualisation techniques in software product lines. In SoftVis ’08: Proceedings of
the 4th ACM symposium on Software visuallization, pages 175–184, New York, NY, USA,
2008. ACM.
[27] Mel Gorman and Patrick Healy. Supporting superpage allocation without additional hardware
support. In ISMM ’08: Proceedings of the 7th international symposium on Memory
management, pages 41–50, New York, NY, USA, 2008. ACM.
[28] Martin Harrigan and Patrick Healy. Practical level planarity testing and layout with embedding
constraints. In Graph Drawing, 15th International Symposium, GD 2007, volume
4875, pages 62–68. Springer Berlin / Heidelberg, Spetember, 2007 2008. DOI: 10.1007/978-
3-540-77537-9 9.
[29] Patrick Healy. handin: A system for the efficient management of programming assignments.
In Computer Science Community of Practice Symposium, 2007, Dec. 2007. ISBN:
1-905952-04-X (978-1-905952-04-5).
[30] Daren Nestor, Luke O’Malley, Patrick Healy, Aaron Quigley, and Steffen Thiel. Visualisation
techniques to support derivation tasks in software product line development. In
CASCON ’07: Proceedings of the 2007 conference of the center for advanced studies on
Collaborative research, pages 315–325, New York, NY, USA, 2007. ACM.
[31] Radoslav Andreev, Patrick Healy, and Nikola S. Nikolov. Applying ant colony optimization
metaheuristic to the DAG layering problem. In Proceedings of the 10th International
Workshop on Nature Inspired Distributed Computing (NIDISC’07); IEEE Catalog Number:
07TH8938, pages 200–201. IEEE Computer Society, 2007.
[32] Martin Harrigan and Patrick Healy. Efficiently drawing a significant spanning tree of a
directed graph. In Proceedings of APVIS ’07 (6th International Asia-Pacific Symposium
on Visualisation), pages 53 – 59, 2007.
[33] Patrick Healy. Scheduling research grant proposal evaluation meetings. In Edmund K.
Burke and Hana Rudová, editors, Proceedings of The 6 th International Conference on the
Practice and Theory of Automated Timetabling, pages 432–436, 2006.
[34] Patrick Healy and Karol Lynch. Fixed-parameter tractable algorithms for testing upward
planarity. In Peter Vojtás, Mária Bieliková, Bernadette Charron-Bost, and Ondrej S´ykora,
editors, SOFSEM, volume 3381 of Lecture Notes in Computer Science, pages 199–208.
Springer, 2005.
[35] Patrick Healy and Karol Lynch. Building blocks of upward planar digraphs. In GD2004,
Proceedings of 12 th International Graph Drawing Symposium, LNCS, pages 296 – 306.
Springer-Verlag, 2004.
[36] Patrick Healy and Nikola S. Nikolov. Facets of the directed acyclic graph layering polytope.
In Boedlander and Kaufman, editors, Graph-Theoretic Concepts in Computer Science:
Proceedings of 28 th International Workshop, WG 2002, Lecture Notes in Computer Science.
Springer-Verlag, 2002.
Page 6 of 8

Patrick Healy Curriculum Vitae
[37] Patrick Healy and Nikola S. Nikolov. A branch-and-cut approach to the directed acyclic
graph layering problem. In Michael T. Goodrich and Stephen G. Koubourov, editors,
GD2002, Proceedings of 10 th International Graph Drawing Symposium, number 2528 in
LNCS, pages 98 – 109. Springer-Verlag, 2002.
[38] Patrick Healy and Nikola S. Nikolov. How to layer a directed acyclic graph. In P. Mutzel,
M. Jünger, and S. Leipert, editors, Graph Drawing: Proceedings of 9 th International Symposium,
GD 2001, Lecture Notes in Computer Science, pages 16 – 30. Springer-Verlag,
2001.
[39] Patrick Healy, Ago Kuusik, and Sebastian Leipert. Characterization of level non-planar
graphs by minimal patterns. In D.-Z. Du, P. Eades, V. Estivill-Castro, X. Lin, and
A. Sharma, editors, Computing and Combinatorics: Proceedings of 6 th International Conference,
COCOON 2000, volume 1858 of Lecture Notes in Computer Science, pages 74 –
84. Springer-Verlag, 2000.
[40] Patrick Healy and Michael English. Upward planarity of sparse graphs. In Ljiljana
Brankovic and Joe Ryan, editors, Proceedings of the Eleventh Australasian Workshop on
Combinatorial Algorithms, pages 191 – 203, July 2000.
[41] Patrick Healy and Ago Kuusik. The vertex-exchange graph: A new concept for multilevel
crossing minimization. In Jan Kratochvíl, editor, Graph Drawing: Proceedings of 7th
International Symposium, GD’99, number 1731 in Lecture Notes in Computer Science,
pages 205 – 216. Springer-Verlag, 1999.
[42] Patrick Healy. The Marie Curie Transfer of Knowledge (ToK) scheme under FP6. Invited
talk at Irish Universities Association, December 2005.
[43] Patrick Healy. The Marie Curie European Postdoctoral Scheme. Invited talk at University
of Limerick, June 2005.
[44] Patrick Healy. A new ILP approach for drawing hierarchical graphs. Invited talk at ISMP
2000: 17 th International Symposium on Mathematical Programming, August 2000.
[45]
[46]
[47]
[48]
Áine Uí Éigeartaigh, Patrick Healy, Mícheál Ó hÉigeartaigh, and Seán Mc Garraghy. rchains
in graphs and their complements.
Áine Uí Éigeartaigh, Patrick Healy, and Mícheál Ó hÉigeartaigh. r-swaps of Hamiltonian
tours. In Proceedings of Combinatorial Optimisation 2004 Conference, Lancaster University,
2004.
Áine Uí Éigeartaigh, Patrick Healy, and Mícheál Ó hÉigeartaigh. r-swaps of Hamiltonian
tours: Structural properties and recursive relationships. In Proceedings of Combinatorial
Optimisation 2004 Conference, Lancaster University, 2004.
Áine Uí Éigeartaigh, Patrick Healy, and Mícheál Ó hÉigeartaigh. Counting r-swaps in
Hamiltonian tours. In SIAM Conference on Discrete Mathematics, 2002.
[49] Patrick Healy and Nikola Nikolov. Optimal levellings of hierarchical graphs. In Proceedings
of ECCO-XIII Conference of the European Chapter on Combinatorial Optimization, 2000.
Page 7 of 8

Patrick Healy Curriculum Vitae
[50] Patrick Healy. Sacrificing: A variant of local optimisation. In Conor Ryan and Jim Buckley,
editors, Proceedings of SCASE ’99, pages 85 – 98, University of Limerick, 1999.
[51] Patrick Healy and Ago Kuusik. An Optimal Algorithm for Rectangle Placement. In Proceedings
of ECCO-XI Conference of the European Chapter on Combinatorial Optimization,
University of Copenhagen, Copenhagen, Denmark, May 1998.
[52] Patrick Healy. Automatic Graph Drawing and Layout. Presented to Soft Computing And
Re-Engineering Workshop, Dept. of Computer Science, University of Limerick, Limerick,
Ireland, April 1998.
[53] Patrick Healy. Soft computing and parallelisation. Presented to Irish Society of Scientific
Engineering Computing Workshop, University College Dublin, Dublin, Ireland, May 1998.
[54] Patrick Healy and Marcus Creavin. A simulated annealing solution to the 3-D container
packing problem. In Rory O’Connor and Patricia Magee, editors, ECCO-IX Conference
of the European Chapter on Combinatorial Optimization. Centre for Teaching Computing,
Dublin City University, April 1996.
[55] Patrick Healy. An O(n)-time rectangle placement algorithm. In Proceedings of 10 th European
Workshop on Computational Geometry. Universidad de Cantabria, Santander, Spain,
1994.
[56] T. Svrcek, N. Krishnamurthy, and P. Healy. Slot swap at United Airlines. In ORSA/TIMS
35 th Joint National Meeting: Transport and Logistics, Chicago, May 1993.
[57] Patrick Healy. A tool for adjusting the flight schedule during high-volume irregular operations.
In Proceedings of 32 nd Annual AGIFORS (Airline Group of the International
Federation of Operational Research Societies) Symposium, October 1992.
Page 8 of 8