Bounding and computing obstacle numbers of graphs
From MaRDI portal
Publication:6542540
Recommendations
Cites work
- scientific article; zbMATH DE number 431988 (Why is no real title available?)
- Axioms and hulls
- Coding and counting arrangements of pseudolines
- Complexity Results for Multiprocessor Scheduling under Resource Constraints
- Constructing the visibility graph for n-line segments in \(O(n^ 2)\) time
- Fundamentals of parameterized complexity
- Lower bounds on the obstacle number of graphs
- Obstacle numbers of graphs
- Obstacle numbers of planar graphs
- Obstructing visibilities with one obstacle
- On a problem of formal logic.
- On obstacle numbers
- On the computational complexity and geometry of the first-order theory of the reals. I: Introduction. Preliminaries. The geometry of semi-algebraic sets. The decision problem for the existential theory of the reals
- On the computational complexity and geometry of the first-order theory of the reals. II: The general decision problem. Preliminaries for quantifier elimination
- On the computational complexity and geometry of the first-order theory of the reals. III: Quantifier elimination
- Outside-obstacle representations with all vertices on the outer face
- Recognition and complexity of point visibility graphs
- Reconstructing Point Set Order Types from Radial Orderings
- Upper bounds for configurations and polytopes in \({\mathbb{R}}^ d\)
This page was built for publication: Bounding and computing obstacle numbers of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6542540)
