Pages that link to "Item:Q1001898"
From MaRDI portal
The following pages link to On the parameterized complexity of multiple-interval graph problems (Q1001898):
Displaying 9 items.
- The complexity of finding effectors (Q519899) (← links)
- Parameterizing by the number of numbers (Q692894) (← links)
- On the complexity of finding and counting solution-free sets of integers (Q1752464) (← links)
- New algorithms for maximum disjoint paths based on tree-likeness (Q1785205) (← links)
- The parameterized complexity of some minimum label problems (Q1959420) (← links)
- Parameterized complexity of Eulerian deletion problems (Q2441593) (← links)
- Parameterized Complexity of Stabbing Rectangles and Squares in the Plane (Q3605506) (← links)
- Planar Capacitated Dominating Set Is W[1]-Hard (Q3656850) (← links)
- Parameterized Complexity of Directed Steiner Network with Respect to Shared Vertices and Arcs (Q5384532) (← links)
