Jakub Onufry Wojtaszczyk

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

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

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

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.
Discrete Applied Mathematics, 2012

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

Sitting Closer to Friends Than Enemies, Revisited.
Proceedings of the Mathematical Foundations of Computer Science 2012, 2012

Solving the 2-Disjoint Connected Subgraphs Problem Faster Than 2 n.
Proceedings of the LATIN 2012: Theoretical Informatics, 2012

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

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

Capacitated domination faster than O(n2).
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

On Multiway Cut Parameterized above Lower Bounds.
Proceedings of the Parameterized and Exact Computation - 6th International Symposium, 2011

Subset Feedback Vertex Set Is Fixed-Parameter Tractable.
Proceedings of the Automata, Languages and Programming - 38th International Colloquium, 2011

Approximation Schemes for Capacitated Geometric Network Design.
Proceedings of the Automata, Languages and Programming - 38th International Colloquium, 2011

Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time.
Proceedings of the IEEE 52nd Annual Symposium on Foundations of Computer Science, 2011

Scheduling Partially Ordered Jobs Faster Than 2 n.
Proceedings of the Algorithms - ESA 2011, 2011

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

Capacitated Domination Faster Than O(2n).
Proceedings of the Algorithm Theory, 2010

An Improved FPT Algorithm and Quadratic Kernel for Pathwidth One Vertex Deletion.
Proceedings of the Parameterized and Exact Computation - 5th International Symposium, 2010

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

2003
Multivariate integration in Cinfinity([0, 1]d) is not strongly tractable.
J. Complexity, 2003


  Loading...