An ILP-based Proof System for the Crossing Number Problem
From MaRDI portal
Publication:4606298
DOI10.4230/LIPICS.ESA.2016.29zbMATH Open1397.68138OpenAlexW2531414784MaRDI QIDQ4606298FDOQ4606298
Authors: Markus Chimani, Tilo Wiedera 
Publication date: 2 March 2018
Full work available at URL: https://doi.org/10.4230/LIPIcs.ESA.2016.29
Recommendations
- scientific article; zbMATH DE number 4131955
- A branch-and-cut approach to the crossing number problem
- Algorithms for the fixed linear crossing number problem
- Crossing Numbers and Parameterized Complexity
- Crossing Number is NP-Complete
- An algorithm for the graph crossing number problem
- Some provably hard crossing number problems
- Integer programs for logic constraint satisfaction
- Numerical reasoning with an ILP system capable of lazy evaluation and customised search
- scientific article; zbMATH DE number 1487879
Graph theory (including graph drawing) in computer science (68R10) Integer programming (90C10) Planar graphs; geometric and topological aspects of graph theory (05C10)
Cited In (21)
- The crossing numbers of join products of four graphs of order five with paths and cycles
- On the crossing numbers of Cartesian products of small graphs with paths, cycles and stars
- Characterizing all graphs with 2-exceptional edges
- On 13-crossing-critical graphs with arbitrarily large degrees
- The longest processing time rule for identical parallel machines revisited
- The crossing numbers of join product of four graphs on six vertices with discrete graphs
- On the crossing number of the join of the wheel on five vertices with the discrete graph
- Star-Struck by Fixed Embeddings: Modern Crossing Number Heuristics
- A tight linear time \(\frac{13}{12}\)-approximation algorithm for the \(P2 || C_{\max}\) problem
- An improved algorithm for a two-stage production scheduling problem with an outsourcing option
- Star-struck by fixed embeddings: modern crossing number heuristics
- There are no cubic graphs on 26 vertices with crossing number 10 or 11
- On the crossing number of the Cartesian product of a sunlet graph and a star graph
- Approximating the 3-period incremental knapsack problem
- The influence of separating cycles in drawings of \(K_5 \setminus e\) in the join product with paths and cycles
- On approximating the incremental knapsack problem
- Facets in the crossing number polytope
- Bounded degree conjecture holds precisely for \(c\)-crossing-critical graphs with \(c \le 12\)
- Title not available (Why is that?)
- On the crossing numbers of Cartesian products of wheels and trees
- A survey of graphs with known or bounded crossing numbers
Uses Software
This page was built for publication: An ILP-based Proof System for the Crossing Number Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4606298)
