© pattilabelle - stock.adobe.com
Subgraph Induced Connectivity Augmentation
C. Gutwenger, M. Jünger, S. Leipert, P. Mutzel, M. Percan, R. Weiskircher
Published in:
"Graph-Theoretic Concepts in Computer Science, 29th International Workshop, WG 2003" (edited by Hans L. Bodlaender), series "Lecture Notes in Computer Science", volume LNCS, number 2880, 261 -
272
A new approach for drawing UML class diagrams
C. Gutwenger, M. Jünger, K. Klein, J. Kupke, S. Leipert, P. Mutzel
Published in:
S. Diehl and J. Stasko Editors. SoftVis '03 : ACM Symposium on Software Visualization ; San Diego, California, USA, June 11 - 13, 2003 ACM 2003, pp. 179-188.
Advances in C-Planarity Testing of Clustered Graphs
C. Gutwenger, M. Jünger, S. Leipert, P. Mutzel, M. Percan, R. Weiskircher
Published in:
M. Goodrich. Editor. 10th International Symposium, GD 2002 Irvine, California, August 26-28, 2002, 2002. Revised Papers. Lecture Notes in Computer Science, Springer Verlag (2002) 220 - 235.
Improving Walker's Algorithm to Run in Linear Time
C. Buchheim, M. Jünger, S. Leipert
Published in:
M. Goodrich. Editor. 10th International Symposium, GD 2002 Irvine, California, August 26-28, 2002, 2002. Revised Papers. Lecture Notes in Computer Science, Springer Verlag (2002) 344 - 353.
caesar Automatic Layout of UML Class Diagrams
C. Gutwenger, M. Jünger, K. Klein, J. Kupke, S. Leipert, P. Mutzel
Published in:
P. Mutzel, M. Jünger, S. Leipert, Editors, 9th International Symposium, Graph Drawing 2001 in Vienna, volume 2265, Lecture Notes in Computer Science, Springer Verlag (2002) 461 - 462.
AGD: A Library of Algorithms for Graph Drawing
C. Gutwenger, M. Jünger, G.W. Klau, S. Leipert, P. Mutzel, R. Weiskircher
Published in:
P. Mutzel, M. Jünger, S. Leipert, Editors, 9th International Symposium, Graph Drawing 2001 in Vienna, volume 2265, Lecture Notes in Computer Science, Springer Verlag (2002) 473 - 474.
Graph Drawing Algorithm Engineering with AGD
C. Gutwenger, M. Jünger, G.W. Klau, S. Leipert, P. Mutzel
S. Diehl , Editor, Software visualization international seminar ; Dagstuhl Castle, Germany, May 20 - 25, 2001 ; revised papers, Lecture notes in computer science 676-679. 2269 Springer 2002, pp. 676-679.
Characterization of Level Non-Planar Graphs by Minimal Patterns
P. Healy, A. Kuusik, S. Leipert
Published in:
D.-Z. Du, P. Eades, V. Estivill-Castro, X. Lin, A. Sharma, Editors, Computing and Combinatorics COCOON 2000, volume 1858; Lecture Notes in Computer Science, Springer Verlag (2000), 74 - 84.
Fast Layout Algorithm for k-Level Graphs
C. Buchheim, M. Jünger, S. Leipert
Published in:
J. Marks, Editor, 8th International Symposium, Graph Drawing 2000 in Williamsburg, volume 1984, Lecture Notes in Computer Science, Springer Verlag (2000) 229 - 240.
Level Planar Embedding in linear Time (Extended Abstract)
M. Jünger, S. Leipert
Published in:
J. Kratochvil, Editor, 7th International Symposium, Graph Drawing 1999 in Stirin Castle, Czech Republic, volume 1731, Lecture Notes in Computer Science, Springer Verlag (1999) 72 - 81.
Level Planarity Testing in Linear Time
M. Jünger, S. Leipert, P. Mutzel
Published in:
S. Whitesides, Editor, 6th International Symposium, Graph Drawing 1998 in Montreal, volume 1547, Lecture Notes in Computer Science, Springer Verlag (1998) 224 - 237.
Pitfalls of using PQ-Trees in Automatic Graph Drawing
M.Jünger, S. Leipert, P.Mutzel
G. Di Battista, Editor, 5th International Symposium, Graph Drawing 1997 in Rome, volume 1353, Lecture Notes in Computer Science, Springer Verlag (1997) 193 - 204.
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 Mutzel
in Special Proceedings for students at ECMI'94, Kaiserslautern (1994)
Druckversion
Sitemap
© Dr. Sebastian Leipert Aktuar DAV und IVS Sachverständiger Unternehmensberatung
