Q5115779 (Q5115779): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3514515 / 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: Finding and counting given length cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: The clique problem in intersection graphs of ellipses and triangles / rank
 
Normal rank
Property / cites work
 
Property / cites work: On forbidden induced subgraphs for unit disk graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3424900 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the stable set problem in terms of the odd cycle packing number / rank
 
Normal rank
Property / cites work
 
Property / cites work: On subexponential and FPT-time inapproximability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5115779 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Classes: A Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unit disk graph recognition is NP-hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: Homothetic polygons and beyond: maximal cliques in intersection graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The clique problem in ray intersection graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2785015 / 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: Complexity of approximating bounded variants of optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unit disk graphs / 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: Approximation and Online Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: The number of maximal independent sets in connected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs without short odd cycles are nearly bipartite / rank
 
Normal rank
Property / cites work
 
Property / cites work: Which problems have strongly exponential complexity? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sphere and dot product representations of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Odd cycle packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Max-Clique for intersection graphs of sets and the Hadwiger-Debrunner numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4838453 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topics in Intersection Graph Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: The max clique problem in classes of string-graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-query PCP with subconstant error / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust algorithms for restricted domains / rank
 
Normal rank

Latest revision as of 08:33, 23 July 2024

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

    Statements

    0 references
    0 references
    0 references
    0 references
    0 references
    18 August 2020
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    disk graph
    0 references
    maximum clique
    0 references
    computational complexity
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references