The following pages link to (Q2768362):
Displaying 12 items.
- Theory and application of width bounded geometric separators (Q632801) (← links)
- Minimum clique partition in unit disk graphs (Q659693) (← links)
- Randomized on-line algorithms and lower bounds for computing large independent sets in disk graphs (Q867854) (← links)
- A note on maximum independent sets in rectangle intersection graphs (Q1029038) (← links)
- Approximate strong separation with application in fractional graph coloring and preemptive scheduling. (Q1401329) (← links)
- Winner determination in geometrical combinatorial auctions (Q1698906) (← links)
- On-line coloring of geometric intersection graphs (Q1862127) (← links)
- Independent set of intersection graphs of convex objects in 2D (Q2489017) (← links)
- A Basic Parameterized Complexity Primer (Q2908536) (← links)
- Coloring and Maximum Independent Set of Rectangles (Q3088088) (← links)
- A note on maximum independent sets and minimum clique partitions in unit disk graphs and penny graphs: complexity and approximation (Q3095042) (← links)
- (Q5708492) (← links)
