The following pages link to Michał Pilipczuk (Q262250):
Displaying 9 items.
- Largest chordal and interval subgraphs faster than \(2^n\) (Q329301) (← links)
- Sitting closer to friends than enemies, revisited (Q2345988) (← links)
- Polynomial kernelization for removing induced claws and diamonds (Q2398208) (← links)
- Parameterized complexity of Eulerian deletion problems (Q2441593) (← links)
- A $c^k n$ 5-Approximation Algorithm for Treewidth (Q2799353) (← links)
- Hardness of Approximation for Strip Packing (Q4973891) (← links)
- A Subexponential Parameterized Algorithm for Proper Interval Completion (Q5891808) (← links)
- A Subexponential Parameterized Algorithm for Proper Interval Completion (Q5899484) (← links)
- Simpler and faster algorithms for detours in planar digraphs (Q6508358) (← links)
