The following pages link to Jakub Onufry Wojtaszczyk (Q486987):
Displaying 6 items.
- Solving the 2-disjoint connected subgraphs problem faster than \(2^n\) (Q486988) (← links)
- Scheduling partially ordered jobs faster than \(2^n\) (Q528859) (← links)
- Breaking the \(2^{n}\)-barrier for irredundance: two lines of attack (Q635734) (← links)
- Dominating set is fixed parameter tractable in claw-free graphs (Q650938) (← links)
- Kernelization hardness of connectivity problems in \(d\)-degenerate graphs (Q713308) (← links)
- A series whose sum range is an arbitrary finite set (Q5715405) (← links)
