default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPatrick Healy
Person information
- affiliation: University of Limerick, Ireland
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j14]Patrick Healy
, Nicolas Jozefowiez, Pierre Laroche, Franc Marchetti, Sébastien Martin, Zsuzsanna Róka:
A branch-and-cut algorithm for the connected max-k-cut problem. Eur. J. Oper. Res. 312(1): 117-124 (2024)- [c43]Yumnah Hasan, Allan de Lima, Fatemeh Amerehi, Darian Reyes Fernández de Bulnes, Patrick Healy, Conor Ryan:
Interpretable Solutions for Breast Cancer Diagnosis with Grammatical Evolution and Data Augmentation. EvoApplications@EvoStar 2024: 224-239 - [c42]Patrick Healy, Dmitriy Babichenko, Steven Orebaugh, Mackenzie Noonan Haase, Zachary Fuller:
Comparing the Use of Controllers and Hand Tracking in a Virtual Reality Nerve Block Simulation. SeGAH 2024: 1-8 - [i7]Yumnah Hasan, Allan de Lima, Fatemeh Amerehi, Darian Reyes Fernández de Bulnes, Patrick Healy, Conor Ryan:
Interpretable Solutions for Breast Cancer Diagnosis with Grammatical Evolution and Data Augmentation. CoRR abs/2401.14255 (2024) - [i6]Fatemeh Amerehi, Patrick Healy:
Label Augmentation for Neural Networks Robustness. CoRR abs/2408.01977 (2024) - 2023
- [c41]Mahsa Mahdinejad, Aidan Murphy, Michael Kwaku Tetteh, Allan de Lima, Patrick Healy, Conor Ryan:
Grammar-Guided Evolution of the U-Net. EvoApplications@EvoStar 2023: 672-686 - [c40]Mahsa Mahdinejad, Aidan Murphy, Patrick Healy, Conor Ryan:
Optimising Evolution of SA-UNet for Iris Segmentation. ICAART (3) 2023: 901-908 - [c39]Yumnah Hasan, Fatemeh Amerehi, Patrick Healy, Conor Ryan:
STEM Rebalance: A Novel Approach for Tackling Imbalanced Datasets using SMOTE, Edited Nearest Neighbour, and Mixup. ICCP 2023: 3-9 - [c38]Fatemeh Amerehi, Patrick Healy:
Ridesharing: The Impact of Traffic Restrictions and Role Flexibility. ITSC 2023: 3142-3147 - [i5]Yumnah Hasan, Fatemeh Amerehi, Patrick Healy, Conor Ryan:
STEM Rebalance: A Novel Approach for Tackling Imbalanced Datasets using SMOTE, Edited Nearest Neighbour, and Mixup. CoRR abs/2311.07504 (2023) - 2022
- [j13]Ksenia Gorbenko, Afrah Mohammed, Edward II Ezenwafor, Sydney Phlegar, Patrick Healy, Tamara Solly, Ingrid Nembhard, Lucy Xenophon, Cardinale Smith, Robert Freeman, David Reich, Madhu Mazumdar:
Innovating in a crisis: a qualitative evaluation of a hospital and Google partnership to implement a COVID-19 inpatient video monitoring program. J. Am. Medical Informatics Assoc. 29(9): 1618-1630 (2022) - [c37]Mahsa Mahdinejad, Aidan Murphy, Patrick Healy, Conor Ryan:
Parameterising the SA-UNet using a Genetic Algorithm. IJCCI 2022: 97-104 - 2021
- [e2]Patrick Healy, Mihai Bilauca, Alexandra Bonnici:
DocEng '21: ACM Symposium on Document Engineering 2021, Limerick, Ireland, August 24-27, 2021. ACM 2021, ISBN 978-1-4503-8596-1 [contents] - 2020
- [c36]Patrick Healy, Pierre Laroche, Franc Marchetti, Sébastien Martin, Zsuzsanna Róka:
Exact and Heuristic Solutions to the Connected k-Partitioning Problem. CoDIT 2020: 1127-1132 - [c35]Dmitriy Babichenko, Ravi Patel, Victoria Grieve, Patrick Healy, Stephen Canton, Eliza Beth Littleton, Nicole Donnellan, Edward G. Andrews:
SterileAR: Exploration of Augmented Reality and Computer Vision Approaches for Real-Time Feedback in Sterile Compounding Training. iLRN 2020: 62-69 - [c34]Dmitriy Babichenko, Patrick Healy, Marcela M. Gomez, Sandra L. Kane-Gill, Eliza Beth Littleton, Peter Brusilovsky, Paul Cohen, Ravi Patel:
The Use of Agent-Based Models As Non-Player Characters in Serious Games. SeGAH 2020: 1-8
2010 – 2019
- 2018
- [c33]Peter Eades, Patrick Healy, Nikola S. Nikolov:
The Weighted Barycenter Drawing Recognition Problem. GD 2018: 569-575 - [i4]Peter Eades, Patrick Healy, Nikola S. Nikolov:
The Weighted Barycenter Drawing Recognition Problem. CoRR abs/1809.00628 (2018) - 2017
- [j12]Aimal Rextin, Patrick Healy:
Dynamic Upward Planarity Testing of Single Source Embedded Digraphs. Comput. J. 60(1): 45-59 (2017) - 2015
- [j11]Mihai Bilauca, Graeme Gange, Patrick Healy, Kim Marriott, Peter Moulder, Peter J. Stuckey:
Automatic Minimal-Height Table Layout. INFORMS J. Comput. 27(3): 449-461 (2015) - 2014
- [c32]Patrick Healy:
Sharp bounds on the spectral radius of Halin graphs and other k-outerplanar graphs. CoDIT 2014: 7-12 - [c31]Patrick Healy, Andrew Ju:
An Experimental Analysis of Vertex Coloring Algorithms on Sparse Random Graphs. ICAA 2014: 174-186 - [i3]Patrick Healy, Andrew Ju:
An Experimental Evaluation of List Coloring Algorithms. CoRR abs/1401.3762 (2014) - 2013
- [j10]Aimal Rextin, Patrick Healy:
Computing maximum upward planar subgraphs of single-source embedded digraphs. J. Comb. Optim. 25(3): 368-392 (2013) - [c30]Mihai Bilauca, Patrick Healy:
Splitting wide tables optimally. ACM Symposium on Document Engineering 2013: 249-252 - [r1]Patrick Healy, Nikola S. Nikolov:
Hierarchical Drawing Algorithms. Handbook of Graph Drawing and Visualization 2013: 409-453 - 2011
- [c29]Mihai Bilauca, Patrick Healy:
Building table formatting tools. ACM Symposium on Document Engineering 2011: 13-22 - [c28]Martin Harrigan, Patrick Healy:
k-Level Crossing Minimization Is NP-Hard for Trees. WALCOM 2011: 70-76 - 2010
- [j9]Sarmad Abbasi, Patrick Healy, Aimal Rextin:
Improving the running time of embedded upward planarity testing. Inf. Process. Lett. 110(7): 274-278 (2010) - [c27]Ciarán Cawley, Patrick Healy, Goetz Botterweck:
A Discussion of Three Visualisation Approaches to Providing Cognitive Support in Variability Management. STeP 2010: 15-31 - [c26]Aimal Rextin, Patrick Healy:
Maximum Upward Planar Subgraph of a Single-Source Embedded Digraph. COCOON 2010: 110-119 - [c25]Mihai Bilauca, Patrick Healy:
A new model for automated table layout. ACM Symposium on Document Engineering 2010: 169-176 - [c24]Mihai Bilauca, Patrick Healy:
Table layout performance of document authoring tools. ACM Symposium on Document Engineering 2010: 199-202 - [c23]Patrick Healy:
Managing Change in the Era of the iPhone. FUN 2010: 249-259 - [c22]Mel Gorman, Patrick Healy:
Performance Characteristics of Explicit Superpage Support. ISCA Workshops 2010: 293-310 - [c21]Ciarán Cawley, Patrick Healy, Goetz Botterweck, Steffen Thiel:
Research Tool to Support Feature Configuration in Software Product Lines. VaMoS 2010: 179-182
2000 – 2009
- 2009
- [j8]Patrick Healy, Nikola S. Nikolov:
Preface to GD'05 special issue. Discret. Math. 309(7): 1793 (2009) - [c20]Ciarán Cawley, Goetz Botterweck, Patrick Healy, Saad bin Abid, Steffen Thiel:
A 3D Visualisation to Enhance Cognition in Software Product Line Engineering. ISVC (2) 2009: 857-868 - [c19]Sarmad Abbasi, Patrick Healy, Aimal Rextin:
An Improved Upward Planarity Testing Algorithm and Related Applications. WALCOM 2009: 334-344 - 2008
- [j7]Martin Harrigan, Patrick Healy:
Using a Significant Spanning Tree to Draw a Directed Graph. J. Graph Algorithms Appl. 12(3): 293-317 (2008) - [c18]Aimal Rextin, Patrick Healy:
A Fully Dynamic Algorithm to Test the Upward Planarity of Single-Source Embedded Digraphs. GD 2008: 254-265 - [c17]Mel Gorman, Patrick Healy:
Supporting superpage allocation without additional hardware support. ISMM 2008: 41-50 - [c16]Daren Nestor, Steffen Thiel, Goetz Botterweck, Ciarán Cawley, Patrick Healy:
Applying visualisation techniques in software product lines. SOFTVIS 2008: 175-184 - [c15]Ciarán Cawley, Steffen Thiel, Patrick Healy:
Visualising Variability Relationships in Software Product Lines. SPLC (2) 2008: 329-333 - [c14]Rick Rabiser, Patrick Healy, Daren Nestor, Mike Mannion, David Sellier:
2nd International Workshop on Visualisation in Software Product Line Engineering (ViSPLE 2008). SPLC 2008: 388 - [i2]Patrick Healy, Tim Dwyer:
08191 Working Group Report - Edge Thresholding. Graph Drawing with Applications to Bioinformatics and Social Sciences 2008 - 2007
- [j6]Patrick Healy, Karol Lynch:
Building Blocks of Upward Planar Digraphs. J. Graph Algorithms Appl. 11(1): 3-44 (2007) - [j5]Peter Eades, Patrick Healy:
Guest Editor's Foreword. J. Graph Algorithms Appl. 11(2): 323-324 (2007) - [c13]Martin Harrigan, Patrick Healy:
Efficiently drawing a significant spanning tree of a directed graph. APVIS 2007: 53-59 - [c12]Daren Nestor, Luke O'Malley, Patrick Healy, Aaron J. Quigley, Steffen Thiel:
Visulasation techniques to support derivation tasks in sofware product line development. CASCON 2007: 315-325 - [c11]Martin Harrigan, Patrick Healy:
Practical Level Planarity Testing and Layout with Embedding Constraints. GD 2007: 62-68 - [c10]Radoslav Andreev, Patrick Healy, Nikola S. Nikolov:
Applying Ant Colony Optimization Metaheuristic to the DAG Layering Problem. IPDPS 2007: 1-9 - [c9]Steffen Thiel, Patrick Healy, Aaron J. Quigley, Daren Nestor, Luke O'Malley:
1st International Workshop on Visualisation in Software Product Line Engineering (ViSPLE 2007). SPLC (2) 2007: 91-93 - 2006
- [j4]Patrick Healy, Karol Lynch:
Two Fixed-parameter Tractable Algorithms for Testing Upward Planarity. Int. J. Found. Comput. Sci. 17(5): 1095-1114 (2006) - [c8]Patrick Healy:
Scheduling Research Grant Proposal Evaluation Meetings and the Range Colouring Problem. PATAT 2006: 119-131 - [e1]Patrick Healy, Nikola S. Nikolov:
Graph Drawing, 13th International Symposium, GD 2005, Limerick, Ireland, September 12-14, 2005, Revised Papers. Lecture Notes in Computer Science 3843, Springer 2006, ISBN 3-540-31425-3 [contents] - 2005
- [c7]Patrick Healy, Karol Lynch:
Fixed-Parameter Tractable Algorithms for Testing Upward Planarity. SOFSEM 2005: 199-208 - [i1]Martin Harrigan, Patrick Healy:
On Layering Directed Acyclic Graphs. Graph Drawing 2005 - 2004
- [j3]Patrick Healy, Ago Kuusik, Sebastian Leipert:
A characterization of level planar graphs. Discret. Math. 280(1-3): 51-63 (2004) - [j2]Patrick Healy, Ago Kuusik:
Algorithms for multi-level graph planarity testing and layout. Theor. Comput. Sci. 320(2-3): 331-344 (2004) - [c6]Patrick Healy, Karol Lynch:
Building Blocks of Upward Planar Digraphs. GD 2004: 296-306 - 2002
- [c5]Patrick Healy, Nikola S. Nikolov:
A Branch-and-Cut Approach to the Directed Acyclic Graph Layering Problem. GD 2002: 98-109 - [c4]Patrick Healy, Nikola S. Nikolov:
Facets of the Directed Acyclic Graph Layering Polytope. WG 2002: 246-257 - 2001
- [c3]Patrick Healy, Nikola S. Nikolov:
How to Layer a Directed Acyclic Graph. GD 2001: 16-30 - 2000
- [c2]Patrick Healy, Ago Kuusik, Sebastian Leipert:
Characterization of Level Non-planar Graphs by Minimal Patterns. COCOON 2000: 74-84
1990 – 1999
- 1999
- [j1]Patrick Healy, Marcus Creavin, Ago Kuusik:
An optimal algorithm for rectangle placement. Oper. Res. Lett. 24(1-2): 73-80 (1999) - [c1]Patrick Healy, Ago Kuusik:
The Vertex-Exchange Graph: A New Concept for Multi-level Crossing Minimisation. GD 1999: 205-216
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-10-25 20:13 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:
