Pages that link to "Item:Q1410592"
From MaRDI portal
The following pages link to Worst-case-optimal algorithms for guarding planar graphs and polyhedral surfaces (Q1410592):
Displaying 20 items.
- Approximation algorithms for a geometric set cover problem (Q423912) (← links)
- Box-respecting colorings of \(n\)-dimensional guillotine-partitions (Q533787) (← links)
- Guarding a set of line segments in the plane (Q630591) (← links)
- Polychromatic 4-coloring of guillotine subdivisions (Q989455) (← links)
- Polychromatic colorings of rectangular partitions (Q1043659) (← links)
- Polychromatic colorings of arbitrary rectangular partitions (Q1045138) (← links)
- Improved bounds for guarding plane graphs with edges (Q1741583) (← links)
- Balanced polychromatic 2-coloring of triangulations (Q2062902) (← links)
- Edge guards for polyhedra in three-space (Q2123291) (← links)
- Polychromatic colorings of hypergraphs with high balance (Q2129929) (← links)
- Facially-constrained colorings of plane graphs: a survey (Q2401805) (← links)
- Computational complexity for the problem of optimal intersection of straight line segments by disks (Q2424188) (← links)
- Experimental Study on Approximation Algorithms for Guarding Sets of Line Segments (Q3077409) (← links)
- GUARDING RECTANGULAR PARTITIONS (Q3405972) (← links)
- A note on the lower bound of edge guards of polyhedral terrains (Q3630029) (← links)
- Polychromatic colorings of bounded degree plane graphs (Q3633009) (← links)
- Drawing Planar Graphs with Few Geometric Primitives (Q4585062) (← links)
- Improved bounds for guarding plane graphs with edges (Q5116478) (← links)
- A note on polychromatic colorings of plane graphs (Q5866030) (← links)
- Polychromatic colorings of plane graphs (Q5896961) (← links)
