Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Stefan Kratsch
@article{DBLP:journals/corr/abs-2402-08046,
author = {Narek Bojikian and
Stefan Kratsch},
title = {Tight Algorithm for Connected Odd Cycle Transversal Parameterized
by Clique-width},
journal = {CoRR},
volume = {abs/2402.08046},
year = {2024},
url = {https://doi.org/10.48550/arXiv.2402.08046},
doi = {10.48550/ARXIV.2402.08046},
eprinttype = {arXiv},
eprint = {2402.08046},
timestamp = {Mon, 19 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2402-08046.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/KratschN23,
author = {Stefan Kratsch and
Florian Nelles},
title = {Efficient parameterized algorithms for computing all-pairs shortest
paths},
journal = {Discret. Appl. Math.},
volume = {341},
pages = {102--119},
year = {2023},
url = {https://doi.org/10.1016/j.dam.2023.07.029},
doi = {10.1016/J.DAM.2023.07.029},
timestamp = {Sun, 10 Dec 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/KratschN23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/HegerfeldK23,
author = {Falko Hegerfeld and
Stefan Kratsch},
editor = {Inge Li G{\o}rtz and
Martin Farach{-}Colton and
Simon J. Puglisi and
Grzegorz Herman},
title = {Tight Algorithms for Connectivity Problems Parameterized by Clique-Width},
booktitle = {31st Annual European Symposium on Algorithms, {ESA} 2023, September
4-6, 2023, Amsterdam, The Netherlands},
series = {LIPIcs},
volume = {274},
pages = {59:1--59:19},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.ESA.2023.59},
doi = {10.4230/LIPICS.ESA.2023.59},
timestamp = {Wed, 30 Aug 2023 15:40:45 +0200},
biburl = {https://dblp.org/rec/conf/esa/HegerfeldK23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/KratschK23,
author = {Stefan Kratsch and
Pascal Kunz},
editor = {Neeldhara Misra and
Magnus Wahlstr{\"{o}}m},
title = {Approximate Turing Kernelization and Lower Bounds for Domination Problems},
booktitle = {18th International Symposium on Parameterized and Exact Computation,
{IPEC} 2023, September 6-8, 2023, Amsterdam, The Netherlands},
series = {LIPIcs},
volume = {285},
pages = {32:1--32:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.IPEC.2023.32},
doi = {10.4230/LIPICS.IPEC.2023.32},
timestamp = {Wed, 13 Dec 2023 14:08:59 +0100},
biburl = {https://dblp.org/rec/conf/iwpec/KratschK23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/ChekanK23,
author = {Vera Chekan and
Stefan Kratsch},
editor = {J{\'{e}}r{\^{o}}me Leroux and
Sylvain Lombardy and
David Peleg},
title = {Tight Algorithmic Applications of Clique-Width Generalizations},
booktitle = {48th International Symposium on Mathematical Foundations of Computer
Science, {MFCS} 2023, August 28 to September 1, 2023, Bordeaux, France},
series = {LIPIcs},
volume = {272},
pages = {35:1--35:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.MFCS.2023.35},
doi = {10.4230/LIPICS.MFCS.2023.35},
timestamp = {Mon, 28 Aug 2023 15:00:20 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/ChekanK23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/0002KPW23,
author = {Eun Jung Kim and
Stefan Kratsch and
Marcin Pilipczuk and
Magnus Wahlstr{\"{o}}m},
editor = {Nikhil Bansal and
Viswanath Nagarajan},
title = {Flow-augmentation {III:} Complexity dichotomy for Boolean CSPs parameterized
by the number of unsatisfied constraints},
booktitle = {Proceedings of the 2023 {ACM-SIAM} Symposium on Discrete Algorithms,
{SODA} 2023, Florence, Italy, January 22-25, 2023},
pages = {3218--3228},
publisher = {{SIAM}},
year = {2023},
url = {https://doi.org/10.1137/1.9781611977554.ch122},
doi = {10.1137/1.9781611977554.CH122},
timestamp = {Fri, 17 Feb 2023 09:28:57 +0100},
biburl = {https://dblp.org/rec/conf/soda/0002KPW23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/BojikianCHK23,
author = {Narek Bojikian and
Vera Chekan and
Falko Hegerfeld and
Stefan Kratsch},
editor = {Petra Berenbrink and
Patricia Bouyer and
Anuj Dawar and
Mamadou Moustapha Kant{\'{e}}},
title = {Tight Bounds for Connectivity Problems Parameterized by Cutwidth},
booktitle = {40th International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2023, March 7-9, 2023, Hamburg, Germany},
series = {LIPIcs},
volume = {254},
pages = {14:1--14:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.STACS.2023.14},
doi = {10.4230/LIPICS.STACS.2023.14},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/BojikianCHK23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/HegerfeldK23,
author = {Falko Hegerfeld and
Stefan Kratsch},
editor = {Dani{\"{e}}l Paulusma and
Bernard Ries},
title = {Tight Algorithms for Connectivity Problems Parameterized by Modular-Treewidth},
booktitle = {Graph-Theoretic Concepts in Computer Science - 49th International
Workshop, {WG} 2023, Fribourg, Switzerland, June 28-30, 2023, Revised
Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {14093},
pages = {388--402},
publisher = {Springer},
year = {2023},
url = {https://doi.org/10.1007/978-3-031-43380-1\_28},
doi = {10.1007/978-3-031-43380-1\_28},
timestamp = {Sat, 14 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wg/HegerfeldK23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2302-03627,
author = {Falko Hegerfeld and
Stefan Kratsch},
title = {Tight algorithms for connectivity problems parameterized by clique-width},
journal = {CoRR},
volume = {abs/2302.03627},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2302.03627},
doi = {10.48550/ARXIV.2302.03627},
eprinttype = {arXiv},
eprint = {2302.03627},
timestamp = {Fri, 10 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2302-03627.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2302-14128,
author = {Falko Hegerfeld and
Stefan Kratsch},
title = {Tight Algorithms for Connectivity Problems Parameterized by Modular-Treewidth},
journal = {CoRR},
volume = {abs/2302.14128},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2302.14128},
doi = {10.48550/ARXIV.2302.14128},
eprinttype = {arXiv},
eprint = {2302.14128},
timestamp = {Thu, 02 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2302-14128.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2307-02241,
author = {Stefan Kratsch and
Pascal Kunz},
title = {Approximate Turing kernelization and lower bounds for domination problems},
journal = {CoRR},
volume = {abs/2307.02241},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2307.02241},
doi = {10.48550/ARXIV.2307.02241},
eprinttype = {arXiv},
eprint = {2307.02241},
timestamp = {Mon, 10 Jul 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2307-02241.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2307-04628,
author = {Vera Chekan and
Stefan Kratsch},
title = {Tight Algorithmic Applications of Clique-Width Generalizations},
journal = {CoRR},
volume = {abs/2307.04628},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2307.04628},
doi = {10.48550/ARXIV.2307.04628},
eprinttype = {arXiv},
eprint = {2307.04628},
timestamp = {Mon, 24 Jul 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2307-04628.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2307-14264,
author = {Narek Bojikian and
Stefan Kratsch},
title = {A tight Monte-Carlo algorithm for Steiner Tree parameterized by clique-width},
journal = {CoRR},
volume = {abs/2307.14264},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2307.14264},
doi = {10.48550/ARXIV.2307.14264},
eprinttype = {arXiv},
eprint = {2307.14264},
timestamp = {Wed, 02 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2307-14264.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/HolsKP22,
author = {Eva{-}Maria C. Hols and
Stefan Kratsch and
Astrid Pieterse},
title = {Elimination Distances, Blocking Sets, and Kernels for Vertex Cover},
journal = {{SIAM} J. Discret. Math.},
volume = {36},
number = {3},
pages = {1955--1990},
year = {2022},
url = {https://doi.org/10.1137/20m1335285},
doi = {10.1137/20M1335285},
timestamp = {Sat, 11 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamdm/HolsKP22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/HegerfeldK22,
author = {Falko Hegerfeld and
Stefan Kratsch},
editor = {Holger Dell and
Jesper Nederlof},
title = {Towards Exact Structural Thresholds for Parameterized Complexity},
booktitle = {17th International Symposium on Parameterized and Exact Computation,
{IPEC} 2022, September 7-9, 2022, Potsdam, Germany},
series = {LIPIcs},
volume = {249},
pages = {17:1--17:20},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.IPEC.2022.17},
doi = {10.4230/LIPICS.IPEC.2022.17},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/iwpec/HegerfeldK22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/0002KPW22,
author = {Eun Jung Kim and
Stefan Kratsch and
Marcin Pilipczuk and
Magnus Wahlstr{\"{o}}m},
editor = {Stefano Leonardi and
Anupam Gupta},
title = {Directed flow-augmentation},
booktitle = {{STOC} '22: 54th Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Rome, Italy, June 20 - 24, 2022},
pages = {938--947},
publisher = {{ACM}},
year = {2022},
url = {https://doi.org/10.1145/3519935.3520018},
doi = {10.1145/3519935.3520018},
timestamp = {Tue, 27 Dec 2022 09:06:31 +0100},
biburl = {https://dblp.org/rec/conf/stoc/0002KPW22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2202-06708,
author = {Stefan Kratsch and
Florian Nelles and
Alexandre Simon},
title = {On Triangle Counting Parameterized by Twin-Width},
journal = {CoRR},
volume = {abs/2202.06708},
year = {2022},
url = {https://arxiv.org/abs/2202.06708},
eprinttype = {arXiv},
eprint = {2202.06708},
timestamp = {Fri, 18 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2202-06708.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2207-07422,
author = {Eun Jung Kim and
Stefan Kratsch and
Marcin Pilipczuk and
Magnus Wahlstr{\"{o}}m},
title = {Flow-augmentation {III:} Complexity dichotomy for Boolean CSPs parameterized
by the number of unsatisfied constraints},
journal = {CoRR},
volume = {abs/2207.07422},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2207.07422},
doi = {10.48550/ARXIV.2207.07422},
eprinttype = {arXiv},
eprint = {2207.07422},
timestamp = {Tue, 19 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2207-07422.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2209-14429,
author = {Stefan Kratsch and
Florian Nelles},
title = {Efficient parameterized algorithms on graphs with heterogeneous structure:
Combining tree-depth and modular-width},
journal = {CoRR},
volume = {abs/2209.14429},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2209.14429},
doi = {10.48550/ARXIV.2209.14429},
eprinttype = {arXiv},
eprint = {2209.14429},
timestamp = {Thu, 06 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2209-14429.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2212-12385,
author = {Narek Bojikian and
Vera Chekan and
Falko Hegerfeld and
Stefan Kratsch},
title = {Tight Bounds for Connectivity Problems Parameterized by Cutwidth},
journal = {CoRR},
volume = {abs/2212.12385},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2212.12385},
doi = {10.48550/ARXIV.2212.12385},
eprinttype = {arXiv},
eprint = {2212.12385},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2212-12385.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/BohnleinKS21,
author = {Toni B{\"{o}}hnlein and
Stefan Kratsch and
Oliver Schaudt},
title = {Revenue maximization in Stackelberg Pricing Games: beyond the combinatorial
setting},
journal = {Math. Program.},
volume = {187},
number = {1},
pages = {653--695},
year = {2021},
url = {https://doi.org/10.1007/s10107-020-01495-0},
doi = {10.1007/S10107-020-01495-0},
timestamp = {Fri, 14 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/BohnleinKS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/KimKPW21,
author = {Eun Jung Kim and
Stefan Kratsch and
Marcin Pilipczuk and
Magnus Wahlstr{\"{o}}m},
editor = {D{\'{a}}niel Marx},
title = {Solving hard cut problems via flow-augmentation},
booktitle = {Proceedings of the 2021 {ACM-SIAM} Symposium on Discrete Algorithms,
{SODA} 2021, Virtual Conference, January 10 - 13, 2021},
pages = {149--168},
publisher = {{SIAM}},
year = {2021},
url = {https://doi.org/10.1137/1.9781611976465.11},
doi = {10.1137/1.9781611976465.11},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/KimKPW21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/KratschMMPS21,
author = {Stefan Kratsch and
Tom{\'{a}}s Masar{\'{\i}}k and
Irene Muzi and
Marcin Pilipczuk and
Manuel Sorge},
editor = {D{\'{a}}niel Marx},
title = {Optimal Discretization is Fixed-parameter Tractable},
booktitle = {Proceedings of the 2021 {ACM-SIAM} Symposium on Discrete Algorithms,
{SODA} 2021, Virtual Conference, January 10 - 13, 2021},
pages = {1702--1719},
publisher = {{SIAM}},
year = {2021},
url = {https://doi.org/10.1137/1.9781611976465.103},
doi = {10.1137/1.9781611976465.103},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/KratschMMPS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2107-06111,
author = {Falko Hegerfeld and
Stefan Kratsch},
title = {Towards exact structural thresholds for parameterized complexity},
journal = {CoRR},
volume = {abs/2107.06111},
year = {2021},
url = {https://arxiv.org/abs/2107.06111},
eprinttype = {arXiv},
eprint = {2107.06111},
timestamp = {Wed, 21 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2107-06111.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2111-03450,
author = {Eun Jung Kim and
Stefan Kratsch and
Marcin Pilipczuk and
Magnus Wahlstr{\"{o}}m},
title = {Directed flow-augmentation},
journal = {CoRR},
volume = {abs/2111.03450},
year = {2021},
url = {https://arxiv.org/abs/2111.03450},
eprinttype = {arXiv},
eprint = {2111.03450},
timestamp = {Wed, 10 Nov 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2111-03450.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/KratschLMPW20,
author = {Stefan Kratsch and
Shaohua Li and
D{\'{a}}niel Marx and
Marcin Pilipczuk and
Magnus Wahlstr{\"{o}}m},
title = {Multi-budgeted Directed Cuts},
journal = {Algorithmica},
volume = {82},
number = {8},
pages = {2135--2155},
year = {2020},
url = {https://doi.org/10.1007/s00453-019-00609-1},
doi = {10.1007/S00453-019-00609-1},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/KratschLMPW20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/KratschW20,
author = {Stefan Kratsch and
Magnus Wahlstr{\"{o}}m},
title = {Representative Sets and Irrelevant Vertices: New Tools for Kernelization},
journal = {J. {ACM}},
volume = {67},
number = {3},
pages = {16:1--16:50},
year = {2020},
url = {https://doi.org/10.1145/3390887},
doi = {10.1145/3390887},
timestamp = {Sat, 08 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/KratschW20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ChikhiJKMMRV20,
author = {Rayan Chikhi and
Vladan Jovicic and
Stefan Kratsch and
Paul Medvedev and
Martin Milanic and
Sofya Raskhodnikova and
Nithin Varma},
title = {Bipartite graphs of small readability},
journal = {Theor. Comput. Sci.},
volume = {806},
pages = {402--415},
year = {2020},
url = {https://doi.org/10.1016/j.tcs.2019.07.022},
doi = {10.1016/J.TCS.2019.07.022},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/ChikhiJKMMRV20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/HolsKP20,
author = {Eva{-}Maria C. Hols and
Stefan Kratsch and
Astrid Pieterse},
editor = {Fabrizio Grandoni and
Grzegorz Herman and
Peter Sanders},
title = {Approximate Turing Kernelization for Problems Parameterized by Treewidth},
booktitle = {28th Annual European Symposium on Algorithms, {ESA} 2020, September
7-9, 2020, Pisa, Italy (Virtual Conference)},
series = {LIPIcs},
volume = {173},
pages = {60:1--60:23},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.ESA.2020.60},
doi = {10.4230/LIPICS.ESA.2020.60},
timestamp = {Thu, 16 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/esa/HolsKP20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/HegerfeldK20,
author = {Falko Hegerfeld and
Stefan Kratsch},
editor = {Christophe Paul and
Markus Bl{\"{a}}ser},
title = {Solving Connectivity Problems Parameterized by Treedepth in Single-Exponential
Time and Polynomial Space},
booktitle = {37th International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2020, March 10-13, 2020, Montpellier, France},
series = {LIPIcs},
volume = {154},
pages = {29:1--29:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.STACS.2020.29},
doi = {10.4230/LIPICS.STACS.2020.29},
timestamp = {Thu, 19 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stacs/HegerfeldK20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/HolsKP20,
author = {Eva{-}Maria C. Hols and
Stefan Kratsch and
Astrid Pieterse},
editor = {Christophe Paul and
Markus Bl{\"{a}}ser},
title = {Elimination Distances, Blocking Sets, and Kernels for Vertex Cover},
booktitle = {37th International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2020, March 10-13, 2020, Montpellier, France},
series = {LIPIcs},
volume = {154},
pages = {36:1--36:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.STACS.2020.36},
doi = {10.4230/LIPICS.STACS.2020.36},
timestamp = {Thu, 19 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stacs/HolsKP20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/KratschN20,
author = {Stefan Kratsch and
Florian Nelles},
editor = {Christophe Paul and
Markus Bl{\"{a}}ser},
title = {Efficient Parameterized Algorithms for Computing All-Pairs Shortest
Paths},
booktitle = {37th International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2020, March 10-13, 2020, Montpellier, France},
series = {LIPIcs},
volume = {154},
pages = {38:1--38:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.STACS.2020.38},
doi = {10.4230/LIPICS.STACS.2020.38},
timestamp = {Thu, 19 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stacs/KratschN20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/birthday/2020bodlaender,
editor = {Fedor V. Fomin and
Stefan Kratsch and
Erik Jan van Leeuwen},
title = {Treewidth, Kernels, and Algorithms - Essays Dedicated to Hans L. Bodlaender
on the Occasion of His 60th Birthday},
series = {Lecture Notes in Computer Science},
volume = {12160},
publisher = {Springer},
year = {2020},
url = {https://doi.org/10.1007/978-3-030-42071-0},
doi = {10.1007/978-3-030-42071-0},
isbn = {978-3-030-42070-3},
timestamp = {Tue, 21 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/birthday/2020bodlaender.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2001-04908,
author = {Stefan Kratsch and
Florian Nelles},
title = {Efficient parameterized algorithms for computing all-pairs shortest
paths},
journal = {CoRR},
volume = {abs/2001.04908},
year = {2020},
url = {https://arxiv.org/abs/2001.04908},
eprinttype = {arXiv},
eprint = {2001.04908},
timestamp = {Fri, 17 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2001-04908.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2001-05364,
author = {Falko Hegerfeld and
Stefan Kratsch},
title = {Solving connectivity problems parameterized by treedepth in single-exponential
time and polynomial space},
journal = {CoRR},
volume = {abs/2001.05364},
year = {2020},
url = {https://arxiv.org/abs/2001.05364},
eprinttype = {arXiv},
eprint = {2001.05364},
timestamp = {Fri, 17 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2001-05364.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2003-02475,
author = {Stefan Kratsch and
Tom{\'{a}}s Masar{\'{\i}}k and
Irene Muzi and
Marcin Pilipczuk and
Manuel Sorge},
title = {Optimal Discretization is Fixed-parameter Tractable},
journal = {CoRR},
volume = {abs/2003.02475},
year = {2020},
url = {https://arxiv.org/abs/2003.02475},
eprinttype = {arXiv},
eprint = {2003.02475},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2003-02475.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2004-12683,
author = {Eva{-}Maria C. Hols and
Stefan Kratsch and
Astrid Pieterse},
title = {Approximate Turing Kernelization for Problems Parameterized by Treewidth},
journal = {CoRR},
volume = {abs/2004.12683},
year = {2020},
url = {https://arxiv.org/abs/2004.12683},
eprinttype = {arXiv},
eprint = {2004.12683},
timestamp = {Wed, 29 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2004-12683.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2007-09018,
author = {Eun Jung Kim and
Stefan Kratsch and
Marcin Pilipczuk and
Magnus Wahlstr{\"{o}}m},
title = {Solving hard cut problems via flow-augmentation},
journal = {CoRR},
volume = {abs/2007.09018},
year = {2020},
url = {https://arxiv.org/abs/2007.09018},
eprinttype = {arXiv},
eprint = {2007.09018},
timestamp = {Fri, 31 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2007-09018.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/DisserKS19,
author = {Yann Disser and
Stefan Kratsch and
Manuel Sorge},
title = {The Minimum Feasible Tileset Problem},
journal = {Algorithmica},
volume = {81},
number = {3},
pages = {1126--1151},
year = {2019},
url = {https://doi.org/10.1007/s00453-018-0460-3},
doi = {10.1007/S00453-018-0460-3},
timestamp = {Sat, 02 Mar 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/DisserKS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/FluschnikKNS19,
author = {Till Fluschnik and
Stefan Kratsch and
Rolf Niedermeier and
Manuel Sorge},
title = {The parameterized complexity of the minimum shared edges problem},
journal = {J. Comput. Syst. Sci.},
volume = {106},
pages = {23--48},
year = {2019},
url = {https://doi.org/10.1016/j.jcss.2018.12.002},
doi = {10.1016/J.JCSS.2018.12.002},
timestamp = {Tue, 20 Aug 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jcss/FluschnikKNS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/netsci/BredereckKKMNS19,
author = {Robert Bredereck and
Christian Komusiewicz and
Stefan Kratsch and
Hendrik Molter and
Rolf Niedermeier and
Manuel Sorge},
title = {Assessing the computational complexity of multilayer subgraph detection},
journal = {Netw. Sci.},
volume = {7},
number = {2},
pages = {215--241},
year = {2019},
url = {https://doi.org/10.1017/nws.2019.13},
doi = {10.1017/NWS.2019.13},
timestamp = {Mon, 11 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/netsci/BredereckKKMNS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/BurtonCKP19,
author = {Benjamin A. Burton and
Sergio Cabello and
Stefan Kratsch and
William Pettersson},
title = {The Parameterized Complexity of Finding a 2-Sphere in a Simplicial
Complex},
journal = {{SIAM} J. Discret. Math.},
volume = {33},
number = {4},
pages = {2092--2110},
year = {2019},
url = {https://doi.org/10.1137/18M1168704},
doi = {10.1137/18M1168704},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/BurtonCKP19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/0001KW19,
author = {Fabrizio Grandoni and
Stefan Kratsch and
Andreas Wiese},
editor = {Michael A. Bender and
Ola Svensson and
Grzegorz Herman},
title = {Parameterized Approximation Schemes for Independent Set of Rectangles
and Geometric Knapsack},
booktitle = {27th Annual European Symposium on Algorithms, {ESA} 2019, September
9-11, 2019, Munich/Garching, Germany},
series = {LIPIcs},
volume = {144},
pages = {53:1--53:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.ESA.2019.53},
doi = {10.4230/LIPICS.ESA.2019.53},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/esa/0001KW19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/HegerfeldK19,
author = {Falko Hegerfeld and
Stefan Kratsch},
editor = {Christel Baier and
Ioannis Chatzigiannakis and
Paola Flocchini and
Stefano Leonardi},
title = {On Adaptive Algorithms for Maximum Matching},
booktitle = {46th International Colloquium on Automata, Languages, and Programming,
{ICALP} 2019, July 9-12, 2019, Patras, Greece},
series = {LIPIcs},
volume = {132},
pages = {71:1--71:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2019.71},
doi = {10.4230/LIPICS.ICALP.2019.71},
timestamp = {Tue, 27 Dec 2022 09:06:31 +0100},
biburl = {https://dblp.org/rec/conf/icalp/HegerfeldK19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/HolsK19,
author = {Eva{-}Maria C. Hols and
Stefan Kratsch},
editor = {Rolf Niedermeier and
Christophe Paul},
title = {On Kernelization for Edge Dominating Set under Structural Parameters},
booktitle = {36th International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2019, March 13-16, 2019, Berlin, Germany},
series = {LIPIcs},
volume = {126},
pages = {36:1--36:18},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.STACS.2019.36},
doi = {10.4230/LIPICS.STACS.2019.36},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/stacs/HolsK19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1901-03582,
author = {Eva{-}Maria C. Hols and
Stefan Kratsch},
title = {On Kernelization for Edge Dominating Set under Structural Parameters},
journal = {CoRR},
volume = {abs/1901.03582},
year = {2019},
url = {http://arxiv.org/abs/1901.03582},
eprinttype = {arXiv},
eprint = {1901.03582},
timestamp = {Fri, 01 Feb 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1901-03582.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1904-11244,
author = {Falko Hegerfeld and
Stefan Kratsch},
title = {On adaptive algorithms for maximum matching},
journal = {CoRR},
volume = {abs/1904.11244},
year = {2019},
url = {http://arxiv.org/abs/1904.11244},
eprinttype = {arXiv},
eprint = {1904.11244},
timestamp = {Thu, 02 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1904-11244.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1905-03631,
author = {Eva{-}Maria C. Hols and
Stefan Kratsch and
Astrid Pieterse},
title = {Elimination Distances, Blocking Sets, and Kernels for Vertex Cover},
journal = {CoRR},
volume = {abs/1905.03631},
year = {2019},
url = {http://arxiv.org/abs/1905.03631},
eprinttype = {arXiv},
eprint = {1905.03631},
timestamp = {Mon, 27 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1905-03631.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1906-10982,
author = {Fabrizio Grandoni and
Stefan Kratsch and
Andreas Wiese},
title = {Parameterized Approximation Schemes for Independent Set of Rectangles
and Geometric Knapsack},
journal = {CoRR},
volume = {abs/1906.10982},
year = {2019},
url = {http://arxiv.org/abs/1906.10982},
eprinttype = {arXiv},
eprint = {1906.10982},
timestamp = {Thu, 27 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1906-10982.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/CyganKN18,
author = {Marek Cygan and
Stefan Kratsch and
Jesper Nederlof},
title = {Fast Hamiltonicity Checking Via Bases of Perfect Matchings},
journal = {J. {ACM}},
volume = {65},
number = {3},
pages = {12:1--12:46},
year = {2018},
url = {https://doi.org/10.1145/3148227},
doi = {10.1145/3148227},
timestamp = {Sat, 08 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/CyganKN18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/HolsK18,
author = {Eva{-}Maria C. Hols and
Stefan Kratsch},
title = {A Randomized Polynomial Kernel for Subset Feedback Vertex Set},
journal = {Theory Comput. Syst.},
volume = {62},
number = {1},
pages = {63--92},
year = {2018},
url = {https://doi.org/10.1007/s00224-017-9805-6},
doi = {10.1007/S00224-017-9805-6},
timestamp = {Fri, 12 Jan 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mst/HolsK18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/Kratsch18,
author = {Stefan Kratsch},
title = {A Randomized Polynomial Kernelization for Vertex Cover with a Smaller
Parameter},
journal = {{SIAM} J. Discret. Math.},
volume = {32},
number = {3},
pages = {1806--1839},
year = {2018},
url = {https://doi.org/10.1137/16M1104585},
doi = {10.1137/16M1104585},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/Kratsch18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BredereckCHK18,
author = {Robert Bredereck and
Jiehua Chen and
Falk H{\"{u}}ffner and
Stefan Kratsch},
title = {Parameterized complexity of team formation in social networks},
journal = {Theor. Comput. Sci.},
volume = {717},
pages = {26--36},
year = {2018},
url = {https://doi.org/10.1016/j.tcs.2017.05.024},
doi = {10.1016/J.TCS.2017.05.024},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BredereckCHK18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoon/ChikhiJKMMRV18,
author = {Rayan Chikhi and
Vladan Jovicic and
Stefan Kratsch and
Paul Medvedev and
Martin Milanic and
Sofya Raskhodnikova and
Nithin Varma},
editor = {Lusheng Wang and
Daming Zhu},
title = {Bipartite Graphs of Small Readability},
booktitle = {Computing and Combinatorics - 24th International Conference, {COCOON}
2018, Qing Dao, China, July 2-4, 2018, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10976},
pages = {467--479},
publisher = {Springer},
year = {2018},
url = {https://doi.org/10.1007/978-3-319-94776-1\_39},
doi = {10.1007/978-3-319-94776-1\_39},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/cocoon/ChikhiJKMMRV18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/KratschN18,
author = {Stefan Kratsch and
Florian Nelles},
editor = {Yossi Azar and
Hannah Bast and
Grzegorz Herman},
title = {Efficient and Adaptive Parameterized Algorithms on Modular Decompositions},
booktitle = {26th Annual European Symposium on Algorithms, {ESA} 2018, August 20-22,
2018, Helsinki, Finland},
series = {LIPIcs},
volume = {112},
pages = {55:1--55:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.ESA.2018.55},
doi = {10.4230/LIPICS.ESA.2018.55},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/esa/KratschN18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/KratschLMPW18,
author = {Stefan Kratsch and
Shaohua Li and
D{\'{a}}niel Marx and
Marcin Pilipczuk and
Magnus Wahlstr{\"{o}}m},
editor = {Christophe Paul and
Michal Pilipczuk},
title = {Multi-Budgeted Directed Cuts},
booktitle = {13th International Symposium on Parameterized and Exact Computation,
{IPEC} 2018, August 20-24, 2018, Helsinki, Finland},
series = {LIPIcs},
volume = {115},
pages = {18:1--18:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.IPEC.2018.18},
doi = {10.4230/LIPICS.IPEC.2018.18},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/iwpec/KratschLMPW18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1802-07175,
author = {Benjamin A. Burton and
Sergio Cabello and
Stefan Kratsch and
William Pettersson},
title = {The parameterized complexity of finding a 2-sphere in a simplicial
complex},
journal = {CoRR},
volume = {abs/1802.07175},
year = {2018},
url = {http://arxiv.org/abs/1802.07175},
eprinttype = {arXiv},
eprint = {1802.07175},
timestamp = {Wed, 08 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1802-07175.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1804-10173,
author = {Stefan Kratsch and
Florian Nelles},
title = {Efficient and adaptive parameterized algorithms on modular decompositions},
journal = {CoRR},
volume = {abs/1804.10173},
year = {2018},
url = {http://arxiv.org/abs/1804.10173},
eprinttype = {arXiv},
eprint = {1804.10173},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1804-10173.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1805-04765,
author = {Rayan Chikhi and
Vladan Jovicic and
Stefan Kratsch and
Paul Medvedev and
Martin Milanic and
Sofya Raskhodnikova and
Nithin Varma},
title = {Bipartite Graphs of Small Readability},
journal = {CoRR},
volume = {abs/1805.04765},
year = {2018},
url = {http://arxiv.org/abs/1805.04765},
eprinttype = {arXiv},
eprint = {1805.04765},
timestamp = {Sun, 05 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1805-04765.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1810-06848,
author = {Stefan Kratsch and
Shaohua Li and
D{\'{a}}niel Marx and
Marcin Pilipczuk and
Magnus Wahlstr{\"{o}}m},
title = {Multi-budgeted directed cuts},
journal = {CoRR},
volume = {abs/1810.06848},
year = {2018},
url = {http://arxiv.org/abs/1810.06848},
eprinttype = {arXiv},
eprint = {1810.06848},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1810-06848.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dagstuhl-reports/BarbayFKS18,
author = {J{\'{e}}r{\'{e}}my Barbay and
Johannes Fischer and
Stefan Kratsch and
Srinivasa Rao Satti},
title = {Synergies between Adaptive Analysis of Algorithms, Parameterized Complexity,
Compressed Data Structures and Compressed Indices (Dagstuhl Seminar
18281)},
journal = {Dagstuhl Reports},
volume = {8},
number = {7},
pages = {44--61},
year = {2018},
url = {https://doi.org/10.4230/DagRep.8.7.44},
doi = {10.4230/DAGREP.8.7.44},
timestamp = {Thu, 24 Jan 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dagstuhl-reports/BarbayFKS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/KratschS17,
author = {Stefan Kratsch and
Manuel Sorge},
title = {On Kernelization and Approximation for the Vector Connectivity Problem},
journal = {Algorithmica},
volume = {79},
number = {1},
pages = {96--138},
year = {2017},
url = {https://doi.org/10.1007/s00453-016-0231-y},
doi = {10.1007/S00453-016-0231-Y},
timestamp = {Wed, 19 Jul 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/KratschS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BodlaenderKKKO17,
author = {Hans L. Bodlaender and
Stefan Kratsch and
Vincent J. C. Kreuzen and
O{-}joung Kwon and
Seongmin Ok},
title = {Characterizing width two for variants of treewidth},
journal = {Discret. Appl. Math.},
volume = {216},
pages = {29--46},
year = {2017},
url = {https://doi.org/10.1016/j.dam.2015.01.015},
doi = {10.1016/J.DAM.2015.01.015},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/BodlaenderKKKO17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/KratschS17,
author = {Stefan Kratsch and
Pascal Schweitzer},
title = {Graph isomorphism for graph classes characterized by two forbidden
induced subgraphs},
journal = {Discret. Appl. Math.},
volume = {216},
pages = {240--253},
year = {2017},
url = {https://doi.org/10.1016/j.dam.2014.10.026},
doi = {10.1016/J.DAM.2014.10.026},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/KratschS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/KratschM17,
author = {Stefan Kratsch and
Martin Milanic},
title = {On the complexity of the identifiable subgraph problem, revisited},
journal = {Discret. Appl. Math.},
volume = {226},
pages = {78--86},
year = {2017},
url = {https://doi.org/10.1016/j.dam.2017.04.028},
doi = {10.1016/J.DAM.2017.04.028},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/KratschM17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/EtscheidKMR17,
author = {Michael Etscheid and
Stefan Kratsch and
Matthias Mnich and
Heiko R{\"{o}}glin},
title = {Polynomial kernels for weighted problems},
journal = {J. Comput. Syst. Sci.},
volume = {84},
pages = {1--10},
year = {2017},
url = {https://doi.org/10.1016/j.jcss.2016.06.004},
doi = {10.1016/J.JCSS.2016.06.004},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jcss/EtscheidKMR17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/BredereckKKMNS17,
author = {Robert Bredereck and
Christian Komusiewicz and
Stefan Kratsch and
Hendrik Molter and
Rolf Niedermeier and
Manuel Sorge},
editor = {Dimitris Fotakis and
Aris Pagourtzis and
Vangelis Th. Paschos},
title = {Assessing the Computational Complexity of Multi-layer Subgraph Detection},
booktitle = {Algorithms and Complexity - 10th International Conference, {CIAC}
2017, Athens, Greece, May 24-26, 2017, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10236},
pages = {128--139},
year = {2017},
url = {https://doi.org/10.1007/978-3-319-57586-5\_12},
doi = {10.1007/978-3-319-57586-5\_12},
timestamp = {Thu, 24 Mar 2022 11:08:56 +0100},
biburl = {https://dblp.org/rec/conf/ciac/BredereckKKMNS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/BohnleinKS17,
author = {Toni B{\"{o}}hnlein and
Stefan Kratsch and
Oliver Schaudt},
editor = {Ioannis Chatzigiannakis and
Piotr Indyk and
Fabian Kuhn and
Anca Muscholl},
title = {Revenue Maximization in Stackelberg Pricing Games: Beyond the Combinatorial
Setting},
booktitle = {44th International Colloquium on Automata, Languages, and Programming,
{ICALP} 2017, July 10-14, 2017, Warsaw, Poland},
series = {LIPIcs},
volume = {80},
pages = {46:1--46:13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2017.46},
doi = {10.4230/LIPICS.ICALP.2017.46},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/icalp/BohnleinKS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/HolsK17,
author = {Eva{-}Maria C. Hols and
Stefan Kratsch},
editor = {Daniel Lokshtanov and
Naomi Nishimura},
title = {Smaller Parameters for Vertex Cover Kernelization},
booktitle = {12th International Symposium on Parameterized and Exact Computation,
{IPEC} 2017, September 6-8, 2017, Vienna, Austria},
series = {LIPIcs},
volume = {89},
pages = {20:1--20:12},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.IPEC.2017.20},
doi = {10.4230/LIPICS.IPEC.2017.20},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/iwpec/HolsK17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/BurtonCKP17,
author = {Benjamin A. Burton and
Sergio Cabello and
Stefan Kratsch and
William Pettersson},
editor = {Heribert Vollmer and
Brigitte Vall{\'{e}}e},
title = {The Parameterized Complexity of Finding a 2-Sphere in a Simplicial
Complex},
booktitle = {34th Symposium on Theoretical Aspects of Computer Science, {STACS}
2017, March 8-11, 2017, Hannover, Germany},
series = {LIPIcs},
volume = {66},
pages = {18:1--18:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.STACS.2017.18},
doi = {10.4230/LIPICS.STACS.2017.18},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/stacs/BurtonCKP17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/DisserK17,
author = {Yann Disser and
Stefan Kratsch},
editor = {Heribert Vollmer and
Brigitte Vall{\'{e}}e},
title = {Robust and Adaptive Search},
booktitle = {34th Symposium on Theoretical Aspects of Computer Science, {STACS}
2017, March 8-11, 2017, Hannover, Germany},
series = {LIPIcs},
volume = {66},
pages = {26:1--26:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.STACS.2017.26},
doi = {10.4230/LIPICS.STACS.2017.26},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/DisserK17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/DisserK17,
author = {Yann Disser and
Stefan Kratsch},
title = {Robust and adaptive search},
journal = {CoRR},
volume = {abs/1702.05932},
year = {2017},
url = {http://arxiv.org/abs/1702.05932},
eprinttype = {arXiv},
eprint = {1702.05932},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/DisserK17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1711-04604,
author = {Eva{-}Maria C. Hols and
Stefan Kratsch},
title = {Smaller parameters for vertex cover kernelization},
journal = {CoRR},
volume = {abs/1711.04604},
year = {2017},
url = {http://arxiv.org/abs/1711.04604},
eprinttype = {arXiv},
eprint = {1711.04604},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1711-04604.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/0001KKPP16,
author = {Matthew Johnson and
Dieter Kratsch and
Stefan Kratsch and
Viresh Patel and
Dani{\"{e}}l Paulusma},
title = {Finding Shortest Paths Between Graph Colourings},
journal = {Algorithmica},
volume = {75},
number = {2},
pages = {295--321},
year = {2016},
url = {https://doi.org/10.1007/s00453-015-0009-7},
doi = {10.1007/S00453-015-0009-7},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/0001KKPP16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/GutinKW16,
author = {Gregory Z. Gutin and
Stefan Kratsch and
Magnus Wahlstr{\"{o}}m},
title = {Polynomial Kernels and User Reductions for the Workflow Satisfiability
Problem},
journal = {Algorithmica},
volume = {75},
number = {2},
pages = {383--402},
year = {2016},
url = {https://doi.org/10.1007/s00453-015-9986-9},
doi = {10.1007/S00453-015-9986-9},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/GutinKW16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/Kratsch16,
author = {Stefan Kratsch},
title = {On polynomial kernels for sparse integer linear programs},
journal = {J. Comput. Syst. Sci.},
volume = {82},
number = {5},
pages = {758--766},
year = {2016},
url = {https://doi.org/10.1016/j.jcss.2015.12.002},
doi = {10.1016/J.JCSS.2015.12.002},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/Kratsch16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/KratschPR16,
author = {Stefan Kratsch and
Geevarghese Philip and
Saurabh Ray},
title = {Point Line Cover: The Easy Kernel is Essentially Tight},
journal = {{ACM} Trans. Algorithms},
volume = {12},
number = {3},
pages = {40:1--40:16},
year = {2016},
url = {https://doi.org/10.1145/2832912},
doi = {10.1145/2832912},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/talg/KratschPR16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toct/KratschMW16,
author = {Stefan Kratsch and
D{\'{a}}niel Marx and
Magnus Wahlstr{\"{o}}m},
title = {Parameterized Complexity and Kernelizability of Max Ones and Exact
Ones Problems},
journal = {{ACM} Trans. Comput. Theory},
volume = {8},
number = {1},
pages = {1:1--1:28},
year = {2016},
url = {https://doi.org/10.1145/2858787},
doi = {10.1145/2858787},
timestamp = {Mon, 08 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/toct/KratschMW16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aaim/BredereckCHK16,
author = {Robert Bredereck and
Jiehua Chen and
Falk H{\"{u}}ffner and
Stefan Kratsch},
editor = {Riccardo Dondi and
Guillaume Fertin and
Giancarlo Mauri},
title = {Parameterized Complexity of Team Formation in Social Networks},
booktitle = {Algorithmic Aspects in Information and Management - 11th International
Conference, {AAIM} 2016, Bergamo, Italy, July 18-20, 2016, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9778},
pages = {137--149},
publisher = {Springer},
year = {2016},
url = {https://doi.org/10.1007/978-3-319-41168-2\_12},
doi = {10.1007/978-3-319-41168-2\_12},
timestamp = {Sun, 02 Oct 2022 15:53:30 +0200},
biburl = {https://dblp.org/rec/conf/aaim/BredereckCHK16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/Kratsch16,
author = {Stefan Kratsch},
editor = {Piotr Sankowski and
Christos D. Zaroliagis},
title = {A Randomized Polynomial Kernelization for Vertex Cover with a Smaller
Parameter},
booktitle = {24th Annual European Symposium on Algorithms, {ESA} 2016, August 22-24,
2016, Aarhus, Denmark},
series = {LIPIcs},
volume = {57},
pages = {59:1--59:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.ESA.2016.59},
doi = {10.4230/LIPICS.ESA.2016.59},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/esa/Kratsch16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/FafianieHKQ16,
author = {Stefan Fafianie and
Eva{-}Maria C. Hols and
Stefan Kratsch and
Vuong Anh Quyen},
editor = {Piotr Faliszewski and
Anca Muscholl and
Rolf Niedermeier},
title = {Preprocessing Under Uncertainty: Matroid Intersection},
booktitle = {41st International Symposium on Mathematical Foundations of Computer
Science, {MFCS} 2016, August 22-26, 2016 - Krak{\'{o}}w, Poland},
series = {LIPIcs},
volume = {58},
pages = {35:1--35:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.MFCS.2016.35},
doi = {10.4230/LIPICS.MFCS.2016.35},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/mfcs/FafianieHKQ16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/FafianieKQ16,
author = {Stefan Fafianie and
Stefan Kratsch and
Vuong Anh Quyen},
editor = {Nicolas Ollinger and
Heribert Vollmer},
title = {Preprocessing Under Uncertainty},
booktitle = {33rd Symposium on Theoretical Aspects of Computer Science, {STACS}
2016, February 17-20, 2016, Orl{\'{e}}ans, France},
series = {LIPIcs},
volume = {47},
pages = {33:1--33:13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.STACS.2016.33},
doi = {10.4230/LIPICS.STACS.2016.33},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/stacs/FafianieKQ16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/HolsK16,
author = {Eva{-}Maria C. Hols and
Stefan Kratsch},
editor = {Nicolas Ollinger and
Heribert Vollmer},
title = {A Randomized Polynomial Kernel for Subset Feedback Vertex Set},
booktitle = {33rd Symposium on Theoretical Aspects of Computer Science, {STACS}
2016, February 17-20, 2016, Orl{\'{e}}ans, France},
series = {LIPIcs},
volume = {47},
pages = {43:1--43:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.STACS.2016.43},
doi = {10.4230/LIPICS.STACS.2016.43},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/HolsK16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:reference/algo/Kratsch16a,
author = {Stefan Kratsch},
title = {Kernelization, Polynomial Lower Bounds},
booktitle = {Encyclopedia of Algorithms},
pages = {1036--1039},
year = {2016},
url = {https://doi.org/10.1007/978-1-4939-2864-4\_522},
doi = {10.1007/978-1-4939-2864-4\_522},
timestamp = {Wed, 12 Jul 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/reference/algo/Kratsch16a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:reference/algo/Kratsch16b,
author = {Stefan Kratsch},
title = {Kernelization, Preprocessing for Treewidth},
booktitle = {Encyclopedia of Algorithms},
pages = {1040--1042},
year = {2016},
url = {https://doi.org/10.1007/978-1-4939-2864-4\_529},
doi = {10.1007/978-1-4939-2864-4\_529},
timestamp = {Wed, 12 Jul 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/reference/algo/Kratsch16b.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/FluschnikKNS16,
author = {Till Fluschnik and
Stefan Kratsch and
Rolf Niedermeier and
Manuel Sorge},
title = {The Parameterized Complexity of the Minimum Shared Edges Problem},
journal = {CoRR},
volume = {abs/1602.01739},
year = {2016},
url = {http://arxiv.org/abs/1602.01739},
eprinttype = {arXiv},
eprint = {1602.01739},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/FluschnikKNS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/KratschM16,
author = {Stefan Kratsch and
Martin Milanic},
title = {On the complexity of the identifiable subgraph problem, revisited},
journal = {CoRR},
volume = {abs/1603.06226},
year = {2016},
url = {http://arxiv.org/abs/1603.06226},
eprinttype = {arXiv},
eprint = {1603.06226},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/KratschM16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BredereckKKMNS16,
author = {Robert Bredereck and
Christian Komusiewicz and
Stefan Kratsch and
Hendrik Molter and
Rolf Niedermeier and
Manuel Sorge},
title = {Assessing the Computational Complexity of Multi-Layer Subgraph Detection},
journal = {CoRR},
volume = {abs/1604.07724},
year = {2016},
url = {http://arxiv.org/abs/1604.07724},
eprinttype = {arXiv},
eprint = {1604.07724},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BredereckKKMNS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/Kratsch16,
author = {Stefan Kratsch},
title = {A randomized polynomial kernelization for Vertex Cover with a smaller
parameter},
journal = {CoRR},
volume = {abs/1611.06795},
year = {2016},
url = {http://arxiv.org/abs/1611.06795},
eprinttype = {arXiv},
eprint = {1611.06795},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/Kratsch16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/HermelinKSWW15,
author = {Danny Hermelin and
Stefan Kratsch and
Karolina Soltys and
Magnus Wahlstr{\"{o}}m and
Xi Wu},
title = {A Completeness Theory for Polynomial (Turing) Kernelization},
journal = {Algorithmica},
volume = {71},
number = {3},
pages = {702--730},
year = {2015},
url = {https://doi.org/10.1007/s00453-014-9910-8},
doi = {10.1007/S00453-014-9910-8},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/HermelinKSWW15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/BodlaenderCKN15,
author = {Hans L. Bodlaender and
Marek Cygan and
Stefan Kratsch and
Jesper Nederlof},
title = {Deterministic single exponential time algorithms for connectivity
problems parameterized by treewidth},
journal = {Inf. Comput.},
volume = {243},
pages = {86--111},
year = {2015},
url = {https://doi.org/10.1016/j.ic.2014.12.008},
doi = {10.1016/J.IC.2014.12.008},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iandc/BodlaenderCKN15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BevernCHKTW15,
author = {Ren{\'{e}} van Bevern and
Jiehua Chen and
Falk H{\"{u}}ffner and
Stefan Kratsch and
Nimrod Talmon and
Gerhard J. Woeginger},
title = {Approximability and parameterized complexity of multicover by c-intervals},
journal = {Inf. Process. Lett.},
volume = {115},
number = {10},
pages = {744--749},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2015.03.004},
doi = {10.1016/J.IPL.2015.03.004},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/BevernCHKTW15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/KratschPPW15,
author = {Stefan Kratsch and
Marcin Pilipczuk and
Michal Pilipczuk and
Magnus Wahlstr{\"{o}}m},
title = {Fixed-Parameter Tractability of Multicut in Directed Acyclic Graphs},
journal = {{SIAM} J. Discret. Math.},
volume = {29},
number = {1},
pages = {122--144},
year = {2015},
url = {https://doi.org/10.1137/120904202},
doi = {10.1137/120904202},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/KratschPPW15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/teco/AlonBCKNW15,
author = {Noga Alon and
Robert Bredereck and
Jiehua Chen and
Stefan Kratsch and
Rolf Niedermeier and
Gerhard J. Woeginger},
title = {How to Put Through Your Agenda in Collective Binary Decisions},
journal = {{ACM} Trans. Economics and Comput.},
volume = {4},
number = {1},
pages = {5:1--5:28},
year = {2015},
url = {https://doi.org/10.1145/2837467},
doi = {10.1145/2837467},
timestamp = {Mon, 27 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/teco/AlonBCKNW15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/JansenK15,
author = {Bart M. P. Jansen and
Stefan Kratsch},
editor = {Nikhil Bansal and
Irene Finocchi},
title = {A Structural Approach to Kernels for ILPs: Treewidth and Total Unimodularity},
booktitle = {Algorithms - {ESA} 2015 - 23rd Annual European Symposium, Patras,
Greece, September 14-16, 2015, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9294},
pages = {779--791},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-662-48350-3\_65},
doi = {10.1007/978-3-662-48350-3\_65},
timestamp = {Tue, 15 Feb 2022 07:54:27 +0100},
biburl = {https://dblp.org/rec/conf/esa/JansenK15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/FluschnikKNS15,
author = {Till Fluschnik and
Stefan Kratsch and
Rolf Niedermeier and
Manuel Sorge},
editor = {Prahladh Harsha and
G. Ramalingam},
title = {The Parameterized Complexity of the Minimum Shared Edges Problem},
booktitle = {35th {IARCS} Annual Conference on Foundation of Software Technology
and Theoretical Computer Science, {FSTTCS} 2015, December 16-18, 2015,
Bangalore, India},
series = {LIPIcs},
volume = {45},
pages = {448--462},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2015},
url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2015.448},
doi = {10.4230/LIPICS.FSTTCS.2015.448},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/fsttcs/FluschnikKNS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/KratschS15,
author = {Stefan Kratsch and
Manuel Sorge},
editor = {Thore Husfeldt and
Iyad A. Kanj},
title = {On Kernelization and Approximation for the Vector Connectivity Problem},
booktitle = {10th International Symposium on Parameterized and Exact Computation,
{IPEC} 2015, September 16-18, 2015, Patras, Greece},
series = {LIPIcs},
volume = {43},
pages = {377--388},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2015},
url = {https://doi.org/10.4230/LIPIcs.IPEC.2015.377},
doi = {10.4230/LIPICS.IPEC.2015.377},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/iwpec/KratschS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/EtscheidKMR15,
author = {Michael Etscheid and
Stefan Kratsch and
Matthias Mnich and
Heiko R{\"{o}}glin},
editor = {Giuseppe F. Italiano and
Giovanni Pighizzini and
Donald Sannella},
title = {Polynomial Kernels for Weighted Problems},
booktitle = {Mathematical Foundations of Computer Science 2015 - 40th International
Symposium, {MFCS} 2015, Milan, Italy, August 24-28, 2015, Proceedings,
Part {II}},
series = {Lecture Notes in Computer Science},
volume = {9235},
pages = {287--298},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-662-48054-0\_24},
doi = {10.1007/978-3-662-48054-0\_24},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/EtscheidKMR15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/FafianieK15,
author = {Stefan Fafianie and
Stefan Kratsch},
editor = {Giuseppe F. Italiano and
Giovanni Pighizzini and
Donald Sannella},
title = {A Shortcut to (Sun)Flowers: Kernels in Logarithmic Space or Linear
Time},
booktitle = {Mathematical Foundations of Computer Science 2015 - 40th International
Symposium, {MFCS} 2015, Milan, Italy, August 24-28, 2015, Proceedings,
Part {II}},
series = {Lecture Notes in Computer Science},
volume = {9235},
pages = {299--310},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-662-48054-0\_25},
doi = {10.1007/978-3-662-48054-0\_25},
timestamp = {Thu, 25 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/FafianieK15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wea/FafianieK15,
author = {Stefan Fafianie and
Stefan Kratsch},
editor = {Evripidis Bampis},
title = {An Experimental Analysis of a Polynomial Compression for the Steiner
Cycle Problem},
booktitle = {Experimental Algorithms - 14th International Symposium, {SEA} 2015,
Paris, France, June 29 - July 1, 2015, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9125},
pages = {367--378},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-319-20086-6\_28},
doi = {10.1007/978-3-319-20086-6\_28},
timestamp = {Thu, 23 Sep 2021 11:47:32 +0200},
biburl = {https://dblp.org/rec/conf/wea/FafianieK15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/FafianieK15,
author = {Stefan Fafianie and
Stefan Kratsch},
title = {A shortcut to (sun)flowers: Kernels in logarithmic space or linear
time},
journal = {CoRR},
volume = {abs/1504.08235},
year = {2015},
url = {http://arxiv.org/abs/1504.08235},
eprinttype = {arXiv},
eprint = {1504.08235},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/FafianieK15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/JansenK15a,
author = {Bart M. P. Jansen and
Stefan Kratsch},
title = {A structural approach to kernels for ILPs: Treewidth and Total Unimodularity},
journal = {CoRR},
volume = {abs/1506.07729},
year = {2015},
url = {http://arxiv.org/abs/1506.07729},
eprinttype = {arXiv},
eprint = {1506.07729},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/JansenK15a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/EtscheidKMR15,
author = {Michael Etscheid and
Stefan Kratsch and
Matthias Mnich and
Heiko R{\"{o}}glin},
title = {Polynomial Kernels for Weighted Problems},
journal = {CoRR},
volume = {abs/1507.03439},
year = {2015},
url = {http://arxiv.org/abs/1507.03439},
eprinttype = {arXiv},
eprint = {1507.03439},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/EtscheidKMR15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/FafianieKQ15,
author = {Stefan Fafianie and
Stefan Kratsch and
Vuong Anh Quyen},
title = {Preprocessing under uncertainty},
journal = {CoRR},
volume = {abs/1510.05503},
year = {2015},
url = {http://arxiv.org/abs/1510.05503},
eprinttype = {arXiv},
eprint = {1510.05503},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/FafianieKQ15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/HolsK15,
author = {Eva{-}Maria C. Hols and
Stefan Kratsch},
title = {A randomized polynomial kernel for Subset Feedback Vertex Set},
journal = {CoRR},
volume = {abs/1512.02510},
year = {2015},
url = {http://arxiv.org/abs/1512.02510},
eprinttype = {arXiv},
eprint = {1512.02510},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/HolsK15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eatcs/Kratsch14,
author = {Stefan Kratsch},
title = {Recent developments in kernelization: {A} survey},
journal = {Bull. {EATCS}},
volume = {113},
year = {2014},
url = {http://eatcs.org/beatcs/index.php/beatcs/article/view/285},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eatcs/Kratsch14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jair/BredereckCHKNSW14,
author = {Robert Bredereck and
Jiehua Chen and
Sepp Hartung and
Stefan Kratsch and
Rolf Niedermeier and
Ondrej Such{\'{y}} and
Gerhard J. Woeginger},
title = {A Multivariate Complexity Analysis of Lobbying in Multiple Referenda},
journal = {J. Artif. Intell. Res.},
volume = {50},
pages = {409--446},
year = {2014},
url = {https://doi.org/10.1613/jair.4285},
doi = {10.1613/JAIR.4285},
timestamp = {Mon, 27 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jair/BredereckCHKNSW14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/FominKPPV14,
author = {Fedor V. Fomin and
Stefan Kratsch and
Marcin Pilipczuk and
Michal Pilipczuk and
Yngve Villanger},
title = {Tight bounds for parameterized complexity of Cluster Editing with
a small number of clusters},
journal = {J. Comput. Syst. Sci.},
volume = {80},
number = {7},
pages = {1430--1447},
year = {2014},
url = {https://doi.org/10.1016/j.jcss.2014.04.015},
doi = {10.1016/J.JCSS.2014.04.015},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/FominKPPV14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/BodlaenderJK14,
author = {Hans L. Bodlaender and
Bart M. P. Jansen and
Stefan Kratsch},
title = {Kernelization Lower Bounds by Cross-Composition},
journal = {{SIAM} J. Discret. Math.},
volume = {28},
number = {1},
pages = {277--305},
year = {2014},
url = {https://doi.org/10.1137/120880240},
doi = {10.1137/120880240},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/BodlaenderJK14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/Kratsch14,
author = {Stefan Kratsch},
title = {Co-Nondeterminism in Compositions: {A} Kernelization Lower Bound for
a Ramsey-Type Problem},
journal = {{ACM} Trans. Algorithms},
volume = {10},
number = {4},
pages = {19:1--19:16},
year = {2014},
url = {https://doi.org/10.1145/2635808},
doi = {10.1145/2635808},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/talg/Kratsch14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/KratschW14,
author = {Stefan Kratsch and
Magnus Wahlstr{\"{o}}m},
title = {Compression via Matroids: {A} Randomized Polynomial Kernel for Odd
Cycle Transversal},
journal = {{ACM} Trans. Algorithms},
volume = {10},
number = {4},
pages = {20:1--20:15},
year = {2014},
url = {https://doi.org/10.1145/2635810},
doi = {10.1145/2635810},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/talg/KratschW14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toct/CyganKPPW14,
author = {Marek Cygan and
Stefan Kratsch and
Marcin Pilipczuk and
Michal Pilipczuk and
Magnus Wahlstr{\"{o}}m},
title = {Clique Cover and Graph Separation: New Incompressibility Results},
journal = {{ACM} Trans. Comput. Theory},
volume = {6},
number = {2},
pages = {6:1--6:19},
year = {2014},
url = {https://doi.org/10.1145/2594439},
doi = {10.1145/2594439},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/toct/CyganKPPW14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toct/KratschPRR14,
author = {Stefan Kratsch and
Marcin Pilipczuk and
Ashutosh Rai and
Venkatesh Raman},
title = {Kernel Lower Bounds using Co-Nondeterminism: Finding Induced Hereditary
Subgraphs},
journal = {{ACM} Trans. Comput. Theory},
volume = {7},
number = {1},
pages = {4:1--4:18},
year = {2014},
url = {https://doi.org/10.1145/2691321},
doi = {10.1145/2691321},
timestamp = {Mon, 08 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/toct/KratschPRR14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/GutinKW14,
author = {Gregory Z. Gutin and
Stefan Kratsch and
Magnus Wahlstr{\"{o}}m},
editor = {Marek Cygan and
Pinar Heggernes},
title = {Polynomial Kernels and User Reductions for the Workflow Satisfiability
Problem},
booktitle = {Parameterized and Exact Computation - 9th International Symposium,
{IPEC} 2014, Wroclaw, Poland, September 10-12, 2014. Revised Selected
Papers},
series = {Lecture Notes in Computer Science},
volume = {8894},
pages = {208--220},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-13524-3\_18},
doi = {10.1007/978-3-319-13524-3\_18},
timestamp = {Sat, 19 Oct 2019 20:25:35 +0200},
biburl = {https://dblp.org/rec/conf/iwpec/GutinKW14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/0002KKPP14,
author = {Matthew Johnson and
Dieter Kratsch and
Stefan Kratsch and
Viresh Patel and
Dani{\"{e}}l Paulusma},
editor = {Marek Cygan and
Pinar Heggernes},
title = {Finding Shortest Paths Between Graph Colourings},
booktitle = {Parameterized and Exact Computation - 9th International Symposium,
{IPEC} 2014, Wroclaw, Poland, September 10-12, 2014. Revised Selected
Papers},
series = {Lecture Notes in Computer Science},
volume = {8894},
pages = {221--233},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-13524-3\_19},
doi = {10.1007/978-3-319-13524-3\_19},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/iwpec/0002KKPP14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/KratschQ14,
author = {Stefan Kratsch and
Vuong Anh Quyen},
editor = {Marek Cygan and
Pinar Heggernes},
title = {On Kernels for Covering and Packing ILPs with Small Coefficients},
booktitle = {Parameterized and Exact Computation - 9th International Symposium,
{IPEC} 2014, Wroclaw, Poland, September 10-12, 2014. Revised Selected
Papers},
series = {Lecture Notes in Computer Science},
volume = {8894},
pages = {307--318},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-13524-3\_26},
doi = {10.1007/978-3-319-13524-3\_26},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/iwpec/KratschQ14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/FafianieK14,
author = {Stefan Fafianie and
Stefan Kratsch},
editor = {Erzs{\'{e}}bet Csuhaj{-}Varj{\'{u}} and
Martin Dietzfelbinger and
Zolt{\'{a}}n {\'{E}}sik},
title = {Streaming Kernelization},
booktitle = {Mathematical Foundations of Computer Science 2014 - 39th International
Symposium, {MFCS} 2014, Budapest, Hungary, August 25-29, 2014. Proceedings,
Part {II}},
series = {Lecture Notes in Computer Science},
volume = {8635},
pages = {275--286},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-662-44465-8\_24},
doi = {10.1007/978-3-662-44465-8\_24},
timestamp = {Tue, 14 May 2019 10:00:37 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/FafianieK14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/KratschPR14,
author = {Stefan Kratsch and
Geevarghese Philip and
Saurabh Ray},
editor = {Chandra Chekuri},
title = {Point Line Cover: The Easy Kernel is Essentially Tight},
booktitle = {Proceedings of the Twenty-Fifth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2014, Portland, Oregon, USA, January 5-7, 2014},
pages = {1596--1606},
publisher = {{SIAM}},
year = {2014},
url = {https://doi.org/10.1137/1.9781611973402.116},
doi = {10.1137/1.9781611973402.116},
timestamp = {Tue, 02 Feb 2021 17:07:40 +0100},
biburl = {https://dblp.org/rec/conf/soda/KratschPR14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/waoa/DisserKS14,
author = {Yann Disser and
Stefan Kratsch and
Manuel Sorge},
editor = {Evripidis Bampis and
Ola Svensson},
title = {The Minimum Feasible Tileset Problem},
booktitle = {Approximation and Online Algorithms - 12th International Workshop,
{WAOA} 2014, Wroc{\l}aw, Poland, September 11-12, 2014, Revised Selected
Papers},
series = {Lecture Notes in Computer Science},
volume = {8952},
pages = {144--155},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-18263-6\_13},
doi = {10.1007/978-3-319-18263-6\_13},
timestamp = {Thu, 23 Sep 2021 11:48:40 +0200},
biburl = {https://dblp.org/rec/conf/waoa/DisserKS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/0002KKPP14,
author = {Matthew Johnson and
Dieter Kratsch and
Stefan Kratsch and
Viresh Patel and
Dani{\"{e}}l Paulusma},
title = {Colouring Reconfiguration Is Fixed-Parameter Tractable},
journal = {CoRR},
volume = {abs/1403.6347},
year = {2014},
url = {http://arxiv.org/abs/1403.6347},
eprinttype = {arXiv},
eprint = {1403.6347},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/0002KKPP14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/FafianieK14,
author = {Stefan Fafianie and
Stefan Kratsch},
title = {Streaming Kernelization},
journal = {CoRR},
volume = {abs/1405.1356},
year = {2014},
url = {http://arxiv.org/abs/1405.1356},
eprinttype = {arXiv},
eprint = {1405.1356},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/FafianieK14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/GutinKW14,
author = {Gregory Z. Gutin and
Stefan Kratsch and
Magnus Wahlstr{\"{o}}m},
title = {Polynomial Kernels and User Reductions for the Workflow Satisfiability
Problem},
journal = {CoRR},
volume = {abs/1409.7261},
year = {2014},
url = {http://arxiv.org/abs/1409.7261},
eprinttype = {arXiv},
eprint = {1409.7261},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/GutinKW14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/DisserKS14,
author = {Yann Disser and
Stefan Kratsch and
Manuel Sorge},
title = {The Minimum Feasible Tileset problem},
journal = {CoRR},
volume = {abs/1409.8524},
year = {2014},
url = {http://arxiv.org/abs/1409.8524},
eprinttype = {arXiv},
eprint = {1409.8524},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/DisserKS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/KratschS14,
author = {Stefan Kratsch and
Manuel Sorge},
title = {On Kernelization and Approximation for the Vector Connectivity Problem},
journal = {CoRR},
volume = {abs/1410.8819},
year = {2014},
url = {http://arxiv.org/abs/1410.8819},
eprinttype = {arXiv},
eprint = {1410.8819},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/KratschS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dagstuhl-reports/KratschLMR14,
author = {Stefan Kratsch and
Daniel Lokshtanov and
D{\'{a}}niel Marx and
Peter Rossmanith},
title = {Optimality and tight results in parameterized complexity (Dagstuhl
Seminar 14451)},
journal = {Dagstuhl Reports},
volume = {4},
number = {11},
pages = {1--21},
year = {2014},
url = {https://doi.org/10.4230/DagRep.4.11.1},
doi = {10.4230/DAGREP.4.11.1},
timestamp = {Wed, 07 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dagstuhl-reports/KratschLMR14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/KratschN13,
author = {Stefan Kratsch and
Frank Neumann},
title = {Fixed-Parameter Evolutionary Algorithms and the Vertex Cover Problem},
journal = {Algorithmica},
volume = {65},
number = {4},
pages = {754--771},
year = {2013},
url = {https://doi.org/10.1007/s00453-012-9660-4},
doi = {10.1007/S00453-012-9660-4},
timestamp = {Mon, 30 Jul 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/KratschN13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/HermelinHKW13,
author = {Danny Hermelin and
Chien{-}Chung Huang and
Stefan Kratsch and
Magnus Wahlstr{\"{o}}m},
title = {Parameterized Two-Player Nash Equilibrium},
journal = {Algorithmica},
volume = {65},
number = {4},
pages = {802--816},
year = {2013},
url = {https://doi.org/10.1007/s00453-011-9609-z},
doi = {10.1007/S00453-011-9609-Z},
timestamp = {Tue, 24 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/HermelinHKW13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/disopt/KratschW13,
author = {Stefan Kratsch and
Magnus Wahlstr{\"{o}}m},
title = {Two edge modification problems without polynomial kernels},
journal = {Discret. Optim.},
volume = {10},
number = {3},
pages = {193--199},
year = {2013},
url = {https://doi.org/10.1016/j.disopt.2013.02.001},
doi = {10.1016/J.DISOPT.2013.02.001},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/disopt/KratschW13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/JansenK13,
author = {Bart M. P. Jansen and
Stefan Kratsch},
title = {Data reduction for graph coloring problems},
journal = {Inf. Comput.},
volume = {231},
pages = {70--88},
year = {2013},
url = {https://doi.org/10.1016/j.ic.2013.08.005},
doi = {10.1016/J.IC.2013.08.005},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iandc/JansenK13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/JansenKMS13,
author = {Klaus Jansen and
Stefan Kratsch and
D{\'{a}}niel Marx and
Ildik{\'{o}} Schlotter},
title = {Bin packing with fixed number of bins revisited},
journal = {J. Comput. Syst. Sci.},
volume = {79},
number = {1},
pages = {39--49},
year = {2013},
url = {https://doi.org/10.1016/j.jcss.2012.04.004},
doi = {10.1016/J.JCSS.2012.04.004},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jcss/JansenKMS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/BodlaenderJK13,
author = {Hans L. Bodlaender and
Bart M. P. Jansen and
Stefan Kratsch},
title = {Preprocessing for Treewidth: {A} Combinatorial Analysis through Kernelization},
journal = {{SIAM} J. Discret. Math.},
volume = {27},
number = {4},
pages = {2108--2142},
year = {2013},
url = {https://doi.org/10.1137/120903518},
doi = {10.1137/120903518},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/BodlaenderJK13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BodlaenderJK13,
author = {Hans L. Bodlaender and
Bart M. P. Jansen and
Stefan Kratsch},
title = {Kernel bounds for path and cycle problems},
journal = {Theor. Comput. Sci.},
volume = {511},
pages = {117--136},
year = {2013},
url = {https://doi.org/10.1016/j.tcs.2012.09.006},
doi = {10.1016/J.TCS.2012.09.006},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BodlaenderJK13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/HeggernesHJKV13,
author = {Pinar Heggernes and
Pim van 't Hof and
Bart M. P. Jansen and
Stefan Kratsch and
Yngve Villanger},
title = {Parameterized complexity of vertex deletion into perfect graph classes},
journal = {Theor. Comput. Sci.},
volume = {511},
pages = {172--180},
year = {2013},
url = {https://doi.org/10.1016/j.tcs.2012.03.013},
doi = {10.1016/J.TCS.2012.03.013},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/HeggernesHJKV13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aldt/AlonBCKNW13,
author = {Noga Alon and
Robert Bredereck and
Jiehua Chen and
Stefan Kratsch and
Rolf Niedermeier and
Gerhard J. Woeginger},
editor = {Patrice Perny and
Marc Pirlot and
Alexis Tsouki{\`{a}}s},
title = {How to Put through Your Agenda in Collective Binary Decisions},
booktitle = {Algorithmic Decision Theory - Third International Conference, {ADT}
2013, Bruxelles, Belgium, November 12-14, 2013, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8176},
pages = {30--44},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-41575-3\_3},
doi = {10.1007/978-3-642-41575-3\_3},
timestamp = {Mon, 03 Jan 2022 22:21:02 +0100},
biburl = {https://dblp.org/rec/conf/aldt/AlonBCKNW13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/Kratsch13,
author = {Stefan Kratsch},
editor = {Hans L. Bodlaender and
Giuseppe F. Italiano},
title = {On Polynomial Kernels for Integer Linear Programs: Covering, Packing
and Feasibility},
booktitle = {Algorithms - {ESA} 2013 - 21st Annual European Symposium, Sophia Antipolis,
France, September 2-4, 2013. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8125},
pages = {647--658},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-40450-4\_55},
doi = {10.1007/978-3-642-40450-4\_55},
timestamp = {Mon, 03 Jan 2022 22:19:39 +0100},
biburl = {https://dblp.org/rec/conf/esa/Kratsch13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/BodlaenderCKN13,
author = {Hans L. Bodlaender and
Marek Cygan and
Stefan Kratsch and
Jesper Nederlof},
editor = {Fedor V. Fomin and
Rusins Freivalds and
Marta Z. Kwiatkowska and
David Peleg},
title = {Deterministic Single Exponential Time Algorithms for Connectivity
Problems Parameterized by Treewidth},
booktitle = {Automata, Languages, and Programming - 40th International Colloquium,
{ICALP} 2013, Riga, Latvia, July 8-12, 2013, Proceedings, Part {I}},
series = {Lecture Notes in Computer Science},
volume = {7965},
pages = {196--207},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-39206-1\_17},
doi = {10.1007/978-3-642-39206-1\_17},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/BodlaenderCKN13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/HermelinKSWW13,
author = {Danny Hermelin and
Stefan Kratsch and
Karolina Soltys and
Magnus Wahlstr{\"{o}}m and
Xi Wu},
editor = {Gregory Z. Gutin and
Stefan Szeider},
title = {A Completeness Theory for Polynomial (Turing) Kernelization},
booktitle = {Parameterized and Exact Computation - 8th International Symposium,
{IPEC} 2013, Sophia Antipolis, France, September 4-6, 2013, Revised
Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {8246},
pages = {202--215},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-319-03898-8\_18},
doi = {10.1007/978-3-319-03898-8\_18},
timestamp = {Tue, 14 May 2019 10:00:45 +0200},
biburl = {https://dblp.org/rec/conf/iwpec/HermelinKSWW13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/KratschK13,
author = {Dieter Kratsch and
Stefan Kratsch},
editor = {Gregory Z. Gutin and
Stefan Szeider},
title = {The Jump Number Problem: Exact and Parameterized},
booktitle = {Parameterized and Exact Computation - 8th International Symposium,
{IPEC} 2013, Sophia Antipolis, France, September 4-6, 2013, Revised
Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {8246},
pages = {230--242},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-319-03898-8\_20},
doi = {10.1007/978-3-319-03898-8\_20},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/iwpec/KratschK13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/FominKPPV13,
author = {Fedor V. Fomin and
Stefan Kratsch and
Marcin Pilipczuk and
Michal Pilipczuk and
Yngve Villanger},
editor = {Natacha Portier and
Thomas Wilke},
title = {Tight bounds for Parameterized Complexity of Cluster Editing},
booktitle = {30th International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2013, February 27 - March 2, 2013, Kiel, Germany},
series = {LIPIcs},
volume = {20},
pages = {32--43},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2013},
url = {https://doi.org/10.4230/LIPIcs.STACS.2013.32},
doi = {10.4230/LIPICS.STACS.2013.32},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/stacs/FominKPPV13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/Kratsch13,
author = {Stefan Kratsch},
editor = {Natacha Portier and
Thomas Wilke},
title = {On Polynomial Kernels for Sparse Integer Linear Programs},
booktitle = {30th International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2013, February 27 - March 2, 2013, Kiel, Germany},
series = {LIPIcs},
volume = {20},
pages = {80--91},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2013},
url = {https://doi.org/10.4230/LIPIcs.STACS.2013.80},
doi = {10.4230/LIPICS.STACS.2013.80},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/Kratsch13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/CyganKN13,
author = {Marek Cygan and
Stefan Kratsch and
Jesper Nederlof},
editor = {Dan Boneh and
Tim Roughgarden and
Joan Feigenbaum},
title = {Fast hamiltonicity checking via bases of perfect matchings},
booktitle = {Symposium on Theory of Computing Conference, STOC'13, Palo Alto, CA,
USA, June 1-4, 2013},
pages = {301--310},
publisher = {{ACM}},
year = {2013},
url = {https://doi.org/10.1145/2488608.2488646},
doi = {10.1145/2488608.2488646},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/CyganKN13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/BodlaenderKK13,
author = {Hans L. Bodlaender and
Stefan Kratsch and
Vincent J. C. Kreuzen},
editor = {Andreas Brandst{\"{a}}dt and
Klaus Jansen and
R{\"{u}}diger Reischuk},
title = {Fixed-Parameter Tractability and Characterizations of Small Special
Treewidth},
booktitle = {Graph-Theoretic Concepts in Computer Science - 39th International
Workshop, {WG} 2013, L{\"{u}}beck, Germany, June 19-21, 2013,
Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {8165},
pages = {88--99},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-45043-3\_9},
doi = {10.1007/978-3-642-45043-3\_9},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wg/BodlaenderKK13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1302-3494,
author = {Stefan Kratsch},
title = {On Polynomial Kernels for Sparse Integer Linear Programs},
journal = {CoRR},
volume = {abs/1302.3494},
year = {2013},
url = {http://arxiv.org/abs/1302.3494},
eprinttype = {arXiv},
eprint = {1302.3494},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1302-3494.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1302-3496,
author = {Stefan Kratsch},
title = {On Polynomial Kernels for Integer Linear Programs: Covering, Packing
and Feasibility},
journal = {CoRR},
volume = {abs/1302.3496},
year = {2013},
url = {http://arxiv.org/abs/1302.3496},
eprinttype = {arXiv},
eprint = {1302.3496},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1302-3496.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/KratschPR13,
author = {Stefan Kratsch and
Geevarghese Philip and
Saurabh Ray},
title = {Point Line Cover: The Easy Kernel is Essentially Tight},
journal = {CoRR},
volume = {abs/1307.2521},
year = {2013},
url = {http://arxiv.org/abs/1307.2521},
eprinttype = {arXiv},
eprint = {1307.2521},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/KratschPR13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Kratsch12,
author = {Stefan Kratsch},
title = {Polynomial Kernelizations for {MIN} F+{\(\Pi\)}1 and {MAX} {NP}},
journal = {Algorithmica},
volume = {63},
number = {1-2},
pages = {532--550},
year = {2012},
url = {https://doi.org/10.1007/s00453-011-9559-5},
doi = {10.1007/S00453-011-9559-5},
timestamp = {Tue, 26 Jun 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/Kratsch12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aaai/BredereckCHNSK12,
author = {Robert Bredereck and
Jiehua Chen and
Sepp Hartung and
Rolf Niedermeier and
Ondrej Such{\'{y}} and
Stefan Kratsch},
editor = {J{\"{o}}rg Hoffmann and
Bart Selman},
title = {A Multivariate Complexity Analysis of Lobbying in Multiple Referenda},
booktitle = {Proceedings of the Twenty-Sixth {AAAI} Conference on Artificial Intelligence,
July 22-26, 2012, Toronto, Ontario, Canada},
pages = {1292--1298},
publisher = {{AAAI} Press},
year = {2012},
url = {https://doi.org/10.1609/aaai.v26i1.8248},
doi = {10.1609/AAAI.V26I1.8248},
timestamp = {Mon, 04 Sep 2023 15:56:47 +0200},
biburl = {https://dblp.org/rec/conf/aaai/BredereckCHNSK12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/KratschW12,
author = {Stefan Kratsch and
Magnus Wahlstr{\"{o}}m},
title = {Representative Sets and Irrelevant Vertices: New Tools for Kernelization},
booktitle = {53rd Annual {IEEE} Symposium on Foundations of Computer Science, {FOCS}
2012, New Brunswick, NJ, USA, October 20-23, 2012},
pages = {450--459},
publisher = {{IEEE} Computer Society},
year = {2012},
url = {https://doi.org/10.1109/FOCS.2012.46},
doi = {10.1109/FOCS.2012.46},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/KratschW12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/CyganKPPW12,
author = {Marek Cygan and
Stefan Kratsch and
Marcin Pilipczuk and
Michal Pilipczuk and
Magnus Wahlstr{\"{o}}m},
editor = {Artur Czumaj and
Kurt Mehlhorn and
Andrew M. Pitts and
Roger Wattenhofer},
title = {Clique Cover and Graph Separation: New Incompressibility Results},
booktitle = {Automata, Languages, and Programming - 39th International Colloquium,
{ICALP} 2012, Warwick, UK, July 9-13, 2012, Proceedings, Part {I}},
series = {Lecture Notes in Computer Science},
volume = {7391},
pages = {254--265},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-31594-7\_22},
doi = {10.1007/978-3-642-31594-7\_22},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/CyganKPPW12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/KratschPPW12,
author = {Stefan Kratsch and
Marcin Pilipczuk and
Michal Pilipczuk and
Magnus Wahlstr{\"{o}}m},
editor = {Artur Czumaj and
Kurt Mehlhorn and
Andrew M. Pitts and
Roger Wattenhofer},
title = {Fixed-Parameter Tractability of Multicut in Directed Acyclic Graphs},
booktitle = {Automata, Languages, and Programming - 39th International Colloquium,
{ICALP} 2012, Warwick, UK, July 9-13, 2012, Proceedings, Part {I}},
series = {Lecture Notes in Computer Science},
volume = {7391},
pages = {581--593},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-31594-7\_49},
doi = {10.1007/978-3-642-31594-7\_49},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/KratschPPW12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/KratschW12,
author = {Stefan Kratsch and
Magnus Wahlstr{\"{o}}m},
editor = {Yuval Rabani},
title = {Compression via matroids: a randomized polynomial kernel for odd cycle
transversal},
booktitle = {Proceedings of the Twenty-Third Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2012, Kyoto, Japan, January 17-19, 2012},
pages = {94--103},
publisher = {{SIAM}},
year = {2012},
url = {https://doi.org/10.1137/1.9781611973099.8},
doi = {10.1137/1.9781611973099.8},
timestamp = {Tue, 02 Feb 2021 17:07:31 +0100},
biburl = {https://dblp.org/rec/conf/soda/KratschW12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/Kratsch12,
author = {Stefan Kratsch},
editor = {Yuval Rabani},
title = {Co-nondeterminism in compositions: a kernelization lower bound for
a Ramsey-type problem},
booktitle = {Proceedings of the Twenty-Third Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2012, Kyoto, Japan, January 17-19, 2012},
pages = {114--122},
publisher = {{SIAM}},
year = {2012},
url = {https://doi.org/10.1137/1.9781611973099.10},
doi = {10.1137/1.9781611973099.10},
timestamp = {Tue, 02 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/Kratsch12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/BodlaenderJK12,
author = {Hans L. Bodlaender and
Bart M. P. Jansen and
Stefan Kratsch},
editor = {Fedor V. Fomin and
Petteri Kaski},
title = {Kernel Bounds for Structural Parameterizations of Pathwidth},
booktitle = {Algorithm Theory - {SWAT} 2012 - 13th Scandinavian Symposium and Workshops,
Helsinki, Finland, July 4-6, 2012. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7357},
pages = {352--363},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-31155-0\_31},
doi = {10.1007/978-3-642-31155-0\_31},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/BodlaenderJK12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/KratschPRR12,
author = {Stefan Kratsch and
Marcin Pilipczuk and
Ashutosh Rai and
Venkatesh Raman},
editor = {Fedor V. Fomin and
Petteri Kaski},
title = {Kernel Lower Bounds Using Co-nondeterminism: Finding Induced Hereditary
Subgraphs},
booktitle = {Algorithm Theory - {SWAT} 2012 - 13th Scandinavian Symposium and Workshops,
Helsinki, Finland, July 4-6, 2012. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7357},
pages = {364--375},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-31155-0\_32},
doi = {10.1007/978-3-642-31155-0\_32},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/KratschPRR12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/KratschS12,
author = {Stefan Kratsch and
Pascal Schweitzer},
editor = {Martin Charles Golumbic and
Michal Stern and
Avivit Levy and
Gila Morgenstern},
title = {Graph Isomorphism for Graph Classes Characterized by Two Forbidden
Induced Subgraphs},
booktitle = {Graph-Theoretic Concepts in Computer Science - 38th International
Workshop, {WG} 2012, Jerusalem, Israel, June 26-28, 2012, Revised
Selcted Papers},
series = {Lecture Notes in Computer Science},
volume = {7551},
pages = {34--45},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-34611-8\_7},
doi = {10.1007/978-3-642-34611-8\_7},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/wg/KratschS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1202-5749,
author = {Stefan Kratsch and
Marcin Pilipczuk and
Michal Pilipczuk and
Magnus Wahlstr{\"{o}}m},
title = {Fixed-parameter tractability of multicut in directed acyclic graphs},
journal = {CoRR},
volume = {abs/1202.5749},
year = {2012},
url = {http://arxiv.org/abs/1202.5749},
eprinttype = {arXiv},
eprint = {1202.5749},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1202-5749.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1206-5941,
author = {Hans L. Bodlaender and
Bart M. P. Jansen and
Stefan Kratsch},
title = {Kernelization Lower Bounds By Cross-Composition},
journal = {CoRR},
volume = {abs/1206.5941},
year = {2012},
url = {http://arxiv.org/abs/1206.5941},
eprinttype = {arXiv},
eprint = {1206.5941},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1206-5941.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1207-4900,
author = {Hans L. Bodlaender and
Bart M. P. Jansen and
Stefan Kratsch},
title = {Kernel Bounds for Structural Parameterizations of Pathwidth},
journal = {CoRR},
volume = {abs/1207.4900},
year = {2012},
url = {http://arxiv.org/abs/1207.4900},
eprinttype = {arXiv},
eprint = {1207.4900},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1207-4900.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1208-0142,
author = {Stefan Kratsch and
Pascal Schweitzer},
title = {Graph Isomorphism for Graph Classes Characterized by two Forbidden
Induced Subgraphs},
journal = {CoRR},
volume = {abs/1208.0142},
year = {2012},
url = {http://arxiv.org/abs/1208.0142},
eprinttype = {arXiv},
eprint = {1208.0142},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1208-0142.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1211-1505,
author = {Hans L. Bodlaender and
Marek Cygan and
Stefan Kratsch and
Jesper Nederlof},
title = {Solving weighted and counting variants of connectivity problems parameterized
by treewidth deterministically in single exponential time},
journal = {CoRR},
volume = {abs/1211.1505},
year = {2012},
url = {http://arxiv.org/abs/1211.1505},
eprinttype = {arXiv},
eprint = {1211.1505},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1211-1505.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1211-1506,
author = {Marek Cygan and
Stefan Kratsch and
Jesper Nederlof},
title = {Fast Hamiltonicity checking via bases of perfect matchings},
journal = {CoRR},
volume = {abs/1211.1506},
year = {2012},
url = {http://arxiv.org/abs/1211.1506},
eprinttype = {arXiv},
eprint = {1211.1506},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1211-1506.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fct/JansenK11,
author = {Bart M. P. Jansen and
Stefan Kratsch},
editor = {Olaf Owe and
Martin Steffen and
Jan Arne Telle},
title = {Data Reduction for Graph Coloring Problems},
booktitle = {Fundamentals of Computation Theory - 18th International Symposium,
{FCT} 2011, Oslo, Norway, August 22-25, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6914},
pages = {90--101},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-22953-4\_8},
doi = {10.1007/978-3-642-22953-4\_8},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/fct/JansenK11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fct/HeggernesHJKV11,
author = {Pinar Heggernes and
Pim van 't Hof and
Bart M. P. Jansen and
Stefan Kratsch and
Yngve Villanger},
editor = {Olaf Owe and
Martin Steffen and
Jan Arne Telle},
title = {Parameterized Complexity of Vertex Deletion into Perfect Graph Classes},
booktitle = {Fundamentals of Computation Theory - 18th International Symposium,
{FCT} 2011, Oslo, Norway, August 22-25, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6914},
pages = {240--251},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-22953-4\_21},
doi = {10.1007/978-3-642-22953-4\_21},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/fct/HeggernesHJKV11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/BodlaenderJK11,
author = {Hans L. Bodlaender and
Bart M. P. Jansen and
Stefan Kratsch},
editor = {Luca Aceto and
Monika Henzinger and
Jir{\'{\i}} Sgall},
title = {Preprocessing for Treewidth: {A} Combinatorial Analysis through Kernelization},
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 = {437--448},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-22006-7\_37},
doi = {10.1007/978-3-642-22006-7\_37},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/BodlaenderJK11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/JansenK11,
author = {Bart M. P. Jansen and
Stefan Kratsch},
editor = {D{\'{a}}niel Marx and
Peter Rossmanith},
title = {On Polynomial Kernels for Structural Parameterizations of Odd Cycle
Transversal},
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 = {132--144},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-28050-4\_11},
doi = {10.1007/978-3-642-28050-4\_11},
timestamp = {Fri, 09 Apr 2021 18:49:30 +0200},
biburl = {https://dblp.org/rec/conf/iwpec/JansenK11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/BodlaenderJK11,
author = {Hans L. Bodlaender and
Bart M. P. Jansen and
Stefan Kratsch},
editor = {D{\'{a}}niel Marx and
Peter Rossmanith},
title = {Kernel Bounds for Path and Cycle Problems},
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 = {145--158},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-28050-4\_12},
doi = {10.1007/978-3-642-28050-4\_12},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/iwpec/BodlaenderJK11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/GuoKK11,
author = {Jiong Guo and
Iyad A. Kanj and
Stefan Kratsch},
editor = {D{\'{a}}niel Marx and
Peter Rossmanith},
title = {Safe Approximation and Its Relation to Kernelization},
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 = {169--180},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-28050-4\_14},
doi = {10.1007/978-3-642-28050-4\_14},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/iwpec/GuoKK11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/BodlaenderJK11,
author = {Hans L. Bodlaender and
Bart M. P. Jansen and
Stefan Kratsch},
editor = {Thomas Schwentick and
Christoph D{\"{u}}rr},
title = {Cross-Composition: {A} New Technique for Kernelization Lower Bounds},
booktitle = {28th International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2011, March 10-12, 2011, Dortmund, Germany},
series = {LIPIcs},
volume = {9},
pages = {165--176},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2011},
url = {https://doi.org/10.4230/LIPIcs.STACS.2011.165},
doi = {10.4230/LIPICS.STACS.2011.165},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/stacs/BodlaenderJK11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/HermelinHKW11,
author = {Danny Hermelin and
Chien{-}Chung Huang and
Stefan Kratsch and
Magnus Wahlstr{\"{o}}m},
editor = {Petr Kolman and
Jan Kratochv{\'{\i}}l},
title = {Parameterized Two-Player Nash Equilibrium},
booktitle = {Graph-Theoretic Concepts in Computer Science - 37th International
Workshop, {WG} 2011, Tepl{\'{a}} Monastery, Czech Republic, June
21-24, 2011. Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {6986},
pages = {215--226},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-25870-1\_20},
doi = {10.1007/978-3-642-25870-1\_20},
timestamp = {Tue, 24 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/wg/HermelinHKW11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1104-4217,
author = {Hans L. Bodlaender and
Bart M. P. Jansen and
Stefan Kratsch},
title = {Preprocessing for Treewidth: {A} Combinatorial Analysis through Kernelization},
journal = {CoRR},
volume = {abs/1104.4217},
year = {2011},
url = {http://arxiv.org/abs/1104.4217},
eprinttype = {arXiv},
eprint = {1104.4217},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1104-4217.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1104-4229,
author = {Bart M. P. Jansen and
Stefan Kratsch},
title = {Data Reduction for Graph Coloring Problems},
journal = {CoRR},
volume = {abs/1104.4229},
year = {2011},
url = {http://arxiv.org/abs/1104.4229},
eprinttype = {arXiv},
eprint = {1104.4229},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1104-4229.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1106-4141,
author = {Hans L. Bodlaender and
Bart M. P. Jansen and
Stefan Kratsch},
title = {Kernel Bounds for Path and Cycle Problems},
journal = {CoRR},
volume = {abs/1106.4141},
year = {2011},
url = {http://arxiv.org/abs/1106.4141},
eprinttype = {arXiv},
eprint = {1106.4141},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1106-4141.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1107-3068,
author = {Stefan Kratsch and
Magnus Wahlstr{\"{o}}m},
title = {Compression via Matroids: {A} Randomized Polynomial Kernel for Odd
Cycle Transversal},
journal = {CoRR},
volume = {abs/1107.3068},
year = {2011},
url = {http://arxiv.org/abs/1107.3068},
eprinttype = {arXiv},
eprint = {1107.3068},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1107-3068.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1107-3658,
author = {Bart M. P. Jansen and
Stefan Kratsch},
title = {On Polynomial Kernels for Structural Parameterizations of Odd Cycle
Transversal},
journal = {CoRR},
volume = {abs/1107.3658},
year = {2011},
url = {http://arxiv.org/abs/1107.3658},
eprinttype = {arXiv},
eprint = {1107.3658},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1107-3658.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1107-3704,
author = {Stefan Kratsch},
title = {Co-nondeterminism in compositions: {A} kernelization lower bound for
a Ramsey-type problem},
journal = {CoRR},
volume = {abs/1107.3704},
year = {2011},
url = {http://arxiv.org/abs/1107.3704},
eprinttype = {arXiv},
eprint = {1107.3704},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1107-3704.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1110-0976,
author = {Danny Hermelin and
Stefan Kratsch and
Karolina Soltys and
Magnus Wahlstr{\"{o}}m and
Xi Wu},
title = {Hierarchies of Inefficient Kernelizability},
journal = {CoRR},
volume = {abs/1110.0976},
year = {2011},
url = {http://arxiv.org/abs/1110.0976},
eprinttype = {arXiv},
eprint = {1110.0976},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1110-0976.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1111-0570,
author = {Marek Cygan and
Stefan Kratsch and
Marcin Pilipczuk and
Michal Pilipczuk and
Magnus Wahlstr{\"{o}}m},
title = {Clique cover and graph separation: New incompressibility results},
journal = {CoRR},
volume = {abs/1111.0570},
year = {2011},
url = {http://arxiv.org/abs/1111.0570},
eprinttype = {arXiv},
eprint = {1111.0570},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1111-0570.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1111-2195,
author = {Stefan Kratsch and
Magnus Wahlstr{\"{o}}m},
title = {Representative sets and irrelevant vertices: New tools for kernelization},
journal = {CoRR},
volume = {abs/1111.2195},
year = {2011},
url = {http://arxiv.org/abs/1111.2195},
eprinttype = {arXiv},
eprint = {1111.2195},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1111-2195.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1112-4419,
author = {Fedor V. Fomin and
Stefan Kratsch and
Marcin Pilipczuk and
Michal Pilipczuk and
Yngve Villanger},
title = {Subexponential fixed-parameter tractability of cluster editing},
journal = {CoRR},
volume = {abs/1112.4419},
year = {2011},
url = {http://arxiv.org/abs/1112.4419},
eprinttype = {arXiv},
eprint = {1112.4419},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1112-4419.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@phdthesis{DBLP:phd/de/Kratsch2010,
author = {Stefan Kratsch},
title = {Kernelization of generic problems: upper and lower bounds},
school = {Saarland University},
year = {2010},
url = {http://scidok.sulb.uni-saarland.de/volltexte/2011/3530/},
urn = {urn:nbn:de:bsz:291-scidok-35302},
timestamp = {Sat, 17 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/phd/de/Kratsch2010.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/KratschW10,
author = {Stefan Kratsch and
Magnus Wahlstr{\"{o}}m},
editor = {Samson Abramsky and
Cyril Gavoille and
Claude Kirchner and
Friedhelm Meyer auf der Heide and
Paul G. Spirakis},
title = {Preprocessing of Min Ones Problems: {A} Dichotomy},
booktitle = {Automata, Languages and Programming, 37th International Colloquium,
{ICALP} 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part
{I}},
series = {Lecture Notes in Computer Science},
volume = {6198},
pages = {653--665},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-14165-2\_55},
doi = {10.1007/978-3-642-14165-2\_55},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/KratschW10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/KratschMW10,
author = {Stefan Kratsch and
D{\'{a}}niel Marx and
Magnus Wahlstr{\"{o}}m},
editor = {Petr Hlinen{\'{y}} and
Anton{\'{\i}}n Kucera},
title = {Parameterized Complexity and Kernelizability of Max Ones and Exact
Ones Problems},
booktitle = {Mathematical Foundations of Computer Science 2010, 35th International
Symposium, {MFCS} 2010, Brno, Czech Republic, August 23-27, 2010.
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6281},
pages = {489--500},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-15155-2\_43},
doi = {10.1007/978-3-642-15155-2\_43},
timestamp = {Fri, 30 Aug 2019 10:02:28 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/KratschMW10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ppsn/KratschLNO10,
author = {Stefan Kratsch and
Per Kristian Lehre and
Frank Neumann and
Pietro Simone Oliveto},
editor = {Robert Schaefer and
Carlos Cotta and
Joanna Kolodziej and
G{\"{u}}nter Rudolph},
title = {Fixed Parameter Evolutionary Algorithms and Maximum Leaf Spanning
Trees: {A} Matter of Mutation},
booktitle = {Parallel Problem Solving from Nature - {PPSN} XI, 11th International
Conference, Krak{\'{o}}w, Poland, September 11-15, 2010, Proceedings,
Part {I}},
series = {Lecture Notes in Computer Science},
volume = {6238},
pages = {204--213},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-15844-5\_21},
doi = {10.1007/978-3-642-15844-5\_21},
timestamp = {Mon, 15 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ppsn/KratschLNO10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/KratschS10,
author = {Stefan Kratsch and
Pascal Schweitzer},
editor = {Haim Kaplan},
title = {Isomorphism for Graphs of Bounded Feedback Vertex Set Number},
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 = {81--92},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-13731-0\_9},
doi = {10.1007/978-3-642-13731-0\_9},
timestamp = {Tue, 14 May 2019 10:00:39 +0200},
biburl = {https://dblp.org/rec/conf/swat/KratschS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/JansenKMS10,
author = {Klaus Jansen and
Stefan Kratsch and
D{\'{a}}niel Marx and
Ildik{\'{o}} Schlotter},
editor = {Haim Kaplan},
title = {Bin Packing with Fixed Number of Bins Revisited},
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 = {260--272},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-13731-0\_25},
doi = {10.1007/978-3-642-13731-0\_25},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/JansenKMS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1006-2063,
author = {Danny Hermelin and
Chien{-}Chung Huang and
Stefan Kratsch and
Magnus Wahlstr{\"{o}}m},
title = {Parameterized Two-Player Nash Equilibrium},
journal = {CoRR},
volume = {abs/1006.2063},
year = {2010},
url = {http://arxiv.org/abs/1006.2063},
eprinttype = {arXiv},
eprint = {1006.2063},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1006-2063.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1011-4224,
author = {Hans L. Bodlaender and
Bart M. P. Jansen and
Stefan Kratsch},
title = {Cross-Composition: {A} New Technique for Kernelization Lower Bounds},
journal = {CoRR},
volume = {abs/1011.4224},
year = {2010},
url = {http://arxiv.org/abs/1011.4224},
eprinttype = {arXiv},
eprint = {1011.4224},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1011-4224.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gecco/KratschN09,
author = {Stefan Kratsch and
Frank Neumann},
editor = {Franz Rothlauf},
title = {Fixed-parameter evolutionary algorithms and the vertex cover problem},
booktitle = {Genetic and Evolutionary Computation Conference, {GECCO} 2009, Proceedings,
Montreal, Qu{\'{e}}bec, Canada, July 8-12, 2009},
pages = {293--300},
publisher = {{ACM}},
year = {2009},
url = {https://doi.org/10.1145/1569901.1569943},
doi = {10.1145/1569901.1569943},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/gecco/KratschN09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/KratschW09,
author = {Stefan Kratsch and
Magnus Wahlstr{\"{o}}m},
editor = {Jianer Chen and
Fedor V. Fomin},
title = {Two Edge Modification Problems without Polynomial Kernels},
booktitle = {Parameterized and Exact Computation, 4th International Workshop, {IWPEC}
2009, Copenhagen, Denmark, September 10-11, 2009, Revised Selected
Papers},
series = {Lecture Notes in Computer Science},
volume = {5917},
pages = {264--275},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-11269-0\_22},
doi = {10.1007/978-3-642-11269-0\_22},
timestamp = {Tue, 14 May 2019 10:00:45 +0200},
biburl = {https://dblp.org/rec/conf/iwpec/KratschW09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/Kratsch09,
author = {Stefan Kratsch},
editor = {Susanne Albers and
Jean{-}Yves Marion},
title = {Polynomial Kernelizations for {MIN} F\({}^{\mbox{+}}\)Pi\({}_{\mbox{1}}\)
and {MAX} {NP}},
booktitle = {26th International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2009, February 26-28, 2009, Freiburg, Germany, Proceedings},
series = {LIPIcs},
volume = {3},
pages = {601--612},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik, Germany},
year = {2009},
url = {https://doi.org/10.4230/LIPIcs.STACS.2009.1851},
doi = {10.4230/LIPICS.STACS.2009.1851},
timestamp = {Tue, 22 Jun 2021 15:43:57 +0200},
biburl = {https://dblp.org/rec/conf/stacs/Kratsch09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0902-1835,
author = {Stefan Kratsch},
title = {Polynomial Kernelizations for {\textdollar}{\textbackslash}MINF{\_}1{\textdollar}
and {\textdollar}{\textbackslash}MNP{\textdollar}},
journal = {CoRR},
volume = {abs/0902.1835},
year = {2009},
url = {http://arxiv.org/abs/0902.1835},
eprinttype = {arXiv},
eprint = {0902.1835},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0902-1835.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0910-4518,
author = {Stefan Kratsch and
Magnus Wahlstr{\"{o}}m},
title = {Preprocessing of Min Ones Problems: {A} Dichotomy},
journal = {CoRR},
volume = {abs/0910.4518},
year = {2009},
url = {http://arxiv.org/abs/0910.4518},
eprinttype = {arXiv},
eprint = {0910.4518},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0910-4518.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 2024-02-20 20:12 CET 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:
