Subexponential algorithms for variants of the homomorphism problem in string graphs (Q2301363): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Created claim: Wikidata QID (P12): Q126434548, #quickstatements; #temporary_batch_1721910495864
 
(7 intermediate revisions by 6 users not shown)
Property / author
 
Property / author: Paweł Rzążewski / rank
Normal rank
 
Property / author
 
Property / author: Paweł Rzążewski / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2972759174 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1809.09345 / 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: Q4626304 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4500843 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independent feedback vertex set for \(P_5\)-free 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: Every planar graph is the intersection graph of segments in the plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Locally constrained homomorphisms on graphs of bounded treewidth and bounded degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: On simplified NP-complete variants of \textsc{Monotone} 3\textsc{-Sat} / rank
 
Normal rank
Property / cites work
 
Property / cites work: On strongly planar not-all-equal 3SAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(k-L(2,1)\)-labelling for planar graphs is NP-complete for \(k\geq 4\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: List homomorphisms and circular arc graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Locally Injective Graph Homomorphism: Lists Guarantee Dichotomy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cantor--Bernstein type theorem for locally constrained graph homomorphisms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A complete complexity classification of the role assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mathematical Foundations of Computer Science 2005 / 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: A Separator Theorem for String Graphs and its Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5365106 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4607888 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Labelling Graphs with a Condition at Distance 2 / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(H\)-colouring \(P_t\)-free graphs in subexponential time / rank
 
Normal rank
Property / cites work
 
Property / cites work: A dichotomy for minimum cost graph homomorphisms / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the injective chromatic number of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact algorithms for \(L(2,1)\)-labeling of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4828516 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5365149 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Injective Colourings of Chordal Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloring the square of a planar graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of \(k\)-SAT / 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: 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: String graphs requiring exponential representations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intersection graphs of segments / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Separator Theorem for Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of locally injective homomorphisms / 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: Near-Optimal Separators in String Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer realizations of disk and segment 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: Q3821582 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subexponential algorithms for variants of homomorphism problem in string graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognizing string graphs in NP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed points, Nash equilibria, and the existential theory of the reals / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q126434548 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 14:31, 25 July 2024

scientific article
Language Label Description Also known as
English
Subexponential algorithms for variants of the homomorphism problem in string graphs
scientific article

    Statements

    Subexponential algorithms for variants of the homomorphism problem in string graphs (English)
    0 references
    0 references
    0 references
    24 February 2020
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    graph homomorphism
    0 references
    string graphs
    0 references
    segment graphs
    0 references
    subexponential algorithms
    0 references
    ETH
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references