Publication:3549636
From MaRDI portal
zbMath1232.90339MaRDI QIDQ3549636
Ken-ichi Kawarabayashi, Bruce A. Reed
Publication date: 5 January 2009
90C35: Programming involving graphs or networks
90C05: Linear programming
68R10: Graph theory (including graph drawing) in computer science
05C10: Planar graphs; geometric and topological aspects of graph theory
Related Items
Crossing Minimization for 1-page and 2-page Drawings of Graphs with Bounded Treewidth, Approximation Algorithms for Euler Genus and Related Problems, Unnamed Item, Unnamed Item, Characterizing Graphs with Crossing Number at Least 2, Unnamed Item, Maximum Cut Parameterized by Crossing Number, Bundled Crossings Revisited, A Practical Approach to Courcelle's Theorem, Approximating the Crossing Number of Toroidal Graphs, Crossing Numbers and Parameterized Complexity, Crossing minimization in perturbed drawings, Crossing numbers of beyond-planar graphs, Algorithms for the edge-width of an embedded graph, Linkless and flat embeddings in 3-space, Planar crossing numbers of graphs of bounded genus, MSOL restricted contractibility to planar graphs, On the red/blue spanning tree problem, Computing the shortest essential cycle, Generalized \(k\)-ary tanglegrams on level graphs: a satisfiability-based approach and its evaluation, On the parameterized complexity of layered graph drawing, Hardness of approximation for crossing number, Proper interval vertex deletion, Crossing number for graphs with bounded pathwidth, Bundled crossings revisited, Exact crossing number parameterized by vertex cover, Approximating the rectilinear crossing number, Polynomial fixed-parameter algorithms: a case study for longest path on interval graphs, Obtaining a planar graph by vertex deletion, There are no cubic graphs on 26 vertices with crossing number 10 or 11, Half-integrality, LP-branching, and FPT Algorithms, FPT Suspects and Tough Customers: Open Problems of Downey and Fellows, Approximating the Rectilinear Crossing Number, A Satisfiability-Based Approach for Embedding Generalized Tanglegrams on Level Graphs
