Jakub Onufry Wojtaszczyk

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