Pages that link to "Item:Q606990"
From MaRDI portal
The following pages link to On the parameterized complexity of some optimization problems related to multiple-interval graphs (Q606990):
Displaying 11 items.
- Tractability and approximability of maximal strip recovery (Q441877) (← links)
- Inapproximability of maximal strip recovery (Q551208) (← links)
- Parameterized complexity in multiple-interval graphs: domination, partition, separation, irredundancy (Q690460) (← links)
- Interval scheduling and colorful independent sets (Q892898) (← links)
- On independent set in \(B_1\)-EPG graphs (Q2174555) (← links)
- Parameterized complexity of conflict-free matchings and paths (Q2182094) (← links)
- Inductive \(k\)-independent graphs and \(c\)-colorable subgraphs in scheduling: a review (Q2327955) (← links)
- Recognizing \(d\)-interval graphs and \(d\)-track interval graphs (Q2375953) (← links)
- Parameterized Complexity in Multiple-Interval Graphs: Domination (Q2891335) (← links)
- (Q5092396) (← links)
- Temporal interval cliques and independent sets (Q6039892) (← links)
