Q5090476 (Q5090476): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.4230/LIPIcs.STACS.2019.27 / rank
Normal rank
 
Property / cites work
 
Property / cites work: Interpreting nowhere dense graph classes as a classical notion of model theory / 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: The monadic second-order logic of graphs. I: Recognizable sets of finite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Domination Problems in Nowhere-Dense Classes / 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: Kernelization and Sparseness: the case of Dominating Set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing first-order properties for subclasses of sparse graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Neighborhood complexity and kernelization for nowhere dense classes of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deciding First-Order Properties of Nowhere Dense Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: First order properties on nowhere dense structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: On nowhere dense graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparsity. Graphs, structures, and algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial bounds for centered colorings on proper minor-closed graph classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the number of types in sparse graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Closed sets and chain conditions in stable theories / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classification theory and the number of non-isomorphic models. / rank
 
Normal rank
Property / cites work
 
Property / cites work: FPT Algorithms for Domination in Biclique-Free Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quick <i>k</i>-Median, <i>k</i>-Center, and Facility Location for Sparse Graphs / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.4230/LIPICS.STACS.2019.27 / rank
 
Normal rank

Latest revision as of 15:53, 30 December 2024

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

    Statements

    0 references
    0 references
    0 references
    0 references
    18 July 2022
    0 references
    dominating set
    0 references
    independent set
    0 references
    nowhere denseness
    0 references
    stability
    0 references
    fixed-parameter tractability
    0 references

    Identifiers