The Problem of Computing a Maximal Planar Subgraph Using PQ-Trees is still not solved
Sebastian Leipert in joint work with Michael Jünger and Petra…
Pitfalls of using PQ-Trees in Automatic Graph Drawing
M.Jünger, S. Leipert, P.Mutzel G. Di Battista, Editor, 5th International…
Level Planarity Testing in Linear Time
M. Jünger, S. Leipert, P. Mutzel Published in:S. Whitesides, Editor,…
GoVisual, A Diagramming Software for UML Class Diagrams
C. Gutwenger, M. Jünger, K. Klein, J. Kupke, S. Leipert,…
Level Planar Embedding in linear Time (Extended Abstract)
M. Jünger, S. Leipert Published in:J. Kratochvil, Editor, 7th International…
Fast Layout Algorithm for k-Level Graphs
C. Buchheim, M. Jünger, S. Leipert Published in:J. Marks, Editor,…
Characterization of Level Non-Planar Graphs by Minimal Patterns
P. Healy, A. Kuusik, S. Leipert Published in:D.-Z. Du, P.…
Drawing Trees
S. Leipert Published in:D. Mehta, and S. Sahni, Editors. Handbook…
Graph Drawing Algorithm Engineering with AGD
C. Gutwenger, M. Jünger, G.W. Klau, S. Leipert, P. Mutzel…
AGD: A Library of Algorithms for Graph Drawing
C. Gutwenger, M. Jünger, G.W. Klau, S. Leipert, P. Mutzel,…