Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Jakub Onufry Wojtaszczyk
@article{DBLP:journals/talg/CyganNPPRW22,
author = {Marek Cygan and
Jesper Nederlof and
Marcin Pilipczuk and
Michal Pilipczuk and
Johan M. M. van Rooij and
Jakub Onufry Wojtaszczyk},
title = {Solving Connectivity Problems Parameterized by Treewidth in Single
Exponential Time},
journal = {{ACM} Trans. Algorithms},
volume = {18},
number = {2},
pages = {17:1--17:31},
year = {2022},
url = {https://doi.org/10.1145/3506707},
doi = {10.1145/3506707},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/talg/CyganNPPRW22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/AdamaszekCLW18,
author = {Anna Adamaszek and
Artur Czumaj and
Andrzej Lingas and
Jakub Onufry Wojtaszczyk},
title = {Approximation Schemes for Capacitated Geometric Network Design},
journal = {{SIAM} J. Discret. Math.},
volume = {32},
number = {4},
pages = {2720--2746},
year = {2018},
url = {https://doi.org/10.1137/16M1108005},
doi = {10.1137/16M1108005},
timestamp = {Tue, 16 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/AdamaszekCLW18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/CyganPPW15,
author = {Marek Cygan and
Marcin Pilipczuk and
Michal Pilipczuk and
Jakub Onufry Wojtaszczyk},
title = {Sitting Closer to Friends than Enemies, Revisited},
journal = {Theory Comput. Syst.},
volume = {56},
number = {2},
pages = {394--405},
year = {2015},
url = {https://doi.org/10.1007/s00224-014-9558-4},
doi = {10.1007/S00224-014-9558-4},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/CyganPPW15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toc/JendrejOW15,
author = {Jacek Jendrej and
Krzysztof Oleszkiewicz and
Jakub Onufry Wojtaszczyk},
title = {On some extensions of the {FKN} theorem},
journal = {Theory Comput.},
volume = {11},
pages = {445--469},
year = {2015},
url = {https://doi.org/10.4086/toc.2015.v011a018},
doi = {10.4086/TOC.2015.V011A018},
timestamp = {Sun, 21 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/toc/JendrejOW15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/CyganPPW14,
author = {Marek Cygan and
Marcin Pilipczuk and
Michal Pilipczuk and
Jakub Onufry Wojtaszczyk},
title = {Scheduling Partially Ordered Jobs Faster than 2 n},
journal = {Algorithmica},
volume = {68},
number = {3},
pages = {692--714},
year = {2014},
url = {https://doi.org/10.1007/s00453-012-9694-7},
doi = {10.1007/S00453-012-9694-7},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/CyganPPW14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/CyganPPW14a,
author = {Marek Cygan and
Marcin Pilipczuk and
Michal Pilipczuk and
Jakub Onufry Wojtaszczyk},
title = {Solving the 2-Disjoint Connected Subgraphs Problem Faster than 2 n},
journal = {Algorithmica},
volume = {70},
number = {2},
pages = {195--207},
year = {2014},
url = {https://doi.org/10.1007/s00453-013-9796-x},
doi = {10.1007/S00453-013-9796-X},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/CyganPPW14a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/CyganPPW13,
author = {Marek Cygan and
Marcin Pilipczuk and
Michal Pilipczuk and
Jakub Onufry Wojtaszczyk},
title = {Subset Feedback Vertex Set Is Fixed-Parameter Tractable},
journal = {{SIAM} J. Discret. Math.},
volume = {27},
number = {1},
pages = {290--309},
year = {2013},
url = {https://doi.org/10.1137/110843071},
doi = {10.1137/110843071},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/CyganPPW13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toct/CyganPPW13,
author = {Marek Cygan and
Marcin Pilipczuk and
Michal Pilipczuk and
Jakub Onufry Wojtaszczyk},
title = {On multiway cut parameterized above lower bounds},
journal = {{ACM} Trans. Comput. Theory},
volume = {5},
number = {1},
pages = {3:1--3:11},
year = {2013},
url = {https://doi.org/10.1145/2462896.2462899},
doi = {10.1145/2462896.2462899},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/toct/CyganPPW13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/CyganPPW12,
author = {Marek Cygan and
Marcin Pilipczuk and
Michal Pilipczuk and
Jakub Onufry Wojtaszczyk},
title = {An Improved {FPT} Algorithm and a Quadratic Kernel for Pathwidth One
Vertex Deletion},
journal = {Algorithmica},
volume = {64},
number = {1},
pages = {170--188},
year = {2012},
url = {https://doi.org/10.1007/s00453-011-9578-2},
doi = {10.1007/S00453-011-9578-2},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/CyganPPW12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/CyganPPW12,
author = {Marek Cygan and
Marcin Pilipczuk and
Michal Pilipczuk and
Jakub Onufry Wojtaszczyk},
title = {Kernelization hardness of connectivity problems in d-degenerate graphs},
journal = {Discret. Appl. Math.},
volume = {160},
number = {15},
pages = {2131--2141},
year = {2012},
url = {https://doi.org/10.1016/j.dam.2012.05.016},
doi = {10.1016/J.DAM.2012.05.016},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/CyganPPW12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/CyganPPW12,
author = {Marek Cygan and
Marcin Pilipczuk and
Michal Pilipczuk and
Jakub Onufry Wojtaszczyk},
title = {A Polynomial Algorithm for 3-Compatible Coloring and the Stubborn
List Partition Problem (The Stubborn Problem Is Stubborn No More)},
journal = {{SIAM} J. Comput.},
volume = {41},
number = {4},
pages = {815--828},
year = {2012},
url = {https://doi.org/10.1137/110826813},
doi = {10.1137/110826813},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/CyganPPW12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/latin/CyganPPW12,
author = {Marek Cygan and
Marcin Pilipczuk and
Michal Pilipczuk and
Jakub Onufry Wojtaszczyk},
editor = {David Fern{\'{a}}ndez{-}Baca},
title = {Solving the 2-Disjoint Connected Subgraphs Problem Faster Than 2 n},
booktitle = {{LATIN} 2012: Theoretical Informatics - 10th Latin American Symposium,
Arequipa, Peru, April 16-20, 2012. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7256},
pages = {195--206},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-29344-3\_17},
doi = {10.1007/978-3-642-29344-3\_17},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/latin/CyganPPW12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/CyganPPW12,
author = {Marek Cygan and
Marcin Pilipczuk and
Michal Pilipczuk and
Jakub Onufry Wojtaszczyk},
editor = {Branislav Rovan and
Vladimiro Sassone and
Peter Widmayer},
title = {Sitting Closer to Friends Than Enemies, Revisited},
booktitle = {Mathematical Foundations of Computer Science 2012 - 37th International
Symposium, {MFCS} 2012, Bratislava, Slovakia, August 27-31, 2012.
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7464},
pages = {296--307},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-32589-2\_28},
doi = {10.1007/978-3-642-32589-2\_28},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/CyganPPW12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1201-1869,
author = {Marek Cygan and
Marcin Pilipczuk and
Michal Pilipczuk and
Jakub Onufry Wojtaszczyk},
title = {Sitting closer to friends than enemies, revisited},
journal = {CoRR},
volume = {abs/1201.1869},
year = {2012},
url = {http://arxiv.org/abs/1201.1869},
eprinttype = {arXiv},
eprint = {1201.1869},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1201-1869.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/CyganPW11,
author = {Marek Cygan and
Marcin Pilipczuk and
Jakub Onufry Wojtaszczyk},
title = {Capacitated domination faster than \emph{O}(\emph{n}\({}^{\mbox{2}}\))},
journal = {Inf. Process. Lett.},
volume = {111},
number = {23-24},
pages = {1099--1103},
year = {2011},
url = {https://doi.org/10.1016/j.ipl.2011.09.004},
doi = {10.1016/J.IPL.2011.09.004},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/CyganPW11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/Binkele-RaibleBCFKKLLPRW11,
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},
title = {Breaking the 2\({}^{\mbox{n}}\)-barrier for Irredundance: Two lines
of attack},
journal = {J. Discrete Algorithms},
volume = {9},
number = {3},
pages = {214--230},
year = {2011},
url = {https://doi.org/10.1016/j.jda.2011.03.002},
doi = {10.1016/J.JDA.2011.03.002},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/Binkele-RaibleBCFKKLLPRW11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/CyganPPPW11,
author = {Marek Cygan and
Geevarghese Philip and
Marcin Pilipczuk and
Michal Pilipczuk and
Jakub Onufry Wojtaszczyk},
title = {Dominating set is fixed parameter tractable in claw-free graphs},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {50},
pages = {6982--7000},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.09.010},
doi = {10.1016/J.TCS.2011.09.010},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/CyganPPPW11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/CyganPPW11,
author = {Marek Cygan and
Marcin Pilipczuk and
Michal Pilipczuk and
Jakub Onufry Wojtaszczyk},
editor = {Camil Demetrescu and
Magn{\'{u}}s M. Halld{\'{o}}rsson},
title = {Scheduling Partially Ordered Jobs Faster Than 2 n},
booktitle = {Algorithms - {ESA} 2011 - 19th Annual European Symposium, Saarbr{\"{u}}cken,
Germany, September 5-9, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6942},
pages = {299--310},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-23719-5\_26},
doi = {10.1007/978-3-642-23719-5\_26},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/esa/CyganPPW11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/CyganNPPRW11,
author = {Marek Cygan and
Jesper Nederlof and
Marcin Pilipczuk and
Michal Pilipczuk and
Johan M. M. van Rooij and
Jakub Onufry Wojtaszczyk},
editor = {Rafail Ostrovsky},
title = {Solving Connectivity Problems Parameterized by Treewidth in Single
Exponential Time},
booktitle = {{IEEE} 52nd Annual Symposium on Foundations of Computer Science, {FOCS}
2011, Palm Springs, CA, USA, October 22-25, 2011},
pages = {150--159},
publisher = {{IEEE} Computer Society},
year = {2011},
url = {https://doi.org/10.1109/FOCS.2011.23},
doi = {10.1109/FOCS.2011.23},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/CyganNPPRW11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/AdamaszekCLW11,
author = {Anna Adamaszek and
Artur Czumaj and
Andrzej Lingas and
Jakub Onufry Wojtaszczyk},
editor = {Luca Aceto and
Monika Henzinger and
Jir{\'{\i}} Sgall},
title = {Approximation Schemes for Capacitated Geometric Network Design},
booktitle = {Automata, Languages and Programming - 38th International Colloquium,
{ICALP} 2011, Zurich, Switzerland, July 4-8, 2011, Proceedings, Part
{I}},
series = {Lecture Notes in Computer Science},
volume = {6755},
pages = {25--36},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-22006-7\_3},
doi = {10.1007/978-3-642-22006-7\_3},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/AdamaszekCLW11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/CyganPPW11,
author = {Marek Cygan and
Marcin Pilipczuk and
Michal Pilipczuk and
Jakub Onufry Wojtaszczyk},
editor = {Luca Aceto and
Monika Henzinger and
Jir{\'{\i}} Sgall},
title = {Subset Feedback Vertex Set Is Fixed-Parameter Tractable},
booktitle = {Automata, Languages and Programming - 38th International Colloquium,
{ICALP} 2011, Zurich, Switzerland, July 4-8, 2011, Proceedings, Part
{I}},
series = {Lecture Notes in Computer Science},
volume = {6755},
pages = {449--461},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-22006-7\_38},
doi = {10.1007/978-3-642-22006-7\_38},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/CyganPPW11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/CyganPPW11,
author = {Marek Cygan and
Marcin Pilipczuk and
Michal Pilipczuk and
Jakub Onufry Wojtaszczyk},
editor = {D{\'{a}}niel Marx and
Peter Rossmanith},
title = {On Multiway Cut Parameterized above Lower Bounds},
booktitle = {Parameterized and Exact Computation - 6th International Symposium,
{IPEC} 2011, Saarbr{\"{u}}cken, Germany, September 6-8, 2011.
Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {7112},
pages = {1--12},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-28050-4\_1},
doi = {10.1007/978-3-642-28050-4\_1},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/iwpec/CyganPPW11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/CyganPPW11,
author = {Marek Cygan and
Marcin Pilipczuk and
Michal Pilipczuk and
Jakub Onufry Wojtaszczyk},
editor = {Dana Randall},
title = {The stubborn problem is stubborn no more (a polynomial algorithm for
3-compatible colouring and the stubborn list partition problem)},
booktitle = {Proceedings of the Twenty-Second Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2011, San Francisco, California, USA, January 23-25,
2011},
pages = {1666--1674},
publisher = {{SIAM}},
year = {2011},
url = {https://doi.org/10.1137/1.9781611973082.128},
doi = {10.1137/1.9781611973082.128},
timestamp = {Tue, 02 Feb 2021 17:07:23 +0100},
biburl = {https://dblp.org/rec/conf/soda/CyganPPW11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1103-0534,
author = {Marek Cygan and
Jesper Nederlof and
Marcin Pilipczuk and
Michal Pilipczuk and
Johan M. M. van Rooij and
Jakub Onufry Wojtaszczyk},
title = {Solving connectivity problems parameterized by treewidth in single
exponential time},
journal = {CoRR},
volume = {abs/1103.0534},
year = {2011},
url = {http://arxiv.org/abs/1103.0534},
eprinttype = {arXiv},
eprint = {1103.0534},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1103-0534.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1107-1585,
author = {Marek Cygan and
Marcin Pilipczuk and
Michal Pilipczuk and
Jakub Onufry Wojtaszczyk},
title = {On Multiway Cut parameterized above lower bounds},
journal = {CoRR},
volume = {abs/1107.1585},
year = {2011},
url = {http://arxiv.org/abs/1107.1585},
eprinttype = {arXiv},
eprint = {1107.1585},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1107-1585.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1108-0810,
author = {Marek Cygan and
Marcin Pilipczuk and
Michal Pilipczuk and
Jakub Onufry Wojtaszczyk},
title = {Scheduling partially ordered jobs faster than 2{\^{}}n},
journal = {CoRR},
volume = {abs/1108.0810},
year = {2011},
url = {http://arxiv.org/abs/1108.0810},
eprinttype = {arXiv},
eprint = {1108.0810},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1108-0810.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/CyganPW10,
author = {Marek Cygan and
Marcin Pilipczuk and
Jakub Onufry Wojtaszczyk},
editor = {Tiziana Calamoneri and
Josep D{\'{\i}}az},
title = {Irredundant Set Faster Than \emph{O}(2\({}^{\mbox{\emph{n}}}\))},
booktitle = {Algorithms and Complexity, 7th International Conference, {CIAC} 2010,
Rome, Italy, May 26-28, 2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6078},
pages = {288--298},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-13073-1\_26},
doi = {10.1007/978-3-642-13073-1\_26},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/CyganPW10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/CyganPPW10,
author = {Marek Cygan and
Marcin Pilipczuk and
Michal Pilipczuk and
Jakub Onufry Wojtaszczyk},
editor = {Venkatesh Raman and
Saket Saurabh},
title = {An Improved {FPT} Algorithm and Quadratic Kernel for Pathwidth One
Vertex Deletion},
booktitle = {Parameterized and Exact Computation - 5th International Symposium,
{IPEC} 2010, Chennai, India, December 13-15, 2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6478},
pages = {95--106},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-17493-3\_11},
doi = {10.1007/978-3-642-17493-3\_11},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/iwpec/CyganPPW10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/CyganPW10,
author = {Marek Cygan and
Marcin Pilipczuk and
Jakub Onufry Wojtaszczyk},
editor = {Haim Kaplan},
title = {Capacitated Domination Faster Than \emph{O}(2\({}^{\mbox{\emph{n}}}\))},
booktitle = {Algorithm Theory - {SWAT} 2010, 12th Scandinavian Symposium and Workshops
on Algorithm Theory, Bergen, Norway, June 21-23, 2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6139},
pages = {74--80},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-13731-0\_8},
doi = {10.1007/978-3-642-13731-0\_8},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/CyganPW10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/CyganPPW10,
author = {Marek Cygan and
Marcin Pilipczuk and
Michal Pilipczuk and
Jakub Onufry Wojtaszczyk},
editor = {Dimitrios M. Thilikos},
title = {Kernelization Hardness of Connectivity Problems in \emph{d}-Degenerate
Graphs},
booktitle = {Graph Theoretic Concepts in Computer Science - 36th International
Workshop, {WG} 2010, Zar{\'{o}}s, Crete, Greece, June 28-30,
2010 Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {6410},
pages = {147--158},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-16926-7\_15},
doi = {10.1007/978-3-642-16926-7\_15},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wg/CyganPPW10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1004-2972,
author = {Marek Cygan and
Marcin Pilipczuk and
Michal Pilipczuk and
Jakub Onufry Wojtaszczyk},
title = {Subset feedback vertex set is fixed parameter tractable},
journal = {CoRR},
volume = {abs/1004.2972},
year = {2010},
url = {http://arxiv.org/abs/1004.2972},
eprinttype = {arXiv},
eprint = {1004.2972},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1004-2972.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1004-5010,
author = {Marek Cygan and
Marcin Pilipczuk and
Michal Pilipczuk and
Jakub Onufry Wojtaszczyk},
title = {The stubborn problem is stubborn no more (a polynomial algorithm for
3-compatible colouring and the stubborn list partition problem)},
journal = {CoRR},
volume = {abs/1004.5010},
year = {2010},
url = {http://arxiv.org/abs/1004.5010},
eprinttype = {arXiv},
eprint = {1004.5010},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1004-5010.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1011-6239,
author = {Marek Cygan and
Geevarghese Philip and
Marcin Pilipczuk and
Michal Pilipczuk and
Jakub Onufry Wojtaszczyk},
title = {Dominating Set is Fixed Parameter Tractable in Claw-free Graphs},
journal = {CoRR},
volume = {abs/1011.6239},
year = {2010},
url = {http://arxiv.org/abs/1011.6239},
eprinttype = {arXiv},
eprint = {1011.6239},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1011-6239.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0909-4021,
author = {Marek Cygan and
Marcin Pilipczuk and
Jakub Onufry Wojtaszczyk},
title = {Beyond O*(2{\^{}}n) in domination-type problems},
journal = {CoRR},
volume = {abs/0909.4021},
year = {2009},
url = {http://arxiv.org/abs/0909.4021},
eprinttype = {arXiv},
eprint = {0909.4021},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0909-4021.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jc/Wojtaszczyk03,
author = {Jakub Onufry Wojtaszczyk},
title = {Multivariate integration in \emph{C}\({}^{\mbox{infinity}}\)([0, 1]\({}^{\mbox{d}}\))
is not strongly tractable},
journal = {J. Complex.},
volume = {19},
number = {5},
pages = {638--643},
year = {2003},
url = {https://doi.org/10.1016/S0885-064X(03)00069-4},
doi = {10.1016/S0885-064X(03)00069-4},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jc/Wojtaszczyk03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2023-09-27 22:41 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
