Pages that link to "Item:Q2340410"
From MaRDI portal
The following pages link to Independent and hitting sets of rectangles intersecting a diagonal line: algorithms and complexity (Q2340410):
Displayed 5 items.
- Approximating dominating set on intersection graphs of rectangles and \(\mathsf{L}\)-frames (Q2331213) (← links)
- Packing and covering with balls on Busemann surfaces (Q2358828) (← links)
- On Local Structures of Cubicity 2 Graphs (Q2958318) (← links)
- Covering, Hitting, Piercing and Packing Rectangles Intersecting an Inclined Line (Q3467840) (← links)
- ON PARAMETERIZED COMPLEXITY OF HITTING SET PROBLEM FOR AXIS–PARALLEL SQUARES INSTERSECTING A STRAIGHT LINE (Q4581438) (← links)