Crossings and Planarization

Crossings and Planarization (2004)

Cached

Download Links

[www.cs.brown.edu]

by Christoph Buchheim , Markus Chimani , Carsten Gutwenger , Michael Jünger , Petra Mutzel

BibTeX

@MISC{Buchheim04crossingsand,
    author = {Christoph Buchheim and Markus Chimani and Carsten Gutwenger and Michael Jünger and Petra Mutzel},
    title = { Crossings and Planarization},
    year = {2004}
}

Bookmark

OpenURL

Abstract

Citations

8881	D.S.: Computers and Intractability, A Guide to the Theory of NP-Completeness - Garey, Johnson - 1979
969	Geometric algorithms and combinatorial optimization - Grötschel, Lovász, et al. - 1993
406	G.: Testing for the consecutive ones property, interval graphs and graph planarity using PQ-trees - Booth, Lueker - 1976
193	Tarjan, Efficient planarity testing - Hopcroft, E - 1974
186	Crossing number is np-complete - Garey, Johnson - 1983
175	Decomposition principle for linear programs - Dantzig, Wolfe - 1960
140	Dividing a Graph into Triconnected Components - E, Tarjan - 1973
120	A framework for solving VLSI graph layout problems - Bhatt, Leighton - 1984
79	N.C.: Edge crossings in drawings of bipartite graphs - Eades, Wormald - 1994
76	New lower bound techniques for VLSI - Leighton - 1984
74	Incremental planarity testing - Battista, Tamassia - 1989
63	Crossing-free subgraphs - Ajtai, Chvátal, et al.
53	P.: 2-layer straightline crossing minimization: Performance of exact and heuristic algorithms - Jünger, Mutzel - 1997
50	An experimental comparison of four graph drawing algorithms - BATTISTA, GARG, et al. - 1997
40	A linear time algorithm for embedding graphs in an arbitrary surface - Mohar - 1999
35	Complexity issues in VLSI: optimal layouts for the shuffle-exchange graph and other networks - Leighton - 1983
30	Maximum planar subgraphs and nice embeddings: Practical layout tools - unger, Mutzel - 1993
29	On the deletion of nonplanar edges of a graph - Liu, Geldmacher - 1977
26	A better approximation algorithm for finding planar graphs - Călinescu, Fernandes, et al. - 1998
26	A linear time implementation of SPQR-trees - Gutwenger, Mutzel - 2001
26	String Graphs II: Recognizing String Graphs is NP-hard - Kratochvil - 1991
25	Bounds for rectilinear crossing numbers - Bienstock, Dean - 1993
22	Some provably hard crossing number problems, Discrete and Computational Geometry 6 - Bienstock - 1991
22	Computing crossing number in quadratic time - Grohe
22	Determining the thickness of a graph is NP-hard - Mansfield - 1983
17	On the cutting edge: Simplified O(n) planarity by edge addition - Boyer, Myrvold
17	Crossing number of graphs - Guy - 1972
17	Computing crossing number in linear time - Kawarabayashi, Reed - 2007
16	Computer aided layout of entityrelationship diagrams - Batini, Talamo, et al. - 1984
15	Reduction of symmetric semidefinite programs using the regular *-representation - Klerk, Pasechnik, et al. - 2007
14	On-Line Planarity Testing - Battista, Tamassia - 1996
13	Crossing Minimization in Linear Embeddings of Graphs - Masuda, Nakajima, et al. - 1990
12	A near optimal algorithm for edge separators - Chung, Yao - 1994
12	Crossing number is hard for cubic graphs - HLINĚN´Y - 2004
11	The toroidal crossing number of the complete graph - Guy, Jenkyns, et al. - 1968
10	Inserting an edge into a planar graph - Gutwenger, Mutzel, et al. - 2001
9	An Experimental Study of Crossing Minimization Heuristics - Gutwenger, Mutzel - 2003
9	Improved bounds for the crossing numbers of Km,n and Kn - Klerk, Maharry, et al.
9	On the NPcompleteness of a computer network layout problem - Masuda, Kashiwabara, et al. - 1987
8	A linear algorithm for the maximal planar subgraph problem - Djidjev - 1995
7	A new approximation algorithm for finding heavy planar subgraphs - Cǎlinescu, Fernandes, et al.
7	Graph planarization and skewness - Cimikowski - 1992
7	Analysis of heuristics for finding a maximum weight planar subgraph - Dyer, Foulds, et al. - 1985
7	An approach for mixed upward planarization - Eiglsperger, Kaufmann, et al.
6	Exact crossing minimization - Buchheim, Ebner, et al. - 2005
6	Planar crossing numbers of graphs embeddable in another surface - Böröczky, Pach, et al.
6	The crossing number of a projective graph is quadratic in the face-width - Gitler, Hliněn´y, et al.
5	Crossing minimization meets simultaneous drawing - Chimani, Jünger, et al. - 2008
5	Crossing and weighted crossing number of nearplanar graphs, Algorithmica - Cabello, Mohar
5	Planar crossing numbers of genus g graphs - Djidjev, Vrˇto - 2006