Browse by Keywords

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

Liers, Frauke and Pardella, Gregor (2012) Partitioning planar graphs: a fast combinatorial approach for max-cut.
Published in: Computational Optimization and Applications. pp. 323-344.

Estrella-Balderrama, Alejandro and Gassner, Elisabeth and Jünger, Michael and Percan, Merijam and Schaefer, Marcus and Schulz, Michael (2008) Simultaneous Geometric Graph Embeddings.
Published In: Graph drawing : 15th international symposium, GD 2007, Sydney, Australia, September 24 - 26, 2007 ; revised papers, Lecture Notes in Computer Science. 4875 Springer 2008, pp. 280-290.

Liers, Frauke and Pardella, Gregor (2008) A simple MAX-CUT algorithm for planar graphs.
Technical Report , 16 p.

Jünger, Michael and Leipert, Sebastian and Percan, Merijam (2002) Triangulating Clustered Graphs.
Technical Report , 7 p.

Fekete, Sandor P. and Kremer, Jana (2001) Tree Spanners in Planar Graphs.
Published in: Discrete Applied Mathematics Vol. 108 (1-2). pp. 85-103.

Fekete, Sandor P. and Hochstättler, Winfried and Kromberg, Stephan and Moll, Christoph (1999) The Complexity of an Inverse Shortest Path Problem.
Published In: Contemporary trends in discrete mathematics : from DIMACS and DIMATIA to the future ; DIMATIA-DIMACS conference, May 19 - 25, 1997, Štiřín Castle, Czech Republic ; [contains papers from a DIMATIA/DIMACS Conference on the Future of Discrete Mathematics], DIMACS series in discrete mathematics and theoretical computer science. 49 American Mathematical Society (AMS) 1999, pp. 113-127.

Dahlhaus, Elias (1999) An Improved Linear Time Algorithm for Minimal Elimination Ordering in Planar Graphs that is Parallelizable.
Technical Report , 10 p.

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

Dahlhaus, Elias (1998) Minimal Elimination Orderings for Planar Graphs.
Published In: Algorithm theory : proceedings / SWAT '98, 6th Scandinavian Workshop on Algorithm Theory, Stockholm, Sweden, July 8 - 10, 1998, Lecture notes in computer science. 1432 Springer 1998, pp. 210-221.

Fekete, Sandor P. and Kremer, Jana (1998) Tree Spanners in Planar Graphs.
Published In: Graph theoretic concepts in computer science : 24th international workshop ; proceedings / WG '98, Smolenice Castle, Slovak Republic, June 18 - 20, 1998 , Lecture notes in computer science. 1517 Springer 1998, pp. 9-30.

Simone, Caterina De and Jünger, Michael (1997) On the Two-Connected Planar Spanning Subgraph Polytope.
Published in: Discrete Applied Mathematics Vol. 80 (2-3). pp. 223-229.

Mehlhorn, Kurt and Mutzel, Petra (1996) On the Embedding Phase of the Hopcroft and Tarjan Planarity Testing Algorithm.
Published in: Algorithmica Vol. 16 (2). pp. 233-242.

Mehlhorn, Kurt and Mutzel, Petra and Näher, Stefan (1994) An Implementation of the Hopcroft and Tarjan Planarity Test and Embedding Algorithm.
Technical Report , 46 p.

Middendorf, Matthias and Pfeiffer, Frank (1993) Weakly Transitive Orientations, Hasse Diagrams and String Graphs.
Published in: Discrete mathematics Vol. 111 (1-3). pp. 393-400.

Mutzel, Petra (1992) A fast 0(n) Embedding Algorithm, based on the Hopcroft-Tarjan Planary Test.
Technical Report , 26 p.

Middendorf, Matthias and Pfeiffer, Frank (1990) On the complexity of the disjoint paths problem (Extended abstract).
Published In: Polyhedral combinatorics : proceedings of a DIMACS Workshop ; June 12 - 16, 1989, DIMACS series in discrete mathematics and theoretical computer science. 1 1990, pp. 171-178.

This list was generated on Sat Sep 23 21:57:31 2017 CEST.