The following pages link to Jakub Onufry Wojtaszczyk (Q486987):
Displaying 21 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)
- The negative association property for the absolute values of random variables equidistributed on a generalized Orlicz ball (Q941694) (← links)
- Multivariate integration in \(C^{\infty}([0,1]^{d})\) is not strongly tractable. (Q1426049) (← links)
- An improved FPT algorithm and a quadratic kernel for pathwidth one vertex deletion (Q1759683) (← links)
- Capacitated domination faster than \(O(2^n)\) (Q1944213) (← links)
- Sitting closer to friends than enemies, revisited (Q2345988) (← links)
- On Multiway Cut Parameterized above Lower Bounds (Q2891333) (← links)
- Solving the 2-Disjoint Connected Subgraphs Problem Faster Than 2 n (Q2894465) (← links)
- Sitting Closer to Friends Than Enemies, Revisited (Q2912728) (← links)
- Approximation Schemes for Capacitated Geometric Network Design (Q3012789) (← links)
- Subset Feedback Vertex Set Is Fixed-Parameter Tractable (Q3012825) (← links)
- Kernelization Hardness of Connectivity Problems in d-Degenerate Graphs (Q3057621) (← links)
- An Improved FPT Algorithm and Quadratic Kernel for Pathwidth One Vertex Deletion (Q3058695) (← links)
- No return to convexity (Q3080025) (← links)
- Scheduling Partially Ordered Jobs Faster Than 2 n (Q3092238) (← links)
- A Polynomial Algorithm for 3-Compatible Coloring and the Stubborn List Partition Problem (The Stubborn Problem Is Stubborn No More) (Q3143294) (← links)
- A series whose sum range is an arbitrary finite set (Q5715405) (← links)
