Searching for authors named "Sebastian Leipert" – sorted by Relevance.
-
The Tree Interface Version 1.0 - User Manual
- -- Version 1.0 User Manual by Sebastian Leipert 1996 Partially supported by DFG-Grant Ju204
- Cited by 3 (0 self) – Add To MetaCart
-
Characterization of Level Non-Planar Graphs by Minimal Patterns
- of Level Non-Planar Graphs by Minimal Patterns by Patrick Healy, and Ago Kuusik, and Sebastian Leipert
- Cited by 2 (0 self) – Add To MetaCart
-
A Note on Computing a Maximal Planar Subgraph using PQ-Trees
- A Note on Computing a Maximal Planar Subgraph using PQ-Trees Michael Junger, Sebastian Leipert
- Cited by 3 (2 self) – Add To MetaCart
-
A Fast Layout Algorithm for k-Level Graphs
- Algorithm for k-Level Graphs by Christoph Buchheim, Michael Junger and Sebastian Leipert 1999 Partially
- Cited by 6 (1 self) – Add To MetaCart
-
Improving Walker's Algorithm to Run in Linear Time
- , and Sebastian Leipert 2 1 Universitat zu Koln, Institut fur Informatik, Pohligstrae 1, 50969 Koln, Germany
- Cited by 9 (0 self) – Add To MetaCart
-
Pitfalls of using PQ-Trees in Automatic Graph Drawing
- -Trees in Automatic Graph Drawing by Michael Junger, Sebastian Leipert and Petra Mutzel 1997 Partially supported
- Cited by 8 (0 self) – Add To MetaCart
-
The Tree Interface Version 1.0
- The Tree Interface Version 1.0 A Tool For Drawing Trees by Sebastian Leipert User Manual
- Add To MetaCart
-
Angewandte Mathematik und Informatik Universit at zu K oln
- Maximal Planar Subgraph using PQ-Trees by Michael Junger, Sebastian Leipert and Petra Mutzel 1998
- Cited by 1 (0 self) – Add To MetaCart
-
Graph Drawing Algorithm Engineering with AGD
- . Klau x Sebastian Leipert { Petra Mutzel k Abstract We discuss the algorithm engineering aspects
- Cited by 4 (3 self) – Add To MetaCart
-
Level Planar Embedding in Linear Time
- Embedding in linear Time by Michael Jiinger, and Sebastian Leipert 1999 Partially supported by DFG
- Cited by 13 (0 self) – Add To MetaCart

