Faster approximation schemes and parameterized algorithms on (odd-)\(H\)-minor-free graphs
type: Item
instance of: scholarly article
title: Faster approximation schemes and parameterized algorithms on (odd-)\(H\)-minor-free graphs
zbMATH Open document ID: 1241.05027
author: Siamak Tazari
published in: Theoretical Computer Science
publication date: 2012-03-13T00:00:00Z
Mathematics Subject Classification ID: 05C10
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 05C83
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 6014319
zbMATH Keywords: subexponential algorithms
zbMATH Keywords: graph minors
zbMATH Keywords: odd minors
MaRDI profile type: Publication
full work available at URL: j.tcs.2011.09.014
OpenAlex ID: W1966397930
cites work: Approximation algorithms for NP-complete problems on planar graphs
cites work: Diameter and treewidth in minor-closed graph families
cites work: Deciding first-order properties of locally tree-decomposable structures
cites work: Local tree-width, excluded minors, and approximation algorithms
cites work: Parameterized complexity: exponential speed-up for planar graph problems
cites work: Q2934606
cites work: A Linear-Time Approximation Scheme for TSP in Undirected Planar Graphs with Edge-Weights
cites work: An O ( n log n ) approximation scheme for Steiner tree in planar graphs
cites work: Graph minors. XVI: Excluding a non-planar graph
cites work: Q4393480
cites work: Parametrized complexity theory.
cites work: Subexponential parameterized algorithms on bounded-genus graphs and H -minor-free graphs
cites work: Q3113754
cites work: A characterization of weakly bipartite graphs
cites work: On the odd-minor variant of Hadwiger's conjecture
cites work: Approximating the list-chromatic number and the chromatic number in minor-closed and odd-minor-closed classes of graphs
cites work: Q5417628
cites work: Q5417627
cites work: Q5837979
cites work: Q5710169
cites work: Q5315023
cites work: Q4385531
cites work: Linear time algorithms for NP-hard problems restricted to partial k- trees
cites work: Q3795218
cites work: Q3579494
cites work: Q5501346
cites work: Graph minors. XIII: The disjoint paths problem
cites work: Graph minors. XX: Wagner's conjecture
cites work: Bidimensionality: new connections between FPT algorithms and PTASs
cites work: Improved Approximation Algorithms for Minimum Weight Vertex Separators
cites work: Graphs excluding a fixed minor have grids as large as treewidth, with combinatorial and algorithmic applications through bidimensionality
cites work: The extremal function for complete minors
cites work: A Separator Theorem for Nonplanar Graphs
cites work: Planar Subgraph Isomorphism Revisited
DOI: 10.1016/J.TCS.2011.09.014
description: scientific article; zbMATH DE number 6014319