Items where Subject is "G Algorithms and Complexity > G.840 Planarization"

Up a level
Export as [feed] Atom [feed] RSS 1.0 [feed] RSS 2.0
Group by: Creators Name | Item Type
Jump to: A | B | C | D | E | F | G | J | M
Number of items at this level: 21.

A

Angelini, Patrizio and Frati, Fabrizio and Patrignani, Maurizio (2010) Splitting Clusters to Get C-Planarity. In: Graph Drawing 17th International Symposium, GD 2009, September 22-25, 2009 , pp. 57-68(Official URL: http://dx.doi.org/10.1007/978-3-642-11805-0_8).

B

Borradaile, Glencora and Eppstein, David and Zhu, Pingan (2014) Planar Induced Subgraphs of Sparse Graphs. In: Graph Drawing 22nd International Symposium, GD 2014, September 24-26, 2014 , pp. 1-12(Official URL: http://dx.doi.org/10.1007/978-3-662-45803-7_1).

C

Chimani, Markus and Gutwenger, Carsten and Mutzel, Petra and Wong, Hoi-Ming (2010) Upward Planarization Layout. In: Graph Drawing 17th International Symposium, GD 2009, September 22-25, 2009 , pp. 94-106(Official URL: http://dx.doi.org/10.1007/978-3-642-11805-0_11).

Chimani, Markus and Mutzel, Petra and Schmidt, Jens M. (2008) Efficient Extraction of Multiple Kuratowski Subdivisions. In: Graph Drawing 15th International Symposium, GD 2007, September 24-26, 2007 , pp. 159-170(Official URL: http://dx.doi.org/10.1007/978-3-540-77537-9_17).

Chimani, Markus and Gutwenger, Carsten (2012) Advances in the Planarization Method: Effective Multiple Edge Insertions. In: Graph Drawing 19th International Symposium, GD 2011, September 21-23, 2011 , pp. 87-98(Official URL: http://dx.doi.org/ 10.1007/978-3-642-25878-7_10).

Chimani, Markus and Gutwenger, Carsten and Jansen, Mathias and Klein, Karsten and Mutzel, Petra (2009) Computing Maximum C-planar Subgraphs. In: Graph Drawing 16th International Symposium, GD 2008, September 21- 24, 2008 , pp. 115-120(Official URL: http://dx.doi.org/10.1007/978-3-642-00219-9_12).

D

Delahousse, Jean and Auillans, Pascal (2002) Knowledge Index Manager. In: Graph Drawing 9th International Symposium, GD 2001, September 23-26, 2001 , pp. 469-470(Official URL: http://dx.doi.org/10.1007/3-540-45848-4_50).

Di Battista, Giuseppe and Didimo, Walter and Marcandalli, A. (2002) Planarization of Clustered Graphs (Extended Abstract). In: Graph Drawing 9th International Symposium, GD 2001, September 23-26, 2001 , pp. 60-74(Official URL: http://dx.doi.org/10.1007/3-540-45848-4_5).

Dujmović, Vida and Fellows, M. and Hallett, M. and Kitching, Matthew and Liotta, Giuseppe and McCartin, C. and Nishimura, N. and Ragde, P. and Rosamond, F. and Suderman, Matthew and Whitesides, Sue and Wood, David R. (2002) A Fixed-Parameter Approach to Two-Layer Planarization. In: Graph Drawing 9th International Symposium, GD 2001, September 23-26, 2001 , pp. 1-15(Official URL: http://dx.doi.org/10.1007/3-540-45848-4_1).

E

Eppstein, David (2017) The Effect of Planarization on Width. In: Graph Drawing and Network Visualization. GD 2017, September 25-27 , pp. 560-574(Official URL: https://doi.org/10.1007/978-3-319-73915-1_43).

F

Frati, Fabrizio and Kaufmann, Michael and Pach, János and Tóth, Csaba D. and Wood, David R. (2013) On the Upward Planarity of Mixed Plane Graphs. In: 21st International Symposium, GD 2013 , September 23-25, 2013 , pp. 1-12(Official URL: http://dx.doi.org/10.1007/978-3-319-03841-4_1).

Fößmeier, Ulrich and Kaufmann, Michael (1998) Algorithms and Area Bounds for Nonplanar Orthogonal Drawings. In: Graph Drawing 5th International Symposium, GD '97, September 18-20, 1997 , pp. 134-145(Official URL: http://dx.doi.org/10.1007/3-540-63938-1_57).

G

Gange, Graeme and Stuckey, Peter J. and Marriott, Kim (2011) Optimal k-Level Planarization and Crossing Minimization. In: Graph Drawing 18th International Symposium, GD 2010, September 21-24, 2010 , pp. 238-249(Official URL: http://dx.doi.org/10.1007/978-3-642-18469-7_22).

Gutwenger, Carsten and Chimani, Markus (2006) Non-Planar Core Reduction of Graphs. In: Graph Drawing 13th International Symposium, GD 2005, September 12-14, 2005 , pp. 223-234(Official URL: http://dx.doi.org/10.1007/11618058_21).

Gutwenger, Carsten and Mutzel, Petra (2004) An Experimental Study of Crossing Minimization Heuristics. In: Graph Drawing 11th International Symposium, GD 2003, September 21-24, 2003 , pp. 13-24(Official URL: http://dx.doi.org/10.1007/978-3-540-24595-7_2).

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]

Jünger, Michael and Mutzel, Petra (1995) The Polyhedral Approach to the Maximum Planar Subgraph Problem: New Chances for Related Problems. In: Graph Drawing DIMACS International Workshop, GD 1994, October 10–12, 1994 , pp. 119-130(Official URL: http://dx.doi.org/10.1007/3-540-58950-3_363).

M

Mutzel, Petra and Ziegler, Thomas (1999) The Constrained Crossing Minimization Problem. In: Graph Drawing 7th International Symposium, GD’99, September 15-19, 1999 , pp. 175-185(Official URL: http://dx.doi.org/10.1007/3-540-46648-7_18).

This list was generated on Wed Jun 20 14:51:00 2018 CEST.