Pages that link to "Item:Q2867067"
From MaRDI portal
The following pages link to Parameterized and Exact Computation (Q2867067):
Displaying 9 items.
- Parameterizing by the number of numbers (Q692894) (← links)
- Faster Exact Algorithms for Some Terminal Set Problems (Q2867080) (← links)
- Graph Isomorphism Parameterized by Elimination Distance to Bounded Degree (Q2946014) (← links)
- A Purely Democratic Characterization of W[1] (Q3503582) (← links)
- A Tighter Bound for Counting Max-Weight Solutions to 2SAT Instances (Q3503590) (← links)
- Exact Algorithms for Edge Domination (Q3503591) (← links)
- Kernelization: New Upper and Lower Bound Techniques (Q3656848) (← links)
- Planar Capacitated Dominating Set Is W[1]-Hard (Q3656850) (← links)
- Computing Pathwidth Faster Than 2 n (Q3656873) (← links)
