Pages that link to "Item:Q2930319"
From MaRDI portal
The following pages link to Optimization problems in multiple-interval graphs (Q2930319):
Displayed 14 items.
- Online selection of intervals and \(t\)-intervals (Q391644) (← links)
- Optimization problems in dotted interval graphs (Q400519) (← links)
- Approximation algorithms for intersection graphs (Q476425) (← links)
- Dominating set is fixed parameter tractable in claw-free graphs (Q650938) (← links)
- Parameterized complexity in multiple-interval graphs: domination, partition, separation, irredundancy (Q690460) (← links)
- Three ways to cover a graph (Q898135) (← links)
- On dominating set of some subclasses of string graphs (Q2144448) (← links)
- Hardness and approximation for L-EPG and \(B_1\)-EPG graphs (Q2184686) (← links)
- Approximating dominating set on intersection graphs of rectangles and \(\mathsf{L}\)-frames (Q2331213) (← links)
- Parameterized Complexity in Multiple-Interval Graphs: Domination (Q2891335) (← links)
- Improved Algorithm for Resource Allocation Problems (Q4604919) (← links)
- Approximating Dominating Set on Intersection Graphs of Rectangles and L-frames (Q5005138) (← links)
- Temporal interval cliques and independent sets (Q6039892) (← links)
- Mobility offer allocations in corporate settings (Q6114908) (← links)