Computing list homomorphisms in geometric intersection graphs (Q6039432): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
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: A Framework for Exponential-Time-Hypothesis--Tight Algorithms and Lower Bounds in Geometric Intersection Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4626304 / rank
 
Normal rank
Property / cites work
 
Property / cites work: EPTAS and Subexponential Algorithm for Maximum Clique on Disk and Unit Ball Graphs / 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: Unit disk graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of colouring problems on dense graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation and Online Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding, hitting and packing cycles in subexponential time on unit disk graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5077647 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5743499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic graph theory and perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of \(k\)-SAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: Which problems have strongly exponential complexity? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Theory for Systems Biology / rank
 
Normal rank
Property / cites work
 
Property / cites work: Max-tolerance graphs as intersection graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Exact Complexity of Hamiltonian Cycle and q-Colouring in Disk Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intersection graphs of segments / rank
 
Normal rank
Property / cites work
 
Property / cites work: String graphs. I: The number of critical nonstring graphs is infinite / rank
 
Normal rank
Property / cites work
 
Property / cites work: String graphs. II: Recognizing string graphs is NP-hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: Representation of a finite graph by a set of intervals on the real line / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms – ESA 2005 / 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: Separators for sphere-packings and nearest neighbor graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subexponential algorithms for variants of the homomorphism problem in string graphs / rank
 
Normal rank

Latest revision as of 02:34, 1 August 2024

scientific article; zbMATH DE number 7682419
Language Label Description Also known as
English
Computing list homomorphisms in geometric intersection graphs
scientific article; zbMATH DE number 7682419

    Statements

    Computing list homomorphisms in geometric intersection graphs (English)
    0 references
    0 references
    0 references
    0 references
    5 May 2023
    0 references
    graph homomorphisms
    0 references
    geometric intersection graphs
    0 references
    subexponential-time algorithms
    0 references
    exponential time hypothesis
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers