% csauthors.net - beta - BibTeX bibliography of Jakub Onufry Wojtaszczyk
@article{journals/jc/Wojtaszczyk03,
title = {Multivariate integration in Cinfinity([0, 1]d) is not strongly tractable.},
year = {2003},
journal = {J. Complex.},
author = {{Jakub Onufry Wojtaszczyk}}
}
@article{journals/corr/abs-0909-4021,
title = {Beyond O*(2^n) in domination-type problems},
year = {2009},
journal = {CoRR},
author = {{Marek Cygan} and {Marcin Pilipczuk} and {Jakub Onufry Wojtaszczyk}}
}
@inproceedings{conf/ciac/CyganPW10,
title = {Irredundant Set Faster Than O(2n).},
year = {2010},
booktitle = {CIAC},
author = {{Marek Cygan} and {Marcin Pilipczuk} and {Jakub Onufry Wojtaszczyk}},
publisher = {Springer},
booktitle = {Algorithms and Complexity, 7th International Conference, CIAC 2010, Rome, Italy, May 26-28, 2010. Proceedings}
}
@inproceedings{conf/swat/CyganPW10,
title = {Capacitated Domination Faster Than O(2n).},
year = {2010},
booktitle = {SWAT},
author = {{Marek Cygan} and {Marcin Pilipczuk} and {Jakub Onufry Wojtaszczyk}},
publisher = {Springer},
booktitle = {Algorithm Theory - SWAT 2010, 12th Scandinavian Symposium and Workshops on Algorithm Theory, Bergen, Norway, June 21-23, 2010. Proceedings}
}
@inproceedings{conf/wg/CyganPPW10,
title = {Kernelization Hardness of Connectivity Problems in d-Degenerate Graphs.},
year = {2010},
booktitle = {WG},
author = {{Marek Cygan} and {Marcin Pilipczuk} and {Michal Pilipczuk} and {Jakub Onufry Wojtaszczyk}},
booktitle = {Graph Theoretic Concepts in Computer Science - 36th International Workshop, WG 2010, Zarós, Crete, Greece, June 28-30, 2010 Revised Papers}
}
@inproceedings{conf/soda/CyganPPW11,
title = {The stubborn problem is stubborn no more (a polynomial algorithm for 3-compatible colouring and the stubborn list partition problem).},
year = {2011},
booktitle = {SODA},
author = {{Marek Cygan} and {Marcin Pilipczuk} and {Michal Pilipczuk} and {Jakub Onufry Wojtaszczyk}},
publisher = {SIAM},
booktitle = {Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2011, San Francisco, California, USA, January 23-25, 2011}
}
@article{journals/ipl/CyganPW11,
title = {Capacitated domination faster than O(n2).},
year = {2011},
journal = {Inf. Process. Lett.},
author = {{Marek Cygan} and {Marcin Pilipczuk} and {Jakub Onufry Wojtaszczyk}}
}
@article{journals/jda/Binkele-RaibleBCFKKLLPRW11,
title = {Breaking the 2n-barrier for Irredundance: Two lines of attack.},
year = {2011},
journal = {J. Discrete Algorithms},
author = {{Daniel Binkele-Raible} and {Ljiljana Brankovic} and {Marek Cygan} and {Henning Fernau} and {Joachim Kneis} and {Dieter Kratsch} and {Alexander Langer} and {Mathieu Liedloff} and {Marcin Pilipczuk} and {Peter Rossmanith} and {Jakub Onufry Wojtaszczyk}}
}
@article{journals/tcs/CyganPPPW11,
title = {Dominating set is fixed parameter tractable in claw-free graphs.},
year = {2011},
journal = {Theor. Comput. Sci.},
author = {{Marek Cygan} and {Geevarghese Philip} and {Marcin Pilipczuk} and {Michal Pilipczuk} and {Jakub Onufry Wojtaszczyk}}
}
@article{journals/algorithmica/CyganPPW12,
title = {An Improved FPT Algorithm and a Quadratic Kernel for Pathwidth One Vertex Deletion.},
year = {2012},
journal = {Algorithmica},
author = {{Marek Cygan} and {Marcin Pilipczuk} and {Michal Pilipczuk} and {Jakub Onufry Wojtaszczyk}}
}
@article{journals/dam/CyganPPW12,
title = {Kernelization hardness of connectivity problems in d-degenerate graphs.},
year = {2012},
journal = {Discret. Appl. Math.},
author = {{Marek Cygan} and {Marcin Pilipczuk} and {Michal Pilipczuk} and {Jakub Onufry Wojtaszczyk}}
}
@article{journals/siamcomp/CyganPPW12,
title = {A Polynomial Algorithm for 3-Compatible Coloring and the Stubborn List Partition Problem (The Stubborn Problem Is Stubborn No More).},
year = {2012},
journal = {SIAM J. Comput.},
author = {{Marek Cygan} and {Marcin Pilipczuk} and {Michal Pilipczuk} and {Jakub Onufry Wojtaszczyk}}
}
@article{journals/siamdm/CyganPPW13,
title = {Subset Feedback Vertex Set Is Fixed-Parameter Tractable.},
year = {2013},
journal = {SIAM J. Discret. Math.},
author = {{Marek Cygan} and {Marcin Pilipczuk} and {Michal Pilipczuk} and {Jakub Onufry Wojtaszczyk}}
}
@article{journals/toct/CyganPPW13,
title = {On multiway cut parameterized above lower bounds.},
year = {2013},
journal = {ACM Trans. Comput. Theory},
author = {{Marek Cygan} and {Marcin Pilipczuk} and {Michal Pilipczuk} and {Jakub Onufry Wojtaszczyk}}
}
@article{journals/algorithmica/CyganPPW14,
title = {Scheduling Partially Ordered Jobs Faster than 2 n.},
year = {2014},
journal = {Algorithmica},
author = {{Marek Cygan} and {Marcin Pilipczuk} and {Michal Pilipczuk} and {Jakub Onufry Wojtaszczyk}}
}
@article{journals/algorithmica/CyganPPW14a,
title = {Solving the 2-Disjoint Connected Subgraphs Problem Faster than 2 n.},
year = {2014},
journal = {Algorithmica},
author = {{Marek Cygan} and {Marcin Pilipczuk} and {Michal Pilipczuk} and {Jakub Onufry Wojtaszczyk}}
}
@article{journals/mst/CyganPPW15,
title = {Sitting Closer to Friends than Enemies, Revisited.},
year = {2015},
journal = {Theory Comput. Syst.},
author = {{Marek Cygan} and {Marcin Pilipczuk} and {Michal Pilipczuk} and {Jakub Onufry Wojtaszczyk}}
}
@article{journals/toc/JendrejOW15,
title = {On some extensions of the FKN theorem.},
year = {2015},
journal = {Theory Comput.},
author = {{Jacek Jendrej} and {Krzysztof Oleszkiewicz} and {Jakub Onufry Wojtaszczyk}}
}
@article{journals/siamdm/AdamaszekCLW18,
title = {Approximation Schemes for Capacitated Geometric Network Design.},
year = {2018},
journal = {SIAM J. Discret. Math.},
author = {{Anna Adamaszek} and {Artur Czumaj} and {Andrzej Lingas} and {Jakub Onufry Wojtaszczyk}}
}
@article{journals/talg/CyganNPPRW22,
title = {Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time.},
year = {2022},
journal = {ACM Trans. Algorithms},
author = {{Marek Cygan} and {Jesper Nederlof} and {Marcin Pilipczuk} and {Michal Pilipczuk} and {Johan M. M. van Rooij} and {Jakub Onufry Wojtaszczyk}}
}