Up a level
Export as [feed] Atom [feed] RSS 1.0 [feed] RSS 2.0
Group by: Item Type | Date | No Grouping
Number of items: 11.

Journal Article

Jünger, Michael and Leipert, Sebastian (2002). Level Planar Embedding in Linear Time (Full Version). Journal of Graph Algorithms and Applications, 6 (1). pp. 67-113. Brown University.

Book Section, Proceedings Item or annotation in a legal commentary

Gutwenger, Carsten, Jünger, Michael, Klein, Karsten, Kupke, Joachim, Leipert, Sebastian and Mutzel, Petra ORCID: 0000-0001-7621-971X (2003). A New Approach for Visualizing UML Class Diagrams. In: SoftVis '03 : ACM Symposium on Software Visualization ; San Diego, California, USA, June 11 - 13, 2003, pp. 179-188. ACM.

Gutwenger, Carsten, Leipert, Sebastian, Mutzel, Petra ORCID: 0000-0001-7621-971X, Percan, Merijam, Jünger, Michael and Weiskircher, René (2003). Subgraph Induced Connectivity Augmentation. In: Graph-theoretic concepts in computer science : 29th International Workshop, WG 2003, Elspeet, The Netherlands, June 19 - 21, 2003 ; revised papers, pp. 261-272. Springer.

Gutwenger, Carsten, Leipert, Sebastian, Mutzel, Petra ORCID: 0000-0001-7621-971X, Percan, Merijam, Weiskircher, René and Jünger, Michael (2002). Advances in C-Planarity Testing of Clustered Graphs (Extended Abstract). In: Graph drawing : 10th international symposium, GD 2002, Irvine, CA, USA, August 26 - 28, 2002 ; revised papers, pp. 220-336. Springer.

Jünger, Michael, Leipert, Sebastian and Mutzel, Petra ORCID: 0000-0001-7621-971X (1997). Pitfalls of using PQ-trees in Automatic Graph Drawing. In: Graph drawing : 5th international symposium, GD '97, Rome, Italy, September 18 - 20, 1997 ; proceedings, pp. 193-204. Springer.

Preprints, Working Papers or Reports

Jünger, Michael and Leipert, Sebastian (1999). Level Planar Embedding in linear Time (Extended Abstract). Springer. ["eprint_fieldopt_monograph_type_preprint" not defined].

Jünger, Michael, Leipert, Sebastian and Mutzel, Petra ORCID: 0000-0001-7621-971X (1999). Level Planarity Testing in Linear Time (Full Version). Working Paper.

Jünger, Michael, Leipert, Sebastian and Mutzel, Petra ORCID: 0000-0001-7621-971X (1996). On Computing a Maximal Planar Subgraph using PQ-Trees. ["eprint_fieldopt_monograph_type_preprint" not defined].

Jünger, Michael, Leipert, Sebastian and Percan, Merijam (2002). Triangulating Clustered Graphs. Working Paper.

Leipert, Sebastian (1996). The Tree Interface — Version 1.0 User Manual. Documentation.

Other

Buchheim, Christoph ORCID: 0000-0001-9974-404X, Jünger, Michael and Leipert, Sebastian (2001). A Fast Layout Algorithm for k-Level Graphs. Springer.

This list was generated on Thu Apr 25 00:35:38 2024 CEST.