| 2006 |
|---|
| 20 | EE | Christoph Buchheim,
Michael Jünger,
Sebastian Leipert:
Drawing rooted trees in linear time.
Softw., Pract. Exper. 36(6): 651-665 (2006) |
| 2004 |
|---|
| 19 | EE | Patrick Healy,
Ago Kuusik,
Sebastian Leipert:
A characterization of level planar graphs.
Discrete Mathematics 280(1-3): 51-63 (2004) |
| 18 | EE | Markus Eiglsperger,
Carsten Gutwenger,
Michael Kaufmann,
Joachim Kupke,
Michael Jünger,
Sebastian Leipert,
Karsten Klein,
Petra Mutzel,
Martin Siebenhaller:
Automatic layout of UML class diagrams in orthogonal style.
Information Visualization 3(3): 189-208 (2004) |
| 2003 |
|---|
| 17 | EE | Carsten Gutwenger,
Joachim Kupke,
Karsten Klein,
Sebastian Leipert:
GoVisual for CASE Tools Borland Together ControlCenter and Gentleware Poseidon - System Demonstration.
Graph Drawing 2003: 123-128 |
| 16 | | Carsten Gutwenger,
Michael Jünger,
Karsten Klein,
Joachim Kupke,
Sebastian Leipert,
Petra Mutzel:
A New Approach for Visualizing UML Class Diagrams.
SOFTVIS 2003: 179-188, 217-218 |
| 15 | EE | Carsten Gutwenger,
Michael Jünger,
Sebastian Leipert,
Petra Mutzel,
Merijam Percan,
René Weiskircher:
Subgraph Induced Planar Connectivity Augmentation: (Extended Abstract).
WG 2003: 261-272 |
| 2002 |
|---|
| 14 | | Petra Mutzel,
Michael Jünger,
Sebastian Leipert:
Graph Drawing, 9th International Symposium, GD 2001 Vienna, Austria, September 23-26, 2001, Revised Papers
Springer 2002 |
| 13 | EE | Carsten Gutwenger,
Michael Jünger,
Sebastian Leipert,
Petra Mutzel,
Merijam Percan,
René Weiskircher:
Advances in C-Planarity Testing of Clustered Graphs.
Graph Drawing 2002: 220-235 |
| 12 | EE | Christoph Buchheim,
Michael Jünger,
Sebastian Leipert:
Improving Walker's Algorithm to Run in Linear Time.
Graph Drawing 2002: 344-353 |
| 11 | EE | Michael Jünger,
Sebastian Leipert:
Level Planar Embedding in Linear Time.
J. Graph Algorithms Appl. 6(1): 67-113 (2002) |
| 2001 |
|---|
| 10 | EE | Carsten Gutwenger,
Michael Jünger,
Karsten Klein,
Joachim Kupke,
Sebastian Leipert,
Petra Mutzel:
Caesar Automatic Layout of UML Class Diagrams.
Graph Drawing 2001: 461-462 |
| 9 | EE | Carsten Gutwenger,
Michael Jünger,
Gunnar W. Klau,
Sebastian Leipert,
Petra Mutzel,
René Weiskircher:
AGD: A Library of Algorithms for Graph Drawing.
Graph Drawing 2001: 473-474 |
| 8 | EE | Carsten Gutwenger,
Michael Jünger,
Gunnar W. Klau,
Sebastian Leipert,
Petra Mutzel:
Graph Drawing Algorithm Engineering with AGD.
Software Visualization 2001: 307-323 |
| 2000 |
|---|
| 7 | EE | Patrick Healy,
Ago Kuusik,
Sebastian Leipert:
Characterization of Level Non-planar Graphs by Minimal Patterns.
COCOON 2000: 74-84 |
| 6 | EE | Christoph Buchheim,
Michael Jünger,
Sebastian Leipert:
A Fast Layout Algorithm for k-Level Graphs.
Graph Drawing 2000: 229-240 |
| 1999 |
|---|
| 5 | EE | Michael Jünger,
Sebastian Leipert:
Level Planar Embedding in Linear Time.
Graph Drawing 1999: 72-81 |
| 1998 |
|---|
| 4 | EE | Michael Jünger,
Sebastian Leipert,
Petra Mutzel:
Level Planarity Testing in Linear Time.
Graph Drawing 1998: 224-237 |
| 3 | EE | Petra Mutzel,
Carsten Gutwenger,
Ralf Brockenauer,
Sergej Fialko,
Gunnar W. Klau,
Michael Krüger,
Thomas Ziegler,
Stefan Näher,
David Alberts,
Dirk Ambras,
Gunter Koch,
Michael Jünger,
Christoph Buchheim,
Sebastian Leipert:
A Library of Algorithms for Graph Drawing.
Graph Drawing 1998: 456-457 |
| 2 | EE | Michael Jünger,
Sebastian Leipert,
Petra Mutzel:
A note on computing a maximal planar subgraph using PQ-trees.
IEEE Trans. on CAD of Integrated Circuits and Systems 17(7): 609-612 (1998) |
| 1997 |
|---|
| 1 | | Michael Jünger,
Sebastian Leipert,
Petra Mutzel:
Pitfalls of Using PQ-Trees in Automatic Graph Drawing.
Graph Drawing 1997: 193-204 |
