Jakub Onufry Wojtaszczyk

Publication Activity (10 Years)

Years Active: 2003-2022
Publications (10 Years): 2

Top Topics

Partially Ordered

Approximation Schemes

Connected Subgraphs

Top Venues

SIAM J. Discret. Math.

ACM Trans. Comput. Theory

Theory Comput. Syst.

Publications

Marek Cygan, Jesper Nederlof, Marcin Pilipczuk, Michal Pilipczuk, Johan M. M. van Rooij, Jakub Onufry Wojtaszczyk
Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time. ACM Trans. Algorithms 18 (2) (2022)
Anna Adamaszek, Artur Czumaj, Andrzej Lingas, Jakub Onufry Wojtaszczyk
Approximation Schemes for Capacitated Geometric Network Design. SIAM J. Discret. Math. 32 (4) (2018)
Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Jakub Onufry Wojtaszczyk
Sitting Closer to Friends than Enemies, Revisited. Theory Comput. Syst. 56 (2) (2015)
Jacek Jendrej, Krzysztof Oleszkiewicz, Jakub Onufry Wojtaszczyk
On some extensions of the FKN theorem. Theory Comput. 11 (2015)
Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Jakub Onufry Wojtaszczyk
Solving the 2-Disjoint Connected Subgraphs Problem Faster than 2 n. Algorithmica 70 (2) (2014)
Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Jakub Onufry Wojtaszczyk
Scheduling Partially Ordered Jobs Faster than 2 n. Algorithmica 68 (3) (2014)
Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Jakub Onufry Wojtaszczyk
On multiway cut parameterized above lower bounds. ACM Trans. Comput. Theory 5 (1) (2013)
Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Jakub Onufry Wojtaszczyk
Subset Feedback Vertex Set Is Fixed-Parameter Tractable. SIAM J. Discret. Math. 27 (1) (2013)
Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Jakub Onufry Wojtaszczyk
An Improved FPT Algorithm and a Quadratic Kernel for Pathwidth One Vertex Deletion. Algorithmica 64 (1) (2012)
Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Jakub Onufry Wojtaszczyk
Solving the 2-Disjoint Connected Subgraphs Problem Faster Than 2 n. LATIN (2012)
Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Jakub Onufry Wojtaszczyk
Sitting Closer to Friends Than Enemies, Revisited. MFCS (2012)
Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Jakub Onufry Wojtaszczyk
Kernelization hardness of connectivity problems in d-degenerate graphs. Discret. Appl. Math. 160 (15) (2012)
Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Jakub Onufry Wojtaszczyk
A Polynomial Algorithm for 3-Compatible Coloring and the Stubborn List Partition Problem (The Stubborn Problem Is Stubborn No More). SIAM J. Comput. 41 (4) (2012)
Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Jakub Onufry Wojtaszczyk
Sitting closer to friends than enemies, revisited CoRR (2012)
Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Jakub Onufry Wojtaszczyk
On Multiway Cut Parameterized above Lower Bounds. IPEC (2011)
Daniel Binkele-Raible, Ljiljana Brankovic, Marek Cygan, Henning Fernau, Joachim Kneis, Dieter Kratsch, Alexander Langer, Mathieu Liedloff, Marcin Pilipczuk, Peter Rossmanith, Jakub Onufry Wojtaszczyk
-barrier for Irredundance: Two lines of attack. J. Discrete Algorithms 9 (3) (2011)
Marek Cygan, Jesper Nederlof, Marcin Pilipczuk, Michal Pilipczuk, Johan M. M. van Rooij, Jakub Onufry Wojtaszczyk
Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time. FOCS (2011)
Marek Cygan, Marcin Pilipczuk, Jakub Onufry Wojtaszczyk
). Inf. Process. Lett. 111 (23-24) (2011)
Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Jakub Onufry Wojtaszczyk
Subset Feedback Vertex Set Is Fixed-Parameter Tractable. ICALP (1) (2011)
Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Jakub Onufry Wojtaszczyk
The stubborn problem is stubborn no more (a polynomial algorithm for 3-compatible colouring and the stubborn list partition problem). SODA (2011)
Marek Cygan, Geevarghese Philip, Marcin Pilipczuk, Michal Pilipczuk, Jakub Onufry Wojtaszczyk
Dominating set is fixed parameter tractable in claw-free graphs. Theor. Comput. Sci. 412 (50) (2011)
Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Jakub Onufry Wojtaszczyk
Scheduling partially ordered jobs faster than 2^n CoRR (2011)
Marek Cygan, Jesper Nederlof, Marcin Pilipczuk, Michal Pilipczuk, Johan M. M. van Rooij, Jakub Onufry Wojtaszczyk
Solving connectivity problems parameterized by treewidth in single exponential time CoRR (2011)
Anna Adamaszek, Artur Czumaj, Andrzej Lingas, Jakub Onufry Wojtaszczyk
Approximation Schemes for Capacitated Geometric Network Design. ICALP (1) (2011)
Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Jakub Onufry Wojtaszczyk
On Multiway Cut parameterized above lower bounds CoRR (2011)
Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Jakub Onufry Wojtaszczyk
Scheduling Partially Ordered Jobs Faster Than 2 n. ESA (2011)
Marek Cygan, Marcin Pilipczuk, Jakub Onufry Wojtaszczyk
). CIAC (2010)
Marek Cygan, Marcin Pilipczuk, Jakub Onufry Wojtaszczyk
). SWAT (2010)
Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Jakub Onufry Wojtaszczyk
The stubborn problem is stubborn no more (a polynomial algorithm for 3-compatible colouring and the stubborn list partition problem) CoRR (2010)
Marek Cygan, Geevarghese Philip, Marcin Pilipczuk, Michal Pilipczuk, Jakub Onufry Wojtaszczyk
Dominating Set is Fixed Parameter Tractable in Claw-free Graphs CoRR (2010)
Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Jakub Onufry Wojtaszczyk
Subset feedback vertex set is fixed parameter tractable CoRR (2010)
Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Jakub Onufry Wojtaszczyk
An Improved FPT Algorithm and Quadratic Kernel for Pathwidth One Vertex Deletion. IPEC (2010)
Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Jakub Onufry Wojtaszczyk
-Degenerate Graphs. WG (2010)
Marek Cygan, Marcin Pilipczuk, Jakub Onufry Wojtaszczyk
Beyond O*(2^n) in domination-type problems CoRR (2009)
Jakub Onufry Wojtaszczyk
) is not strongly tractable. J. Complex. 19 (5) (2003)