An algorithm for the graph crossing number problem

Type: Article

Publication Date: 2011-06-06

Citations: 36

DOI: https://doi.org/10.1145/1993636.1993678

Locations

  • arXiv (Cornell University) - View - PDF
  • CiteSeer X (The Pennsylvania State University) - View - PDF

Similar Works

Action Title Year Authors
+ An Algorithm for the Graph Crossing Number Problem 2010 Julia Chuzhoy
+ An Algorithm for the Graph Crossing Number Problem 2010 Julia Chuzhoy
+ PDF Chat A subpolynomial approximation algorithm for graph crossing number in low-degree graphs 2022 Julia Chuzhoy
Zihan Tan
+ On Graph Crossing Number and Edge Planarization 2010 Julia Chuzhoy
Yury Makarychev
Anastasios Sidiropoulos
+ Towards Better Approximation of Graph Crossing Number 2020 Julia Chuzhoy
Sepideh Mahabadi
Zihan Tan
+ A Subpolynomial Approximation Algorithm for Graph Crossing Number in Low-Degree Graphs 2022 Julia Chuzhoy
Zihan Tan
+ PDF Chat A Subpolynomial Approximation Algorithm for Graph Crossing Number in Low-Degree Graphs 2022 Julia Chuzhoy
Zihan Tan
+ On topological graphs with at most four crossings per edge 2015 Eyal Ackerman
+ PDF Chat Towards Better Approximation of Graph Crossing Number 2020 Julia Chuzhoy
Sepideh Mahabadi
Zihan Tan
+ On topological graphs with at most four crossings per edge 2015 Eyal Ackerman
+ PDF Chat On Graph Crossing Number and Edge Planarization 2011 Julia Chuzhoy
Yury Makarychev
Anastasios Sidiropoulos
+ Computing crossing number in linear time 2007 Ken‐ichi Kawarabayashi
Buce Reed
+ Crossing Number for Graphs With Bounded Pathwidth 2016 Thérèse Biedl
Markus Chimani
Martin Derka
Petra Mutzel
+ Crossing Number for Graphs With Bounded Pathwidth 2016 Thérèse Biedl
Markus Chimani
Martin Derka
Petra Mutzel
+ PDF Chat Crossing Number is NP-hard for Constant Path-width (and Tree-width) 2024 Petr Hliněný
Liana Khazaliya
+ On the Maximum Crossing Number 2017 Markus Chimani
Stefan Felsner
Stephen Kobourov
Torsten Ueckerdt
Pável Valtr
Alexander Wolff
+ PDF Chat A Survey on Graph Drawing Beyond Planarity 2019 Walter Didimo
Giuseppe Liotta
Fabrizio Montecchiani
+ PDF Chat Cutwidth and Crossings 2025 J. Rauch
Dieter Rautenbach
+ Algorithms and bounds for drawing non-planar graphs with crossing-free subgraphs 2015 Patrizio Angelini
Carla Binucci
Giordano Da Lozzo
Walter Didimo
Luca Grilli
Fabrizio Montecchiani
Maurizio Patrignani
Ioannis G. Tollis
+ Maximum Cut Parameterized by Crossing Number 2020 Markus Chimani
Christine Dahn
Martina Juhnke‐Kubitzke
Nils M. Kriege
Petra Mutzel
Alexander Nover