Sciweavers

973 search results - page 1 / 195
» New Bounds on Crossing Numbers
Sort
View
COMPGEOM
1999
ACM
13 years 8 months ago
New Bounds on Crossing Numbers
János Pach, Joel Spencer, Géza T&oac...
SODA
2010
ACM
248views Algorithms» more  SODA 2010»
14 years 1 months ago
Approximating the Crossing Number of Graphs Embeddable in Any Orientable Surface
The crossing number of a graph is the least number of pairwise edge crossings in a drawing of the graph in the plane. We provide an O(n log n) time constant factor approximation al...
Petr Hlineny, Markus Chimani
COMPGEOM
2005
ACM
13 years 5 months ago
Abstract order type extension and new results on the rectilinear crossing number
Order Type Extension and New Results ectilinear Crossing Number - Extended Abstract Oswin Aichholzer∗ Hannes Krasser† We provide a complete data base of all realizable order t...
Oswin Aichholzer, Hannes Krasser
APVIS
2008
13 years 5 months ago
Crossing Minimization meets Simultaneous Drawing
We define the concept of crossing numbers for simultaneous graphs by extending the crossing number problem of traditional graphs. We discuss differences to the traditional crossin...
Markus Chimani, Michael Jünger, Michael Schul...
CORR
2010
Springer
162views Education» more  CORR 2010»
13 years 9 days ago
Cross-Composition: A New Technique for Kernelization Lower Bounds
We introduce a new technique for proving kernelization lower bounds, called cross-composition. A classical problem L cross-composes into a parameterized problem Q if an instance o...
Hans L. Bodlaender, Bart M. P. Jansen, Stefan Krat...