Jakub Onufry Wojtaszczyk

According to our database, Jakub Onufry Wojtaszczyk authored at least 20 papers between 2003 and 2015.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2015

On some extensions of the FKN theorem.

Jacek Jendrej, Krzysztof Oleszkiewicz, Jakub Onufry Wojtaszczyk

Theory Comput., 2015

2012

A Polynomial Algorithm for 3-Compatible Coloring and the Stubborn List Partition Problem (The Stubborn Problem Is Stubborn No More).

Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Jakub Onufry Wojtaszczyk

SIAM J. Comput., 2012

Kernelization hardness of connectivity problems in d-degenerate graphs.

Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Jakub Onufry Wojtaszczyk

Discret. Appl. Math., 2012

Sitting Closer to Friends Than Enemies, Revisited.

Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Jakub Onufry Wojtaszczyk

Proceedings of the Mathematical Foundations of Computer Science 2012, 2012

Solving the 2-Disjoint Connected Subgraphs Problem Faster Than 2 n.

Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Jakub Onufry Wojtaszczyk

Proceedings of the LATIN 2012: Theoretical Informatics, 2012

2011

Dominating set is fixed parameter tractable in claw-free graphs.

Marek Cygan, Geevarghese Philip, Marcin Pilipczuk, Michal Pilipczuk, Jakub Onufry Wojtaszczyk

Theor. Comput. Sci., 2011

Breaking the 2ⁿ-barrier for Irredundance: Two lines of attack.

Daniel Binkele-Raible, Ljiljana Brankovic, Marek Cygan, Henning Fernau, Joachim Kneis, Dieter Kratsch, Alexander Langer, Mathieu Liedloff, Marcin Pilipczuk, Peter Rossmanith, Jakub Onufry Wojtaszczyk

J. Discrete Algorithms, 2011

Capacitated domination faster than <i>O</i>(<i>n</i>²).

Marek Cygan, Marcin Pilipczuk, Jakub Onufry Wojtaszczyk

Inf. Process. Lett., 2011

The stubborn problem is stubborn no more (a polynomial algorithm for 3-compatible colouring and the stubborn list partition problem).

Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Jakub Onufry Wojtaszczyk

Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011

On Multiway Cut Parameterized above Lower Bounds.

Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Jakub Onufry Wojtaszczyk

Proceedings of the Parameterized and Exact Computation - 6th International Symposium, 2011

Subset Feedback Vertex Set Is Fixed-Parameter Tractable.

Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Jakub Onufry Wojtaszczyk

Proceedings of the Automata, Languages and Programming - 38th International Colloquium, 2011

Approximation Schemes for Capacitated Geometric Network Design.

Anna Adamaszek, Artur Czumaj, Andrzej Lingas, Jakub Onufry Wojtaszczyk

Proceedings of the Automata, Languages and Programming - 38th International Colloquium, 2011

Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time.

Marek Cygan, Jesper Nederlof, Marcin Pilipczuk, Michal Pilipczuk, Johan M. M. van Rooij, Jakub Onufry Wojtaszczyk

Proceedings of the IEEE 52nd Annual Symposium on Foundations of Computer Science, 2011

Scheduling Partially Ordered Jobs Faster Than 2 n.

Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Jakub Onufry Wojtaszczyk

Proceedings of the Algorithms - ESA 2011, 2011

2010

Kernelization Hardness of Connectivity Problems in <i>d</i>-Degenerate Graphs.

Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Jakub Onufry Wojtaszczyk

Proceedings of the Graph Theoretic Concepts in Computer Science, 2010

Capacitated Domination Faster Than <i>O</i>(2^<i>n</i>).

Marek Cygan, Marcin Pilipczuk, Jakub Onufry Wojtaszczyk

Proceedings of the Algorithm Theory, 2010

An Improved FPT Algorithm and Quadratic Kernel for Pathwidth One Vertex Deletion.

Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Jakub Onufry Wojtaszczyk

Proceedings of the Parameterized and Exact Computation - 5th International Symposium, 2010

Irredundant Set Faster Than <i>O</i>(2^<i>n</i>).

Marek Cygan, Marcin Pilipczuk, Jakub Onufry Wojtaszczyk

Proceedings of the Algorithms and Complexity, 7th International Conference, 2010

2009

Beyond O*(2^n) in domination-type problems

Marek Cygan, Marcin Pilipczuk, Jakub Onufry Wojtaszczyk

CoRR, 2009

2003

Multivariate integration in <i>C</i>^infinity([0, 1]^d) is not strongly tractable.

Jakub Onufry Wojtaszczyk

J. Complex., 2003