Clique-based separators for geometric intersection graphs (Q6103521): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s00453-022-01041-8 / rank
Normal rank
 
Property / OpenAlex ID
 
Property / OpenAlex ID: W3217451109 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Bounds for the Union of Locally Fat Objects in the Plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the visibility graph of points within a polygon / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimality program in segment and string graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Helly-type theorem for intersections of compact connected sets in the plane / 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: Map graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applications of random sampling in computational geometry. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Framework for Exponential-Time-Hypothesis--Tight Algorithms and Lower Bounds in Geometric Intersection Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5452284 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reduced constants for simple cycle graph separation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition of Map Graphs with Applications. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A bipartite strengthening of the crossing Lemma / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Algorithms for Polynomial-Expansion and Low-Density Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hyperbolic intersection graphs and (quasi)-polynomial time / rank
 
Normal rank
Property / cites work
 
Property / cites work: How Does Object Fatness Impact the Complexity of Packing in d Dimensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Separators in region intersection graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Separator Theorem for Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Parameterized Algorithms for Planar Facility Location Problems Using Voronoi Diagrams / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4530626 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Near-Optimal Separators in String Graphs / 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: Q4657590 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Finite Family of Pseudodiscs Must Include a “Small” Pseudodisc / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the geodesic center of a simple polygon / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructing planar support for non-piercing regions / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S00453-022-01041-8 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 18:28, 30 December 2024

scientific article; zbMATH DE number 7691816
Language Label Description Also known as
English
Clique-based separators for geometric intersection graphs
scientific article; zbMATH DE number 7691816

    Statements

    Clique-based separators for geometric intersection graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    5 June 2023
    0 references
    computational geometry
    0 references
    intersection graphs
    0 references
    separator theorems
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers