Multivariate integration in Cinfinity([0, 1]d) is not strongly tractable. - Jakub Onufry Wojtaszczyk (J. Complex., 2003)

Beyond O*(2^n) in domination-type problems - Marek Cygan; Marcin Pilipczuk; Jakub Onufry Wojtaszczyk (CoRR, 2009)

Irredundant Set Faster Than O(2n). - Marek Cygan; Marcin Pilipczuk; Jakub Onufry Wojtaszczyk (CIAC, 2010)

Capacitated Domination Faster Than O(2n). - Marek Cygan; Marcin Pilipczuk; Jakub Onufry Wojtaszczyk (SWAT, 2010)

Kernelization Hardness of Connectivity Problems in d-Degenerate Graphs. - Marek Cygan; Marcin Pilipczuk; Michal Pilipczuk; Jakub Onufry Wojtaszczyk (WG, 2010)

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 (SODA, 2011)

Capacitated domination faster than O(n2). - Marek Cygan; Marcin Pilipczuk; Jakub Onufry Wojtaszczyk (Inf. Process. Lett., 2011)

Breaking the 2n-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)

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)

An Improved FPT Algorithm and a Quadratic Kernel for Pathwidth One Vertex Deletion. - Marek Cygan; Marcin Pilipczuk; Michal Pilipczuk; Jakub Onufry Wojtaszczyk (Algorithmica, 2012)

Kernelization hardness of connectivity problems in d-degenerate graphs. - Marek Cygan; Marcin Pilipczuk; Michal Pilipczuk; Jakub Onufry Wojtaszczyk (Discret. Appl. Math., 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)

Subset Feedback Vertex Set Is Fixed-Parameter Tractable. - Marek Cygan; Marcin Pilipczuk; Michal Pilipczuk; Jakub Onufry Wojtaszczyk (SIAM J. Discret. Math., 2013)

On multiway cut parameterized above lower bounds. - Marek Cygan; Marcin Pilipczuk; Michal Pilipczuk; Jakub Onufry Wojtaszczyk (ACM Trans. Comput. Theory, 2013)

Scheduling Partially Ordered Jobs Faster than 2 n. - Marek Cygan; Marcin Pilipczuk; Michal Pilipczuk; Jakub Onufry Wojtaszczyk (Algorithmica, 2014)

Solving the 2-Disjoint Connected Subgraphs Problem Faster than 2 n. - Marek Cygan; Marcin Pilipczuk; Michal Pilipczuk; Jakub Onufry Wojtaszczyk (Algorithmica, 2014)

Sitting Closer to Friends than Enemies, Revisited. - Marek Cygan; Marcin Pilipczuk; Michal Pilipczuk; Jakub Onufry Wojtaszczyk (Theory Comput. Syst., 2015)

On some extensions of the FKN theorem. - Jacek Jendrej; Krzysztof Oleszkiewicz; Jakub Onufry Wojtaszczyk (Theory Comput., 2015)

Approximation Schemes for Capacitated Geometric Network Design. - Anna Adamaszek; Artur Czumaj; Andrzej Lingas; Jakub Onufry Wojtaszczyk (SIAM J. Discret. Math., 2018)

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 (ACM Trans. Algorithms, 2022)