Faster approximation schemes and parameterized algorithms on (odd-)\(H\)-minor-free graphs (Q764332): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Approximation algorithms for NP-complete problems on planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Diameter and treewidth in minor-closed graph families / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deciding first-order properties of locally tree-decomposable structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local tree-width, excluded minors, and approximation algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized complexity: exponential speed-up for planar graph problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2934606 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear-Time Approximation Scheme for TSP in Undirected Planar Graphs with Edge-Weights / rank
 
Normal rank
Property / cites work
 
Property / cites work: An <i>O</i> ( <i>n</i> log <i>n</i> ) approximation scheme for Steiner tree in planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. XVI: Excluding a non-planar graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4393480 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametrized complexity theory. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subexponential parameterized algorithms on bounded-genus graphs and <i>H</i> -minor-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3113754 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of weakly bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the odd-minor variant of Hadwiger's conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the list-chromatic number and the chromatic number in minor-closed and odd-minor-closed classes of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5417628 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5417627 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5837979 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5710169 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5315023 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385531 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear time algorithms for NP-hard problems restricted to partial k- trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3795218 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3579494 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5501346 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. XIII: The disjoint paths problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. XX: Wagner's conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2921717 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Approximation Algorithms for Minimum Weight Vertex Separators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2921728 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The extremal function for complete minors / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Separator Theorem for Nonplanar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar Subgraph Isomorphism Revisited / rank
 
Normal rank

Latest revision as of 00:28, 5 July 2024

scientific article
Language Label Description Also known as
English
Faster approximation schemes and parameterized algorithms on (odd-)\(H\)-minor-free graphs
scientific article

    Statements

    Faster approximation schemes and parameterized algorithms on (odd-)\(H\)-minor-free graphs (English)
    0 references
    0 references
    13 March 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    subexponential algorithms
    0 references
    graph minors
    0 references
    odd minors
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references