Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Matthias Mnich
@article{DBLP:journals/talg/ChalermsookKMSUV24,
author = {Parinya Chalermsook and
Matthias Kaul and
Matthias Mnich and
Joachim Spoerhase and
Sumedha Uniyal and
Daniel Vaz},
title = {Approximating Sparsest Cut in Low-treewidth Graphs via Combinatorial
Diameter},
journal = {{ACM} Trans. Algorithms},
volume = {20},
number = {1},
pages = {6:1--6:20},
year = {2024},
url = {https://doi.org/10.1145/3632623},
doi = {10.1145/3632623},
timestamp = {Thu, 29 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/talg/ChalermsookKMSUV24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sofsem/BerndtMS24,
author = {Sebastian Berndt and
Matthias Mnich and
Tobias Stamm},
editor = {Henning Fernau and
Serge Gaspers and
Ralf Klasing},
title = {New Support Size Bounds and Proximity Bounds for Integer Linear Programming},
booktitle = {{SOFSEM} 2024: Theory and Practice of Computer Science - 49th International
Conference on Current Trends in Theory and Practice of Computer Science,
{SOFSEM} 2024, Cochem, Germany, February 19-23, 2024, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {14519},
pages = {82--95},
publisher = {Springer},
year = {2024},
url = {https://doi.org/10.1007/978-3-031-52113-3\_6},
doi = {10.1007/978-3-031-52113-3\_6},
timestamp = {Thu, 29 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/sofsem/BerndtMS24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/KnopKLMO23,
author = {Dusan Knop and
Martin Kouteck{\'{y}} and
Asaf Levin and
Matthias Mnich and
Shmuel Onn},
title = {High-multiplicity N-fold {IP} via configuration {LP}},
journal = {Math. Program.},
volume = {200},
number = {1},
pages = {199--227},
year = {2023},
url = {https://doi.org/10.1007/s10107-022-01882-9},
doi = {10.1007/S10107-022-01882-9},
timestamp = {Tue, 12 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/KnopKLMO23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/BergougnouxCGKM23,
author = {Benjamin Bergougnoux and
Vera Chekan and
Robert Ganian and
Mamadou Moustapha Kant{\'{e}} and
Matthias Mnich and
Sang{-}il Oum and
Michal Pilipczuk and
Erik Jan van Leeuwen},
editor = {Inge Li G{\o}rtz and
Martin Farach{-}Colton and
Simon J. Puglisi and
Grzegorz Herman},
title = {Space-Efficient Parameterized Algorithms on Graphs of Low Shrubdepth},
booktitle = {31st Annual European Symposium on Algorithms, {ESA} 2023, September
4-6, 2023, Amsterdam, The Netherlands},
series = {LIPIcs},
volume = {274},
pages = {18:1--18:18},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.ESA.2023.18},
doi = {10.4230/LIPICS.ESA.2023.18},
timestamp = {Wed, 30 Aug 2023 15:40:45 +0200},
biburl = {https://dblp.org/rec/conf/esa/BergougnouxCGKM23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/DeppertKM23,
author = {Max Deppert and
Matthias Kaul and
Matthias Mnich},
editor = {Inge Li G{\o}rtz and
Martin Farach{-}Colton and
Simon J. Puglisi and
Grzegorz Herman},
title = {A {(3/2} + {\(\epsilon\)})-Approximation for Multiple {TSP} with a
Variable Number of Depots},
booktitle = {31st Annual European Symposium on Algorithms, {ESA} 2023, September
4-6, 2023, Amsterdam, The Netherlands},
series = {LIPIcs},
volume = {274},
pages = {39:1--39:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.ESA.2023.39},
doi = {10.4230/LIPICS.ESA.2023.39},
timestamp = {Fri, 22 Mar 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/esa/DeppertKM23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/KulikMS23,
author = {Ariel Kulik and
Matthias Mnich and
Hadas Shachnai},
title = {Improved Approximations for Vector Bin Packing via Iterative Randomized
Rounding},
booktitle = {64th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2023, Santa Cruz, CA, USA, November 6-9, 2023},
pages = {1366--1376},
publisher = {{IEEE}},
year = {2023},
url = {https://doi.org/10.1109/FOCS57990.2023.00084},
doi = {10.1109/FOCS57990.2023.00084},
timestamp = {Tue, 02 Jan 2024 14:56:14 +0100},
biburl = {https://dblp.org/rec/conf/focs/KulikMS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iccad/DietrichTM23,
author = {Christian Dietrich and
Tim{-}Marek Thomas and
Matthias Mnich},
title = {Checkpoint Placement for Systematic Fault-Injection Campaigns},
booktitle = {{IEEE/ACM} International Conference on Computer Aided Design, {ICCAD}
2023, San Francisco, CA, USA, October 28 - Nov. 2, 2023},
pages = {1--9},
publisher = {{IEEE}},
year = {2023},
url = {https://doi.org/10.1109/ICCAD57390.2023.10323809},
doi = {10.1109/ICCAD57390.2023.10323809},
timestamp = {Sat, 13 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/iccad/DietrichTM23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/0001BJMS23,
author = {Sebastian Berndt and
Hauke Brinkop and
Klaus Jansen and
Matthias Mnich and
Tobias Stamm},
editor = {Satoru Iwata and
Naonori Kakimura},
title = {New Support Size Bounds for Integer Programming, Applied to Makespan
Minimization on Uniformly Related Machines},
booktitle = {34th International Symposium on Algorithms and Computation, {ISAAC}
2023, December 3-6, 2023, Kyoto, Japan},
series = {LIPIcs},
volume = {283},
pages = {13:1--13:18},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2023.13},
doi = {10.4230/LIPICS.ISAAC.2023.13},
timestamp = {Tue, 28 Nov 2023 13:12:50 +0100},
biburl = {https://dblp.org/rec/conf/isaac/0001BJMS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2305-08432,
author = {Sebastian Berndt and
Hauke Brinkop and
Klaus Jansen and
Matthias Mnich and
Tobias Stamm},
title = {New Support Size Bounds for Integer Programming, Applied to Makespan
Minimization on Uniformly Related Machines},
journal = {CoRR},
volume = {abs/2305.08432},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2305.08432},
doi = {10.48550/ARXIV.2305.08432},
eprinttype = {arXiv},
eprint = {2305.08432},
timestamp = {Wed, 28 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2305-08432.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2307-01285,
author = {Benjamin Bergougnoux and
Vera Chekan and
Robert Ganian and
Mamadou Moustapha Kant{\'{e}} and
Matthias Mnich and
Sang{-}il Oum and
Michal Pilipczuk and
Erik Jan van Leeuwen},
title = {Space-Efficient Parameterized Algorithms on Graphs of Low Shrubdepth},
journal = {CoRR},
volume = {abs/2307.01285},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2307.01285},
doi = {10.48550/ARXIV.2307.01285},
eprinttype = {arXiv},
eprint = {2307.01285},
timestamp = {Mon, 10 Jul 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2307-01285.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2307-07180,
author = {Max Deppert and
Matthias Kaul and
Matthias Mnich},
title = {A {(3/2} + {\(\epsilon\)})-Approximation for Multiple {TSP} with a
Variable Number of Depots},
journal = {CoRR},
volume = {abs/2307.07180},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2307.07180},
doi = {10.48550/ARXIV.2307.07180},
eprinttype = {arXiv},
eprint = {2307.07180},
timestamp = {Mon, 24 Jul 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2307-07180.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2308-05521,
author = {Christian Dietrich and
Tim{-}Marek Thomas and
Matthias Mnich},
title = {Checkpoint Placement for Systematic Fault-Injection Campaigns},
journal = {CoRR},
volume = {abs/2308.05521},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2308.05521},
doi = {10.48550/ARXIV.2308.05521},
eprinttype = {arXiv},
eprint = {2308.05521},
timestamp = {Wed, 23 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2308-05521.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2308-12593,
author = {Klaus Heeger and
Danny Hermelin and
Matthias Mnich and
Dvir Shabtay},
title = {No Polynomial Kernels for Knapsack},
journal = {CoRR},
volume = {abs/2308.12593},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2308.12593},
doi = {10.48550/ARXIV.2308.12593},
eprinttype = {arXiv},
eprint = {2308.12593},
timestamp = {Wed, 30 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2308-12593.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/disopt/GokeMM22,
author = {Alexander G{\"{o}}ke and
D{\'{a}}niel Marx and
Matthias Mnich},
title = {Parameterized algorithms for generalizations of Directed Feedback
Vertex Set},
journal = {Discret. Optim.},
volume = {46},
pages = {100740},
year = {2022},
url = {https://doi.org/10.1016/j.disopt.2022.100740},
doi = {10.1016/J.DISOPT.2022.100740},
timestamp = {Sun, 25 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/disopt/GokeMM22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/GokeKMS22,
author = {Alexander G{\"{o}}ke and
Jochen K{\"{o}}nemann and
Matthias Mnich and
Hao Sun},
title = {Hitting Weighted Even Cycles in Planar Graphs},
journal = {{SIAM} J. Discret. Math.},
volume = {36},
number = {4},
pages = {2830--2862},
year = {2022},
url = {https://doi.org/10.1137/21m144894x},
doi = {10.1137/21M144894X},
timestamp = {Sat, 11 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamdm/GokeKMS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/BercziMV22,
author = {Krist{\'{o}}f B{\'{e}}rczi and
Matthias Mnich and
Roland Vincze},
title = {A 3/2-Approximation for the Metric Many-Visits Path {TSP}},
journal = {{SIAM} J. Discret. Math.},
volume = {36},
number = {4},
pages = {2995--3030},
year = {2022},
url = {https://doi.org/10.1137/22m1483414},
doi = {10.1137/22M1483414},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamdm/BercziMV22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:books/sp/22/Abu-KhzamLMN0S22,
author = {Faisal N. Abu{-}Khzam and
Sebastian Lamm and
Matthias Mnich and
Alexander Noe and
Christian Schulz and
Darren Strash},
editor = {Hannah Bast and
Claudius Korzen and
Ulrich Meyer and
Manuel Penschuck},
title = {Recent Advances in Practical Data Reduction},
booktitle = {Algorithms for Big Data - {DFG} Priority Program 1736},
series = {Lecture Notes in Computer Science},
volume = {13201},
pages = {97--133},
publisher = {Springer},
year = {2022},
url = {https://doi.org/10.1007/978-3-031-21534-6\_6},
doi = {10.1007/978-3-031-21534-6\_6},
timestamp = {Tue, 28 Feb 2023 10:35:03 +0100},
biburl = {https://dblp.org/rec/books/sp/22/Abu-KhzamLMN0S22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2201-02054,
author = {Krist{\'{o}}f B{\'{e}}rczi and
Matthias Mnich and
Roland Vincze},
title = {Efficient Approximations for Many-Visits Multiple Traveling Salesman
Problems},
journal = {CoRR},
volume = {abs/2201.02054},
year = {2022},
url = {https://arxiv.org/abs/2201.02054},
eprinttype = {arXiv},
eprint = {2201.02054},
timestamp = {Mon, 10 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2201-02054.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2203-03600,
author = {David Fischer and
Julian Golak and
Matthias Mnich},
title = {Exponentially faster fixed-parameter algorithms for high-multiplicity
scheduling},
journal = {CoRR},
volume = {abs/2203.03600},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2203.03600},
doi = {10.48550/ARXIV.2203.03600},
eprinttype = {arXiv},
eprint = {2203.03600},
timestamp = {Wed, 16 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2203-03600.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2205-12828,
author = {Ariel Kulik and
Matthias Mnich and
Hadas Shachnai},
title = {An Asymptotic (4/3+{\(\epsilon\)})-Approximation for the 2-Dimensional
Vector Bin Packing Problem},
journal = {CoRR},
volume = {abs/2205.12828},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2205.12828},
doi = {10.48550/ARXIV.2205.12828},
eprinttype = {arXiv},
eprint = {2205.12828},
timestamp = {Mon, 30 May 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2205-12828.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2207-12278,
author = {Gregory Z. Gutin and
Matthias Mnich},
title = {A Survey on Graph Problems Parameterized Above and Below Guaranteed
Values},
journal = {CoRR},
volume = {abs/2207.12278},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2207.12278},
doi = {10.48550/ARXIV.2207.12278},
eprinttype = {arXiv},
eprint = {2207.12278},
timestamp = {Mon, 01 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2207-12278.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2209-02017,
author = {Krist{\'{o}}f B{\'{e}}rczi and
Alexander G{\"{o}}ke and
Lydia Mirabel Mendoza Cadena and
Matthias Mnich},
title = {Resolving Infeasibility of Linear Systems: {A} Parameterized Approach},
journal = {CoRR},
volume = {abs/2209.02017},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2209.02017},
doi = {10.48550/ARXIV.2209.02017},
eprinttype = {arXiv},
eprint = {2209.02017},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2209-02017.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/lmcs/FearnleyGMS21,
author = {John Fearnley and
Martin Gairing and
Matthias Mnich and
Rahul Savani},
title = {Reachability Switching Games},
journal = {Log. Methods Comput. Sci.},
volume = {17},
number = {2},
year = {2021},
url = {https://lmcs.episciences.org/7392},
timestamp = {Tue, 01 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/lmcs/FearnleyGMS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/KnopKLMO21,
author = {Dusan Knop and
Martin Kouteck{\'{y}} and
Asaf Levin and
Matthias Mnich and
Shmuel Onn},
title = {Parameterized complexity of configuration integer programs},
journal = {Oper. Res. Lett.},
volume = {49},
number = {6},
pages = {908--913},
year = {2021},
url = {https://doi.org/10.1016/j.orl.2021.11.005},
doi = {10.1016/J.ORL.2021.11.005},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/orl/KnopKLMO21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/GokeKMS21,
author = {Alexander G{\"{o}}ke and
Jochen K{\"{o}}nemann and
Matthias Mnich and
Hao Sun},
editor = {Mary Wootters and
Laura Sanit{\`{a}}},
title = {Hitting Weighted Even Cycles in Planar Graphs},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2021, August 16-18, 2021, University
of Washington, Seattle, Washington, {USA} (Virtual Conference)},
series = {LIPIcs},
volume = {207},
pages = {25:1--25:23},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2021.25},
doi = {10.4230/LIPICS.APPROX/RANDOM.2021.25},
timestamp = {Tue, 21 Sep 2021 09:36:32 +0200},
biburl = {https://dblp.org/rec/conf/approx/GokeKMS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2107-04763,
author = {Alexander G{\"{o}}ke and
Jochen K{\"{o}}nemann and
Matthias Mnich and
Hao Sun},
title = {Hitting Weighted Even Cycles in Planar Graphs},
journal = {CoRR},
volume = {abs/2107.04763},
year = {2021},
url = {https://arxiv.org/abs/2107.04763},
eprinttype = {arXiv},
eprint = {2107.04763},
timestamp = {Tue, 20 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2107-04763.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2111-06299,
author = {Parinya Chalermsook and
Matthias Kaul and
Matthias Mnich and
Joachim Spoerhase and
Sumedha Uniyal and
Daniel Vaz},
title = {Approximating Sparsest Cut in Low-Treewidth Graphs via Combinatorial
Diameter},
journal = {CoRR},
volume = {abs/2111.06299},
year = {2021},
url = {https://arxiv.org/abs/2111.06299},
eprinttype = {arXiv},
eprint = {2111.06299},
timestamp = {Tue, 16 Nov 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2111-06299.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/MnichS20,
author = {Matthias Mnich and
Ildik{\'{o}} Schlotter},
title = {Stable Matchings with Covering Constraints: {A} Complete Computational
Trichotomy},
journal = {Algorithmica},
volume = {82},
number = {5},
pages = {1136--1188},
year = {2020},
url = {https://doi.org/10.1007/s00453-019-00636-y},
doi = {10.1007/S00453-019-00636-Y},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/MnichS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/disopt/AbiadGLMRVVZ20,
author = {Aida Abiad and
Sander Gribling and
Domenico Lahaye and
Matthias Mnich and
Guus Regts and
Llu{\'{\i}}s Vena and
Gerard Verweij and
Peter J. Zwaneveld},
title = {On the complexity of solving a decision problem with flow-depending
costs: The case of the IJsselmeer dikes},
journal = {Discret. Optim.},
volume = {37},
pages = {100565},
year = {2020},
url = {https://doi.org/10.1016/j.disopt.2019.100565},
doi = {10.1016/J.DISOPT.2019.100565},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/disopt/AbiadGLMRVVZ20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/KnopKM20,
author = {Dusan Knop and
Martin Kouteck{\'{y}} and
Matthias Mnich},
title = {Combinatorial n-fold integer programming and applications},
journal = {Math. Program.},
volume = {184},
number = {1},
pages = {1--34},
year = {2020},
url = {https://doi.org/10.1007/s10107-019-01402-2},
doi = {10.1007/S10107-019-01402-2},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mp/KnopKM20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/ChandrasekaranM20,
author = {Karthekeyan Chandrasekaran and
Matthias Mnich and
Sahand Mozaffari},
title = {Odd Multiway Cut in Directed Acyclic Graphs},
journal = {{SIAM} J. Discret. Math.},
volume = {34},
number = {2},
pages = {1385--1408},
year = {2020},
url = {https://doi.org/10.1137/18M1176087},
doi = {10.1137/18M1176087},
timestamp = {Thu, 06 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/ChandrasekaranM20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/BergerKMV20,
author = {Andr{\'{e}} Berger and
L{\'{a}}szl{\'{o}} Kozma and
Matthias Mnich and
Roland Vincze},
title = {Time- and Space-optimal Algorithm for the Many-visits {TSP}},
journal = {{ACM} Trans. Algorithms},
volume = {16},
number = {3},
pages = {35:1--35:22},
year = {2020},
url = {https://doi.org/10.1145/3382038},
doi = {10.1145/3382038},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/talg/BergerKMV20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/AlmanMW20,
author = {Josh Alman and
Matthias Mnich and
Virginia Vassilevska Williams},
title = {Dynamic Parameterized Problems and Algorithms},
journal = {{ACM} Trans. Algorithms},
volume = {16},
number = {4},
pages = {45:1--45:46},
year = {2020},
url = {https://doi.org/10.1145/3395037},
doi = {10.1145/3395037},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/talg/AlmanMW20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/teco/KnopKM20,
author = {Dusan Knop and
Martin Kouteck{\'{y}} and
Matthias Mnich},
title = {Voting and Bribing in Single-Exponential Time},
journal = {{ACM} Trans. Economics and Comput.},
volume = {8},
number = {3},
pages = {12:1--12:28},
year = {2020},
url = {https://doi.org/10.1145/3396855},
doi = {10.1145/3396855},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/teco/KnopKM20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/alenex/FerizovicHLM0S20,
author = {Damir Ferizovic and
Demian Hespe and
Sebastian Lamm and
Matthias Mnich and
Christian Schulz and
Darren Strash},
editor = {Guy E. Blelloch and
Irene Finocchi},
title = {Engineering Kernelization for Maximum Cut},
booktitle = {Proceedings of the Symposium on Algorithm Engineering and Experiments,
{ALENEX} 2020, Salt Lake City, UT, USA, January 5-6, 2020},
pages = {27--41},
publisher = {{SIAM}},
year = {2020},
url = {https://doi.org/10.1137/1.9781611976007.3},
doi = {10.1137/1.9781611976007.3},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/alenex/FerizovicHLM0S20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/GokeMM20,
author = {Alexander G{\"{o}}ke and
D{\'{a}}niel Marx and
Matthias Mnich},
editor = {Artur Czumaj and
Anuj Dawar and
Emanuela Merelli},
title = {Hitting Long Directed Cycles Is Fixed-Parameter Tractable},
booktitle = {47th International Colloquium on Automata, Languages, and Programming,
{ICALP} 2020, July 8-11, 2020, Saarbr{\"{u}}cken, Germany (Virtual
Conference)},
series = {LIPIcs},
volume = {168},
pages = {59:1--59:18},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2020.59},
doi = {10.4230/LIPICS.ICALP.2020.59},
timestamp = {Mon, 21 Dec 2020 13:23:22 +0100},
biburl = {https://dblp.org/rec/conf/icalp/GokeMM20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/BannachBMMLRS20,
author = {Max Bannach and
Sebastian Berndt and
Marten Maack and
Matthias Mnich and
Alexandra Lassota and
Malin Rau and
Malte Skambath},
editor = {Javier Esparza and
Daniel Kr{\'{a}}l'},
title = {Solving Packing Problems with Few Small Items Using Rainbow Matchings},
booktitle = {45th International Symposium on Mathematical Foundations of Computer
Science, {MFCS} 2020, August 24-28, 2020, Prague, Czech Republic},
series = {LIPIcs},
volume = {170},
pages = {11:1--11:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.MFCS.2020.11},
doi = {10.4230/LIPICS.MFCS.2020.11},
timestamp = {Wed, 28 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/BannachBMMLRS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2003-02483,
author = {Alexander G{\"{o}}ke and
D{\'{a}}niel Marx and
Matthias Mnich},
title = {Parameterized Algorithms for Generalizations of Directed Feedback
Vertex Set},
journal = {CoRR},
volume = {abs/2003.02483},
year = {2020},
url = {https://arxiv.org/abs/2003.02483},
eprinttype = {arXiv},
eprint = {2003.02483},
timestamp = {Tue, 10 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2003-02483.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2003-05267,
author = {Alexander G{\"{o}}ke and
D{\'{a}}niel Marx and
Matthias Mnich},
title = {Hitting Long Directed Cycles is Fixed-Parameter Tractable},
journal = {CoRR},
volume = {abs/2003.05267},
year = {2020},
url = {https://arxiv.org/abs/2003.05267},
eprinttype = {arXiv},
eprint = {2003.05267},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2003-05267.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2004-14102,
author = {Marek Karpinski and
Mateusz Lewandowski and
Syed Mohammad Meesum and
Matthias Mnich},
title = {Dense Steiner problems: Approximation algorithms and inapproximability},
journal = {CoRR},
volume = {abs/2004.14102},
year = {2020},
url = {https://arxiv.org/abs/2004.14102},
eprinttype = {arXiv},
eprint = {2004.14102},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2004-14102.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2007-02660,
author = {Max Bannach and
Sebastian Berndt and
Marten Maack and
Matthias Mnich and
Alexandra Lassota and
Malin Rau and
Malte Skambath},
title = {Solving Packing Problems with Few Small Items Using Rainbow Matchings},
journal = {CoRR},
volume = {abs/2007.02660},
year = {2020},
url = {https://arxiv.org/abs/2007.02660},
eprinttype = {arXiv},
eprint = {2007.02660},
timestamp = {Wed, 28 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2007-02660.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2007-11389,
author = {Krist{\'{o}}f B{\'{e}}rczi and
Matthias Mnich and
Roland Vincze},
title = {A 3/2-Approximation for the Metric Many-visits Path {TSP}},
journal = {CoRR},
volume = {abs/2007.11389},
year = {2020},
url = {https://arxiv.org/abs/2007.11389},
eprinttype = {arXiv},
eprint = {2007.11389},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2007-11389.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2012-12594,
author = {Faisal N. Abu{-}Khzam and
Sebastian Lamm and
Matthias Mnich and
Alexander Noe and
Christian Schulz and
Darren Strash},
title = {Recent Advances in Practical Data Reduction},
journal = {CoRR},
volume = {abs/2012.12594},
year = {2020},
url = {https://arxiv.org/abs/2012.12594},
eprinttype = {arXiv},
eprint = {2012.12594},
timestamp = {Thu, 10 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2012-12594.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/HermelinMLW19,
author = {Danny Hermelin and
Matthias Mnich and
Erik Jan van Leeuwen and
Gerhard J. Woeginger},
title = {Domination When the Stars Are Out},
journal = {{ACM} Trans. Algorithms},
volume = {15},
number = {2},
pages = {25:1--25:90},
year = {2019},
url = {https://doi.org/10.1145/3301445},
doi = {10.1145/3301445},
timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/talg/HermelinMLW19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/GokeMM19,
author = {Alexander G{\"{o}}ke and
D{\'{a}}niel Marx and
Matthias Mnich},
editor = {Pinar Heggernes},
title = {Parameterized Algorithms for Generalizations of Directed Feedback
Vertex Set},
booktitle = {Algorithms and Complexity - 11th International Conference, {CIAC}
2019, Rome, Italy, May 27-29, 2019, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {11485},
pages = {249--261},
publisher = {Springer},
year = {2019},
url = {https://doi.org/10.1007/978-3-030-17402-6\_21},
doi = {10.1007/978-3-030-17402-6\_21},
timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/ciac/GokeMM19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/GokeCM19,
author = {Alexander G{\"{o}}ke and
Lydia Mirabel Mendoza Cadena and
Matthias Mnich},
editor = {Bart M. P. Jansen and
Jan Arne Telle},
title = {Resolving Infeasibility of Linear Systems: {A} Parameterized Approach},
booktitle = {14th International Symposium on Parameterized and Exact Computation,
{IPEC} 2019, September 11-13, 2019, Munich, Germany},
series = {LIPIcs},
volume = {148},
pages = {17:1--17:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.IPEC.2019.17},
doi = {10.4230/LIPICS.IPEC.2019.17},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/iwpec/GokeCM19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/Berger0MV19,
author = {Andr{\'{e}} Berger and
L{\'{a}}szl{\'{o}} Kozma and
Matthias Mnich and
Roland Vincze},
editor = {Timothy M. Chan},
title = {A time- and space-optimal algorithm for the many-visits {TSP}},
booktitle = {Proceedings of the Thirtieth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2019, San Diego, California, USA, January 6-9,
2019},
pages = {1770--1782},
publisher = {{SIAM}},
year = {2019},
url = {https://doi.org/10.1137/1.9781611975482.106},
doi = {10.1137/1.9781611975482.106},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/Berger0MV19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1905-10902,
author = {Damir Ferizovic and
Demian Hespe and
Sebastian Lamm and
Matthias Mnich and
Christian Schulz and
Darren Strash},
title = {Engineering Kernelization for Maximum Cut},
journal = {CoRR},
volume = {abs/1905.10902},
year = {2019},
url = {http://arxiv.org/abs/1905.10902},
eprinttype = {arXiv},
eprint = {1905.10902},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1905-10902.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1909-07326,
author = {Dusan Knop and
Martin Kouteck{\'{y}} and
Asaf Levin and
Matthias Mnich and
Shmuel Onn},
title = {Multitype Integer Monoid Optimization and Applications},
journal = {CoRR},
volume = {abs/1909.07326},
year = {2019},
url = {http://arxiv.org/abs/1909.07326},
eprinttype = {arXiv},
eprint = {1909.07326},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1909-07326.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1911-09890,
author = {Krist{\'{o}}f B{\'{e}}rczi and
Andr{\'{e}} Berger and
Matthias Mnich and
Roland Vincze},
title = {Degree-Bounded Generalized Polymatroids and Approximating the Metric
Many-Visits {TSP}},
journal = {CoRR},
volume = {abs/1911.09890},
year = {2019},
url = {http://arxiv.org/abs/1911.09890},
eprinttype = {arXiv},
eprint = {1911.09890},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1911-09890.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1911-12350,
author = {Danny Hermelin and
Matthias Mnich and
Simon Omlor},
title = {Single Machine Batch Scheduling to Minimize the Weighted Number of
Tardy Jobs},
journal = {CoRR},
volume = {abs/1911.12350},
year = {2019},
url = {http://arxiv.org/abs/1911.12350},
eprinttype = {arXiv},
eprint = {1911.12350},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1911-12350.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/EtscheidM18,
author = {Michael Etscheid and
Matthias Mnich},
title = {Linear Kernels and Linear-Time Algorithms for Finding Large Cuts},
journal = {Algorithmica},
volume = {80},
number = {9},
pages = {2574--2615},
year = {2018},
url = {https://doi.org/10.1007/s00453-017-0388-z},
doi = {10.1007/S00453-017-0388-Z},
timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/EtscheidM18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cor/MnichB18,
author = {Matthias Mnich and
Ren{\'{e}} van Bevern},
title = {Parameterized complexity of machine scheduling: 15 open problems},
journal = {Comput. Oper. Res.},
volume = {100},
pages = {254--261},
year = {2018},
url = {https://doi.org/10.1016/j.cor.2018.07.020},
doi = {10.1016/J.COR.2018.07.020},
timestamp = {Tue, 16 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cor/MnichB18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/disopt/MnichRS18,
author = {Matthias Mnich and
Ignaz Rutter and
Jens M. Schmidt},
title = {Linear-time recognition of map graphs with outerplanar witness},
journal = {Discret. Optim.},
volume = {28},
pages = {63--77},
year = {2018},
url = {https://doi.org/10.1016/j.disopt.2017.12.002},
doi = {10.1016/J.DISOPT.2017.12.002},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/disopt/MnichRS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/disopt/MnichRR18,
author = {Matthias Mnich and
Heiko R{\"{o}}glin and
Clemens R{\"{o}}sner},
title = {New deterministic algorithms for solving parity games},
journal = {Discret. Optim.},
volume = {30},
pages = {73--95},
year = {2018},
url = {https://doi.org/10.1016/j.disopt.2018.06.001},
doi = {10.1016/J.DISOPT.2018.06.001},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/disopt/MnichRR18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eor/MnichM18,
author = {Matthias Mnich and
Tobias M{\"{o}}mke},
title = {Improved integrality gap upper bounds for traveling salesperson problems
with distances one and two},
journal = {Eur. J. Oper. Res.},
volume = {266},
number = {2},
pages = {436--457},
year = {2018},
url = {https://doi.org/10.1016/j.ejor.2017.09.036},
doi = {10.1016/J.EJOR.2017.09.036},
timestamp = {Fri, 21 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eor/MnichM18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/MnichT18,
author = {Matthias Mnich and
Eva{-}Lotta Teutrine},
title = {Improved bounds for minimal feedback vertex sets in tournaments},
journal = {J. Graph Theory},
volume = {88},
number = {3},
pages = {482--506},
year = {2018},
url = {https://doi.org/10.1002/jgt.22225},
doi = {10.1002/JGT.22225},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/MnichT18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ki/Mnich18,
author = {Matthias Mnich},
title = {Big data algorithms beyond machine learning},
journal = {K{\"{u}}nstliche Intell.},
volume = {32},
number = {1},
pages = {9--17},
year = {2018},
url = {https://doi.org/10.1007/s13218-017-0517-5},
doi = {10.1007/S13218-017-0517-5},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ki/Mnich18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/FleszarMS18,
author = {Krzysztof Fleszar and
Matthias Mnich and
Joachim Spoerhase},
title = {New algorithms for maximum disjoint paths based on tree-likeness},
journal = {Math. Program.},
volume = {171},
number = {1-2},
pages = {433--461},
year = {2018},
url = {https://doi.org/10.1007/s10107-017-1199-3},
doi = {10.1007/S10107-017-1199-3},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/FleszarMS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/atal/KnopKM18,
author = {Dusan Knop and
Martin Kouteck{\'{y}} and
Matthias Mnich},
editor = {Elisabeth Andr{\'{e}} and
Sven Koenig and
Mehdi Dastani and
Gita Sukthankar},
title = {A Unifying Framework for Manipulation Problems},
booktitle = {Proceedings of the 17th International Conference on Autonomous Agents
and MultiAgent Systems, {AAMAS} 2018, Stockholm, Sweden, July 10-15,
2018},
pages = {256--264},
publisher = {International Foundation for Autonomous Agents and Multiagent Systems
Richland, SC, {USA} / {ACM}},
year = {2018},
url = {http://dl.acm.org/citation.cfm?id=3237427},
timestamp = {Sat, 30 Sep 2023 09:34:53 +0200},
biburl = {https://dblp.org/rec/conf/atal/KnopKM18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/AdamaszekMP18,
author = {Anna Adamaszek and
Matthias Mnich and
Katarzyna Paluch},
editor = {Ioannis Chatzigiannakis and
Christos Kaklamanis and
D{\'{a}}niel Marx and
Donald Sannella},
title = {New Approximation Algorithms for (1, 2)-TSP},
booktitle = {45th International Colloquium on Automata, Languages, and Programming,
{ICALP} 2018, July 9-13, 2018, Prague, Czech Republic},
series = {LIPIcs},
volume = {107},
pages = {9:1--9:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2018.9},
doi = {10.4230/LIPICS.ICALP.2018.9},
timestamp = {Thu, 20 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/AdamaszekMP18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/FearnleyGMS18,
author = {John Fearnley and
Martin Gairing and
Matthias Mnich and
Rahul Savani},
editor = {Ioannis Chatzigiannakis and
Christos Kaklamanis and
D{\'{a}}niel Marx and
Donald Sannella},
title = {Reachability Switching Games},
booktitle = {45th International Colloquium on Automata, Languages, and Programming,
{ICALP} 2018, July 9-13, 2018, Prague, Czech Republic},
series = {LIPIcs},
volume = {107},
pages = {124:1--124:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2018.124},
doi = {10.4230/LIPICS.ICALP.2018.124},
timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/icalp/FearnleyGMS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1801-09584,
author = {Dusan Knop and
Martin Kouteck{\'{y}} and
Matthias Mnich},
title = {A Unifying Framework for Manipulation Problems},
journal = {CoRR},
volume = {abs/1801.09584},
year = {2018},
url = {http://arxiv.org/abs/1801.09584},
eprinttype = {arXiv},
eprint = {1801.09584},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1801-09584.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1804-06361,
author = {Andr{\'{e}} Berger and
L{\'{a}}szl{\'{o}} Kozma and
Matthias Mnich and
Roland Vincze},
title = {Time- and space-optimal algorithms for the many-visits {TSP}},
journal = {CoRR},
volume = {abs/1804.06361},
year = {2018},
url = {http://arxiv.org/abs/1804.06361},
eprinttype = {arXiv},
eprint = {1804.06361},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1804-06361.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1812-01852,
author = {Dusan Knop and
Martin Kouteck{\'{y}} and
Matthias Mnich},
title = {Voting and Bribing in Single-Exponential Time},
journal = {CoRR},
volume = {abs/1812.01852},
year = {2018},
url = {http://arxiv.org/abs/1812.01852},
eprinttype = {arXiv},
eprint = {1812.01852},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1812-01852.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/disopt/MnichL17,
author = {Matthias Mnich and
Erik Jan van Leeuwen},
title = {Polynomial kernels for deletion to classes of acyclic digraphs},
journal = {Discret. Optim.},
volume = {25},
pages = {48--76},
year = {2017},
url = {https://doi.org/10.1016/j.disopt.2017.02.002},
doi = {10.1016/J.DISOPT.2017.02.002},
timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/disopt/MnichL17.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}
}
@article{DBLP:journals/siamdm/DvorakM17,
author = {Zdenek Dvor{\'{a}}k and
Matthias Mnich},
title = {Large Independent Sets in Triangle-Free Planar Graphs},
journal = {{SIAM} J. Discret. Math.},
volume = {31},
number = {2},
pages = {1355--1373},
year = {2017},
url = {https://doi.org/10.1137/16M1061862},
doi = {10.1137/16M1061862},
timestamp = {Fri, 01 Dec 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamdm/DvorakM17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/KnopKM17,
author = {Dusan Knop and
Martin Kouteck{\'{y}} and
Matthias Mnich},
editor = {Kirk Pruhs and
Christian Sohler},
title = {Combinatorial n-fold Integer Programming and Applications},
booktitle = {25th Annual European Symposium on Algorithms, {ESA} 2017, September
4-6, 2017, Vienna, Austria},
series = {LIPIcs},
volume = {87},
pages = {54:1--54:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.ESA.2017.54},
doi = {10.4230/LIPICS.ESA.2017.54},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/esa/KnopKM17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/AlmanMW17,
author = {Josh Alman and
Matthias Mnich and
Virginia Vassilevska Williams},
editor = {Ioannis Chatzigiannakis and
Piotr Indyk and
Fabian Kuhn and
Anca Muscholl},
title = {Dynamic Parameterized Problems and Algorithms},
booktitle = {44th International Colloquium on Automata, Languages, and Programming,
{ICALP} 2017, July 10-14, 2017, Warsaw, Poland},
series = {LIPIcs},
volume = {80},
pages = {41:1--41:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2017.41},
doi = {10.4230/LIPICS.ICALP.2017.41},
timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/icalp/AlmanMW17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sagt/MnichS17,
author = {Matthias Mnich and
Ildik{\'{o}} Schlotter},
editor = {Vittorio Bil{\`{o}} and
Michele Flammini},
title = {Stable Marriage with Covering Constraints-A Complete Computational
Trichotomy},
booktitle = {Algorithmic Game Theory - 10th International Symposium, {SAGT} 2017,
L'Aquila, Italy, September 12-14, 2017, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10504},
pages = {320--332},
publisher = {Springer},
year = {2017},
url = {https://doi.org/10.1007/978-3-319-66700-3\_25},
doi = {10.1007/978-3-319-66700-3\_25},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sagt/MnichS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/KnopKM17,
author = {Dusan Knop and
Martin Kouteck{\'{y}} and
Matthias Mnich},
editor = {Heribert Vollmer and
Brigitte Vall{\'{e}}e},
title = {Voting and Bribing in Single-Exponential Time},
booktitle = {34th Symposium on Theoretical Aspects of Computer Science, {STACS}
2017, March 8-11, 2017, Hannover, Germany},
series = {LIPIcs},
volume = {66},
pages = {46:1--46:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.STACS.2017.46},
doi = {10.4230/LIPICS.STACS.2017.46},
timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stacs/KnopKM17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/KnopKM17,
author = {Dusan Knop and
Martin Kouteck{\'{y}} and
Matthias Mnich},
title = {Combinatorial n-fold Integer Programming and Applications},
journal = {CoRR},
volume = {abs/1705.08657},
year = {2017},
url = {http://arxiv.org/abs/1705.08657},
eprinttype = {arXiv},
eprint = {1705.08657},
timestamp = {Sat, 23 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/KnopKM17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/AlmanMW17,
author = {Josh Alman and
Matthias Mnich and
Virginia Vassilevska Williams},
title = {Dynamic Parameterized Problems and Algorithms},
journal = {CoRR},
volume = {abs/1707.00362},
year = {2017},
url = {http://arxiv.org/abs/1707.00362},
eprinttype = {arXiv},
eprint = {1707.00362},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/AlmanMW17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1708-02323,
author = {Karthekeyan Chandrasekaran and
Matthias Mnich and
Sahand Mozaffari},
title = {Odd Multiway Cut in Directed Acyclic Graphs},
journal = {CoRR},
volume = {abs/1708.02323},
year = {2017},
url = {http://arxiv.org/abs/1708.02323},
eprinttype = {arXiv},
eprint = {1708.02323},
timestamp = {Sat, 23 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1708-02323.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1709-01670,
author = {Matthias Mnich and
Ren{\'{e}} van Bevern},
title = {Parameterized complexity of machine scheduling: 15 open problems},
journal = {CoRR},
volume = {abs/1709.01670},
year = {2017},
url = {http://arxiv.org/abs/1709.01670},
eprinttype = {arXiv},
eprint = {1709.01670},
timestamp = {Sat, 23 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1709-01670.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1709-08991,
author = {John Fearnley and
Martin Gairing and
Matthias Mnich and
Rahul Savani},
title = {Reachability Switching Games},
journal = {CoRR},
volume = {abs/1709.08991},
year = {2017},
url = {http://arxiv.org/abs/1709.08991},
eprinttype = {arXiv},
eprint = {1709.08991},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1709-08991.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/AdamaszekAMS16,
author = {Anna Adamaszek and
Michal Adamaszek and
Matthias Mnich and
Jens M. Schmidt},
title = {Lower Bounds for Locally Highly Connected Graphs},
journal = {Graphs Comb.},
volume = {32},
number = {5},
pages = {1641--1650},
year = {2016},
url = {https://doi.org/10.1007/s00373-016-1686-y},
doi = {10.1007/S00373-016-1686-Y},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/AdamaszekAMS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/BringmannHML16,
author = {Karl Bringmann and
Danny Hermelin and
Matthias Mnich and
Erik Jan van Leeuwen},
title = {Parameterized complexity dichotomy for Steiner Multicut},
journal = {J. Comput. Syst. Sci.},
volume = {82},
number = {6},
pages = {1020--1043},
year = {2016},
url = {https://doi.org/10.1016/j.jcss.2016.03.003},
doi = {10.1016/J.JCSS.2016.03.003},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/BringmannHML16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/FleszarMS16,
author = {Krzysztof Fleszar and
Matthias Mnich and
Joachim Spoerhase},
editor = {Piotr Sankowski and
Christos D. Zaroliagis},
title = {New Algorithms for Maximum Disjoint Paths Based on Tree-Likeness},
booktitle = {24th Annual European Symposium on Algorithms, {ESA} 2016, August 22-24,
2016, Aarhus, Denmark},
series = {LIPIcs},
volume = {57},
pages = {42:1--42:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.ESA.2016.42},
doi = {10.4230/LIPICS.ESA.2016.42},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/esa/FleszarMS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/MnichWV16,
author = {Matthias Mnich and
Virginia Vassilevska Williams and
L{\'{a}}szl{\'{o}} A. V{\'{e}}gh},
editor = {Piotr Sankowski and
Christos D. Zaroliagis},
title = {A 7/3-Approximation for Feedback Vertex Sets in Tournaments},
booktitle = {24th Annual European Symposium on Algorithms, {ESA} 2016, August 22-24,
2016, Aarhus, Denmark},
series = {LIPIcs},
volume = {57},
pages = {67:1--67:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.ESA.2016.67},
doi = {10.4230/LIPICS.ESA.2016.67},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/esa/MnichWV16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/EtscheidM16,
author = {Michael Etscheid and
Matthias Mnich},
editor = {Seok{-}Hee Hong},
title = {Linear Kernels and Linear-Time Algorithms for Finding Large Cuts},
booktitle = {27th International Symposium on Algorithms and Computation, {ISAAC}
2016, December 12-14, 2016, Sydney, Australia},
series = {LIPIcs},
volume = {64},
pages = {31:1--31:13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2016.31},
doi = {10.4230/LIPICS.ISAAC.2016.31},
timestamp = {Thu, 27 Apr 2023 14:57:19 +0200},
biburl = {https://dblp.org/rec/conf/isaac/EtscheidM16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/MnichT16,
author = {Matthias Mnich and
Eva{-}Lotta Teutrine},
editor = {Jiong Guo and
Danny Hermelin},
title = {Improved Bounds for Minimal Feedback Vertex Sets in Tournaments},
booktitle = {11th International Symposium on Parameterized and Exact Computation,
{IPEC} 2016, August 24-26, 2016, Aarhus, Denmark},
series = {LIPIcs},
volume = {63},
pages = {24:1--24:10},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.IPEC.2016.24},
doi = {10.4230/LIPICS.IPEC.2016.24},
timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/iwpec/MnichT16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/latin/MnichRR16,
author = {Matthias Mnich and
Heiko R{\"{o}}glin and
Clemens R{\"{o}}sner},
editor = {Evangelos Kranakis and
Gonzalo Navarro and
Edgar Ch{\'{a}}vez},
title = {New Deterministic Algorithms for Solving Parity Games},
booktitle = {{LATIN} 2016: Theoretical Informatics - 12th Latin American Symposium,
Ensenada, Mexico, April 11-15, 2016, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9644},
pages = {634--645},
publisher = {Springer},
year = {2016},
url = {https://doi.org/10.1007/978-3-662-49529-2\_47},
doi = {10.1007/978-3-662-49529-2\_47},
timestamp = {Wed, 28 Feb 2024 00:16:41 +0100},
biburl = {https://dblp.org/rec/conf/latin/MnichRR16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/MnichL16,
author = {Matthias Mnich and
Erik Jan van Leeuwen},
editor = {Nicolas Ollinger and
Heribert Vollmer},
title = {Polynomial Kernels for Deletion to Classes of Acyclic Digraphs},
booktitle = {33rd Symposium on Theoretical Aspects of Computer Science, {STACS}
2016, February 17-20, 2016, Orl{\'{e}}ans, France},
series = {LIPIcs},
volume = {47},
pages = {55:1--55:13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.STACS.2016.55},
doi = {10.4230/LIPICS.STACS.2016.55},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/stacs/MnichL16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/MnichRS16,
author = {Matthias Mnich and
Ignaz Rutter and
Jens M. Schmidt},
editor = {Rasmus Pagh},
title = {Linear-Time Recognition of Map Graphs with Outerplanar Witness},
booktitle = {15th Scandinavian Symposium and Workshops on Algorithm Theory, {SWAT}
2016, June 22-24, 2016, Reykjavik, Iceland},
series = {LIPIcs},
volume = {53},
pages = {5:1--5:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.SWAT.2016.5},
doi = {10.4230/LIPICS.SWAT.2016.5},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/swat/MnichRS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/EneMPR16,
author = {Alina Ene and
Matthias Mnich and
Marcin Pilipczuk and
Andrej Risteski},
editor = {Rasmus Pagh},
title = {On Routing Disjoint Paths in Bounded Treewidth Graphs},
booktitle = {15th Scandinavian Symposium and Workshops on Algorithm Theory, {SWAT}
2016, June 22-24, 2016, Reykjavik, Iceland},
series = {LIPIcs},
volume = {53},
pages = {15:1--15:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.SWAT.2016.15},
doi = {10.4230/LIPICS.SWAT.2016.15},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/EneMPR16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/walcom/Mnich16,
author = {Matthias Mnich},
editor = {Mohammad Kaykobad and
Rossella Petreschi},
title = {Large Independent Sets in Subquartic Planar Graphs},
booktitle = {{WALCOM:} Algorithms and Computation - 10th International Workshop,
{WALCOM} 2016, Kathmandu, Nepal, March 29-31, 2016, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9627},
pages = {209--221},
publisher = {Springer},
year = {2016},
url = {https://doi.org/10.1007/978-3-319-30139-6\_17},
doi = {10.1007/978-3-319-30139-6\_17},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/walcom/Mnich16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/MnichS16,
author = {Matthias Mnich and
Ildik{\'{o}} Schlotter},
title = {Stable Marriage with Covering Constraints: {A} Complete Computational
Trichotomy},
journal = {CoRR},
volume = {abs/1602.08230},
year = {2016},
url = {http://arxiv.org/abs/1602.08230},
eprinttype = {arXiv},
eprint = {1602.08230},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/MnichS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/FleszarMS16,
author = {Krzysztof Fleszar and
Matthias Mnich and
Joachim Spoerhase},
title = {New Algorithms for Maximum Disjoint Paths Based on Tree-Likeness},
journal = {CoRR},
volume = {abs/1603.01740},
year = {2016},
url = {http://arxiv.org/abs/1603.01740},
eprinttype = {arXiv},
eprint = {1603.01740},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/FleszarMS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/CrowstonJM15,
author = {Robert Crowston and
Mark Jones and
Matthias Mnich},
title = {Max-Cut Parameterized Above the Edwards-Erd{\H{o}}s Bound},
journal = {Algorithmica},
volume = {72},
number = {3},
pages = {734--757},
year = {2015},
url = {https://doi.org/10.1007/s00453-014-9870-z},
doi = {10.1007/S00453-014-9870-Z},
timestamp = {Thu, 05 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/CrowstonJM15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/MnichW15,
author = {Matthias Mnich and
Andreas Wiese},
title = {Scheduling and fixed-parameter tractability},
journal = {Math. Program.},
volume = {154},
number = {1-2},
pages = {533--562},
year = {2015},
url = {https://doi.org/10.1007/s10107-014-0830-9},
doi = {10.1007/S10107-014-0830-9},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/MnichW15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/scheduling/BevernMNW15,
author = {Ren{\'{e}} van Bevern and
Matthias Mnich and
Rolf Niedermeier and
Mathias Weller},
title = {Interval scheduling and colorful independent sets},
journal = {J. Sched.},
volume = {18},
number = {5},
pages = {449--469},
year = {2015},
url = {https://doi.org/10.1007/s10951-014-0398-5},
doi = {10.1007/S10951-014-0398-5},
timestamp = {Wed, 01 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/scheduling/BevernMNW15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ijcai/MnichSY15,
author = {Matthias Mnich and
Yash Raj Shrestha and
Yongjie Yang},
editor = {Qiang Yang and
Michael J. Wooldridge},
title = {When Does Schwartz Conjecture Hold?},
booktitle = {Proceedings of the Twenty-Fourth International Joint Conference on
Artificial Intelligence, {IJCAI} 2015, Buenos Aires, Argentina, July
25-31, 2015},
pages = {603--609},
publisher = {{AAAI} Press},
year = {2015},
url = {http://ijcai.org/Abstract/15/091},
timestamp = {Mon, 23 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ijcai/MnichSY15.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/stacs/BringmannHML15,
author = {Karl Bringmann and
Danny Hermelin and
Matthias Mnich and
Erik Jan van Leeuwen},
editor = {Ernst W. Mayr and
Nicolas Ollinger},
title = {Parameterized Complexity Dichotomy for Steiner Multicut},
booktitle = {32nd International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2015, March 4-7, 2015, Garching, Germany},
series = {LIPIcs},
volume = {30},
pages = {157--170},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2015},
url = {https://doi.org/10.4230/LIPIcs.STACS.2015.157},
doi = {10.4230/LIPICS.STACS.2015.157},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/stacs/BringmannHML15.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/MnichWV15,
author = {Matthias Mnich and
Virginia Vassilevska Williams and
L{\'{a}}szl{\'{o}} A. V{\'{e}}gh},
title = {A 7/3-Approximation for Feedback Vertex Sets in Tournaments},
journal = {CoRR},
volume = {abs/1511.01137},
year = {2015},
url = {http://arxiv.org/abs/1511.01137},
eprinttype = {arXiv},
eprint = {1511.01137},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/MnichWV15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/EneMPR15,
author = {Alina Ene and
Matthias Mnich and
Marcin Pilipczuk and
Andrej Risteski},
title = {On Routing Disjoint Paths in Bounded Treewidth Graphs},
journal = {CoRR},
volume = {abs/1512.01829},
year = {2015},
url = {http://arxiv.org/abs/1512.01829},
eprinttype = {arXiv},
eprint = {1512.01829},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/EneMPR15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/MnichRR15,
author = {Matthias Mnich and
Heiko R{\"{o}}glin and
Clemens R{\"{o}}sner},
title = {New Deterministic Algorithms for Solving Parity Games},
journal = {CoRR},
volume = {abs/1512.03246},
year = {2015},
url = {http://arxiv.org/abs/1512.03246},
eprinttype = {arXiv},
eprint = {1512.03246},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/MnichRR15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/HermelinML14,
author = {Danny Hermelin and
Matthias Mnich and
Erik Jan van Leeuwen},
title = {Parameterized Complexity of Induced Graph Matching on Claw-Free Graphs},
journal = {Algorithmica},
volume = {70},
number = {3},
pages = {513--560},
year = {2014},
url = {https://doi.org/10.1007/s00453-014-9877-5},
doi = {10.1007/S00453-014-9877-5},
timestamp = {Thu, 15 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/HermelinML14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/MnichPSS14,
author = {Matthias Mnich and
Geevarghese Philip and
Saket Saurabh and
Ondrej Such{\'{y}}},
title = {Beyond Max-Cut: {\(\lambda\)}-extendible properties parameterized
above the Poljak-Turz{\'{\i}}k bound},
journal = {J. Comput. Syst. Sci.},
volume = {80},
number = {7},
pages = {1384--1403},
year = {2014},
url = {https://doi.org/10.1016/j.jcss.2014.04.011},
doi = {10.1016/J.JCSS.2014.04.011},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/MnichPSS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/DvorakM14,
author = {Zdenek Dvor{\'{a}}k and
Matthias Mnich},
editor = {Andreas S. Schulz and
Dorothea Wagner},
title = {Large Independent Sets in Triangle-Free Planar Graphs},
booktitle = {Algorithms - {ESA} 2014 - 22th Annual European Symposium, Wroclaw,
Poland, September 8-10, 2014. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8737},
pages = {346--357},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-662-44777-2\_29},
doi = {10.1007/978-3-662-44777-2\_29},
timestamp = {Fri, 01 Dec 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/esa/DvorakM14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ifipTCS/JacobLM14,
author = {Riko Jacob and
Tobias Lieber and
Matthias Mnich},
editor = {Josep D{\'{\i}}az and
Ivan Lanese and
Davide Sangiorgi},
title = {Treewidth Computation and Kernelization in the Parallel External Memory
Model},
booktitle = {Theoretical Computer Science - 8th {IFIP} {TC} 1/WG 2.2 International
Conference, {TCS} 2014, Rome, Italy, September 1-3, 2014. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8705},
pages = {78--89},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-662-44602-7\_7},
doi = {10.1007/978-3-662-44602-7\_7},
timestamp = {Tue, 14 May 2019 10:00:36 +0200},
biburl = {https://dblp.org/rec/conf/ifipTCS/JacobLM14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipco/MnichW14,
author = {Matthias Mnich and
Andreas Wiese},
editor = {Jon Lee and
Jens Vygen},
title = {Scheduling and Fixed-Parameter Tractability},
booktitle = {Integer Programming and Combinatorial Optimization - 17th International
Conference, {IPCO} 2014, Bonn, Germany, June 23-25, 2014. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8494},
pages = {381--392},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-07557-0\_32},
doi = {10.1007/978-3-319-07557-0\_32},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/ipco/MnichW14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BevernMNW14,
author = {Ren{\'{e}} van Bevern and
Matthias Mnich and
Rolf Niedermeier and
Mathias Weller},
title = {Interval scheduling and colorful independent sets},
journal = {CoRR},
volume = {abs/1402.0851},
year = {2014},
url = {http://arxiv.org/abs/1402.0851},
eprinttype = {arXiv},
eprint = {1402.0851},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BevernMNW14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BringmannHML14,
author = {Karl Bringmann and
Danny Hermelin and
Matthias Mnich and
Erik Jan van Leeuwen},
title = {Parameterized Complexity Dichotomy for Steiner Multicut},
journal = {CoRR},
volume = {abs/1404.7006},
year = {2014},
url = {http://arxiv.org/abs/1404.7006},
eprinttype = {arXiv},
eprint = {1404.7006},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BringmannHML14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/GaspersM13,
author = {Serge Gaspers and
Matthias Mnich},
title = {Feedback Vertex Sets in Tournaments},
journal = {J. Graph Theory},
volume = {72},
number = {1},
pages = {72--89},
year = {2013},
url = {https://doi.org/10.1002/jgt.21631},
doi = {10.1002/JGT.21631},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/GaspersM13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/GuillemotM13,
author = {Sylvain Guillemot and
Matthias Mnich},
title = {Kernel and fast algorithm for dense triplet inconsistency},
journal = {Theor. Comput. Sci.},
volume = {494},
pages = {134--143},
year = {2013},
url = {https://doi.org/10.1016/j.tcs.2012.12.032},
doi = {10.1016/J.TCS.2012.12.032},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/GuillemotM13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/DvorakM13,
author = {Zdenek Dvor{\'{a}}k and
Matthias Mnich},
title = {Large Independent Sets in Triangle-Free Planar Graphs},
journal = {CoRR},
volume = {abs/1311.2749},
year = {2013},
url = {http://arxiv.org/abs/1311.2749},
eprinttype = {arXiv},
eprint = {1311.2749},
timestamp = {Fri, 01 Dec 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/DvorakM13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/MnichW13,
author = {Matthias Mnich and
Andreas Wiese},
title = {Scheduling Meets Fixed-Parameter Tractability},
journal = {CoRR},
volume = {abs/1311.4021},
year = {2013},
url = {http://arxiv.org/abs/1311.4021},
eprinttype = {arXiv},
eprint = {1311.4021},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/MnichW13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/MnichM13,
author = {Matthias Mnich and
Tobias M{\"{o}}mke},
title = {Improved integrality gap upper bounds for {TSP} with distances one
and two},
journal = {CoRR},
volume = {abs/1312.2502},
year = {2013},
url = {http://arxiv.org/abs/1312.2502},
eprinttype = {arXiv},
eprint = {1312.2502},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/MnichM13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/GutinIMY12,
author = {Gregory Z. Gutin and
Leo van Iersel and
Matthias Mnich and
Anders Yeo},
title = {Every ternary permutation constraint satisfaction problem parameterized
above average has a kernel with a quadratic number of variables},
journal = {J. Comput. Syst. Sci.},
volume = {78},
number = {1},
pages = {151--163},
year = {2012},
url = {https://doi.org/10.1016/j.jcss.2011.01.004},
doi = {10.1016/J.JCSS.2011.01.004},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/GutinIMY12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/KangMM12,
author = {Ross J. Kang and
Matthias Mnich and
Tobias M{\"{u}}ller},
title = {Induced Matchings in Subcubic Planar Graphs},
journal = {{SIAM} J. Discret. Math.},
volume = {26},
number = {3},
pages = {1383--1411},
year = {2012},
url = {https://doi.org/10.1137/100808824},
doi = {10.1137/100808824},
timestamp = {Tue, 27 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamdm/KangMM12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/HermelinML12,
author = {Danny Hermelin and
Matthias Mnich and
Erik Jan van Leeuwen},
editor = {Leah Epstein and
Paolo Ferragina},
title = {Parameterized Complexity of Induced H-Matching on Claw-Free Graphs},
booktitle = {Algorithms - {ESA} 2012 - 20th Annual European Symposium, Ljubljana,
Slovenia, September 10-12, 2012. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7501},
pages = {624--635},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-33090-2\_54},
doi = {10.1007/978-3-642-33090-2\_54},
timestamp = {Tue, 14 May 2019 10:00:54 +0200},
biburl = {https://dblp.org/rec/conf/esa/HermelinML12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/MnichPSS12,
author = {Matthias Mnich and
Geevarghese Philip and
Saket Saurabh and
Ondrej Such{\'{y}}},
editor = {Deepak D'Souza and
Telikepalli Kavitha and
Jaikumar Radhakrishnan},
title = {Beyond Max-Cut: lambda-Extendible Properties Parameterized Above the
Poljak-Turzik Bound},
booktitle = {{IARCS} Annual Conference on Foundations of Software Technology and
Theoretical Computer Science, {FSTTCS} 2012, December 15-17, 2012,
Hyderabad, India},
series = {LIPIcs},
volume = {18},
pages = {412--423},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2012},
url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2012.412},
doi = {10.4230/LIPICS.FSTTCS.2012.412},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/fsttcs/MnichPSS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/CrowstonJM12,
author = {Robert Crowston and
Mark Jones and
Matthias Mnich},
editor = {Artur Czumaj and
Kurt Mehlhorn and
Andrew M. Pitts and
Roger Wattenhofer},
title = {Max-Cut Parameterized above the Edwards-Erd{\H{o}}s Bound},
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 = {242--253},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-31594-7\_21},
doi = {10.1007/978-3-642-31594-7\_21},
timestamp = {Thu, 05 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/icalp/CrowstonJM12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/BevernMNW12,
author = {Ren{\'{e}} van Bevern and
Matthias Mnich and
Rolf Niedermeier and
Mathias Weller},
editor = {Kun{-}Mao Chao and
Tsan{-}sheng Hsu and
Der{-}Tsai Lee},
title = {Interval Scheduling and Colorful Independent Sets},
booktitle = {Algorithms and Computation - 23rd International Symposium, {ISAAC}
2012, Taipei, Taiwan, December 19-21, 2012. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7676},
pages = {247--256},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-35261-4\_28},
doi = {10.1007/978-3-642-35261-4\_28},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/isaac/BevernMNW12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/MnichZ12,
author = {Matthias Mnich and
Rico Zenklusen},
editor = {Martin Charles Golumbic and
Michal Stern and
Avivit Levy and
Gila Morgenstern},
title = {Bisections above Tight Lower Bounds},
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 = {184--193},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-34611-8\_20},
doi = {10.1007/978-3-642-34611-8\_20},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/wg/MnichZ12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/HermelinML12,
author = {Danny Hermelin and
Matthias Mnich and
Erik Jan van Leeuwen},
title = {Parameterized Complexity of Induced Graph Matching on Claw-Free Graphs},
journal = {CoRR},
volume = {abs/1206.7105},
year = {2012},
url = {http://arxiv.org/abs/1206.7105},
eprinttype = {arXiv},
eprint = {1206.7105},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/HermelinML12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1207-5696,
author = {Matthias Mnich and
Geevarghese Philip and
Saket Saurabh and
Ondrej Such{\'{y}}},
title = {Beyond Max-Cut: {\(\lambda\)}-Extendible Properties Parameterized
Above the Poljak-Turz{\'{\i}}k Bound},
journal = {CoRR},
volume = {abs/1207.5696},
year = {2012},
url = {http://arxiv.org/abs/1207.5696},
eprinttype = {arXiv},
eprint = {1207.5696},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1207-5696.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/Mnich11,
author = {Matthias Mnich},
title = {Book review},
journal = {Oper. Res. Lett.},
volume = {39},
number = {3},
pages = {229--230},
year = {2011},
url = {https://doi.org/10.1016/j.orl.2011.03.008},
doi = {10.1016/J.ORL.2011.03.008},
timestamp = {Wed, 14 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/Mnich11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/LokshtanovMS11,
author = {Daniel Lokshtanov and
Matthias Mnich and
Saket Saurabh},
title = {A linear kernel for planar connected dominating set},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {23},
pages = {2536--2543},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.10.045},
doi = {10.1016/J.TCS.2010.10.045},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/LokshtanovMS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/HermelinMLW11,
author = {Danny Hermelin and
Matthias Mnich and
Erik Jan van Leeuwen and
Gerhard J. Woeginger},
editor = {Luca Aceto and
Monika Henzinger and
Jir{\'{\i}} Sgall},
title = {Domination When the Stars Are Out},
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 = {462--473},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-22006-7\_39},
doi = {10.1007/978-3-642-22006-7\_39},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/HermelinMLW11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/LokshtanovMS11,
author = {Daniel Lokshtanov and
Matthias Mnich and
Saket Saurabh},
editor = {Petr Kolman and
Jan Kratochv{\'{\i}}l},
title = {Planar k-Path in Subexponential Time and Polynomial Space},
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 = {262--270},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-25870-1\_24},
doi = {10.1007/978-3-642-25870-1\_24},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/wg/LokshtanovMS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1112-3506,
author = {Robert Crowston and
Mark Jones and
Matthias Mnich},
title = {Max-Cut Parameterized Above the Edwards-Erd{\H{o}}s Bound},
journal = {CoRR},
volume = {abs/1112.3506},
year = {2011},
url = {http://arxiv.org/abs/1112.3506},
eprinttype = {arXiv},
eprint = {1112.3506},
timestamp = {Thu, 05 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1112-3506.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/GutinKMY10,
author = {Gregory Z. Gutin and
Eun Jung Kim and
Matthias Mnich and
Anders Yeo},
title = {Betweenness parameterized above tight lower bound},
journal = {J. Comput. Syst. Sci.},
volume = {76},
number = {8},
pages = {872--878},
year = {2010},
url = {https://doi.org/10.1016/j.jcss.2010.05.001},
doi = {10.1016/J.JCSS.2010.05.001},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/GutinKMY10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/KangMM10,
author = {Ross J. Kang and
Matthias Mnich and
Tobias M{\"{u}}ller},
editor = {Mark de Berg and
Ulrich Meyer},
title = {Induced Matchings in Subcubic Planar Graphs},
booktitle = {Algorithms - {ESA} 2010, 18th Annual European Symposium, Liverpool,
UK, September 6-8, 2010. Proceedings, Part {II}},
series = {Lecture Notes in Computer Science},
volume = {6347},
pages = {112--122},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-15781-3\_10},
doi = {10.1007/978-3-642-15781-3\_10},
timestamp = {Tue, 27 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/esa/KangMM10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/GaspersM10,
author = {Serge Gaspers and
Matthias Mnich},
editor = {Mark de Berg and
Ulrich Meyer},
title = {Feedback Vertex Sets in Tournaments},
booktitle = {Algorithms - {ESA} 2010, 18th Annual European Symposium, Liverpool,
UK, September 6-8, 2010. Proceedings, Part {I}},
series = {Lecture Notes in Computer Science},
volume = {6346},
pages = {267--277},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-15775-2\_23},
doi = {10.1007/978-3-642-15775-2\_23},
timestamp = {Tue, 14 May 2019 10:00:54 +0200},
biburl = {https://dblp.org/rec/conf/esa/GaspersM10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/GutinIMY10,
author = {Gregory Z. Gutin and
Leo van Iersel and
Matthias Mnich and
Anders Yeo},
editor = {Mark de Berg and
Ulrich Meyer},
title = {All Ternary Permutation Constraint Satisfaction Problems Parameterized
above Average Have Kernels with Quadratic Numbers of Variables},
booktitle = {Algorithms - {ESA} 2010, 18th Annual European Symposium, Liverpool,
UK, September 6-8, 2010. Proceedings, Part {I}},
series = {Lecture Notes in Computer Science},
volume = {6346},
pages = {326--337},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-15775-2\_28},
doi = {10.1007/978-3-642-15775-2\_28},
timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/esa/GutinIMY10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwoca/FernauFLMPS10,
author = {Henning Fernau and
Fedor V. Fomin and
Daniel Lokshtanov and
Matthias Mnich and
Geevarghese Philip and
Saket Saurabh},
editor = {Costas S. Iliopoulos and
William F. Smyth},
title = {Ranking and Drawing in Subexponential Time},
booktitle = {Combinatorial Algorithms - 21st International Workshop, {IWOCA} 2010,
London, UK, July 26-28, 2010, Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {6460},
pages = {337--348},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-19222-7\_34},
doi = {10.1007/978-3-642-19222-7\_34},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/iwoca/FernauFLMPS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/tamc/GuillemotM10,
author = {Sylvain Guillemot and
Matthias Mnich},
editor = {Jan Kratochv{\'{\i}}l and
Angsheng Li and
Jir{\'{\i}} Fiala and
Petr Kolman},
title = {Kernel and Fast Algorithm for Dense Triplet Inconsistency},
booktitle = {Theory and Applications of Models of Computation, 7th Annual Conference,
{TAMC} 2010, Prague, Czech Republic, June 7-11, 2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6108},
pages = {247--257},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-13562-0\_23},
doi = {10.1007/978-3-642-13562-0\_23},
timestamp = {Tue, 14 May 2019 10:00:46 +0200},
biburl = {https://dblp.org/rec/conf/tamc/GuillemotM10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1004-1956,
author = {Gregory Z. Gutin and
Leo van Iersel and
Matthias Mnich and
Anders Yeo},
title = {All Ternary Permutation Constraint Satisfaction Problems Parameterized
Above Average Have Polynomial Kernels},
journal = {CoRR},
volume = {abs/1004.1956},
year = {2010},
url = {http://arxiv.org/abs/1004.1956},
eprinttype = {arXiv},
eprint = {1004.1956},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1004-1956.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1012-0012,
author = {Danny Hermelin and
Matthias Mnich and
Erik Jan van Leeuwen and
Gerhard J. Woeginger},
title = {Domination When the Stars Are Out},
journal = {CoRR},
volume = {abs/1012.0012},
year = {2010},
url = {http://arxiv.org/abs/1012.0012},
eprinttype = {arXiv},
eprint = {1012.0012},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1012-0012.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jbcb/IerselKM09,
author = {Leo van Iersel and
Steven Kelk and
Matthias Mnich},
title = {Uniqueness, Intractability and Exact Algorithms: Reflections on Level-k
Phylogenetic Networks},
journal = {J. Bioinform. Comput. Biol.},
volume = {7},
number = {4},
pages = {597--623},
year = {2009},
url = {https://doi.org/10.1142/S0219720009004308},
doi = {10.1142/S0219720009004308},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jbcb/IerselKM09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/FellowsLMMRS09,
author = {Michael R. Fellows and
Daniel Lokshtanov and
Neeldhara Misra and
Matthias Mnich and
Frances A. Rosamond and
Saket Saurabh},
title = {The Complexity Ecology of Parameters: An Illustration Using Bounded
Max Leaf Number},
journal = {Theory Comput. Syst.},
volume = {45},
number = {4},
pages = {822--848},
year = {2009},
url = {https://doi.org/10.1007/s00224-009-9167-9},
doi = {10.1007/S00224-009-9167-9},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mst/FellowsLMMRS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/tamc/LokshtanovMS09,
author = {Daniel Lokshtanov and
Matthias Mnich and
Saket Saurabh},
editor = {Jianer Chen and
S. Barry Cooper},
title = {Linear Kernel for Planar Connected Dominating Set},
booktitle = {Theory and Applications of Models of Computation, 6th Annual Conference,
{TAMC} 2009, Changsha, China, May 18-22, 2009. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5532},
pages = {281--290},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-02017-9\_31},
doi = {10.1007/978-3-642-02017-9\_31},
timestamp = {Tue, 14 May 2019 10:00:46 +0200},
biburl = {https://dblp.org/rec/conf/tamc/LokshtanovMS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0905-0567,
author = {Serge Gaspers and
Matthias Mnich},
title = {On Feedback Vertex Sets in Tournaments},
journal = {CoRR},
volume = {abs/0905.0567},
year = {2009},
url = {http://arxiv.org/abs/0905.0567},
eprinttype = {arXiv},
eprint = {0905.0567},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0905-0567.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0907-5427,
author = {Gregory Z. Gutin and
Eun Jung Kim and
Matthias Mnich and
Anders Yeo},
title = {Ordinal Embedding Relaxations Parameterized Above Tight Lower Bound},
journal = {CoRR},
volume = {abs/0907.5427},
year = {2009},
url = {http://arxiv.org/abs/0907.5427},
eprinttype = {arXiv},
eprint = {0907.5427},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0907-5427.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-04-25 05:47 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
