The parameterized complexity of guarding almost convex polygons (Q6191439): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Irrational Guards are Sometimes Needed / rank
 
Normal rank
Property / cites work
 
Property / cites work: The art gallery problem is ∃ ℝ-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear-time algorithm for testing the truth of certain quantified Boolean formulas / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the combinatorial and algebraic complexity of quantifier elimination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximability of guarding weak visibility polygons / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Hardness of Art Gallery Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4580094 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Hardness of Art Gallery Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Almost optimal set covers in finite VC-dimension / rank
 
Normal rank
Property / cites work
 
Property / cites work: A combinatorial theorem in plane geometry / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for polytope covering and approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact algorithm for minimizing vertex guards on art galleries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Pseudopolynomial Time O(logn)-Approximation Algorithm for Art Gallery Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fundamentals of parameterized complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Guarding galleries and terrains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inapproximability results for guarding polygons and terrains / rank
 
Normal rank
Property / cites work
 
Property / cites work: A short proof of Chvatal's Watchman Theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for art gallery problems in polygons / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unsolved problems in visibility graphs of points, segments, and polygons / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new upper bound for the VC-dimension of visibility regions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4607896 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Guarding galleries where every point sees a large area / rank
 
Normal rank
Property / cites work
 
Property / cites work: On guarding the vertices of rectilinear domains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast vertex guarding for polygons with and without holes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved approximation for guarding simple galleries from the perimeter / rank
 
Normal rank
Property / cites work
 
Property / cites work: An \(O(\lg \lg {\mathrm {OPT}})\)-approximation algorithm for multi-guarding galleries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate guarding of monotone and rectilinear polygons / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational complexity of art gallery problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mathematical Foundations of Computer Science 2004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reflections on Multivariate Algorithmics and Problem Parameterization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3799261 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some NP-hard polygon decomposition problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two NP‐Hard Art‐Gallery Problems for Ortho‐Polygons / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4945523 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Guarding galleries where no point sees a small area. / rank
 
Normal rank

Revision as of 12:59, 26 August 2024

scientific article; zbMATH DE number 7802594
Language Label Description Also known as
English
The parameterized complexity of guarding almost convex polygons
scientific article; zbMATH DE number 7802594

    Statements

    The parameterized complexity of guarding almost convex polygons (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    9 February 2024
    0 references
    \textsc{Art Gallery}
    0 references
    reflex vertices
    0 references
    monotone 2-CSP
    0 references
    parameterized complexity
    0 references
    fixed parameter tractability
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references