Jakub Onufry Wojtaszczyk

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

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2022
Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time.
ACM Trans. Algorithms, 2022

2018
Approximation Schemes for Capacitated Geometric Network Design.
SIAM J. Discret. Math., 2018

2015
On some extensions of the FKN theorem.
Theory Comput., 2015

Sitting Closer to Friends than Enemies, Revisited.
Theory Comput. Syst., 2015

2014
Solving the 2-Disjoint Connected Subgraphs Problem Faster than 2 n.
Algorithmica, 2014

Scheduling Partially Ordered Jobs Faster than 2 n.
Algorithmica, 2014

2013
On multiway cut parameterized above lower bounds.
ACM Trans. Comput. Theory, 2013

Subset Feedback Vertex Set Is Fixed-Parameter Tractable.
SIAM J. Discret. Math., 2013

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

Kernelization hardness of connectivity problems in d-degenerate graphs.
Discret. Appl. Math., 2012

An Improved FPT Algorithm and a Quadratic Kernel for Pathwidth One Vertex Deletion.
Algorithmica, 2012

2011
Dominating set is fixed parameter tractable in claw-free graphs.
Theor. Comput. Sci., 2011

Breaking the 2<sup>n</sup>-barrier for Irredundance: Two lines of attack.
J. Discrete Algorithms, 2011

Capacitated domination faster than <i>O</i>(<i>n</i><sup>2</sup>).
Inf. Process. Lett., 2011

The stubborn problem is stubborn no more (a polynomial algorithm for 3-compatible colouring and the stubborn list partition problem).
Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011

2010
Kernelization Hardness of Connectivity Problems in <i>d</i>-Degenerate Graphs.
Proceedings of the Graph Theoretic Concepts in Computer Science, 2010

Capacitated Domination Faster Than <i>O</i>(2<sup><i>n</i></sup>).
Proceedings of the Algorithm Theory, 2010

Irredundant Set Faster Than <i>O</i>(2<sup><i>n</i></sup>).
Proceedings of the Algorithms and Complexity, 7th International Conference, 2010

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

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


  Loading...