Jakub Onufry Wojtaszczyk
Phd in probability theory and Masters in CS obtained at Warsaw University. Publications in diverse fields of mathematics (functional analysis, probability theory, complexity theory) and CS (moderately exponential algorithms, graph algorithms, CSP)
Research Areas
Authored Publications
Sort By
Google
Solving the 2-disjoint connected subgraphs problem faster than 2n
Preview
Marek Cygan
Marcin Pilipczuk
Michal Pilipczuk
Proceedings of the 10th Latin American international conference on Theoretical Informatics, Springer-Verlag, Berlin, Heidelberg (2012), pp. 195-206
On multiway cut parameterized above lower bounds
Preview
Marek Cygan
Marcin Pilipczuk
Michal Pilipczuk
Proceedings of the 6th international conference on Parameterized and Exact Computation, Springer-Verlag, Berlin, Heidelberg (2012), pp. 1-12
Approximation Schemes for Capacitated Geometric Network Design
Anna Adamaszek
Artur Czumaj
Andrzej Lingas
ICALP 2011, Rynek Główny 12 (to appear)
Solving connectivity problems parameterized by treewidth in single exponential time
Marek Cygan
Jesper Nederlof
Marcin Pilipczuk
Michał Pilipczuk
Johann M. M. van Rooij
Foundations of Computer Science 2011, Rynek Główny 12 (to appear)
