Download:
|
by Alexander Grigoriev, Hans L. Bodlaender
Proc. 15th Int. Symp. on Fundamentals of Computation Theory (FCT’05), volume 3623 of Lecture Notes in Computer Science
http://www.cs.uu.nl/research/techreps/repo/CS-2004/2004-058.ps.gz
Add To MetaCart
Abstract:
www.cs.uu.nl Algorithms for graphs embeddable with few crossings per edge ∗
Citations
|
7703
|
Computers and Intractability: A Guide to the Theory of NP-Completeness
– Garey, Johnson
- 1979
|
|
250
|
Approximation algorithms for NP-complete problems on planar graphs
– Baker
- 1994
|
|
69
|
New lower bound techniques for VLSI
– Leighton
- 1984
|
|
59
|
Graph Theory and its Applications
– Gross, Yellen
- 1999
|
|
56
|
Diameter and treewidth in minor-closed graph families
– Eppstein
- 2000
|
|
42
|
Local tree-width, excluded minors, and approximation algorithms
– Grohe
|
|
33
|
Algorithms for vertex partitioning problems on partial k-trees
– Telle, Proskurowski
- 1997
|
|
17
|
Bidimensionality: New Connections between FPT Algorithms and PTASs
– Demaine, Hajiaghayi
- 2005
|
|
13
|
Graphs excluding a fixed minor have grids as large as treewidth, with combinatorial and algorithmic applications through bidimensionality
– Demaine, Hajiaghayi
- 2005
|
|
10
|
Graphs drawn with few crossings per edge
– Pach, Toth
- 1997
|
|
6
|
A robust PTAS for Maximum Independent Sets in unit disk graphs
– Nieberg, Hurink, et al.
- 2004
|
|
1
|
Ragde and D.M. Thilikos, Approximation algorithms for classes of graphs excluding single-crossing graphs as minors
– Demaine, Nishimura, et al.
|
|
1
|
Web: http://mathworld.wolfram.com/GraphCrossing Number.html
– Wide
|
