scientific article
From MaRDI portal
Publication:2957518
DOI10.4230/LIPIcs.FSTTCS.2012.424zbMath1354.68129MaRDI QIDQ2957518
Magnus Wahlström, Saket Saurabh, Daniel Lokshtanov
Publication date: 26 January 2017
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85) Randomized algorithms (68W20)
Related Items (15)
Efficient Graph Minors Theory and Parameterized Algorithms for (Planar) Disjoint Paths ⋮ Four Shorts Stories on Surprising Algorithmic Uses of Treewidth ⋮ A Subexponential Parameterized Algorithm for Directed Subset Traveling Salesman Problem on Planar Graphs ⋮ Optimizing adiabatic quantum program compilation using a graph-theoretic framework ⋮ Linear kernels for outbranching problems in sparse digraphs ⋮ Parameterized complexity dichotomy for \((r, \ell)\)-\textsc{Vertex Deletion} ⋮ Hitting Selected (Odd) Cycles ⋮ An Updated Experimental Evaluation of Graph Bipartization Methods ⋮ Faster algorithms for cycle hitting problems on disk graphs ⋮ A Tight Lower Bound for Edge-Disjoint Paths on Planar DAGs ⋮ A Deterministic Polynomial Kernel for Odd Cycle Transversal and Vertex Multiway Cut in Planar Graphs ⋮ Unnamed Item ⋮ Faster graph bipartization ⋮ Tight Bounds for Planar Strongly Connected Steiner Subgraph with Fixed Number of Terminals (and Extensions) ⋮ Parameterized Approximation Algorithms for Bidirected Steiner Network Problems
This page was built for publication:
