Pages that link to "Item:Q1737591"
From MaRDI portal
The following pages link to The complexity of dominating set in geometric intersection graphs (Q1737591):
Displaying 6 items.
- On dominating set of some subclasses of string graphs (Q2144448) (← links)
- A Framework for Exponential-Time-Hypothesis--Tight Algorithms and Lower Bounds in Geometric Intersection Graphs (Q3387760) (← links)
- Lower Bounds for Dominating Set in Ball Graphs and for Weighted Dominating Set in Unit-Ball Graphs (Q5042449) (← links)
- On Geometric Set Cover for Orthants (Q5075763) (← links)
- The Dominating Set Problem in Geometric Intersection Graphs (Q5111873) (← links)
- Hyperideal-based intersection graphs (Q6099744) (← links)
