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