Browse by Keywords

Up a level
Export as [feed] Atom [feed] RSS 1.0 [feed] RSS 2.0
Number of items: 40.

Wotzlaw, Andreas and Speckenmeyer, Ewald and Porschen, Stefan (2012) Generalized k-ary tanglegrams on level graphs: a satisfiability-based approach and its evaluation.
Published in: Discrete Applied Mathematics Vol. 160 (16-17). pp. 2349-2363.

Gronemann, Martin and Jünger, Michael and Mallach, Sven and Schmidt, Daniel R. (2011) Towards shortest longest edges in orthogonal graph drawing.
Technical Report , 6 p.

Speckenmeyer, Ewald and Wotzlaw, Andreas and Porschen, Stefan (2011) A Satisfiability-based Approach for Embedding Generalized Tanglegrams on Level Graphs.
Published In: Theory and Applications of Satisfiability Testing - SAT 2011 : 14th International Conference, SAT 2011, Ann Arbor, MI, USA, June 19-22, 2011. Proceedings, Lecture notes in computer science. 6695 Springer February 2011, pp. 134-144.

Baumann, Frank and Buchheim, Christoph and Liers, Frauke (2010) Exact Bipartite Crossing Minimization under Tree Constraints.
Published In: 9th International Symposium on Experimental Algorithms SEA 2010, Lecture Notes in Computer Science. 6049 Springer Verlag 2010, pp. 118-128.

Buchheim, Christoph and Hong, Seok-Hee (2008) Testing Planarity of Geometric Automorphisms in Linear Time.
Published in: Algorithmica Vol. 52 (4). pp. 448-465.

Buchheim, Christoph and Jünger, Michael and Percan, Merijam and Schulz, Michael and Thelen, Christina (2007) Drawing cycles in networks.
Technical Report , 8 p.

Hachul, Stefan and Jünger, Michael (2007) Large-Graph Layout Algorithms at Work: An Experimental Study.
Published in: Journal of Graph Algorithms and Applications Vol. 11 (21). pp. 345-369.

Buchheim, Christoph and Jünger, Michael and Kandyba, Maria and Percan, Merijam and Schulz, Michael (2007) Planarization With Fixed Subgraph Embedding.
Technical Report , 10 p.

Buchheim, Christoph and Jünger, Michael and Menze, Annette and Percan, Merijam (2006) Bimodal Crossing Minimization.
Published In: Computing and combinatorics : 12th annual international conference, COCOON 2006, Taipei, Taiwan, August 15 - 18, 2006 ; proceedings, Lecture Notes in Computer Science. 4112 Springer 2006, pp. 497-506.

Buchheim, Christoph and Jünger, Michael and Leipert, Sebastian (2006) Drawing Rooted Trees in Linear Time.
Published in: Software; Practice and Experience Vol. 36 (6). pp. 651-665.

Buchheim, Christoph and Ebner, Dietmar and Jünger, Michael and Klau, Gunnar W. and Mutzel, Petra and Weiskircher, René (2006) Exact Crossing Minimization.
Published In: Graph drawing : 13th international symposium, GD 2005, Limerick, Ireland, September 12 - 14, 2005 ; revised papers, Lecture Notes in Computer Science. 3843 Springer 2006, pp. 37-48.

Hachul, Stefan and Jünger, Michael (2006) An Experimental Comparison of Fast Algorithms for Drawing General Large Graphs.
Published In: Graph drawing : 13th international symposium, GD 2005, Limerick, Ireland, September 12 - 14, 2005 ; revised papers, Lecture Notes in Computer Science. 3843 Springer 2006.

Gassner, Elisabeth and Jünger, Michael and Percan, Merijam and Schaefer, Marcus and Schulz, Michael (2006) Simultaneous Graph Embeddings with Fixed Edges.
Published In: Graph-theoretic concepts in computer science : 32nd international workshop, WG 2006, Bergen, Norway, June 22 - 24, 2006 ; revised papers, Lecture Notes in Computer Science. 4271 Springer 2006, pp. 325-335.

Buchheim, Christoph and Hong, Seok-Hee (2005) Crossing Minimization for Symmetries (Journal Version).
Published in: Theory of Computing Systems Vol. 38 (3). pp. 293-311.

Hachul, Stefan and Jünger, Michael (2005) Large-Graph Layout with the Fast Multipole Multilevel Method.
Technical Report , 27 p.

Eiglsperger, Markus and Gutwenger, Carsten and Kaufmann, Michael and Kupke, Joachim and Jünger, Michael and Leipert, Sebastian and Klein, Karsten and Mutzel, Petra and Siebenhaller, Martin (2004) Automatic layout of UML class diagrams in orthogonal style.
Published in: Information Visualization Vol. 3 (3). pp. 189-208.

Hachul, Stefan and Jünger, Michael (2004) Drawing Large Graphs with a Potential -Field-Based Multilevel Algorithm.
Published In: Graph drawing: 12th international symposium, GD 2004, New York, NY, USA, September 29 - October 2, 2004; revised selected papers, Lecture Notes in Computer Science. 3383 Springer 2004, pp. 285-295.

Mutzel, Petra and Jünger, Michael (2004) Graph Drawing: Exact Optimization helps!
Published in: The sharpest cut: the impact of Manfred Padberg and his work ; [invited lectures given at a workshop held in October 2001 to celebrate Padberg's 60th birthday ; Workshop in Honor of Manfred Padberg]., MPS-SIAM series on optimization. 4 SIAM 2004.

Barth, Wilhelm and Mutzel, Petra and Jünger, Michael (2004) Simple and Efficient Bilayer Cross Counting (Journal Version).
Published in: Journal of Graph Algorithms and Applications Vol. 8 (21). pp. 179-194.

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

Buchheim, Christoph and Hong, Seok-Hee (2002) Crossing Minimization for Symmetries (Extended Abstract).
Published In: Algorithms and Computation : 13th International Symposium, ISAAC 2002 Vancouver, BC, Canada, November 21-23, 2002 ; proceedings, Lecture notes in computer science. 2518 Springer 2002, pp. 137-152.

Buchheim, Christoph and Jünger, Michael (2002) Detecting Symmetries by Branch & Cut (Extended Abstract).
Published In: Graph drawing : 9th international symposium, GD 2001, Vienna, Austria, September 23 - 26, 2001 ; revised papers, Lecture Notes in Computer Science. 2265 Springer 2002, pp. 496-498.

Buchheim, Christoph and Jünger, Michael and Leipert, Sebastian (2002) Improving Walker's Algorithm to Run in Linear Time.
Published In: Graph drawing : 10th international symposium, GD 2002, Irvine, CA, USA, August 26 - 28, 2002 ; revised papers, Lecture notes in computer science. 2528 Springer 2002, pp. 347-364.

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

Jünger, Michael and Mutzel, Petra (2001) Automatisches Layout von Diagrammen.
Published in: OR news : das Magazin der GOR Vol. 5 (12). pp. 5-12.

Buchheim, Christoph and Jünger, Michael and Leipert, Sebastian (2001) A Fast Layout Algorithm for k-Level Graphs.
Published In: Graph drawing : 8th international symposium, GD 2000, Colonial Williamsburg, VA, USA, September 20 - 23, 2000 ; proceedings, Lecture Notes in Computer Science. 1984 Springer 2001, pp. 86-89.

Brandenburg, Franz J. and Jünger, Michael and Marks, Joe and Mutzel, Petra and Schreiber, Falk (1999) Graph-Drawing Contest Report.
Published In: Graph drawing : 7th international symposium, GD'99 , Štiřín Castle, Czech Republic, September 15 - 19, 1999, Lecture notes in computer science. 1731 Springer 1999, pp. 400-409.

Fekete, Sandor P. and Meijer, Henk (1999) Rectangle and Box Visibility Graphs in 3D.
Published in: International Journal of Computational Geometry and Applications : : IJCGA Vol. 9 (1). pp. 1-27.

Dahlhaus, Elias (1998) A Linear Time Algorithm to Recognize Clustered Planar Graphs and its Parallelization.
Technical Report , 18 p.

Bose, Prosenjit K. and Everett, Hazel and Fekete, Sandor P. and Houle, Michael and Lubiw, Anna and Meijer, Henk and Romanik, Kathleen A. and Rote, Günter and Shermer, Thomas C. and Whitesides, Sue and Zelle, Christian (1998) On a visibility representation for graphs in 3D.
Published in: Journal of Graph Algorithms and Applications Vol. 2 (3). pp. 1-16.

Fekete, Sandor P. (1997) Geometric Ideas for Graph Representation and for Cooperative Game Theory.
Technical Report , 54 p.

Fekete, Sandor P. and Houle, Michael and Whitesides, Sue (1997) The wobbly logic engine: proving hardness of non-rigid geometric graph representations.
Published In: Graph drawing : 5th international symposium, GD '97, Rome, Italy, September 18 - 20, 1997 ; proceedings, Lecture notes in computer science. 1353 Springer 1997, pp. 272-283.

Jünger, Michael and Mutzel, Petra (1996) Exact and Heuristic Algorithms for 2-Layer Straightline Crossing Minimization.
Published In: Graph drawing : Symposium on Graph Drawing, GD '95, Passau, Germany, September 20 - 22, 1995 ; proceedings, Lecture notes in computer science. 1027 Springer 1996, pp. 337-348.

Jünger, Michael and Mutzel, Petra (1996) Maximum Planar Subgraphs and Nice Embeddings: Practical Layout Tools.
Published in: Algorithmica Vol. 16 (1). pp. 33-59.

Fekete, Sandor P. and Houle, Michael and Whitesides, Sue (1996) New results on a visibility representation of graphs in 3D.
Published In: Graph drawing : Symposium on Graph Drawing, GD '95, Passau, Germany, September 20 - 22, 1995 ; proceedings, Lecture notes in computer science. 1027 Springer 1996, pp. 234-241.

Leipert, Sebastian (1996) The Tree Interface -- Version 1.0 User Manual.
Manual , 53 p.

Jünger, Michael and Mutzel, Petra (1995) The Polyhedral Approach to the Maximum Planar Subgraph Problem: New Chances for Related Problems.
Published In: Graph drawing : DIMACS international workshop, GD '94, Princeton, New Jersey, USA, October 10 - 12, 1994 ; proceedings, Lecture notes in computer science. 894 Springer 1995, pp. 119-130.

Bose, Prosenjit K. and Everett, Hazel and Fekete, Sandor P. and Lubiw, Anna and Meijer, Henk and Romanik, Kathleen A. and Shermer, Thomas C. and Whitesides, Sue (1994) On a visibility representation for graphs in three dimensions.
Technical Report , 24 p.

Bose, Prosenjit K. and Everett, Hazel and Fekete, Sandor P. and Lubiw, Anna and Meijer, Henk and Romanik, Kathleen A. and Shermer, Thomas C. and Whitesides, Sue (1993) On a visibility representation for graphs in three dimensions.
Published In: Graph drawing : 9th international symposium ; ALCOM International Workshop Paris 1993 on Graph Drawing and Topological Graph Algorithms Alcom 1993, pp. 38-39.

Jünger, Michael and Mutzel, Petra (1993) Solving the Maximum Weight Planar Subgraph Problem by Branch-and-Cut.
Published In: Proc. third conference of integer programming and combinatorial optimization (IPCO) IPCO Conference 1993, pp. 479-492.

This list was generated on Mon Sep 25 06:21:32 2017 CEST.