Browse by Author

Up a level
Export as [feed] Atom [feed] RSS 1.0 [feed] RSS 2.0
Number of items: 6.

Healy, Patrick and Nikolov, Nikola S. (2002) A Branch-and-Cut Approach to the Directed Acyclic Graph Layering Problem. In: Graph Drawing 10th International Symposium, GD 2002, August 26-28, 2002, Irvine, CA, USA , pp. 98-109 (Official URL: http://dx.doi.org/10.1007/3-540-36151-0_10).

Rextin, Aimal and Healy, Patrick (2009) A Fully Dynamic Algorithm to Test the Upward Planarity of Single-Source Embedded Digraphs. In: Graph Drawing 16th International Symposium, GD 2008, September 21- 24, 2008, Heraklion, Crete, Greece , pp. 254-265 (Official URL: http://dx.doi.org/10.1007/978-3-642-00219-9_24).

Healy, Patrick and Lynch, Karol (2004) Building Blocks of Upward Planar Digraphs. In: Graph Drawing 12th International Symposium, GD 2004, September 29-October 2, 2004, New York, NY, USA , pp. 296-306 (Official URL: http://dx.doi.org/10.1007/978-3-540-31843-9_30).

Healy, Patrick and Nikolov, Nikola S. (2002) How to Layer a Directed Acyclic Graph. In: Graph Drawing 9th International Symposium, GD 2001, September 23-26, 2001, Vienna, Austria , pp. 16-30 (Official URL: http://dx.doi.org/10.1007/3-540-45848-4_2).

Harrigan, Martin and Healy, Patrick (2008) Practical Level Planarity Testing and Layout with Embedding Constraints. In: Graph Drawing 15th International Symposium, GD 2007, September 24-26, 2007, Sydney, Australia , pp. 62-68 (Official URL: http://dx.doi.org/10.1007/978-3-540-77537-9_9).

Healy, Patrick and Kuusik, Ago (1999) The Vertex-Exchange Graph: A New Concept for Multi-level Crossing Minimisation. In: Graph Drawing 7th International Symposium, GD’99, September 15-19, 1999, Štirín Castle, Czech Republic , pp. 205-216 (Official URL: http://dx.doi.org/10.1007/3-540-46648-7_21).

This list was generated on Thu Oct 23 04:05:13 2014 CEST.