Pages that link to "Item:Q2182094"
From MaRDI portal
The following pages link to Parameterized complexity of conflict-free matchings and paths (Q2182094):
Displaying 9 items.
- Finding temporal paths under waiting time constraints (Q1979453) (← links)
- Complexity of the path avoiding forbidden pairs problem revisited (Q2446333) (← links)
- Constrained hitting set problem with intervals (Q2695330) (← links)
- Parameterized complexity of conflict-free set cover (Q5918356) (← links)
- Conflict free version of covering problems on graphs: classical and parameterized (Q5918906) (← links)
- Parameterized complexity of perfectly matched sets (Q6038698) (← links)
- Finding Temporal Paths Under Waiting Time Constraints. (Q6065432) (← links)
- Sparsity in covering solutions (Q6547950) (← links)
- AntiFactor is FPT parameterized by treewidth and list size (but counting is hard) (Q6670813) (← links)