Pages that link to "Item:Q659693"
From MaRDI portal
The following pages link to Minimum clique partition in unit disk graphs (Q659693):
Displaying 15 items.
- Approximation algorithms for intersection graphs (Q476425) (← links)
- Minimum clique partition in unit disk graphs (Q659693) (← links)
- On the chromatic number of disjointness graphs of curves (Q777485) (← links)
- On arrangements of orthogonal circles (Q2206852) (← links)
- Finding, hitting and packing cycles in subexponential time on unit disk graphs (Q2334507) (← links)
- Minimum bisection is NP-hard on unit disk graphs (Q2407090) (← links)
- Approximating 2-cliques in unit disk graphs (Q2636809) (← links)
- Parameterized study of Steiner tree on unit disk graphs (Q2700383) (← links)
- APPROXIMATION ALGORITHMS FOR A VARIANT OF DISCRETE PIERCING SET PROBLEM FOR UNIT DISKS (Q2932520) (← links)
- (Q3008139) (← links)
- A Weakly Robust PTAS for Minimum Clique Partition in Unit Disk Graphs (Q3569890) (← links)
- (Q5088986) (← links)
- Covering a Graph with Clubs (Q5377354) (← links)
- (Q5743499) (← links)
- On the tractability of covering a graph with 2-clubs (Q5925691) (← links)
