Patrick Healy

Available identifiers

zbMath Open healy.patrickMaRDI QIDQ596100

List of research outcomes

Publication	Date of Publication	Type
The weighted barycenter drawing recognition problem	2019-02-15	Paper
Automatic Minimal-Height Table Layout	2015-12-21	Paper
Computing maximum upward planar subgraphs of single-source embedded digraphs	2013-06-28	Paper
k-Level Crossing Minimization Is NP-Hard for Trees	2011-02-20	Paper
Improving the running time of embedded upward planarity testing	2010-09-07	Paper
Maximum Upward Planar Subgraph of a Single-Source Embedded Digraph	2010-07-20	Paper
A Fully Dynamic Algorithm to Test the Upward Planarity of Single-Source Embedded Digraphs	2009-03-03	Paper
An Improved Upward Planarity Testing Algorithm and Related Applications	2009-02-24	Paper
Building Blocks of Upward Planar Digraphs	2009-01-19	Paper
Using a Significant Spanning Tree to Draw a Directed Graph	2009-01-19	Paper
Practical Level Planarity Testing and Layout with Embedding Constraints	2008-03-25	Paper
TWO FIXED-PARAMETER TRACTABLE ALGORITHMS FOR TESTING UPWARD PLANARITY	2006-10-16	Paper
SOFSEM 2005: Theory and Practice of Computer Science	2005-12-07	Paper
Graph Drawing	2005-12-07	Paper
Algorithms for multi-level graph planarity testing and layout	2004-08-10	Paper
A characterization of level planar graphs	2004-08-06	Paper
https://portal.mardi4nfdi.de/entity/Q3043701	2004-08-06	Paper
https://portal.mardi4nfdi.de/entity/Q4422266	2003-09-03	Paper
https://portal.mardi4nfdi.de/entity/Q4414502	2003-07-25	Paper
https://portal.mardi4nfdi.de/entity/Q2766816	2002-07-22	Paper
An optimal algorithm for rectangle placement	2001-03-20	Paper
https://portal.mardi4nfdi.de/entity/Q4501705	2001-01-29	Paper
A new extension of local search applied to the Dial-A-Ride problem	1999-01-05	Paper
A Local Optimization-based Solution to the Rectangle Layout Problem	1997-06-09	Paper

Research outcomes over time

This page was built for person: Patrick Healy