M. Jünger, S. Leipert, P. Mutzel Published in: IEEE Transactions On Computer-Aided Design 17(7) (1998) 609 – 612 Abstract The problem of computing a maximal planar subgraph of a non planar graph has been deeply investigated over the last 20 years. Several attempts have been tried to solve the problem with the help of PQ-trees. […]
M. Jünger, S. Leipert Published in Journal of Graph Algorithms and Applications Vol. 6, no. 1 (2002) 67 – 113 Abstract A level graph G = (V,E,lev) is a directed acyclic graph with a mapping lev : V -> {1,2,dots,k}, k >= 1, that partitions the vertex set V as V = V1 u V2 […]
M. Eiglsperger, C. Gutwenger, M. Kaufmann, J. Kupke, M. Jünger, S. Leipert, K. Klein, P. Mutzel, M. Siebenhaller Published in January 2004 by Palgrave Macmillan Journals in the journal „Information Visualization“, volume 3, pages 189-208 Abstract Unified modelling language (UML) diagrams have become increasingly important in engineering and re-engineering processes for software systems. Of particular […]
P. Healy, A. Kuusik, S. Leipert Published in:Discrete Mathematics, Volume 280, Issues 1-3, 6 April 2004, Pages 51-63 Abstract We present a characterization of level planar graphs in terms of minimal forbidden subgraphs called minimal level non-planar (MLNP) subgraph patterns. We show that an MLNP subgraph pattern is completely characterized by either a tree, a […]
C. Buchheim, M. Jünger, S. Leipert Published in:Software; Practice and Experience Vol. 36 (6). pp. 651-665 Abstract The aim of automatic graph drawing is the development of algorithms for creating nice and well-readable layouts of abstractly given graphs. For the special case of rooted trees of unbounded degree, John Q. Walker II presented a drawing […]