|
Search the dblp DataBase
Patrick Healy:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Patrick Healy, Ago Kuusik, Sebastian Leipert
Characterization of Level Non-planar Graphs by Minimal Patterns. [Citation Graph (0, 0)][DBLP] COCOON, 2000, pp:74-84 [Conf]
- Martin Harrigan, Patrick Healy
On Layering Directed Acyclic Graphs. [Citation Graph (0, 0)][DBLP] Graph Drawing, 2005, pp:- [Conf]
- Patrick Healy, Ago Kuusik
The Vertex-Exchange Graph: A New Concept for Multi-level Crossing Minimisation. [Citation Graph (0, 0)][DBLP] Graph Drawing, 1999, pp:205-216 [Conf]
- Patrick Healy, Karol Lynch
Building Blocks of Upward Planar Digraphs. [Citation Graph (0, 0)][DBLP] Graph Drawing, 2004, pp:296-306 [Conf]
- Patrick Healy, Nikola S. Nikolov
How to Layer a Directed Acyclic Graph. [Citation Graph (0, 0)][DBLP] Graph Drawing, 2001, pp:16-30 [Conf]
- Patrick Healy, Nikola S. Nikolov
A Branch-and-Cut Approach to the Directed Acyclic Graph Layering Problem. [Citation Graph (0, 0)][DBLP] Graph Drawing, 2002, pp:98-109 [Conf]
- Patrick Healy, Karol Lynch
Fixed-Parameter Tractable Algorithms for Testing Upward Planarity. [Citation Graph (0, 0)][DBLP] SOFSEM, 2005, pp:199-208 [Conf]
- Patrick Healy, Nikola S. Nikolov
Facets of the Directed Acyclic Graph Layering Polytope. [Citation Graph (0, 0)][DBLP] WG, 2002, pp:246-257 [Conf]
- Patrick Healy, Ago Kuusik, Sebastian Leipert
A characterization of level planar graphs. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2004, v:280, n:1-3, pp:51-63 [Journal]
- Patrick Healy, Karol Lynch
Two Fixed-parameter Tractable Algorithms for Testing Upward Planarity. [Citation Graph (0, 0)][DBLP] Int. J. Found. Comput. Sci., 2006, v:17, n:5, pp:1095-1114 [Journal]
- Patrick Healy, Marcus Creavin, Ago Kuusik
An optimal algorithm for rectangle placement. [Citation Graph (0, 0)][DBLP] Oper. Res. Lett., 1999, v:24, n:1-2, pp:73-80 [Journal]
- Patrick Healy, Ago Kuusik
Algorithms for multi-level graph planarity testing and layout. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2004, v:320, n:2-3, pp:331-344 [Journal]
- Radoslav Andreev, Patrick Healy, Nikola S. Nikolov
Applying Ant Colony Optimization Metaheuristic to the DAG Layering Problem. [Citation Graph (0, 0)][DBLP] IPDPS, 2007, pp:1-9 [Conf]
Efficiently drawing a significant spanning tree of a directed graph. [Citation Graph (, )][DBLP]
Visulasation techniques to support derivation tasks in sofware product line development. [Citation Graph (, )][DBLP]
Maximum Upward Planar Subgraph of a Single-Source Embedded Digraph. [Citation Graph (, )][DBLP]
A Fully Dynamic Algorithm to Test the Upward Planarity of Single-Source Embedded Digraphs. [Citation Graph (, )][DBLP]
Practical Level Planarity Testing and Layout with Embedding Constraints. [Citation Graph (, )][DBLP]
A 3D Visualisation to Enhance Cognition in Software Product Line Engineering. [Citation Graph (, )][DBLP]
Supporting superpage allocation without additional hardware support. [Citation Graph (, )][DBLP]
Scheduling Research Grant Proposal Evaluation Meetings and the Range Colouring Problem. [Citation Graph (, )][DBLP]
Applying visualisation techniques in software product lines. [Citation Graph (, )][DBLP]
2nd International Workshop on Visualisation in Software Product Line Engineering (ViSPLE 2008). [Citation Graph (, )][DBLP]
Visualising Variability Relationships in Software Product Lines. [Citation Graph (, )][DBLP]
1st International Workshop on Visualisation in Software Product Line Engineering (ViSPLE 2007). [Citation Graph (, )][DBLP]
An Improved Upward Planarity Testing Algorithm and Related Applications. [Citation Graph (, )][DBLP]
Managing Change in the Era of the iPhone. [Citation Graph (, )][DBLP]
Research Tool to Support Feature Configuration in Software Product Lines. [Citation Graph (, )][DBLP]
A Discussion of Three Visualisation Approaches to Providing Cognitive Support in Variability Management. [Citation Graph (, )][DBLP]
Preface to GD'05 special issue. [Citation Graph (, )][DBLP]
Search in 0.002secs, Finished in 0.003secs
|