Items where Subject is "M Methods > M.700 Planarization-based"

D

Di Giacomo, Emilio and Didimo, Walter and Liotta, Giuseppe and Palladino, Pietro (2009) Visual Analysis of One-To-Many Matched Graphs. In: Graph Drawing 16th International Symposium, GD 2008, September 21- 24, 2008 , pp. 133-144(Official URL: http://dx.doi.org/10.1007/978-3-642-00219-9_14).

Dickerson, Matthew and Eppstein, David and Goodrich, Michael T. and Meng, Jeremy Yu (2004) Confluent Drawings: Visualizing Non-planar Diagrams in a Planar Way. In: Graph Drawing 11th International Symposium, GD 2003, September 21-24, 2003 , pp. 1-12(Official URL: http://dx.doi.org/10.1007/978-3-540-24595-7_1).

F

Frati, Fabrizio (2007) Embedding Graphs Simultaneously with Fixed Edges. In: Graph Drawing 14th International Symposium, GD 2006, September 18-20, 2006 , pp. 108-113(Official URL: http://dx.doi.org/10.1007/978-3-540-70904-6_12).

G

Gutwenger, Carsten and Klein, Karsten and Mutzel, Petra (2007) Planarity Testing and Optimal Edge Insertion with Embedding Constraints. In: Graph Drawing 14th International Symposium, GD 2006, September 18-20, 2006 , pp. 126-137(Official URL: http://dx.doi.org/10.1007/978-3-540-70904-6_14).

Gutwenger, Carsten and Mutzel, Petra (2003) An Experimental Study of Crossing Minimization Heuristics. In: Graph Drawing 2003, 2003 . (In Press)

H

Hliněný, Petr and Salazar, Gelasio (2007) On the Crossing Number of Almost Planar Graphs. In: Graph Drawing 14th International Symposium, GD 2006, September 18-20, 2006 , pp. 162-173(Official URL: http://dx.doi.org/10.1007/978-3-540-70904-6_17).

J

Jünger, Michael and Leipert, Sebastian and Mutzel, Petra (1998) A Note on Computing a Maximal Planar Subgraph using PQ-Trees. [Preprint]

Jünger, Michael and Leipert, Sebastian and Mutzel, Petra (1997) Pitfalls of using PQ-Trees in Automatic Graph Drawing. [Preprint]

Jünger, Michael and Mutzel, Petra (1993) Maximum Planar Subgraphs and Nice Embeddings: Practical Layout Tools. [Preprint]

Jünger, Michael and Mutzel, Petra (1993) Solving the Maximum Weight Planar Subgraph Problem by Branch-and-Cut. [Preprint]

S

Siebenhaller, Martin and Kaufmann, Michael (2006) Mixed Upward Planarization - Fast and Robust. In: Graph Drawing 13th International Symposium, GD 2005, September 12-14, 2005 , pp. 522-523(Official URL: http://dx.doi.org/10.1007/11618058_52).