Q5743499 (Q5743499): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Label placement by maximum independent set in rectangles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric separation and exact solutions for the parameterized independent set problem on disk graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some APX-completeness results for cubic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Easy problems for tree-decomposable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for NP-complete problems on planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Algorithms for the Feedback Vertex Set Problem with Applications to Constraint Satisfaction and Bayesian Inference / rank
 
Normal rank
Property / cites work
 
Property / cites work: A partial k-arboretum of graphs with bounded treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automatic generation of linear-time algorithms from predicate calculus descriptions of problems on recursively constructed graph families / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial-time approximation schemes for packing and piercing fat objects / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Algorithms for Independent Sets in Map Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4542571 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Map graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unit disk graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The monadic second-order logic of graphs. I: Recognizable sets of finite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Handbook of Graph Grammars and Computing by Graph Transformation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-parameter algorithms for ( <i>k</i> , <i>r</i> )-center in planar graphs and map graphs / 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: Q2921717 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linearity of grid minors in treewidth with applications through bidimensionality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic graph minor theory: Improved grid minor bounds and Wagner's contraction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5315023 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum clique partition in unit disk graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Three-dimensional orthogonal graph drawing algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial-Time Approximation Schemes for Geometric Intersection Graphs / 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: Q5743499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bidimensionality and Geometric Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation schemes for covering and packing problems in image processing and VLSI / rank
 
Normal rank
Property / cites work
 
Property / cites work: NC-Approximation Schemes for NP- and PSPACE-Hard Problems for Geometric Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Which problems have strongly exponential complexity? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial Kernels for Hard Problems on Disk Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4194048 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple heuristics for unit disk graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms – ESA 2005 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Separators for sphere-packings and nearest neighbor graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust algorithms for restricted domains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quickly excluding a planar graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph searching and a min-max theorem for tree-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4250223 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast and accurate algorithms for protein side-chain packing / rank
 
Normal rank

Latest revision as of 05:13, 19 July 2024

scientific article; zbMATH DE number 7053376
Language Label Description Also known as
English
No label defined
scientific article; zbMATH DE number 7053376

    Statements

    0 references
    0 references
    0 references
    10 May 2019
    0 references
    EPTAS
    0 references
    unit-disc graph
    0 references
    map graph
    0 references
    bidimensionality
    0 references
    treewidth
    0 references
    fixed-parameter tractability
    0 references
    subexponential algorithm
    0 references
    exponential time hypothesis
    0 references
    excluded grid theorem
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references