Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Dániel Marx
@article{DBLP:journals/algorithmica/EsmerKMSW24,
author = {Baris Can Esmer and
Ariel Kulik and
D{\'{a}}niel Marx and
Philipp Schepper and
Karol Wegrzycki},
title = {Computing Generalized Convolutions Faster Than Brute Force},
journal = {Algorithmica},
volume = {86},
number = {1},
pages = {334--366},
year = {2024},
url = {https://doi.org/10.1007/s00453-023-01176-2},
doi = {10.1007/S00453-023-01176-2},
timestamp = {Fri, 26 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/EsmerKMSW24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/EsmerKMNS24,
author = {Baris Can Esmer and
Ariel Kulik and
D{\'{a}}niel Marx and
Daniel Neuen and
Roohani Sharma},
editor = {David P. Woodruff},
title = {Optimally Repurposing Existing Algorithms to Obtain Exponential-Time
Approximations},
booktitle = {Proceedings of the 2024 {ACM-SIAM} Symposium on Discrete Algorithms,
{SODA} 2024, Alexandria, VA, USA, January 7-10, 2024},
pages = {314--345},
publisher = {{SIAM}},
year = {2024},
url = {https://doi.org/10.1137/1.9781611977912.13},
doi = {10.1137/1.9781611977912.13},
timestamp = {Thu, 04 Apr 2024 19:38:10 +0200},
biburl = {https://dblp.org/rec/conf/soda/EsmerKMNS24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sosa/SMPS24,
author = {{Karthik {C. S.}} and
D{\'{a}}niel Marx and
Marcin Pilipczuk and
U{\'{e}}verton S. Souza},
editor = {Merav Parter and
Seth Pettie},
title = {Conditional lower bounds for sparse parameterized 2-CSP: {A} streamlined
proof},
booktitle = {2024 Symposium on Simplicity in Algorithms, {SOSA} 2024, Alexandria,
VA, USA, January 8-10, 2024},
pages = {383--395},
publisher = {{SIAM}},
year = {2024},
url = {https://doi.org/10.1137/1.9781611977936.35},
doi = {10.1137/1.9781611977936.35},
timestamp = {Wed, 10 Apr 2024 20:26:09 +0200},
biburl = {https://dblp.org/rec/conf/sosa/SMPS24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2402-07331,
author = {Baris Can Esmer and
Jacob Focke and
D{\'{a}}niel Marx and
Pawel Rzazewski},
title = {Fundamental Problems on Bounded-Treewidth Graphs: The Real Source
of Hardness},
journal = {CoRR},
volume = {abs/2402.07331},
year = {2024},
url = {https://doi.org/10.48550/arXiv.2402.07331},
doi = {10.48550/ARXIV.2402.07331},
eprinttype = {arXiv},
eprint = {2402.07331},
timestamp = {Fri, 16 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2402-07331.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2402-14927,
author = {Jacob Focke and
Fabian Frei and
Shaohua Li and
D{\'{a}}niel Marx and
Philipp Schepper and
Roohani Sharma and
Karol Wegrzycki},
title = {Hitting Meets Packing: How Hard Can it Be?},
journal = {CoRR},
volume = {abs/2402.14927},
year = {2024},
url = {https://doi.org/10.48550/arXiv.2402.14927},
doi = {10.48550/ARXIV.2402.14927},
eprinttype = {arXiv},
eprint = {2402.14927},
timestamp = {Fri, 22 Mar 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2402-14927.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/GalbyMSST23,
author = {Esther Galby and
D{\'{a}}niel Marx and
Philipp Schepper and
Roohani Sharma and
Prafullkumar Tale},
title = {Parameterized complexity of multicut in weighted trees},
journal = {Theor. Comput. Sci.},
volume = {978},
pages = {114174},
year = {2023},
url = {https://doi.org/10.1016/j.tcs.2023.114174},
doi = {10.1016/J.TCS.2023.114174},
timestamp = {Fri, 27 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/GalbyMSST23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/AbbasiBBCGKMSS23,
author = {Fateme Abbasi and
Sandip Banerjee and
Jaroslaw Byrka and
Parinya Chalermsook and
Ameet Gadekar and
Kamyar Khodamoradi and
D{\'{a}}niel Marx and
Roohani Sharma and
Joachim Spoerhase},
title = {Parameterized Approximation Schemes for Clustering with General Norm
Objectives},
booktitle = {64th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2023, Santa Cruz, CA, USA, November 6-9, 2023},
pages = {1377--1399},
publisher = {{IEEE}},
year = {2023},
url = {https://doi.org/10.1109/FOCS57990.2023.00085},
doi = {10.1109/FOCS57990.2023.00085},
timestamp = {Tue, 02 Jan 2024 14:56:14 +0100},
biburl = {https://dblp.org/rec/conf/focs/AbbasiBBCGKMSS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/EsmerKMNS23,
author = {Baris Can Esmer and
Ariel Kulik and
D{\'{a}}niel Marx and
Daniel Neuen and
Roohani Sharma},
editor = {Neeldhara Misra and
Magnus Wahlstr{\"{o}}m},
title = {Approximate Monotone Local Search for Weighted Problems},
booktitle = {18th International Symposium on Parameterized and Exact Computation,
{IPEC} 2023, September 6-8, 2023, Amsterdam, The Netherlands},
series = {LIPIcs},
volume = {285},
pages = {17:1--17:23},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.IPEC.2023.17},
doi = {10.4230/LIPICS.IPEC.2023.17},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/iwpec/EsmerKMNS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/AgrawalMNS23,
author = {Akanksha Agrawal and
D{\'{a}}niel Marx and
Daniel Neuen and
Jasper Slusallek},
editor = {Nikhil Bansal and
Viswanath Nagarajan},
title = {Computing Square Colorings on Bounded-Treewidth and Planar Graphs},
booktitle = {Proceedings of the 2023 {ACM-SIAM} Symposium on Discrete Algorithms,
{SODA} 2023, Florence, Italy, January 22-25, 2023},
pages = {2087--2110},
publisher = {{SIAM}},
year = {2023},
url = {https://doi.org/10.1137/1.9781611977554.ch80},
doi = {10.1137/1.9781611977554.CH80},
timestamp = {Tue, 02 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/AgrawalMNS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/FockeMINSSW23,
author = {Jacob Focke and
D{\'{a}}niel Marx and
Fionn Mc Inerney and
Daniel Neuen and
Govind S. Sankar and
Philipp Schepper and
Philip Wellnitz},
editor = {Nikhil Bansal and
Viswanath Nagarajan},
title = {Tight Complexity Bounds for Counting Generalized Dominating Sets in
Bounded-Treewidth Graphs},
booktitle = {Proceedings of the 2023 {ACM-SIAM} Symposium on Discrete Algorithms,
{SODA} 2023, Florence, Italy, January 22-25, 2023},
pages = {3664--3683},
publisher = {{SIAM}},
year = {2023},
url = {https://doi.org/10.1137/1.9781611977554.ch140},
doi = {10.1137/1.9781611977554.CH140},
timestamp = {Fri, 17 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/FockeMINSSW23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2304-03146,
author = {Fateme Abbasi and
Sandip Banerjee and
Jaroslaw Byrka and
Parinya Chalermsook and
Ameet Gadekar and
Kamyar Khodamoradi and
D{\'{a}}niel Marx and
Roohani Sharma and
Joachim Spoerhase},
title = {Parameterized Approximation Schemes for Clustering with General Norm
Objectives},
journal = {CoRR},
volume = {abs/2304.03146},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2304.03146},
doi = {10.48550/ARXIV.2304.03146},
eprinttype = {arXiv},
eprint = {2304.03146},
timestamp = {Tue, 18 Apr 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2304-03146.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2305-07316,
author = {Fateme Abbasi and
Sandip Banerjee and
Jaroslaw Byrka and
Parinya Chalermsook and
Ameet Gadekar and
Kamyar Khodamoradi and
D{\'{a}}niel Marx and
Roohani Sharma and
Joachim Spoerhase},
title = {Parameterized Approximation for Robust Clustering in Discrete Geometric
Spaces},
journal = {CoRR},
volume = {abs/2305.07316},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2305.07316},
doi = {10.48550/ARXIV.2305.07316},
eprinttype = {arXiv},
eprint = {2305.07316},
timestamp = {Wed, 17 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2305-07316.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2306-03640,
author = {Jacob Focke and
D{\'{a}}niel Marx and
Fionn Mc Inerney and
Daniel Neuen and
Govind S. Sankar and
Philipp Schepper and
Philip Wellnitz},
title = {Tight Complexity Bounds for Counting Generalized Dominating Sets in
Bounded-Treewidth Graphs Part {II:} Hardness Results},
journal = {CoRR},
volume = {abs/2306.03640},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2306.03640},
doi = {10.48550/ARXIV.2306.03640},
eprinttype = {arXiv},
eprint = {2306.03640},
timestamp = {Tue, 13 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2306-03640.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2306-15331,
author = {Baris Can Esmer and
Ariel Kulik and
D{\'{a}}niel Marx and
Daniel Neuen and
Roohani Sharma},
title = {Optimally Repurposing Existing Algorithms to Obtain Exponential-Time
Approximations},
journal = {CoRR},
volume = {abs/2306.15331},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2306.15331},
doi = {10.48550/ARXIV.2306.15331},
eprinttype = {arXiv},
eprint = {2306.15331},
timestamp = {Fri, 30 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2306-15331.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2308-15306,
author = {Baris Can Esmer and
Ariel Kulik and
D{\'{a}}niel Marx and
Daniel Neuen and
Roohani Sharma},
title = {Approximate Monotone Local Search for Weighted Problems},
journal = {CoRR},
volume = {abs/2308.15306},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2308.15306},
doi = {10.48550/ARXIV.2308.15306},
eprinttype = {arXiv},
eprint = {2308.15306},
timestamp = {Mon, 04 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2308-15306.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2311-05913,
author = {{Karthik {C. S.}} and
D{\'{a}}niel Marx and
Marcin Pilipczuk and
U{\'{e}}verton S. Souza},
title = {Conditional lower bounds for sparse parameterized 2-CSP: {A} streamlined
proof},
journal = {CoRR},
volume = {abs/2311.05913},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2311.05913},
doi = {10.48550/ARXIV.2311.05913},
eprinttype = {arXiv},
eprint = {2311.05913},
timestamp = {Wed, 15 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2311-05913.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2311-08988,
author = {Simon D{\"{o}}ring and
D{\'{a}}niel Marx and
Philip Wellnitz},
title = {Counting Small Induced Subgraphs with Edge-monotone Properties},
journal = {CoRR},
volume = {abs/2311.08988},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2311.08988},
doi = {10.48550/ARXIV.2311.08988},
eprinttype = {arXiv},
eprint = {2311.08988},
timestamp = {Tue, 21 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2311-08988.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2312-11086,
author = {Jacob Focke and
Florian H{\"{o}}rsch and
Shaohua Li and
D{\'{a}}niel Marx},
title = {Multicut Problems in Embedded Graphs: The Dependency of Complexity
on the Demand Pattern},
journal = {CoRR},
volume = {abs/2312.11086},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2312.11086},
doi = {10.48550/ARXIV.2312.11086},
eprinttype = {arXiv},
eprint = {2312.11086},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2312-11086.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/jcss/MarxS22,
author = {D{\'{a}}niel Marx and
R. B. Sandeep},
title = {Incompressibility of \emph{H}-free edge modification problems: Towards
a dichotomy},
journal = {J. Comput. Syst. Sci.},
volume = {125},
pages = {25--58},
year = {2022},
url = {https://doi.org/10.1016/j.jcss.2021.11.001},
doi = {10.1016/J.JCSS.2021.11.001},
timestamp = {Tue, 08 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/MarxS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/MarxPP22,
author = {D{\'{a}}niel Marx and
Marcin Pilipczuk and
Michal Pilipczuk},
title = {A Subexponential Parameterized Algorithm for Directed Subset Traveling
Salesman Problem on Planar Graphs},
journal = {{SIAM} J. Comput.},
volume = {51},
number = {2},
pages = {254--289},
year = {2022},
url = {https://doi.org/10.1137/19m1304088},
doi = {10.1137/19M1304088},
timestamp = {Tue, 28 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/MarxPP22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/FominLMPPS22,
author = {Fedor V. Fomin and
Daniel Lokshtanov and
D{\'{a}}niel Marx and
Marcin Pilipczuk and
Michal Pilipczuk and
Saket Saurabh},
title = {Subexponential Parameterized Algorithms for Planar and Apex-Minor-Free
Graphs via Low Treewidth Pattern Covering},
journal = {{SIAM} J. Comput.},
volume = {51},
number = {6},
pages = {1866--1930},
year = {2022},
url = {https://doi.org/10.1137/19m1262504},
doi = {10.1137/19M1262504},
timestamp = {Sun, 15 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/FominLMPPS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/MarxP22,
author = {D{\'{a}}niel Marx and
Michal Pilipczuk},
title = {Optimal Parameterized Algorithms for Planar Facility Location Problems
Using Voronoi Diagrams},
journal = {{ACM} Trans. Algorithms},
volume = {18},
number = {2},
pages = {13:1--13:64},
year = {2022},
url = {https://doi.org/10.1145/3483425},
doi = {10.1145/3483425},
timestamp = {Thu, 28 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/talg/MarxP22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/BringmannKKMN22,
author = {Karl Bringmann and
S{\'{a}}ndor Kisfaludi{-}Bak and
Marvin K{\"{u}}nnemann and
D{\'{a}}niel Marx and
Andr{\'{e}} Nusser},
editor = {Xavier Goaoc and
Michael Kerber},
title = {Dynamic Time Warping Under Translation: Approximation Guided by Space-Filling
Curves},
booktitle = {38th International Symposium on Computational Geometry, SoCG 2022,
June 7-10, 2022, Berlin, Germany},
series = {LIPIcs},
volume = {224},
pages = {20:1--20:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.SoCG.2022.20},
doi = {10.4230/LIPICS.SOCG.2022.20},
timestamp = {Wed, 01 Jun 2022 16:45:26 +0200},
biburl = {https://dblp.org/rec/conf/compgeom/BringmannKKMN22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/EsmerKMNS22,
author = {Baris Can Esmer and
Ariel Kulik and
D{\'{a}}niel Marx and
Daniel Neuen and
Roohani Sharma},
editor = {Shiri Chechik and
Gonzalo Navarro and
Eva Rotenberg and
Grzegorz Herman},
title = {Faster Exponential-Time Approximation Algorithms Using Approximate
Monotone Local Search},
booktitle = {30th Annual European Symposium on Algorithms, {ESA} 2022, September
5-9, 2022, Berlin/Potsdam, Germany},
series = {LIPIcs},
volume = {244},
pages = {50:1--50:19},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.ESA.2022.50},
doi = {10.4230/LIPICS.ESA.2022.50},
timestamp = {Wed, 28 Feb 2024 00:16:41 +0100},
biburl = {https://dblp.org/rec/conf/esa/EsmerKMNS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/EsmerKMSW22,
author = {Baris Can Esmer and
Ariel Kulik and
D{\'{a}}niel Marx and
Philipp Schepper and
Karol Wegrzycki},
editor = {Holger Dell and
Jesper Nederlof},
title = {Computing Generalized Convolutions Faster Than Brute Force},
booktitle = {17th International Symposium on Parameterized and Exact Computation,
{IPEC} 2022, September 7-9, 2022, Potsdam, Germany},
series = {LIPIcs},
volume = {249},
pages = {12:1--12:22},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.IPEC.2022.12},
doi = {10.4230/LIPICS.IPEC.2022.12},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/iwpec/EsmerKMSW22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/GalbyMSST22,
author = {Esther Galby and
D{\'{a}}niel Marx and
Philipp Schepper and
Roohani Sharma and
Prafullkumar Tale},
editor = {Holger Dell and
Jesper Nederlof},
title = {Domination and Cut Problems on Chordal Graphs with Bounded Leafage},
booktitle = {17th International Symposium on Parameterized and Exact Computation,
{IPEC} 2022, September 7-9, 2022, Potsdam, Germany},
series = {LIPIcs},
volume = {249},
pages = {14:1--14:24},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.IPEC.2022.14},
doi = {10.4230/LIPICS.IPEC.2022.14},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/iwpec/GalbyMSST22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/MarxSS22,
author = {D{\'{a}}niel Marx and
Govind S. Sankar and
Philipp Schepper},
editor = {Holger Dell and
Jesper Nederlof},
title = {Anti-Factor Is {FPT} Parameterized by Treewidth and List Size (But
Counting Is Hard)},
booktitle = {17th International Symposium on Parameterized and Exact Computation,
{IPEC} 2022, September 7-9, 2022, Potsdam, Germany},
series = {LIPIcs},
volume = {249},
pages = {22:1--22:23},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.IPEC.2022.22},
doi = {10.4230/LIPICS.IPEC.2022.22},
timestamp = {Wed, 14 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/iwpec/MarxSS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/FockeMR22,
author = {Jacob Focke and
D{\'{a}}niel Marx and
Pawel Rzazewski},
editor = {Joseph (Seffi) Naor and
Niv Buchbinder},
title = {Counting list homomorphisms from graphs of bounded treewidth: tight
complexity bounds},
booktitle = {Proceedings of the 2022 {ACM-SIAM} Symposium on Discrete Algorithms,
{SODA} 2022, Virtual Conference / Alexandria, VA, USA, January 9 -
12, 2022},
pages = {431--458},
publisher = {{SIAM}},
year = {2022},
url = {https://doi.org/10.1137/1.9781611977073.22},
doi = {10.1137/1.9781611977073.22},
timestamp = {Tue, 12 Apr 2022 11:24:56 +0200},
biburl = {https://dblp.org/rec/conf/soda/FockeMR22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/MarxMNT22,
author = {D{\'{a}}niel Marx and
Pranabendu Misra and
Daniel Neuen and
Prafullkumar Tale},
editor = {Joseph (Seffi) Naor and
Niv Buchbinder},
title = {A Framework for Parameterized Subexponential Algorithms for Generalized
Cycle Hitting Problems on Planar Graphs},
booktitle = {Proceedings of the 2022 {ACM-SIAM} Symposium on Discrete Algorithms,
{SODA} 2022, Virtual Conference / Alexandria, VA, USA, January 9 -
12, 2022},
pages = {2085--2127},
publisher = {{SIAM}},
year = {2022},
url = {https://doi.org/10.1137/1.9781611977073.83},
doi = {10.1137/1.9781611977073.83},
timestamp = {Tue, 12 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/MarxMNT22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/GalbyMSST22,
author = {Esther Galby and
D{\'{a}}niel Marx and
Philipp Schepper and
Roohani Sharma and
Prafullkumar Tale},
editor = {Michael A. Bekos and
Michael Kaufmann},
title = {Parameterized Complexity of Weighted Multicut in Trees},
booktitle = {Graph-Theoretic Concepts in Computer Science - 48th International
Workshop, {WG} 2022, T{\"{u}}bingen, Germany, June 22-24, 2022,
Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {13453},
pages = {257--270},
publisher = {Springer},
year = {2022},
url = {https://doi.org/10.1007/978-3-031-15914-5\_19},
doi = {10.1007/978-3-031-15914-5\_19},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wg/GalbyMSST22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2203-07717,
author = {D{\'{a}}niel Marx},
title = {Modern Lower Bound Techniques in Database Theory and Constraint Satisfaction},
journal = {CoRR},
volume = {abs/2203.07717},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2203.07717},
doi = {10.48550/ARXIV.2203.07717},
eprinttype = {arXiv},
eprint = {2203.07717},
timestamp = {Mon, 28 Mar 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2203-07717.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2203-07898,
author = {Karl Bringmann and
S{\'{a}}ndor Kisfaludi{-}Bak and
Marvin K{\"{u}}nnemann and
D{\'{a}}niel Marx and
Andr{\'{e}} Nusser},
title = {Dynamic Time Warping Under Translation: Approximation Guided by Space-Filling
Curves},
journal = {CoRR},
volume = {abs/2203.07898},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2203.07898},
doi = {10.48550/ARXIV.2203.07898},
eprinttype = {arXiv},
eprint = {2203.07898},
timestamp = {Mon, 28 Mar 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2203-07898.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2205-10105,
author = {Esther Galby and
D{\'{a}}niel Marx and
Philipp Schepper and
Roohani Sharma and
Prafullkumar Tale},
title = {Parameterized Complexity of Weighted Multicut in Trees},
journal = {CoRR},
volume = {abs/2205.10105},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2205.10105},
doi = {10.48550/ARXIV.2205.10105},
eprinttype = {arXiv},
eprint = {2205.10105},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2205-10105.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2206-13481,
author = {Baris Can Esmer and
Ariel Kulik and
D{\'{a}}niel Marx and
Daniel Neuen and
Roohani Sharma},
title = {Faster Exponential-Time Approximation Algorithms Using Approximate
Monotone Local Search},
journal = {CoRR},
volume = {abs/2206.13481},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2206.13481},
doi = {10.48550/ARXIV.2206.13481},
eprinttype = {arXiv},
eprint = {2206.13481},
timestamp = {Mon, 04 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2206-13481.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2208-02850,
author = {Esther Galby and
D{\'{a}}niel Marx and
Philipp Schepper and
Roohani Sharma and
Prafullkumar Tale},
title = {Domination and Cut Problems on Chordal Graphs with Bounded Leafage},
journal = {CoRR},
volume = {abs/2208.02850},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2208.02850},
doi = {10.48550/ARXIV.2208.02850},
eprinttype = {arXiv},
eprint = {2208.02850},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2208-02850.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2208-06015,
author = {Esther Galby and
S{\'{a}}ndor Kisfaludi{-}Bak and
D{\'{a}}niel Marx and
Roohani Sharma},
title = {Subexponential Parameterized Directed Steiner Network Problems on
Planar Graphs: a Complete Classification},
journal = {CoRR},
volume = {abs/2208.06015},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2208.06015},
doi = {10.48550/ARXIV.2208.06015},
eprinttype = {arXiv},
eprint = {2208.06015},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2208-06015.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2209-01623,
author = {Baris Can Esmer and
Ariel Kulik and
D{\'{a}}niel Marx and
Philipp Schepper and
Karol Wegrzycki},
title = {Computing Generalized Convolutions Faster Than Brute Force},
journal = {CoRR},
volume = {abs/2209.01623},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2209.01623},
doi = {10.48550/ARXIV.2209.01623},
eprinttype = {arXiv},
eprint = {2209.01623},
timestamp = {Mon, 26 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2209-01623.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2210-10677,
author = {Baris Can Esmer and
Jacob Focke and
D{\'{a}}niel Marx and
Pawel Rzazewski},
title = {List homomorphisms by deleting edges and vertices: tight complexity
bounds for bounded-treewidth graphs},
journal = {CoRR},
volume = {abs/2210.10677},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2210.10677},
doi = {10.48550/ARXIV.2210.10677},
eprinttype = {arXiv},
eprint = {2210.10677},
timestamp = {Tue, 25 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2210-10677.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2211-04278,
author = {Jacob Focke and
D{\'{a}}niel Marx and
Fionn Mc Inerney and
Daniel Neuen and
Govind S. Sankar and
Philipp Schepper and
Philip Wellnitz},
title = {Tight Complexity Bounds for Counting Generalized Dominating Sets in
Bounded-Treewidth Graphs Part {I:} Algorithmic Results},
journal = {CoRR},
volume = {abs/2211.04278},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2211.04278},
doi = {10.48550/ARXIV.2211.04278},
eprinttype = {arXiv},
eprint = {2211.04278},
timestamp = {Tue, 02 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2211-04278.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2211-04458,
author = {Akanksha Agrawal and
D{\'{a}}niel Marx and
Daniel Neuen and
Jasper Slusallek},
title = {Computing Square Colorings on Bounded-Treewidth and Planar Graphs},
journal = {CoRR},
volume = {abs/2211.04458},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2211.04458},
doi = {10.48550/ARXIV.2211.04458},
eprinttype = {arXiv},
eprint = {2211.04458},
timestamp = {Tue, 02 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2211-04458.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dagstuhl-reports/GroheGMZ22,
author = {Martin Grohe and
Venkatesan Guruswami and
D{\'{a}}niel Marx and
Stanislav Zivn{\'{y}}},
title = {The Constraint Satisfaction Problem: Complexity and Approximability
(Dagstuhl Seminar 22201)},
journal = {Dagstuhl Reports},
volume = {12},
number = {5},
pages = {112--130},
year = {2022},
url = {https://doi.org/10.4230/DagRep.12.5.112},
doi = {10.4230/DAGREP.12.5.112},
timestamp = {Fri, 16 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dagstuhl-reports/GroheGMZ22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BerendsohnKM21,
author = {Benjamin Aram Berendsohn and
L{\'{a}}szl{\'{o}} Kozma and
D{\'{a}}niel Marx},
title = {Finding and Counting Permutations via CSPs},
journal = {Algorithmica},
volume = {83},
number = {8},
pages = {2552--2577},
year = {2021},
url = {https://doi.org/10.1007/s00453-021-00812-z},
doi = {10.1007/S00453-021-00812-Z},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BerendsohnKM21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/BhattacharyyaBE21,
author = {Arnab Bhattacharyya and
{\'{E}}douard Bonnet and
L{\'{a}}szl{\'{o}} Egri and
Suprovat Ghoshal and
{Karthik {C. S.}} and
Bingkai Lin and
Pasin Manurangsi and
D{\'{a}}niel Marx},
title = {Parameterized Intractability of Even Set and Shortest Vector Problem},
journal = {J. {ACM}},
volume = {68},
number = {3},
pages = {16:1--16:40},
year = {2021},
url = {https://doi.org/10.1145/3444942},
doi = {10.1145/3444942},
timestamp = {Mon, 20 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/BhattacharyyaBE21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Cohen-AddadVMM21,
author = {Vincent Cohen{-}Addad and
{\'{E}}ric Colin de Verdi{\`{e}}re and
D{\'{a}}niel Marx and
Arnaud de Mesmay},
title = {Almost Tight Lower Bounds for Hard Cutting Problems in Embedded Graphs},
journal = {J. {ACM}},
volume = {68},
number = {4},
pages = {30:1--30:26},
year = {2021},
url = {https://doi.org/10.1145/3450704},
doi = {10.1145/3450704},
timestamp = {Wed, 01 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/Cohen-AddadVMM21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/forc/Cohen-AddadKMWW21,
author = {Vincent Cohen{-}Addad and
Philip N. Klein and
D{\'{a}}niel Marx and
Archer Wheeler and
Christopher Wolfram},
editor = {Katrina Ligett and
Swati Gupta},
title = {On the Computational Tractability of a Geographic Clustering Problem
Arising in Redistricting},
booktitle = {2nd Symposium on Foundations of Responsible Computing, {FORC} 2021,
June 9-11, 2021, Virtual Conference},
series = {LIPIcs},
volume = {192},
pages = {3:1--3:18},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.FORC.2021.3},
doi = {10.4230/LIPICS.FORC.2021.3},
timestamp = {Thu, 14 Dec 2023 11:20:43 +0100},
biburl = {https://dblp.org/rec/conf/forc/Cohen-AddadKMWW21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/MarxSS21,
author = {D{\'{a}}niel Marx and
Govind S. Sankar and
Philipp Schepper},
editor = {Nikhil Bansal and
Emanuela Merelli and
James Worrell},
title = {Degrees and Gaps: Tight Complexity Results of General Factor Problems
Parameterized by Treewidth and Cutwidth},
booktitle = {48th International Colloquium on Automata, Languages, and Programming,
{ICALP} 2021, July 12-16, 2021, Glasgow, Scotland (Virtual Conference)},
series = {LIPIcs},
volume = {198},
pages = {95:1--95:20},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2021.95},
doi = {10.4230/LIPICS.ICALP.2021.95},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/MarxSS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/pods/Marx21,
author = {D{\'{a}}niel Marx},
editor = {Leonid Libkin and
Reinhard Pichler and
Paolo Guagliardo},
title = {Modern Lower Bound Techniques in Database Theory and Constraint Satisfaction},
booktitle = {PODS'21: Proceedings of the 40th {ACM} {SIGMOD-SIGACT-SIGAI} Symposium
on Principles of Database Systems, Virtual Event, China, June 20-25,
2021},
pages = {19--29},
publisher = {{ACM}},
year = {2021},
url = {https://doi.org/10.1145/3452021.3458814},
doi = {10.1145/3452021.3458814},
timestamp = {Mon, 21 Jun 2021 12:19:15 +0200},
biburl = {https://dblp.org/rec/conf/pods/Marx21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/soda/2021,
editor = {D{\'{a}}niel Marx},
title = {Proceedings of the 2021 {ACM-SIAM} Symposium on Discrete Algorithms,
{SODA} 2021, Virtual Conference, January 10 - 13, 2021},
publisher = {{SIAM}},
year = {2021},
url = {https://doi.org/10.1137/1.9781611976465},
doi = {10.1137/1.9781611976465},
isbn = {978-1-61197-646-5},
timestamp = {Thu, 15 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/2021.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2105-08980,
author = {D{\'{a}}niel Marx and
Govind S. Sankar and
Philipp Schepper},
title = {Degrees and Gaps: Tight Complexity Results of General Factor Problems
Parameterized by Treewidth and Cutwidth},
journal = {CoRR},
volume = {abs/2105.08980},
year = {2021},
url = {https://arxiv.org/abs/2105.08980},
eprinttype = {arXiv},
eprint = {2105.08980},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2105-08980.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2107-06889,
author = {Jacob Focke and
D{\'{a}}niel Marx and
Pawel Rzazewski},
title = {Counting list homomorphisms from graphs of bounded treewidth: tight
complexity bounds},
journal = {CoRR},
volume = {abs/2107.06889},
year = {2021},
url = {https://arxiv.org/abs/2107.06889},
eprinttype = {arXiv},
eprint = {2107.06889},
timestamp = {Wed, 21 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2107-06889.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2110-09369,
author = {D{\'{a}}niel Marx and
Govind S. Sankar and
Philipp Schepper},
title = {Anti-Factor is {FPT} Parameterized by Treewidth and List Size (but
Counting is Hard)},
journal = {CoRR},
volume = {abs/2110.09369},
year = {2021},
url = {https://arxiv.org/abs/2110.09369},
eprinttype = {arXiv},
eprint = {2110.09369},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2110-09369.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2110-15098,
author = {D{\'{a}}niel Marx and
Pranabendu Misra and
Daniel Neuen and
Prafullkumar Tale},
title = {A Framework for Parameterized Subexponential Algorithms for Generalized
Cycle Hitting Problems on Planar Graphs},
journal = {CoRR},
volume = {abs/2110.15098},
year = {2021},
url = {https://arxiv.org/abs/2110.15098},
eprinttype = {arXiv},
eprint = {2110.15098},
timestamp = {Tue, 02 Nov 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2110-15098.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/FeldmannM20,
author = {Andreas Emil Feldmann and
D{\'{a}}niel Marx},
title = {The Parameterized Hardness of the k-Center Problem in Transportation
Networks},
journal = {Algorithmica},
volume = {82},
number = {7},
pages = {1989--2005},
year = {2020},
url = {https://doi.org/10.1007/s00453-020-00683-w},
doi = {10.1007/S00453-020-00683-W},
timestamp = {Tue, 16 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/FeldmannM20.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/siamcomp/ChitnisFHM20,
author = {Rajesh Hemant Chitnis and
Andreas Emil Feldmann and
Mohammad Taghi Hajiaghayi and
D{\'{a}}niel Marx},
title = {Tight Bounds for Planar Strongly Connected Steiner Subgraph with Fixed
Number of Terminals (and Extensions)},
journal = {{SIAM} J. Comput.},
volume = {49},
number = {2},
pages = {318--364},
year = {2020},
url = {https://doi.org/10.1137/18M122371X},
doi = {10.1137/18M122371X},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/ChitnisFHM20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BergBKMZ20,
author = {Mark de Berg and
Hans L. Bodlaender and
S{\'{a}}ndor Kisfaludi{-}Bak and
D{\'{a}}niel Marx and
Tom C. van der Zanden},
title = {A Framework for Exponential-Time-Hypothesis-Tight Algorithms and Lower
Bounds in Geometric Intersection Graphs},
journal = {{SIAM} J. Comput.},
volume = {49},
number = {6},
pages = {1291--1331},
year = {2020},
url = {https://doi.org/10.1137/20M1320870},
doi = {10.1137/20M1320870},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/BergBKMZ20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/birthday/Marx20,
author = {D{\'{a}}niel Marx},
editor = {Fedor V. Fomin and
Stefan Kratsch and
Erik Jan van Leeuwen},
title = {Four Shorts Stories on Surprising Algorithmic Uses of Treewidth},
booktitle = {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},
pages = {129--144},
publisher = {Springer},
year = {2020},
url = {https://doi.org/10.1007/978-3-030-42071-0\_10},
doi = {10.1007/978-3-030-42071-0\_10},
timestamp = {Tue, 21 Apr 2020 18:45:48 +0200},
biburl = {https://dblp.org/rec/conf/birthday/Marx20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/KunnemannM20,
author = {Marvin K{\"{u}}nnemann and
D{\'{a}}niel Marx},
editor = {Shubhangi Saraf},
title = {Finding Small Satisfying Assignments Faster Than Brute Force: {A}
Fine-Grained Perspective into Boolean Constraint Satisfaction},
booktitle = {35th Computational Complexity Conference, {CCC} 2020, July 28-31,
2020, Saarbr{\"{u}}cken, Germany (Virtual Conference)},
series = {LIPIcs},
volume = {169},
pages = {27:1--27:28},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.CCC.2020.27},
doi = {10.4230/LIPICS.CCC.2020.27},
timestamp = {Thu, 02 Feb 2023 13:27:04 +0100},
biburl = {https://dblp.org/rec/conf/coco/KunnemannM20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/Marx20,
author = {D{\'{a}}niel Marx},
editor = {Fabrizio Grandoni and
Grzegorz Herman and
Peter Sanders},
title = {Chordless Cycle Packing Is Fixed-Parameter Tractable},
booktitle = {28th Annual European Symposium on Algorithms, {ESA} 2020, September
7-9, 2020, Pisa, Italy (Virtual Conference)},
series = {LIPIcs},
volume = {173},
pages = {71:1--71:19},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.ESA.2020.71},
doi = {10.4230/LIPICS.ESA.2020.71},
timestamp = {Mon, 21 Dec 2020 13:23:22 +0100},
biburl = {https://dblp.org/rec/conf/esa/Marx20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/MarxS20,
author = {D{\'{a}}niel Marx and
R. B. Sandeep},
editor = {Fabrizio Grandoni and
Grzegorz Herman and
Peter Sanders},
title = {Incompressibility of H-Free Edge Modification Problems: Towards a
Dichotomy},
booktitle = {28th Annual European Symposium on Algorithms, {ESA} 2020, September
7-9, 2020, Pisa, Italy (Virtual Conference)},
series = {LIPIcs},
volume = {173},
pages = {72:1--72:25},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.ESA.2020.72},
doi = {10.4230/LIPICS.ESA.2020.72},
timestamp = {Wed, 26 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/esa/MarxS20.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}
}
@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-11761,
author = {D{\'{a}}niel Marx and
R. B. Sandeep},
title = {Incompressibility of H-free edge modification problems: Towards a
dichotomy},
journal = {CoRR},
volume = {abs/2004.11761},
year = {2020},
url = {https://arxiv.org/abs/2004.11761},
eprinttype = {arXiv},
eprint = {2004.11761},
timestamp = {Tue, 28 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2004-11761.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2005-11541,
author = {Marvin K{\"{u}}nnemann and
D{\'{a}}niel Marx},
title = {Finding Small Satisfying Assignments Faster Than Brute Force: {A}
Fine-grained Perspective into Boolean Constraint Satisfaction},
journal = {CoRR},
volume = {abs/2005.11541},
year = {2020},
url = {https://arxiv.org/abs/2005.11541},
eprinttype = {arXiv},
eprint = {2005.11541},
timestamp = {Thu, 28 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2005-11541.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2008-07968,
author = {D{\'{a}}niel Marx},
title = {Four short stories on surprising algorithmic uses of treewidth},
journal = {CoRR},
volume = {abs/2008.07968},
year = {2020},
url = {https://arxiv.org/abs/2008.07968},
eprinttype = {arXiv},
eprint = {2008.07968},
timestamp = {Fri, 21 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2008-07968.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2009-00188,
author = {Vincent Cohen{-}Addad and
Philip N. Klein and
D{\'{a}}niel Marx},
title = {On the computational tractability of a geographic clustering problem
arising in redistricting},
journal = {CoRR},
volume = {abs/2009.00188},
year = {2020},
url = {https://arxiv.org/abs/2009.00188},
eprinttype = {arXiv},
eprint = {2009.00188},
timestamp = {Wed, 16 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2009-00188.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BacsoLMPTL19,
author = {G{\'{a}}bor Bacs{\'{o}} and
Daniel Lokshtanov and
D{\'{a}}niel Marx and
Marcin Pilipczuk and
Zsolt Tuza and
Erik Jan van Leeuwen},
title = {Subexponential-Time Algorithms for Maximum Independent Set in {\textdollar}{\textdollar}P{\_}t{\textdollar}{\textdollar}
{P} t -Free and Broom-Free Graphs},
journal = {Algorithmica},
volume = {81},
number = {2},
pages = {421--438},
year = {2019},
url = {https://doi.org/10.1007/s00453-018-0479-5},
doi = {10.1007/S00453-018-0479-5},
timestamp = {Tue, 20 Aug 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BacsoLMPTL19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BonnetBKM19,
author = {{\'{E}}douard Bonnet and
Nick Brettell and
O{-}joung Kwon and
D{\'{a}}niel Marx},
title = {Generalized Feedback Vertex Set Problems on Bounded-Treewidth Graphs:
Chordality is the Key to Single-Exponential Parameterized Algorithms},
journal = {Algorithmica},
volume = {81},
number = {10},
pages = {3890--3935},
year = {2019},
url = {https://doi.org/10.1007/s00453-019-00579-4},
doi = {10.1007/S00453-019-00579-4},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BonnetBKM19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/AmiriKMR19,
author = {Saeed Akhoondian Amiri and
Stephan Kreutzer and
D{\'{a}}niel Marx and
Roman Rabinovich},
title = {Routing with congestion in acyclic digraphs},
journal = {Inf. Process. Lett.},
volume = {151},
year = {2019},
url = {https://doi.org/10.1016/j.ipl.2019.105836},
doi = {10.1016/J.IPL.2019.105836},
timestamp = {Fri, 07 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/AmiriKMR19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/MarxWY19,
author = {D{\'{a}}niel Marx and
Virginia Vassilevska Williams and
Neal E. Young},
title = {Introduction to the Special Issue on {SODA} 2017},
journal = {{ACM} Trans. Algorithms},
volume = {15},
number = {2},
pages = {17:1--17:2},
year = {2019},
url = {https://doi.org/10.1145/3319426},
doi = {10.1145/3319426},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/talg/MarxWY19.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/compgeom/Cohen-AddadVMM19,
author = {Vincent Cohen{-}Addad and
{\'{E}}ric Colin de Verdi{\`{e}}re and
D{\'{a}}niel Marx and
Arnaud de Mesmay},
editor = {Gill Barequet and
Yusu Wang},
title = {Almost Tight Lower Bounds for Hard Cutting Problems in Embedded Graphs},
booktitle = {35th International Symposium on Computational Geometry, SoCG 2019,
June 18-21, 2019, Portland, Oregon, {USA}},
series = {LIPIcs},
volume = {129},
pages = {27:1--27:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.SoCG.2019.27},
doi = {10.4230/LIPICS.SOCG.2019.27},
timestamp = {Mon, 02 Jan 2023 09:02:13 +0100},
biburl = {https://dblp.org/rec/conf/compgeom/Cohen-AddadVMM19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/AgrawalBBBCMM0019,
author = {Akanksha Agrawal and
Arindam Biswas and
{\'{E}}douard Bonnet and
Nick Brettell and
Radu Curticapean and
D{\'{a}}niel Marx and
Tillmann Miltzow and
Venkatesh Raman and
Saket Saurabh},
editor = {Arkadev Chattopadhyay and
Paul Gastin},
title = {Parameterized Streaming Algorithms for Min-Ones d-SAT},
booktitle = {39th {IARCS} Annual Conference on Foundations of Software Technology
and Theoretical Computer Science, {FSTTCS} 2019, December 11-13, 2019,
Bombay, India},
series = {LIPIcs},
volume = {150},
pages = {8:1--8:20},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2019.8},
doi = {10.4230/LIPICS.FSTTCS.2019.8},
timestamp = {Tue, 02 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/fsttcs/AgrawalBBBCMM0019.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/Kisfaludi-BakMZ19,
author = {S{\'{a}}ndor Kisfaludi{-}Bak and
D{\'{a}}niel Marx and
Tom C. van der Zanden},
editor = {Pinyan Lu and
Guochuan Zhang},
title = {How Does Object Fatness Impact the Complexity of Packing in d Dimensions?},
booktitle = {30th International Symposium on Algorithms and Computation, {ISAAC}
2019, December 8-11, 2019, Shanghai University of Finance and Economics,
Shanghai, China},
series = {LIPIcs},
volume = {149},
pages = {36:1--36:18},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2019.36},
doi = {10.4230/LIPICS.ISAAC.2019.36},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/isaac/Kisfaludi-BakMZ19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/Berendsohn0M19,
author = {Benjamin Aram Berendsohn and
L{\'{a}}szl{\'{o}} Kozma and
D{\'{a}}niel Marx},
editor = {Bart M. P. Jansen and
Jan Arne Telle},
title = {Finding and Counting Permutations via CSPs},
booktitle = {14th International Symposium on Parameterized and Exact Computation,
{IPEC} 2019, September 11-13, 2019, Munich, Germany},
series = {LIPIcs},
volume = {148},
pages = {1:1--1:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.IPEC.2019.1},
doi = {10.4230/LIPICS.IPEC.2019.1},
timestamp = {Thu, 05 Dec 2019 15:19:13 +0100},
biburl = {https://dblp.org/rec/conf/iwpec/Berendsohn0M19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1902-08218,
author = {Lin Chen and
D{\'{a}}niel Marx},
title = {Covering a tree with rooted subtrees},
journal = {CoRR},
volume = {abs/1902.08218},
year = {2019},
url = {http://arxiv.org/abs/1902.08218},
eprinttype = {arXiv},
eprint = {1902.08218},
timestamp = {Tue, 21 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1902-08218.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1902-08723,
author = {Daniel Lokshtanov and
D{\'{a}}niel Marx and
Saket Saurabh},
title = {Slightly Superexponential Parameterized Problems},
journal = {CoRR},
volume = {abs/1902.08723},
year = {2019},
url = {http://arxiv.org/abs/1902.08723},
eprinttype = {arXiv},
eprint = {1902.08723},
timestamp = {Tue, 21 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1902-08723.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1903-08603,
author = {Vincent Cohen{-}Addad and
{\'{E}}ric Colin de Verdi{\`{e}}re and
D{\'{a}}niel Marx and
Arnaud de Mesmay},
title = {Almost Tight Lower Bounds for Hard Cutting Problems in Embedded Graphs},
journal = {CoRR},
volume = {abs/1903.08603},
year = {2019},
url = {http://arxiv.org/abs/1903.08603},
eprinttype = {arXiv},
eprint = {1903.08603},
timestamp = {Thu, 04 Apr 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1903-08603.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1908-04673,
author = {Benjamin Aram Berendsohn and
L{\'{a}}szl{\'{o}} Kozma and
D{\'{a}}niel Marx},
title = {Finding and counting permutations via CSPs},
journal = {CoRR},
volume = {abs/1908.04673},
year = {2019},
url = {http://arxiv.org/abs/1908.04673},
eprinttype = {arXiv},
eprint = {1908.04673},
timestamp = {Thu, 29 Aug 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1908-04673.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1909-01986,
author = {Arnab Bhattacharyya and
{\'{E}}douard Bonnet and
L{\'{a}}szl{\'{o}} Egri and
Suprovat Ghoshal and
{Karthik {C. S.}} and
Bingkai Lin and
Pasin Manurangsi and
D{\'{a}}niel Marx},
title = {Parameterized Intractability of Even Set and Shortest Vector Problem},
journal = {CoRR},
volume = {abs/1909.01986},
year = {2019},
url = {http://arxiv.org/abs/1909.01986},
eprinttype = {arXiv},
eprint = {1909.01986},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1909-01986.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1909-12044,
author = {S{\'{a}}ndor Kisfaludi{-}Bak and
D{\'{a}}niel Marx and
Tom C. van der Zanden},
title = {How does object fatness impact the complexity of packing in d dimensions?},
journal = {CoRR},
volume = {abs/1909.12044},
year = {2019},
url = {http://arxiv.org/abs/1909.12044},
eprinttype = {arXiv},
eprint = {1909.12044},
timestamp = {Fri, 27 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1909-12044.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1911-13161,
author = {Rajesh Chitnis and
Andreas Emil Feldmann and
MohammadTaghi Hajiaghayi and
D{\'{a}}niel Marx},
title = {Tight Bounds for Planar Strongly Connected Steiner Subgraph with Fixed
Number of Terminals (and Extensions)},
journal = {CoRR},
volume = {abs/1911.13161},
year = {2019},
url = {http://arxiv.org/abs/1911.13161},
eprinttype = {arXiv},
eprint = {1911.13161},
timestamp = {Wed, 08 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1911-13161.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dagstuhl-reports/FominM0Z19,
author = {Fedor V. Fomin and
D{\'{a}}niel Marx and
Saket Saurabh and
Meirav Zehavi},
title = {New Horizons in Parameterized Complexity (Dagstuhl Seminar 19041)},
journal = {Dagstuhl Reports},
volume = {9},
number = {1},
pages = {67--87},
year = {2019},
url = {https://doi.org/10.4230/DagRep.9.1.67},
doi = {10.4230/DAGREP.9.1.67},
timestamp = {Wed, 26 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dagstuhl-reports/FominM0Z19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BhattacharyyaBE19,
author = {Arnab Bhattacharyya and
{\'{E}}douard Bonnet and
L{\'{a}}szl{\'{o}} Egri and
Suprovat Ghoshal and
{Karthik {C. S.}} and
Bingkai Lin and
Pasin Manurangsi and
D{\'{a}}niel Marx},
title = {Parameterized Intractability of Even Set and Shortest Vector Problem},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-115}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/115},
eprinttype = {ECCC},
eprint = {TR19-115},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/BhattacharyyaBE19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jocg/BiroBMMR18,
author = {Csaba Bir{\'{o}} and
{\'{E}}douard Bonnet and
D{\'{a}}niel Marx and
Tillmann Miltzow and
Pawel Rzazewski},
title = {Fine-grained complexity of coloring unit disks and balls},
journal = {J. Comput. Geom.},
volume = {9},
number = {2},
pages = {47--80},
year = {2018},
url = {https://doi.org/10.20382/jocg.v9i2a4},
doi = {10.20382/JOCG.V9I2A4},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jocg/BiroBMMR18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/LokshtanovMS18,
author = {Daniel Lokshtanov and
D{\'{a}}niel Marx and
Saket Saurabh},
title = {Slightly Superexponential Parameterized Problems},
journal = {{SIAM} J. Comput.},
volume = {47},
number = {3},
pages = {675--702},
year = {2018},
url = {https://doi.org/10.1137/16M1104834},
doi = {10.1137/16M1104834},
timestamp = {Mon, 23 Jul 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/LokshtanovMS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/LokshtanovMS18,
author = {Daniel Lokshtanov and
D{\'{a}}niel Marx and
Saket Saurabh},
title = {Known Algorithms on Graphs of Bounded Treewidth Are Probably Optimal},
journal = {{ACM} Trans. Algorithms},
volume = {14},
number = {2},
pages = {13:1--13:30},
year = {2018},
url = {https://doi.org/10.1145/3170442},
doi = {10.1145/3170442},
timestamp = {Wed, 21 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/talg/LokshtanovMS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/MarxPP18,
author = {D{\'{a}}niel Marx and
Marcin Pilipczuk and
Michal Pilipczuk},
editor = {Mikkel Thorup},
title = {On Subexponential Parameterized Algorithms for Steiner Tree and Directed
Subset {TSP} on Planar Graphs},
booktitle = {59th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2018, Paris, France, October 7-9, 2018},
pages = {474--484},
publisher = {{IEEE} Computer Society},
year = {2018},
url = {https://doi.org/10.1109/FOCS.2018.00052},
doi = {10.1109/FOCS.2018.00052},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/MarxPP18.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}
}
@inproceedings{DBLP:conf/soda/ChenM18,
author = {Lin Chen and
D{\'{a}}niel Marx},
editor = {Artur Czumaj},
title = {Covering a tree with rooted subtrees - parameterized and approximation
algorithms},
booktitle = {Proceedings of the Twenty-Ninth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2018, New Orleans, LA, USA, January 7-10, 2018},
pages = {2801--2820},
publisher = {{SIAM}},
year = {2018},
url = {https://doi.org/10.1137/1.9781611975031.178},
doi = {10.1137/1.9781611975031.178},
timestamp = {Tue, 02 Feb 2021 17:07:58 +0100},
biburl = {https://dblp.org/rec/conf/soda/ChenM18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/EgriMR18,
author = {L{\'{a}}szl{\'{o}} Egri and
D{\'{a}}niel Marx and
Pawel Rzazewski},
editor = {Rolf Niedermeier and
Brigitte Vall{\'{e}}e},
title = {Finding List Homomorphisms from Bounded-treewidth Graphs to Reflexive
Graphs: a Complete Complexity Characterization},
booktitle = {35th Symposium on Theoretical Aspects of Computer Science, {STACS}
2018, February 28 to March 3, 2018, Caen, France},
series = {LIPIcs},
volume = {96},
pages = {27:1--27:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.STACS.2018.27},
doi = {10.4230/LIPICS.STACS.2018.27},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/stacs/EgriMR18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BergBKMZ18,
author = {Mark de Berg and
Hans L. Bodlaender and
S{\'{a}}ndor Kisfaludi{-}Bak and
D{\'{a}}niel Marx and
Tom C. van der Zanden},
editor = {Ilias Diakonikolas and
David Kempe and
Monika Henzinger},
title = {A framework for ETH-tight algorithms and lower bounds in geometric
intersection graphs},
booktitle = {Proceedings of the 50th Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2018, Los Angeles, CA, USA, June 25-29, 2018},
pages = {574--586},
publisher = {{ACM}},
year = {2018},
url = {https://doi.org/10.1145/3188745.3188854},
doi = {10.1145/3188745.3188854},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/BergBKMZ18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/FeldmannM18,
author = {Andreas Emil Feldmann and
D{\'{a}}niel Marx},
editor = {David Eppstein},
title = {The Parameterized Hardness of the k-Center Problem in Transportation
Networks},
booktitle = {16th Scandinavian Symposium and Workshops on Algorithm Theory, {SWAT}
2018, June 18-20, 2018, Malm{\"{o}}, Sweden},
series = {LIPIcs},
volume = {101},
pages = {19:1--19:13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.SWAT.2018.19},
doi = {10.4230/LIPICS.SWAT.2018.19},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/FeldmannM18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/icalp/2018,
editor = {Ioannis Chatzigiannakis and
Christos Kaklamanis and
D{\'{a}}niel Marx and
Donald Sannella},
title = {45th International Colloquium on Automata, Languages, and Programming,
{ICALP} 2018, July 9-13, 2018, Prague, Czech Republic},
series = {LIPIcs},
volume = {107},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {http://www.dagstuhl.de/dagpub/978-3-95977-076-7},
isbn = {978-3-95977-076-7},
timestamp = {Tue, 11 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/icalp/2018.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1802-08563,
author = {Andreas Emil Feldmann and
D{\'{a}}niel Marx},
title = {The Parameterized Hardness of the k-Center Problem in Transportation
Networks},
journal = {CoRR},
volume = {abs/1802.08563},
year = {2018},
url = {http://arxiv.org/abs/1802.08563},
eprinttype = {arXiv},
eprint = {1802.08563},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1802-08563.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1803-10633,
author = {Mark de Berg and
Hans L. Bodlaender and
S{\'{a}}ndor Kisfaludi{-}Bak and
D{\'{a}}niel Marx and
Tom C. van der Zanden},
title = {Framework for ETH-tight Algorithms and Lower Bounds in Geometric Intersection
Graphs},
journal = {CoRR},
volume = {abs/1803.10633},
year = {2018},
url = {http://arxiv.org/abs/1803.10633},
eprinttype = {arXiv},
eprint = {1803.10633},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1803-10633.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1804-04077,
author = {G{\'{a}}bor Bacs{\'{o}} and
Daniel Lokshtanov and
D{\'{a}}niel Marx and
Marcin Pilipczuk and
Zsolt Tuza and
Erik Jan van Leeuwen},
title = {Subexponential-time Algorithms for Maximum Independent Set in P\({}_{\mbox{t}}\)-free
and Broom-free Graphs},
journal = {CoRR},
volume = {abs/1804.04077},
year = {2018},
url = {http://arxiv.org/abs/1804.04077},
eprinttype = {arXiv},
eprint = {1804.04077},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1804-04077.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/corr/abs-1812-03155,
author = {Holger Dell and
D{\'{a}}niel Marx},
title = {Kernelization of Packing Problems},
journal = {CoRR},
volume = {abs/1812.03155},
year = {2018},
url = {http://arxiv.org/abs/1812.03155},
eprinttype = {arXiv},
eprint = {1812.03155},
timestamp = {Tue, 01 Jan 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1812-03155.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/ChitnisEM17,
author = {Rajesh Chitnis and
L{\'{a}}szl{\'{o}} Egri and
D{\'{a}}niel Marx},
title = {List H-Coloring a Graph by Removing Few Vertices},
journal = {Algorithmica},
volume = {78},
number = {1},
pages = {110--146},
year = {2017},
url = {https://doi.org/10.1007/s00453-016-0139-6},
doi = {10.1007/S00453-016-0139-6},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/ChitnisEM17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/CyganMPP17,
author = {Marek Cygan and
D{\'{a}}niel Marx and
Marcin Pilipczuk and
Michal Pilipczuk},
title = {Hitting forbidden subgraphs in graphs of bounded treewidth},
journal = {Inf. Comput.},
volume = {256},
pages = {62--82},
year = {2017},
url = {https://doi.org/10.1016/j.ic.2017.04.009},
doi = {10.1016/J.IC.2017.04.009},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/iandc/CyganMPP17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/MarxSW17,
author = {D{\'{a}}niel Marx and
Paul D. Seymour and
Paul Wollan},
title = {Rooted grid minors},
journal = {J. Comb. Theory, Ser. {B}},
volume = {122},
pages = {428--437},
year = {2017},
url = {https://doi.org/10.1016/j.jctb.2016.07.003},
doi = {10.1016/J.JCTB.2016.07.003},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jct/MarxSW17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/AboulkerBHMT17,
author = {Pierre Aboulker and
Nick Brettell and
Fr{\'{e}}d{\'{e}}ric Havet and
D{\'{a}}niel Marx and
Nicolas Trotignon},
title = {Coloring Graphs with Constraints on Connectivity},
journal = {J. Graph Theory},
volume = {85},
number = {4},
pages = {814--838},
year = {2017},
url = {https://doi.org/10.1002/jgt.22109},
doi = {10.1002/JGT.22109},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/AboulkerBHMT17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/BiroBMMR17,
author = {Csaba Bir{\'{o}} and
{\'{E}}douard Bonnet and
D{\'{a}}niel Marx and
Tillmann Miltzow and
Pawel Rzazewski},
editor = {Boris Aronov and
Matthew J. Katz},
title = {Fine-Grained Complexity of Coloring Unit Disks and Balls},
booktitle = {33rd International Symposium on Computational Geometry, SoCG 2017,
July 4-7, 2017, Brisbane, Australia},
series = {LIPIcs},
volume = {77},
pages = {18:1--18:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.SoCG.2017.18},
doi = {10.4230/LIPICS.SOCG.2017.18},
timestamp = {Wed, 16 Jun 2021 12:03:17 +0200},
biburl = {https://dblp.org/rec/conf/compgeom/BiroBMMR17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/MarxP17,
author = {D{\'{a}}niel Marx and
Marcin Pilipczuk},
editor = {Kirk Pruhs and
Christian Sohler},
title = {Subexponential Parameterized Algorithms for Graphs of Polynomial Growth},
booktitle = {25th Annual European Symposium on Algorithms, {ESA} 2017, September
4-6, 2017, Vienna, Austria},
series = {LIPIcs},
volume = {87},
pages = {59:1--59:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.ESA.2017.59},
doi = {10.4230/LIPICS.ESA.2017.59},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/esa/MarxP17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icdt/Marx17,
author = {D{\'{a}}niel Marx},
editor = {Michael Benedikt and
Giorgio Orsi},
title = {Graphs, Hypergraphs, and the Complexity of Conjunctive Database Queries
(Invited Talk)},
booktitle = {20th International Conference on Database Theory, {ICDT} 2017, March
21-24, 2017, Venice, Italy},
series = {LIPIcs},
volume = {68},
pages = {2:1--2:1},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.ICDT.2017.2},
doi = {10.4230/LIPICS.ICDT.2017.2},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/icdt/Marx17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/BonnetBKM17,
author = {{\'{E}}douard Bonnet and
Nick Brettell and
O{-}joung Kwon and
D{\'{a}}niel Marx},
editor = {Daniel Lokshtanov and
Naomi Nishimura},
title = {Generalized Feedback Vertex Set Problems on Bounded-Treewidth Graphs:
Chordality Is the Key to Single-Exponential Parameterized Algorithms},
booktitle = {12th International Symposium on Parameterized and Exact Computation,
{IPEC} 2017, September 6-8, 2017, Vienna, Austria},
series = {LIPIcs},
volume = {89},
pages = {7:1--7:13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.IPEC.2017.7},
doi = {10.4230/LIPICS.IPEC.2017.7},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/iwpec/BonnetBKM17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/0011MYZ17,
author = {Lin Chen and
D{\'{a}}niel Marx and
Deshi Ye and
Guochuan Zhang},
editor = {Heribert Vollmer and
Brigitte Vall{\'{e}}e},
title = {Parameterized and Approximation Results for Scheduling with a Low
Rank Processing Time Matrix},
booktitle = {34th Symposium on Theoretical Aspects of Computer Science, {STACS}
2017, March 8-11, 2017, Hannover, Germany},
series = {LIPIcs},
volume = {66},
pages = {22:1--22:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.STACS.2017.22},
doi = {10.4230/LIPICS.STACS.2017.22},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stacs/0011MYZ17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/CurticapeanDM17,
author = {Radu Curticapean and
Holger Dell and
D{\'{a}}niel Marx},
editor = {Hamed Hatami and
Pierre McKenzie and
Valerie King},
title = {Homomorphisms are a good basis for counting small subgraphs},
booktitle = {Proceedings of the 49th Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2017, Montreal, QC, Canada, June 19-23, 2017},
pages = {210--223},
publisher = {{ACM}},
year = {2017},
url = {https://doi.org/10.1145/3055399.3055502},
doi = {10.1145/3055399.3055502},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/CurticapeanDM17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BonnetBKM17,
author = {{\'{E}}douard Bonnet and
Nick Brettell and
O{-}joung Kwon and
D{\'{a}}niel Marx},
title = {Generalized feedback vertex set problems on bounded-treewidth graphs:
chordality is the key to single-exponential parameterized algorithms},
journal = {CoRR},
volume = {abs/1704.06757},
year = {2017},
url = {http://arxiv.org/abs/1704.06757},
eprinttype = {arXiv},
eprint = {1704.06757},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BonnetBKM17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/CurticapeanDM17,
author = {Radu Curticapean and
Holger Dell and
D{\'{a}}niel Marx},
title = {Homomorphisms Are a Good Basis for Counting Small Subgraphs},
journal = {CoRR},
volume = {abs/1705.01595},
year = {2017},
url = {http://arxiv.org/abs/1705.01595},
eprinttype = {arXiv},
eprint = {1705.01595},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/CurticapeanDM17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/MarxPP17,
author = {D{\'{a}}niel Marx and
Marcin Pilipczuk and
Michal Pilipczuk},
title = {On subexponential parameterized algorithms for Steiner Tree and Directed
Subset {TSP} on planar graphs},
journal = {CoRR},
volume = {abs/1707.02190},
year = {2017},
url = {http://arxiv.org/abs/1707.02190},
eprinttype = {arXiv},
eprint = {1707.02190},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/MarxPP17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/FeldmannM17,
author = {Andreas Emil Feldmann and
D{\'{a}}niel Marx},
title = {The Complexity Landscape of Fixed-Parameter Directed Steiner Network
Problems},
journal = {CoRR},
volume = {abs/1707.06808},
year = {2017},
url = {http://arxiv.org/abs/1707.06808},
eprinttype = {arXiv},
eprint = {1707.06808},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/FeldmannM17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1711-03860,
author = {Albert Atserias and
Martin Grohe and
D{\'{a}}niel Marx},
title = {Size bounds and query plans for relational joins},
journal = {CoRR},
volume = {abs/1711.03860},
year = {2017},
url = {http://arxiv.org/abs/1711.03860},
eprinttype = {arXiv},
eprint = {1711.03860},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1711-03860.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1711-03885,
author = {Daniel Lokshtanov and
D{\'{a}}niel Marx},
title = {Clustering with Local Restrictions},
journal = {CoRR},
volume = {abs/1711.03885},
year = {2017},
url = {http://arxiv.org/abs/1711.03885},
eprinttype = {arXiv},
eprint = {1711.03885},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1711-03885.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1711-03886,
author = {D{\'{a}}niel Marx},
title = {Completely inapproximable monotone and antimonotone parameterized
problems},
journal = {CoRR},
volume = {abs/1711.03886},
year = {2017},
url = {http://arxiv.org/abs/1711.03886},
eprinttype = {arXiv},
eprint = {1711.03886},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1711-03886.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1711-03894,
author = {Andrei A. Krokhin and
D{\'{a}}niel Marx},
title = {On the hardness of losing weight},
journal = {CoRR},
volume = {abs/1711.03894},
year = {2017},
url = {http://arxiv.org/abs/1711.03894},
eprinttype = {arXiv},
eprint = {1711.03894},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1711-03894.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1711-04506,
author = {Martin Grohe and
D{\'{a}}niel Marx},
title = {Constraint Solving via Fractional Edge Covers},
journal = {CoRR},
volume = {abs/1711.04506},
year = {2017},
url = {http://arxiv.org/abs/1711.04506},
eprinttype = {arXiv},
eprint = {1711.04506},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1711-04506.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/CaoM16,
author = {Yixin Cao and
D{\'{a}}niel Marx},
title = {Chordal Editing is Fixed-Parameter Tractable},
journal = {Algorithmica},
volume = {75},
number = {1},
pages = {118--137},
year = {2016},
url = {https://doi.org/10.1007/s00453-015-0014-x},
doi = {10.1007/S00453-015-0014-X},
timestamp = {Fri, 15 Sep 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/CaoM16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/CyganDLMNOPSW16,
author = {Marek Cygan and
Holger Dell and
Daniel Lokshtanov and
D{\'{a}}niel Marx and
Jesper Nederlof and
Yoshio Okamoto and
Ramamohan Paturi and
Saket Saurabh and
Magnus Wahlstr{\"{o}}m},
title = {On Problems as Hard as {CNF-SAT}},
journal = {{ACM} Trans. Algorithms},
volume = {12},
number = {3},
pages = {41:1--41:24},
year = {2016},
url = {https://doi.org/10.1145/2925416},
doi = {10.1145/2925416},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/talg/CyganDLMNOPSW16.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/approx/MarxSS16,
author = {D{\'{a}}niel Marx and
Ario Salmasi and
Anastasios Sidiropoulos},
editor = {Klaus Jansen and
Claire Mathieu and
Jos{\'{e}} D. P. Rolim and
Chris Umans},
title = {Constant-Factor Approximations for Asymmetric {TSP} on Nearly-Embeddable
Graphs},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2016, September 7-9, 2016, Paris,
France},
series = {LIPIcs},
volume = {60},
pages = {16:1--16:54},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2016.16},
doi = {10.4230/LIPICS.APPROX-RANDOM.2016.16},
timestamp = {Tue, 21 Sep 2021 09:36:24 +0200},
biburl = {https://dblp.org/rec/conf/approx/MarxSS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/MarxM16,
author = {D{\'{a}}niel Marx and
Tillmann Miltzow},
editor = {S{\'{a}}ndor P. Fekete and
Anna Lubiw},
title = {Peeling and Nibbling the Cactus: Subexponential-Time Algorithms for
Counting Triangulations and Related Problems},
booktitle = {32nd International Symposium on Computational Geometry, SoCG 2016,
June 14-18, 2016, Boston, MA, {USA}},
series = {LIPIcs},
volume = {51},
pages = {52:1--52:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.SoCG.2016.52},
doi = {10.4230/LIPICS.SOCG.2016.52},
timestamp = {Wed, 16 Jun 2021 12:03:34 +0200},
biburl = {https://dblp.org/rec/conf/compgeom/MarxM16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/BonnetEM16,
author = {{\'{E}}douard Bonnet and
L{\'{a}}szl{\'{o}} Egri and
D{\'{a}}niel Marx},
editor = {Piotr Sankowski and
Christos D. Zaroliagis},
title = {Fixed-Parameter Approximability of Boolean MinCSPs},
booktitle = {24th Annual European Symposium on Algorithms, {ESA} 2016, August 22-24,
2016, Aarhus, Denmark},
series = {LIPIcs},
volume = {57},
pages = {18:1--18:18},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.ESA.2016.18},
doi = {10.4230/LIPICS.ESA.2016.18},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/esa/BonnetEM16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/FominLMPPS16,
author = {Fedor V. Fomin and
Daniel Lokshtanov and
D{\'{a}}niel Marx and
Marcin Pilipczuk and
Michal Pilipczuk and
Saket Saurabh},
editor = {Irit Dinur},
title = {Subexponential Parameterized Algorithms for Planar and Apex-Minor-Free
Graphs via Low Treewidth Pattern Covering},
booktitle = {{IEEE} 57th Annual Symposium on Foundations of Computer Science, {FOCS}
2016, 9-11 October 2016, Hyatt Regency, New Brunswick, New Jersey,
{USA}},
pages = {515--524},
publisher = {{IEEE} Computer Society},
year = {2016},
url = {https://doi.org/10.1109/FOCS.2016.62},
doi = {10.1109/FOCS.2016.62},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/FominLMPPS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/FeldmannM16,
author = {Andreas Emil Feldmann and
D{\'{a}}niel Marx},
editor = {Ioannis Chatzigiannakis and
Michael Mitzenmacher and
Yuval Rabani and
Davide Sangiorgi},
title = {The Complexity Landscape of Fixed-Parameter Directed Steiner Network
Problems},
booktitle = {43rd International Colloquium on Automata, Languages, and Programming,
{ICALP} 2016, July 11-15, 2016, Rome, Italy},
series = {LIPIcs},
volume = {55},
pages = {27:1--27:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2016.27},
doi = {10.4230/LIPICS.ICALP.2016.27},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/icalp/FeldmannM16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/MarxM16,
author = {D{\'{a}}niel Marx and
Valia Mitsou},
editor = {Ioannis Chatzigiannakis and
Michael Mitzenmacher and
Yuval Rabani and
Davide Sangiorgi},
title = {Double-Exponential and Triple-Exponential Bounds for Choosability
Problems Parameterized by Treewidth},
booktitle = {43rd International Colloquium on Automata, Languages, and Programming,
{ICALP} 2016, July 11-15, 2016, Rome, Italy},
series = {LIPIcs},
volume = {55},
pages = {28:1--28:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2016.28},
doi = {10.4230/LIPICS.ICALP.2016.28},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/MarxM16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/BacsoMT16,
author = {G{\'{a}}bor Bacs{\'{o}} and
D{\'{a}}niel Marx and
Zsolt Tuza},
editor = {Jiong Guo and
Danny Hermelin},
title = {H-Free Graphs, Independent Sets, and Subexponential-Time Algorithms},
booktitle = {11th International Symposium on Parameterized and Exact Computation,
{IPEC} 2016, August 24-26, 2016, Aarhus, Denmark},
series = {LIPIcs},
volume = {63},
pages = {3:1--3:12},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.IPEC.2016.3},
doi = {10.4230/LIPICS.IPEC.2016.3},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/iwpec/BacsoMT16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/AmiriKMR16,
author = {Saeed Akhoondian Amiri and
Stephan Kreutzer and
D{\'{a}}niel Marx and
Roman Rabinovich},
editor = {Piotr Faliszewski and
Anca Muscholl and
Rolf Niedermeier},
title = {Routing with Congestion in Acyclic Digraphs},
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 = {7:1--7:11},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.MFCS.2016.7},
doi = {10.4230/LIPICS.MFCS.2016.7},
timestamp = {Fri, 07 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/AmiriKMR16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/CurticapeanM16,
author = {Radu Curticapean and
D{\'{a}}niel Marx},
editor = {Robert Krauthgamer},
title = {Tight conditional lower bounds for counting perfect matchings on graphs
of bounded treewidth, cliquewidth, and genus},
booktitle = {Proceedings of the Twenty-Seventh Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2016, Arlington, VA, USA, January 10-12, 2016},
pages = {1650--1669},
publisher = {{SIAM}},
year = {2016},
url = {https://doi.org/10.1137/1.9781611974331.ch113},
doi = {10.1137/1.9781611974331.CH113},
timestamp = {Tue, 02 Feb 2021 17:07:56 +0100},
biburl = {https://dblp.org/rec/conf/soda/CurticapeanM16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BateniDHM16,
author = {MohammadHossein Bateni and
Erik D. Demaine and
MohammadTaghi Hajiaghayi and
D{\'{a}}niel Marx},
editor = {Daniel Wichs and
Yishay Mansour},
title = {A {PTAS} for planar group Steiner tree via spanner bootstrapping and
prize collecting},
booktitle = {Proceedings of the 48th Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2016, Cambridge, MA, USA, June 18-21, 2016},
pages = {570--583},
publisher = {{ACM}},
year = {2016},
url = {https://doi.org/10.1145/2897518.2897549},
doi = {10.1145/2897518.2897549},
timestamp = {Mon, 12 Aug 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/BateniDHM16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/Marx16,
author = {D{\'{a}}niel Marx},
editor = {Rasmus Pagh},
title = {The Complexity Landscape of Fixed-Parameter Directed Steiner Network
Problems (Invited Talk)},
booktitle = {15th Scandinavian Symposium and Workshops on Algorithm Theory, {SWAT}
2016, June 22-24, 2016, Reykjavik, Iceland},
series = {LIPIcs},
volume = {53},
pages = {32:1--32:1},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.SWAT.2016.32},
doi = {10.4230/LIPICS.SWAT.2016.32},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/swat/Marx16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/BonnetBKM16,
author = {{\'{E}}douard Bonnet and
Nick Brettell and
O{-}joung Kwon and
D{\'{a}}niel Marx},
editor = {Pinar Heggernes},
title = {Parameterized Vertex Deletion Problems for Hereditary Graph Classes
with a Block Property},
booktitle = {Graph-Theoretic Concepts in Computer Science - 42nd International
Workshop, {WG} 2016, Istanbul, Turkey, June 22-24, 2016, Revised Selected
Papers},
series = {Lecture Notes in Computer Science},
volume = {9941},
pages = {233--244},
year = {2016},
url = {https://doi.org/10.1007/978-3-662-53536-3\_20},
doi = {10.1007/978-3-662-53536-3\_20},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/wg/BonnetBKM16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/MarxSS16,
author = {D{\'{a}}niel Marx and
Ario Salmasi and
Anastasios Sidiropoulos},
title = {Constant-factor approximations for asymmetric {TSP} on nearly-embeddable
graphs},
journal = {CoRR},
volume = {abs/1601.01372},
year = {2016},
url = {http://arxiv.org/abs/1601.01372},
eprinttype = {arXiv},
eprint = {1601.01372},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/MarxSS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BonnetEM16,
author = {{\'{E}}douard Bonnet and
L{\'{a}}szl{\'{o}} Egri and
D{\'{a}}niel Marx},
title = {Fixed-parameter Approximability of Boolean MinCSPs},
journal = {CoRR},
volume = {abs/1601.04935},
year = {2016},
url = {http://arxiv.org/abs/1601.04935},
eprinttype = {arXiv},
eprint = {1601.04935},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BonnetEM16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BonnetBKM16,
author = {{\'{E}}douard Bonnet and
Nick Brettell and
O{-}joung Kwon and
D{\'{a}}niel Marx},
title = {Parameterized vertex deletion problems for hereditary graph classes
with a block property},
journal = {CoRR},
volume = {abs/1603.05945},
year = {2016},
url = {http://arxiv.org/abs/1603.05945},
eprinttype = {arXiv},
eprint = {1603.05945},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BonnetBKM16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/MarxM16,
author = {D{\'{a}}niel Marx and
Tillmann Miltzow},
title = {Peeling and Nibbling the Cactus: Subexponential-Time Algorithms for
Counting Triangulations and Related Problems},
journal = {CoRR},
volume = {abs/1603.07340},
year = {2016},
url = {http://arxiv.org/abs/1603.07340},
eprinttype = {arXiv},
eprint = {1603.07340},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/MarxM16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/FominLMPPS16,
author = {Fedor V. Fomin and
Daniel Lokshtanov and
D{\'{a}}niel Marx and
Marcin Pilipczuk and
Michal Pilipczuk and
Saket Saurabh},
title = {Subexponential parameterized algorithms for planar and apex-minor-free
graphs via low treewidth pattern covering},
journal = {CoRR},
volume = {abs/1604.05999},
year = {2016},
url = {http://arxiv.org/abs/1604.05999},
eprinttype = {arXiv},
eprint = {1604.05999},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/FominLMPPS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/AmiriKMR16,
author = {Saeed Akhoondian Amiri and
Stephan Kreutzer and
D{\'{a}}niel Marx and
Roman Rabinovich},
title = {Routing with Congestion in Acyclic Digraphs},
journal = {CoRR},
volume = {abs/1605.01866},
year = {2016},
url = {http://arxiv.org/abs/1605.01866},
eprinttype = {arXiv},
eprint = {1605.01866},
timestamp = {Fri, 07 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/AmiriKMR16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/MarxP16,
author = {D{\'{a}}niel Marx and
Marcin Pilipczuk},
title = {Subexponential parameterized algorithms for graphs of polynomial growth},
journal = {CoRR},
volume = {abs/1610.07778},
year = {2016},
url = {http://arxiv.org/abs/1610.07778},
eprinttype = {arXiv},
eprint = {1610.07778},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/MarxP16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/MarxS16,
author = {D{\'{a}}niel Marx and
Anastasios Sidiropoulos},
title = {The limited blessing of low dimensionality: when {\textdollar}1-1/d{\textdollar}
is the best possible exponent for {\textdollar}d{\textdollar}-dimensional
geometric problems},
journal = {CoRR},
volume = {abs/1612.01171},
year = {2016},
url = {http://arxiv.org/abs/1612.01171},
eprinttype = {arXiv},
eprint = {1612.01171},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/MarxS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dagstuhl-reports/EricksonKMM16,
author = {Jeff Erickson and
Philip N. Klein and
D{\'{a}}niel Marx and
Claire Mathieu},
title = {Algorithms for Optimization Problems in Planar Graphs (Dagstuhl Seminar
16221)},
journal = {Dagstuhl Reports},
volume = {6},
number = {5},
pages = {94--116},
year = {2016},
url = {https://doi.org/10.4230/DagRep.6.5.94},
doi = {10.4230/DAGREP.6.5.94},
timestamp = {Tue, 21 Nov 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dagstuhl-reports/EricksonKMM16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@book{DBLP:books/sp/CyganFKLMPPS15,
author = {Marek Cygan and
Fedor V. Fomin and
Lukasz Kowalik and
Daniel Lokshtanov and
D{\'{a}}niel Marx and
Marcin Pilipczuk and
Michal Pilipczuk and
Saket Saurabh},
title = {Parameterized Algorithms},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-319-21275-3},
doi = {10.1007/978-3-319-21275-3},
isbn = {978-3-319-21274-6},
timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/books/sp/CyganFKLMPPS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/HeggernesHMMV15,
author = {Pinar Heggernes and
Pim van 't Hof and
D{\'{a}}niel Marx and
Neeldhara Misra and
Yngve Villanger},
title = {On the Parameterized Complexity of Finding Separators with Non-Hereditary
Properties},
journal = {Algorithmica},
volume = {72},
number = {3},
pages = {687--713},
year = {2015},
url = {https://doi.org/10.1007/s00453-014-9868-6},
doi = {10.1007/S00453-014-9868-6},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/HeggernesHMMV15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/GroheM15,
author = {Martin Grohe and
D{\'{a}}niel Marx},
title = {Structure Theorem and Isomorphism Test for Graphs with Excluded Topological
Subgraphs},
journal = {{SIAM} J. Comput.},
volume = {44},
number = {1},
pages = {114--159},
year = {2015},
url = {https://doi.org/10.1137/120892234},
doi = {10.1137/120892234},
timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/GroheM15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/CaoM15,
author = {Yixin Cao and
D{\'{a}}niel Marx},
title = {Interval Deletion Is Fixed-Parameter Tractable},
journal = {{ACM} Trans. Algorithms},
volume = {11},
number = {3},
pages = {21:1--21:35},
year = {2015},
url = {https://doi.org/10.1145/2629595},
doi = {10.1145/2629595},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/talg/CaoM15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/MarxV15,
author = {D{\'{a}}niel Marx and
L{\'{a}}szl{\'{o}} A. V{\'{e}}gh},
title = {Fixed-Parameter Algorithms for Minimum-Cost Edge-Connectivity Augmentation},
journal = {{ACM} Trans. Algorithms},
volume = {11},
number = {4},
pages = {27:1--27:24},
year = {2015},
url = {https://doi.org/10.1145/2700210},
doi = {10.1145/2700210},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/talg/MarxV15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/ChitnisCHM15,
author = {Rajesh Hemant Chitnis and
Marek Cygan and
Mohammad Taghi Hajiaghayi and
D{\'{a}}niel Marx},
title = {Directed Subset Feedback Vertex Set Is Fixed-Parameter Tractable},
journal = {{ACM} Trans. Algorithms},
volume = {11},
number = {4},
pages = {28:1--28:28},
year = {2015},
url = {https://doi.org/10.1145/2700209},
doi = {10.1145/2700209},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/talg/ChitnisCHM15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/MarxP15,
author = {D{\'{a}}niel Marx and
Michal Pilipczuk},
editor = {Nikhil Bansal and
Irene Finocchi},
title = {Optimal Parameterized Algorithms for Planar Facility Location Problems
Using Voronoi Diagrams},
booktitle = {Algorithms - {ESA} 2015 - 23rd Annual European Symposium, Patras,
Greece, September 14-16, 2015, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9294},
pages = {865--877},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-662-48350-3\_72},
doi = {10.1007/978-3-662-48350-3\_72},
timestamp = {Tue, 15 Feb 2022 07:54:27 +0100},
biburl = {https://dblp.org/rec/conf/esa/MarxP15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/JansenM15,
author = {Bart M. P. Jansen and
D{\'{a}}niel Marx},
editor = {Piotr Indyk},
title = {Characterizing the easy-to-find subgraphs from the viewpoint of polynomial-time
algorithms, kernels, and Turing kernels},
booktitle = {Proceedings of the Twenty-Sixth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2015, San Diego, CA, USA, January 4-6, 2015},
pages = {616--629},
publisher = {{SIAM}},
year = {2015},
url = {https://doi.org/10.1137/1.9781611973730.42},
doi = {10.1137/1.9781611973730.42},
timestamp = {Tue, 02 Feb 2021 17:07:30 +0100},
biburl = {https://dblp.org/rec/conf/soda/JansenM15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/MarxW15,
author = {D{\'{a}}niel Marx and
Paul Wollan},
editor = {Piotr Indyk},
title = {An exact characterization of tractable demand patterns for maximum
disjoint path problems},
booktitle = {Proceedings of the Twenty-Sixth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2015, San Diego, CA, USA, January 4-6, 2015},
pages = {642--661},
publisher = {{SIAM}},
year = {2015},
url = {https://doi.org/10.1137/1.9781611973730.44},
doi = {10.1137/1.9781611973730.44},
timestamp = {Tue, 02 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/MarxW15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/MarxP15,
author = {D{\'{a}}niel Marx and
Michal Pilipczuk},
title = {Optimal parameterized algorithms for planar facility location problems
using Voronoi diagrams},
journal = {CoRR},
volume = {abs/1504.05476},
year = {2015},
url = {http://arxiv.org/abs/1504.05476},
eprinttype = {arXiv},
eprint = {1504.05476},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/MarxP15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/AboulkerBHMT15,
author = {Pierre Aboulker and
Nick Brettell and
Fr{\'{e}}d{\'{e}}ric Havet and
D{\'{a}}niel Marx and
Nicolas Trotignon},
title = {Colouring graphs with constraints on connectivity},
journal = {CoRR},
volume = {abs/1505.01616},
year = {2015},
url = {http://arxiv.org/abs/1505.01616},
eprinttype = {arXiv},
eprint = {1505.01616},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/AboulkerBHMT15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dagstuhl-reports/BulatovGKM15,
author = {Andrei A. Bulatov and
Venkatesan Guruswami and
Andrei A. Krokhin and
D{\'{a}}niel Marx},
title = {The Constraint Satisfaction Problem: Complexity and Approximability
(Dagstuhl Seminar 15301)},
journal = {Dagstuhl Reports},
volume = {5},
number = {7},
pages = {22--41},
year = {2015},
url = {https://doi.org/10.4230/DagRep.5.7.22},
doi = {10.4230/DAGREP.5.7.22},
timestamp = {Wed, 07 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dagstuhl-reports/BulatovGKM15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/CyganMPPS14,
author = {Marek Cygan and
D{\'{a}}niel Marx and
Marcin Pilipczuk and
Michal Pilipczuk and
Ildik{\'{o}} Schlotter},
title = {Parameterized Complexity of Eulerian Deletion Problems},
journal = {Algorithmica},
volume = {68},
number = {1},
pages = {41--61},
year = {2014},
url = {https://doi.org/10.1007/s00453-012-9667-x},
doi = {10.1007/S00453-012-9667-X},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/CyganMPPS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/MarxR14,
author = {D{\'{a}}niel Marx and
Igor Razgon},
title = {Fixed-Parameter Tractability of Multicut Parameterized by the Size
of the Cutset},
journal = {{SIAM} J. Comput.},
volume = {43},
number = {2},
pages = {355--388},
year = {2014},
url = {https://doi.org/10.1137/110855247},
doi = {10.1137/110855247},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/MarxR14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BulatovM14,
author = {Andrei A. Bulatov and
D{\'{a}}niel Marx},
title = {Constraint Satisfaction Parameterized by Solution Size},
journal = {{SIAM} J. Comput.},
volume = {43},
number = {2},
pages = {573--616},
year = {2014},
url = {https://doi.org/10.1137/120882160},
doi = {10.1137/120882160},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/BulatovM14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/MarxW14,
author = {D{\'{a}}niel Marx and
Paul Wollan},
title = {Immersions in Highly Edge Connected Graphs},
journal = {{SIAM} J. Discret. Math.},
volume = {28},
number = {1},
pages = {503--520},
year = {2014},
url = {https://doi.org/10.1137/130924056},
doi = {10.1137/130924056},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/MarxW14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/DellHMTW14,
author = {Holger Dell and
Thore Husfeldt and
D{\'{a}}niel Marx and
Nina Taslaman and
Martin Wahlen},
title = {Exponential Time Complexity of the Permanent and the Tutte Polynomial},
journal = {{ACM} Trans. Algorithms},
volume = {10},
number = {4},
pages = {21:1--21:32},
year = {2014},
url = {https://doi.org/10.1145/2635812},
doi = {10.1145/2635812},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/talg/DellHMTW14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/GroheM14,
author = {Martin Grohe and
D{\'{a}}niel Marx},
title = {Constraint Solving via Fractional Edge Covers},
journal = {{ACM} Trans. Algorithms},
volume = {11},
number = {1},
pages = {4:1--4:20},
year = {2014},
url = {https://doi.org/10.1145/2636918},
doi = {10.1145/2636918},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/talg/GroheM14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/DemaineHM14,
author = {Erik D. Demaine and
Mohammad Taghi Hajiaghayi and
D{\'{a}}niel Marx},
title = {Minimizing Movement: Fixed-Parameter Tractability},
journal = {{ACM} Trans. Algorithms},
volume = {11},
number = {2},
pages = {14:1--14:29},
year = {2014},
url = {https://doi.org/10.1145/2650247},
doi = {10.1145/2650247},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/talg/DemaineHM14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/MarxS14,
author = {D{\'{a}}niel Marx and
Anastasios Sidiropoulos},
editor = {Siu{-}Wing Cheng and
Olivier Devillers},
title = {The limited blessing of low dimensionality: when 1-1/d is the best
possible exponent for d-dimensional geometric problems},
booktitle = {30th Annual Symposium on Computational Geometry, SoCG'14, Kyoto, Japan,
June 08 - 11, 2014},
pages = {67},
publisher = {{ACM}},
year = {2014},
url = {https://doi.org/10.1145/2582112.2582124},
doi = {10.1145/2582112.2582124},
timestamp = {Mon, 14 Jun 2021 16:39:30 +0200},
biburl = {https://dblp.org/rec/conf/compgeom/MarxS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/CurticapeanM14,
author = {Radu Curticapean and
D{\'{a}}niel Marx},
title = {Complexity of Counting Subgraphs: Only the Boundedness of the Vertex-Cover
Number Counts},
booktitle = {55th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2014, Philadelphia, PA, USA, October 18-21, 2014},
pages = {130--139},
publisher = {{IEEE} Computer Society},
year = {2014},
url = {https://doi.org/10.1109/FOCS.2014.22},
doi = {10.1109/FOCS.2014.22},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/CurticapeanM14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/CyganMPP14,
author = {Marek Cygan and
D{\'{a}}niel Marx and
Marcin Pilipczuk and
Michal Pilipczuk},
editor = {Erzs{\'{e}}bet Csuhaj{-}Varj{\'{u}} and
Martin Dietzfelbinger and
Zolt{\'{a}}n {\'{E}}sik},
title = {Hitting Forbidden Subgraphs in Graphs of Bounded Treewidth},
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 = {189--200},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-662-44465-8\_17},
doi = {10.1007/978-3-662-44465-8\_17},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/CyganMPP14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/GuillemotM14,
author = {Sylvain Guillemot and
D{\'{a}}niel Marx},
editor = {Chandra Chekuri},
title = {Finding small patterns in permutations in linear time},
booktitle = {Proceedings of the Twenty-Fifth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2014, Portland, Oregon, USA, January 5-7, 2014},
pages = {82--101},
publisher = {{SIAM}},
year = {2014},
url = {https://doi.org/10.1137/1.9781611973402.7},
doi = {10.1137/1.9781611973402.7},
timestamp = {Tue, 02 Feb 2021 17:07:40 +0100},
biburl = {https://dblp.org/rec/conf/soda/GuillemotM14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/CaoM14,
author = {Yixin Cao and
D{\'{a}}niel Marx},
editor = {Chandra Chekuri},
title = {Interval Deletion is Fixed-Parameter Tractable},
booktitle = {Proceedings of the Twenty-Fifth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2014, Portland, Oregon, USA, January 5-7, 2014},
pages = {122--141},
publisher = {{SIAM}},
year = {2014},
url = {https://doi.org/10.1137/1.9781611973402.9},
doi = {10.1137/1.9781611973402.9},
timestamp = {Tue, 02 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/CaoM14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/ChitnisHM14,
author = {Rajesh Hemant Chitnis and
MohammadTaghi Hajiaghayi and
D{\'{a}}niel Marx},
editor = {Chandra Chekuri},
title = {Tight Bounds for Planar Strongly Connected Steiner Subgraph with Fixed
Number of Terminals (and Extensions)},
booktitle = {Proceedings of the Twenty-Fifth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2014, Portland, Oregon, USA, January 5-7, 2014},
pages = {1782--1801},
publisher = {{SIAM}},
year = {2014},
url = {https://doi.org/10.1137/1.9781611973402.129},
doi = {10.1137/1.9781611973402.129},
timestamp = {Tue, 02 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/ChitnisHM14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/KleinM14,
author = {Philip N. Klein and
D{\'{a}}niel Marx},
editor = {Chandra Chekuri},
title = {A subexponential parameterized algorithm for Subset {TSP} on planar
graphs},
booktitle = {Proceedings of the Twenty-Fifth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2014, Portland, Oregon, USA, January 5-7, 2014},
pages = {1812--1830},
publisher = {{SIAM}},
year = {2014},
url = {https://doi.org/10.1137/1.9781611973402.131},
doi = {10.1137/1.9781611973402.131},
timestamp = {Tue, 02 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/KleinM14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/CaoM14,
author = {Yixin Cao and
D{\'{a}}niel Marx},
editor = {Ernst W. Mayr and
Natacha Portier},
title = {Chordal Editing is Fixed-Parameter Tractable},
booktitle = {31st International Symposium on Theoretical Aspects of Computer Science
{(STACS} 2014), {STACS} 2014, March 5-8, 2014, Lyon, France},
series = {LIPIcs},
volume = {25},
pages = {214--225},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2014},
url = {https://doi.org/10.4230/LIPIcs.STACS.2014.214},
doi = {10.4230/LIPICS.STACS.2014.214},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/stacs/CaoM14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/MarxP14,
author = {D{\'{a}}niel Marx and
Michal Pilipczuk},
editor = {Ernst W. Mayr and
Natacha Portier},
title = {Everything you always wanted to know about the parameterized complexity
of Subgraph Isomorphism (but were afraid to ask)},
booktitle = {31st International Symposium on Theoretical Aspects of Computer Science
{(STACS} 2014), {STACS} 2014, March 5-8, 2014, Lyon, France},
series = {LIPIcs},
volume = {25},
pages = {542--553},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2014},
url = {https://doi.org/10.4230/LIPIcs.STACS.2014.542},
doi = {10.4230/LIPICS.STACS.2014.542},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/MarxP14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/HebrardMOR14,
author = {Emmanuel Hebrard and
D{\'{a}}niel Marx and
Barry O'Sullivan and
Igor Razgon},
title = {Soft Constraints of Difference and Equality},
journal = {CoRR},
volume = {abs/1401.3879},
year = {2014},
url = {http://arxiv.org/abs/1401.3879},
eprinttype = {arXiv},
eprint = {1401.3879},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/HebrardMOR14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/0001M14b,
author = {Yixin Cao and
D{\'{a}}niel Marx},
title = {Chordal Editing is Fixed-Parameter Tractable},
journal = {CoRR},
volume = {abs/1405.7859},
year = {2014},
url = {http://arxiv.org/abs/1405.7859},
eprinttype = {arXiv},
eprint = {1405.7859},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/0001M14b.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/CurticapeanM14,
author = {Radu Curticapean and
D{\'{a}}niel Marx},
title = {Complexity of counting subgraphs: only the boundedness of the vertex-cover
number counts},
journal = {CoRR},
volume = {abs/1407.2929},
year = {2014},
url = {http://arxiv.org/abs/1407.2929},
eprinttype = {arXiv},
eprint = {1407.2929},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/CurticapeanM14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/JansenM14,
author = {Bart M. P. Jansen and
D{\'{a}}niel Marx},
title = {Characterizing the easy-to-find subgraphs from the viewpoint of polynomial-time
algorithms, kernels, and Turing kernels},
journal = {CoRR},
volume = {abs/1410.0855},
year = {2014},
url = {http://arxiv.org/abs/1410.0855},
eprinttype = {arXiv},
eprint = {1410.0855},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/JansenM14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/MarxW14,
author = {D{\'{a}}niel Marx and
Paul Wollan},
title = {An exact characterization of tractable demand patterns for maximum
disjoint path problems},
journal = {CoRR},
volume = {abs/1411.0871},
year = {2014},
url = {http://arxiv.org/abs/1411.0871},
eprinttype = {arXiv},
eprint = {1411.0871},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/MarxW14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/CyganMPP14,
author = {Marek Cygan and
D{\'{a}}niel Marx and
Marcin Pilipczuk and
Michal Pilipczuk},
title = {Hitting forbidden subgraphs in graphs of bounded treewidth},
journal = {CoRR},
volume = {abs/1411.4184},
year = {2014},
url = {http://arxiv.org/abs/1411.4184},
eprinttype = {arXiv},
eprint = {1411.4184},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/CyganMPP14.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/MarxS13,
author = {D{\'{a}}niel Marx and
Ildik{\'{o}} Schlotter},
title = {Cleaning Interval Graphs},
journal = {Algorithmica},
volume = {65},
number = {2},
pages = {275--316},
year = {2013},
url = {https://doi.org/10.1007/s00453-011-9588-0},
doi = {10.1007/S00453-011-9588-0},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/MarxS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/LokshtanovM13,
author = {Daniel Lokshtanov and
D{\'{a}}niel Marx},
title = {Clustering with local restrictions},
journal = {Inf. Comput.},
volume = {222},
pages = {278--292},
year = {2013},
url = {https://doi.org/10.1016/j.ic.2012.10.016},
doi = {10.1016/J.IC.2012.10.016},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iandc/LokshtanovM13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/GuillemotM13,
author = {Sylvain Guillemot and
D{\'{a}}niel Marx},
title = {A faster {FPT} algorithm for Bipartite Contraction},
journal = {Inf. Process. Lett.},
volume = {113},
number = {22-24},
pages = {906--912},
year = {2013},
url = {https://doi.org/10.1016/j.ipl.2013.09.004},
doi = {10.1016/J.IPL.2013.09.004},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/GuillemotM13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Marx13,
author = {D{\'{a}}niel Marx},
title = {Tractable Hypergraph Properties for Constraint Satisfaction and Conjunctive
Queries},
journal = {J. {ACM}},
volume = {60},
number = {6},
pages = {42:1--42:51},
year = {2013},
url = {https://doi.org/10.1145/2535926},
doi = {10.1145/2535926},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Marx13.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/jcss/Marx13,
author = {D{\'{a}}niel Marx},
title = {Completely inapproximable monotone and antimonotone parameterized
problems},
journal = {J. Comput. Syst. Sci.},
volume = {79},
number = {1},
pages = {144--151},
year = {2013},
url = {https://doi.org/10.1016/j.jcss.2012.09.001},
doi = {10.1016/J.JCSS.2012.09.001},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/Marx13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ChitnisHM13,
author = {Rajesh Hemant Chitnis and
MohammadTaghi Hajiaghayi and
D{\'{a}}niel Marx},
title = {Fixed-Parameter Tractability of Directed Multiway Cut Parameterized
by the Size of the Cutset},
journal = {{SIAM} J. Comput.},
volume = {42},
number = {4},
pages = {1674--1696},
year = {2013},
url = {https://doi.org/10.1137/12086217X},
doi = {10.1137/12086217X},
timestamp = {Fri, 02 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/ChitnisHM13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/AtseriasGM13,
author = {Albert Atserias and
Martin Grohe and
D{\'{a}}niel Marx},
title = {Size Bounds and Query Plans for Relational Joins},
journal = {{SIAM} J. Comput.},
volume = {42},
number = {4},
pages = {1737--1767},
year = {2013},
url = {https://doi.org/10.1137/110859440},
doi = {10.1137/110859440},
timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/AtseriasGM13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/MarxOR13,
author = {D{\'{a}}niel Marx and
Barry O'Sullivan and
Igor Razgon},
title = {Finding small separators in linear time via treewidth reduction},
journal = {{ACM} Trans. Algorithms},
volume = {9},
number = {4},
pages = {30:1--30:35},
year = {2013},
url = {https://doi.org/10.1145/2500119},
doi = {10.1145/2500119},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/talg/MarxOR13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aaim/Marx13,
author = {D{\'{a}}niel Marx},
editor = {Michael R. Fellows and
Xuehou Tan and
Binhai Zhu},
title = {The Square Root Phenomenon in Planar Graphs},
booktitle = {Frontiers in Algorithmics \emph{and} Algorithmic Aspects in Information
and Management, Third Joint International Conference, {FAW-AAIM} 2013,
Dalian, China, June 26-28, 2013. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7924},
pages = {1},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-38756-2\_1},
doi = {10.1007/978-3-642-38756-2\_1},
timestamp = {Tue, 14 May 2019 10:00:41 +0200},
biburl = {https://dblp.org/rec/conf/aaim/Marx13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/ChitnisEM13,
author = {Rajesh Hemant Chitnis and
L{\'{a}}szl{\'{o}} Egri and
D{\'{a}}niel Marx},
editor = {Hans L. Bodlaender and
Giuseppe F. Italiano},
title = {List H-Coloring a Graph by Removing Few Vertices},
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 = {313--324},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-40450-4\_27},
doi = {10.1007/978-3-642-40450-4\_27},
timestamp = {Mon, 03 Jan 2022 22:19:39 +0100},
biburl = {https://dblp.org/rec/conf/esa/ChitnisEM13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/CyganMPP13,
author = {Marek Cygan and
D{\'{a}}niel Marx and
Marcin Pilipczuk and
Michal Pilipczuk},
title = {The Planar Directed K-Vertex-Disjoint Paths Problem Is Fixed-Parameter
Tractable},
booktitle = {54th Annual {IEEE} Symposium on Foundations of Computer Science, {FOCS}
2013, 26-29 October, 2013, Berkeley, CA, {USA}},
pages = {197--206},
publisher = {{IEEE} Computer Society},
year = {2013},
url = {https://doi.org/10.1109/FOCS.2013.29},
doi = {10.1109/FOCS.2013.29},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/CyganMPP13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/Marx13,
author = {D{\'{a}}niel Marx},
editor = {Fedor V. Fomin and
Rusins Freivalds and
Marta Z. Kwiatkowska and
David Peleg},
title = {The Square Root Phenomenon in Planar Graphs},
booktitle = {Automata, Languages, and Programming - 40th International Colloquium,
{ICALP} 2013, Riga, Latvia, July 8-12, 2013, Proceedings, Part {II}},
series = {Lecture Notes in Computer Science},
volume = {7966},
pages = {28},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-39212-2\_4},
doi = {10.1007/978-3-642-39212-2\_4},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/Marx13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/ChenM13,
author = {Hubie Chen and
D{\'{a}}niel Marx},
editor = {Fedor V. Fomin and
Rusins Freivalds and
Marta Z. Kwiatkowska and
David Peleg},
title = {Block-Sorted Quantified Conjunctive Queries},
booktitle = {Automata, Languages, and Programming - 40th International Colloquium,
{ICALP} 2013, Riga, Latvia, July 8-12, 2013, Proceedings, Part {II}},
series = {Lecture Notes in Computer Science},
volume = {7966},
pages = {125--136},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-39212-2\_14},
doi = {10.1007/978-3-642-39212-2\_14},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/ChenM13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/MarxV13,
author = {D{\'{a}}niel Marx and
L{\'{a}}szl{\'{o}} A. V{\'{e}}gh},
editor = {Fedor V. Fomin and
Rusins Freivalds and
Marta Z. Kwiatkowska and
David Peleg},
title = {Fixed-Parameter Algorithms for Minimum Cost Edge-Connectivity Augmentation},
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 = {721--732},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-39206-1\_61},
doi = {10.1007/978-3-642-39206-1\_61},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/MarxV13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/GuillemotM13,
author = {Sylvain Guillemot and
D{\'{a}}niel Marx},
editor = {Gregory Z. Gutin and
Stefan Szeider},
title = {A Faster {FPT} Algorithm for Bipartite Contraction},
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 = {177--188},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-319-03898-8\_16},
doi = {10.1007/978-3-319-03898-8\_16},
timestamp = {Tue, 14 May 2019 10:00:45 +0200},
biburl = {https://dblp.org/rec/conf/iwpec/GuillemotM13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/Marx13,
author = {D{\'{a}}niel Marx},
editor = {Natacha Portier and
Thomas Wilke},
title = {Algorithmic Graph Structure Theory (Tutorial)},
booktitle = {30th International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2013, February 27 - March 2, 2013, Kiel, Germany},
series = {LIPIcs},
volume = {20},
pages = {7--7},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2013},
url = {https://doi.org/10.4230/LIPIcs.STACS.2013.7},
doi = {10.4230/LIPICS.STACS.2013.7},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/stacs/Marx13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1304-4207,
author = {Marek Cygan and
D{\'{a}}niel Marx and
Marcin Pilipczuk and
Michal Pilipczuk},
title = {The planar directed k-Vertex-Disjoint Paths problem is fixed-parameter
tractable},
journal = {CoRR},
volume = {abs/1304.4207},
year = {2013},
url = {http://arxiv.org/abs/1304.4207},
eprinttype = {arXiv},
eprint = {1304.4207},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1304-4207.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1304-6593,
author = {D{\'{a}}niel Marx and
L{\'{a}}szl{\'{o}} A. V{\'{e}}gh},
title = {Fixed-parameter algorithms for minimum cost edge-connectivity augmentation},
journal = {CoRR},
volume = {abs/1304.6593},
year = {2013},
url = {http://arxiv.org/abs/1304.6593},
eprinttype = {arXiv},
eprint = {1304.6593},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1304-6593.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1305-2743,
author = {Sylvain Guillemot and
D{\'{a}}niel Marx},
title = {A faster {FPT} algorithm for Bipartite Contraction},
journal = {CoRR},
volume = {abs/1305.2743},
year = {2013},
url = {http://arxiv.org/abs/1305.2743},
eprinttype = {arXiv},
eprint = {1305.2743},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1305-2743.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/MarxP13,
author = {D{\'{a}}niel Marx and
Michal Pilipczuk},
title = {Everything you always wanted to know about the parameterized complexity
of Subgraph Isomorphism (but were afraid to ask)},
journal = {CoRR},
volume = {abs/1307.2187},
year = {2013},
url = {http://arxiv.org/abs/1307.2187},
eprinttype = {arXiv},
eprint = {1307.2187},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/MarxP13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/GuillemotM13,
author = {Sylvain Guillemot and
D{\'{a}}niel Marx},
title = {Finding small patterns in permutations in linear time},
journal = {CoRR},
volume = {abs/1307.3073},
year = {2013},
url = {http://arxiv.org/abs/1307.3073},
eprinttype = {arXiv},
eprint = {1307.3073},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/GuillemotM13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/ChitnisEM13,
author = {Rajesh Hemant Chitnis and
L{\'{a}}szl{\'{o}} Egri and
D{\'{a}}niel Marx},
title = {List H-Coloring a Graph by Removing Few Vertices},
journal = {CoRR},
volume = {abs/1308.1068},
year = {2013},
url = {http://arxiv.org/abs/1308.1068},
eprinttype = {arXiv},
eprint = {1308.1068},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/ChitnisEM13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dagstuhl-reports/BorradaileKMM13,
author = {Glencora Borradaile and
Philip N. Klein and
D{\'{a}}niel Marx and
Claire Mathieu},
title = {Algorithms for Optimization Problems in Planar Graphs (Dagstuhl Seminar
13421)},
journal = {Dagstuhl Reports},
volume = {3},
number = {10},
pages = {36--57},
year = {2013},
url = {https://doi.org/10.4230/DagRep.3.10.36},
doi = {10.4230/DAGREP.3.10.36},
timestamp = {Wed, 07 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dagstuhl-reports/BorradaileKMM13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/MarxS12,
author = {D{\'{a}}niel Marx and
Ildik{\'{o}} Schlotter},
title = {Obtaining a Planar Graph by Vertex Deletion},
journal = {Algorithmica},
volume = {62},
number = {3-4},
pages = {807--822},
year = {2012},
url = {https://doi.org/10.1007/s00453-010-9484-z},
doi = {10.1007/S00453-010-9484-Z},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/MarxS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jair/CohenCCMS12,
author = {David A. Cohen and
Martin C. Cooper and
P{\'{a}}id{\'{\i}} Creed and
D{\'{a}}niel Marx and
Andr{\'{a}}s Z. Salamon},
title = {The Tractability of {CSP} Classes Defined by Forbidden Patterns},
journal = {J. Artif. Intell. Res.},
volume = {45},
pages = {47--78},
year = {2012},
url = {https://doi.org/10.1613/jair.3651},
doi = {10.1613/JAIR.3651},
timestamp = {Mon, 21 Jan 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jair/CohenCCMS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/BulatovDGM12,
author = {Andrei A. Bulatov and
V{\'{\i}}ctor Dalmau and
Martin Grohe and
D{\'{a}}niel Marx},
title = {Enumerating homomorphisms},
journal = {J. Comput. Syst. Sci.},
volume = {78},
number = {2},
pages = {638--650},
year = {2012},
url = {https://doi.org/10.1016/j.jcss.2011.09.006},
doi = {10.1016/J.JCSS.2011.09.006},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/BulatovDGM12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/KrokhinM12,
author = {Andrei A. Krokhin and
D{\'{a}}niel Marx},
title = {On the hardness of losing weight},
journal = {{ACM} Trans. Algorithms},
volume = {8},
number = {2},
pages = {19:1--19:18},
year = {2012},
url = {https://doi.org/10.1145/2151171.2151182},
doi = {10.1145/2151171.2151182},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/talg/KrokhinM12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/birthday/FominM12,
author = {Fedor V. Fomin and
D{\'{a}}niel Marx},
editor = {Hans L. Bodlaender and
Rod Downey and
Fedor V. Fomin and
D{\'{a}}niel Marx},
title = {{FPT} Suspects and Tough Customers: Open Problems of Downey and Fellows},
booktitle = {The Multivariate Algorithmic Revolution and Beyond - Essays Dedicated
to Michael R. Fellows on the Occasion of His 60th Birthday},
series = {Lecture Notes in Computer Science},
volume = {7370},
pages = {457--468},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-30891-8\_19},
doi = {10.1007/978-3-642-30891-8\_19},
timestamp = {Mon, 03 Jan 2022 22:35:50 +0100},
biburl = {https://dblp.org/rec/conf/birthday/FominM12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/birthday/Marx12,
author = {D{\'{a}}niel Marx},
editor = {Hans L. Bodlaender and
Rod Downey and
Fedor V. Fomin and
D{\'{a}}niel Marx},
title = {What's Next? Future Directions in Parameterized Complexity},
booktitle = {The Multivariate Algorithmic Revolution and Beyond - Essays Dedicated
to Michael R. Fellows on the Occasion of His 60th Birthday},
series = {Lecture Notes in Computer Science},
volume = {7370},
pages = {469--496},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-30891-8\_20},
doi = {10.1007/978-3-642-30891-8\_20},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/birthday/Marx12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/CyganDLMNOPSW12,
author = {Marek Cygan and
Holger Dell and
Daniel Lokshtanov and
D{\'{a}}niel Marx and
Jesper Nederlof and
Yoshio Okamoto and
Ramamohan Paturi and
Saket Saurabh and
Magnus Wahlstr{\"{o}}m},
title = {On Problems as Hard as {CNF-SAT}},
booktitle = {Proceedings of the 27th Conference on Computational Complexity, {CCC}
2012, Porto, Portugal, June 26-29, 2012},
pages = {74--84},
publisher = {{IEEE} Computer Society},
year = {2012},
url = {https://doi.org/10.1109/CCC.2012.36},
doi = {10.1109/CCC.2012.36},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/CyganDLMNOPSW12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/ChitnisCHM12,
author = {Rajesh Hemant Chitnis and
Marek Cygan and
Mohammad Taghi Hajiaghayi and
D{\'{a}}niel Marx},
editor = {Artur Czumaj and
Kurt Mehlhorn and
Andrew M. Pitts and
Roger Wattenhofer},
title = {Directed Subset Feedback Vertex Set Is Fixed-Parameter Tractable},
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 = {230--241},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-31594-7\_20},
doi = {10.1007/978-3-642-31594-7\_20},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/ChitnisCHM12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/KleinM12,
author = {Philip N. Klein and
D{\'{a}}niel Marx},
editor = {Artur Czumaj and
Kurt Mehlhorn and
Andrew M. Pitts and
Roger Wattenhofer},
title = {Solving Planar k -Terminal Cut in {\textdollar}O(n{\^{}}\{c {\textbackslash}sqrt\{k\}\}){\textdollar}
Time},
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 = {569--580},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-31594-7\_48},
doi = {10.1007/978-3-642-31594-7\_48},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/KleinM12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/Marx12,
author = {D{\'{a}}niel Marx},
editor = {Artur Czumaj and
Kurt Mehlhorn and
Andrew M. Pitts and
Roger Wattenhofer},
title = {A Tight Lower Bound for Planar Multiway Cut with Fixed Number of Terminals},
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 = {677--688},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-31594-7\_57},
doi = {10.1007/978-3-642-31594-7\_57},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/Marx12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/Marx12,
author = {D{\'{a}}niel Marx},
editor = {Dimitrios M. Thilikos and
Gerhard J. Woeginger},
title = {Randomized Techniques for Parameterized Algorithms},
booktitle = {Parameterized and Exact Computation - 7th International Symposium,
{IPEC} 2012, Ljubljana, Slovenia, September 12-14, 2012. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7535},
pages = {2},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-33293-7\_2},
doi = {10.1007/978-3-642-33293-7\_2},
timestamp = {Tue, 14 May 2019 10:00:45 +0200},
biburl = {https://dblp.org/rec/conf/iwpec/Marx12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/DellM12,
author = {Holger Dell and
D{\'{a}}niel Marx},
editor = {Yuval Rabani},
title = {Kernelization of packing problems},
booktitle = {Proceedings of the Twenty-Third Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2012, Kyoto, Japan, January 17-19, 2012},
pages = {68--81},
publisher = {{SIAM}},
year = {2012},
url = {https://doi.org/10.1137/1.9781611973099.6},
doi = {10.1137/1.9781611973099.6},
timestamp = {Tue, 02 Feb 2021 17:07:31 +0100},
biburl = {https://dblp.org/rec/conf/soda/DellM12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/ChitnisHM12,
author = {Rajesh Hemant Chitnis and
MohammadTaghi Hajiaghayi and
D{\'{a}}niel Marx},
editor = {Yuval Rabani},
title = {Fixed-parameter tractability of directed multiway cut parameterized
by the size of the cutset},
booktitle = {Proceedings of the Twenty-Third Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2012, Kyoto, Japan, January 17-19, 2012},
pages = {1713--1725},
publisher = {{SIAM}},
year = {2012},
url = {https://doi.org/10.1137/1.9781611973099.136},
doi = {10.1137/1.9781611973099.136},
timestamp = {Tue, 02 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/ChitnisHM12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/GroheM12,
author = {Martin Grohe and
D{\'{a}}niel Marx},
editor = {Howard J. Karloff and
Toniann Pitassi},
title = {Structure theorem and isomorphism test for graphs with excluded topological
subgraphs},
booktitle = {Proceedings of the 44th Symposium on Theory of Computing Conference,
{STOC} 2012, New York, NY, USA, May 19 - 22, 2012},
pages = {173--192},
publisher = {{ACM}},
year = {2012},
url = {https://doi.org/10.1145/2213977.2213996},
doi = {10.1145/2213977.2213996},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/GroheM12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/HeggernesHMMV12,
author = {Pinar Heggernes and
Pim van 't Hof and
D{\'{a}}niel Marx and
Neeldhara Misra and
Yngve Villanger},
editor = {Martin Charles Golumbic and
Michal Stern and
Avivit Levy and
Gila Morgenstern},
title = {On the Parameterized Complexity of Finding Separators with Non-Hereditary
Properties},
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 = {332--343},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-34611-8\_33},
doi = {10.1007/978-3-642-34611-8\_33},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wg/HeggernesHMMV12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/birthday/2012fellows,
editor = {Hans L. Bodlaender and
Rod Downey and
Fedor V. Fomin and
D{\'{a}}niel Marx},
title = {The Multivariate Algorithmic Revolution and Beyond - Essays Dedicated
to Michael R. Fellows on the Occasion of His 60th Birthday},
series = {Lecture Notes in Computer Science},
volume = {7370},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-30891-8},
doi = {10.1007/978-3-642-30891-8},
isbn = {978-3-642-30890-1},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/birthday/2012fellows.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/iwpec/2011,
editor = {D{\'{a}}niel Marx and
Peter Rossmanith},
title = {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},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-28050-4},
doi = {10.1007/978-3-642-28050-4},
isbn = {978-3-642-28049-8},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/iwpec/2011.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1205-1271,
author = {Rajesh Hemant Chitnis and
Marek Cygan and
MohammadTaghi Hajiaghayi and
D{\'{a}}niel Marx},
title = {Directed Subset Feedback Vertex Set is Fixed-Parameter Tractable},
journal = {CoRR},
volume = {abs/1205.1271},
year = {2012},
url = {http://arxiv.org/abs/1205.1271},
eprinttype = {arXiv},
eprint = {1205.1271},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1205-1271.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1205-6960,
author = {Erik D. Demaine and
MohammadTaghi Hajiaghayi and
D{\'{a}}niel Marx},
title = {Minimizing Movement: Fixed-Parameter Tractability},
journal = {CoRR},
volume = {abs/1205.6960},
year = {2012},
url = {http://arxiv.org/abs/1205.6960},
eprinttype = {arXiv},
eprint = {1205.6960},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1205-6960.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1206-1775,
author = {Holger Dell and
Thore Husfeldt and
D{\'{a}}niel Marx and
Nina Taslaman and
Martin Wahlen},
title = {Exponential Time Complexity of the Permanent and the Tutte Polynomial},
journal = {CoRR},
volume = {abs/1206.1775},
year = {2012},
url = {http://arxiv.org/abs/1206.1775},
eprinttype = {arXiv},
eprint = {1206.1775},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1206-1775.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1206-4854,
author = {Andrei A. Bulatov and
D{\'{a}}niel Marx},
title = {Constraint satisfaction parameterized by solution size},
journal = {CoRR},
volume = {abs/1206.4854},
year = {2012},
url = {http://arxiv.org/abs/1206.4854},
eprinttype = {arXiv},
eprint = {1206.4854},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1206-4854.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1211-5933,
author = {Yixin Cao and
D{\'{a}}niel Marx},
title = {Interval Deletion is Fixed-Parameter Tractable},
journal = {CoRR},
volume = {abs/1211.5933},
year = {2012},
url = {http://arxiv.org/abs/1211.5933},
eprinttype = {arXiv},
eprint = {1211.5933},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1211-5933.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dagstuhl-reports/FellowsGMS12,
author = {Michael R. Fellows and
Jiong Guo and
D{\'{a}}niel Marx and
Saket Saurabh},
title = {Data Reduction and Problem Kernels (Dagstuhl Seminar 12241)},
journal = {Dagstuhl Reports},
volume = {2},
number = {6},
pages = {26--50},
year = {2012},
url = {https://doi.org/10.4230/DagRep.2.6.26},
doi = {10.4230/DAGREP.2.6.26},
timestamp = {Mon, 30 Oct 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dagstuhl-reports/FellowsGMS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dagstuhl-reports/HastadKM12,
author = {Johan H{\aa}stad and
Andrei A. Krokhin and
D{\'{a}}niel Marx},
title = {The Constraint Satisfaction Problem: Complexity and Approximability
(Dagstuhl Seminar 12451)},
journal = {Dagstuhl Reports},
volume = {2},
number = {11},
pages = {1--19},
year = {2012},
url = {https://doi.org/10.4230/DagRep.2.11.1},
doi = {10.4230/DAGREP.2.11.1},
timestamp = {Wed, 07 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dagstuhl-reports/HastadKM12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/disopt/MarxS11,
author = {D{\'{a}}niel Marx and
Ildik{\'{o}} Schlotter},
title = {Stable assignment with couples: Parameterized complexity and local
search},
journal = {Discret. Optim.},
volume = {8},
number = {1},
pages = {25--40},
year = {2011},
url = {https://doi.org/10.1016/j.disopt.2010.07.004},
doi = {10.1016/J.DISOPT.2010.07.004},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/disopt/MarxS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eatcs/LokshtanovMS11,
author = {Daniel Lokshtanov and
D{\'{a}}niel Marx and
Saket Saurabh},
title = {Lower bounds based on the Exponential Time Hypothesis},
journal = {Bull. {EATCS}},
volume = {105},
pages = {41--72},
year = {2011},
url = {http://eatcs.org/beatcs/index.php/beatcs/article/view/92},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eatcs/LokshtanovMS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/BateniHM11,
author = {MohammadHossein Bateni and
Mohammad Taghi Hajiaghayi and
D{\'{a}}niel Marx},
title = {Approximation Schemes for Steiner Forest on Planar Graphs and Graphs
of Bounded Treewidth},
journal = {J. {ACM}},
volume = {58},
number = {5},
pages = {21:1--21:37},
year = {2011},
url = {https://doi.org/10.1145/2027216.2027219},
doi = {10.1145/2027216.2027219},
timestamp = {Mon, 12 Aug 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/BateniHM11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jair/HebrardMOR11,
author = {Emmanuel Hebrard and
D{\'{a}}niel Marx and
Barry O'Sullivan and
Igor Razgon},
title = {Soft Constraints of Difference and Equality},
journal = {J. Artif. Intell. Res.},
volume = {41},
pages = {97--130},
year = {2011},
url = {https://doi.org/10.1613/jair.3197},
doi = {10.1613/JAIR.3197},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jair/HebrardMOR11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/KakimuraKM11,
author = {Naonori Kakimura and
Ken{-}ichi Kawarabayashi and
D{\'{a}}niel Marx},
title = {Packing cycles through prescribed vertices},
journal = {J. Comb. Theory, Ser. {B}},
volume = {101},
number = {5},
pages = {378--381},
year = {2011},
url = {https://doi.org/10.1016/j.jctb.2011.03.004},
doi = {10.1016/J.JCTB.2011.03.004},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/KakimuraKM11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/Marx11,
author = {D{\'{a}}niel Marx},
title = {Tractable Structures for Constraint Satisfaction with Truth Tables},
journal = {Theory Comput. Syst.},
volume = {48},
number = {3},
pages = {444--464},
year = {2011},
url = {https://doi.org/10.1007/s00224-009-9248-9},
doi = {10.1007/S00224-009-9248-9},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/Marx11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/AlonM11,
author = {Noga Alon and
D{\'{a}}niel Marx},
title = {Sparse Balanced Partitions and the Complexity of Subgraph Problems},
journal = {{SIAM} J. Discret. Math.},
volume = {25},
number = {2},
pages = {631--644},
year = {2011},
url = {https://doi.org/10.1137/100812653},
doi = {10.1137/100812653},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/AlonM11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/CabelloGKMR11,
author = {Sergio Cabello and
Panos Giannopoulos and
Christian Knauer and
D{\'{a}}niel Marx and
G{\"{u}}nter Rote},
title = {Geometric clustering: Fixed-parameter tractability and lower bounds
with respect to the dimension},
journal = {{ACM} Trans. Algorithms},
volume = {7},
number = {4},
pages = {43:1--43:27},
year = {2011},
url = {https://doi.org/10.1145/2000807.2000811},
doi = {10.1145/2000807.2000811},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/talg/CabelloGKMR11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Marx11,
author = {D{\'{a}}niel Marx},
title = {Complexity of clique coloring and related problems},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {29},
pages = {3487--3500},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.02.038},
doi = {10.1016/J.TCS.2011.02.038},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Marx11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cp/CohenCGM11,
author = {David A. Cohen and
Martin C. Cooper and
Martin James Green and
D{\'{a}}niel Marx},
editor = {Jimmy Ho{-}Man Lee},
title = {On Guaranteeing Polynomially Bounded Search Tree Size},
booktitle = {Principles and Practice of Constraint Programming - {CP} 2011 - 17th
International Conference, {CP} 2011, Perugia, Italy, September 12-16,
2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6876},
pages = {160--171},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-23786-7\_14},
doi = {10.1007/978-3-642-23786-7\_14},
timestamp = {Tue, 14 May 2019 10:00:45 +0200},
biburl = {https://dblp.org/rec/conf/cp/CohenCGM11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/BulatovM11,
author = {Andrei A. Bulatov and
D{\'{a}}niel Marx},
editor = {Luca Aceto and
Monika Henzinger and
Jir{\'{\i}} Sgall},
title = {Constraint Satisfaction Parameterized by Solution Size},
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 = {424--436},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-22006-7\_36},
doi = {10.1007/978-3-642-22006-7\_36},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/BulatovM11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/LokshtanovM11,
author = {Daniel Lokshtanov and
D{\'{a}}niel Marx},
editor = {Luca Aceto and
Monika Henzinger and
Jir{\'{\i}} Sgall},
title = {Clustering with Local Restrictions},
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 = {785--797},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-22006-7\_66},
doi = {10.1007/978-3-642-22006-7\_66},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/LokshtanovM11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/LokshtanovMS11,
author = {Daniel Lokshtanov and
D{\'{a}}niel Marx and
Saket Saurabh},
editor = {Dana Randall},
title = {Slightly Superexponential Parameterized Problems},
booktitle = {Proceedings of the Twenty-Second Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2011, San Francisco, California, USA, January 23-25,
2011},
pages = {760--776},
publisher = {{SIAM}},
year = {2011},
url = {https://doi.org/10.1137/1.9781611973082.60},
doi = {10.1137/1.9781611973082.60},
timestamp = {Tue, 02 Feb 2021 17:07:23 +0100},
biburl = {https://dblp.org/rec/conf/soda/LokshtanovMS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/LokshtanovMS11a,
author = {Daniel Lokshtanov and
D{\'{a}}niel Marx and
Saket Saurabh},
editor = {Dana Randall},
title = {Known Algorithms on Graphs on Bounded Treewidth are Probably Optimal},
booktitle = {Proceedings of the Twenty-Second Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2011, San Francisco, California, USA, January 23-25,
2011},
pages = {777--789},
publisher = {{SIAM}},
year = {2011},
url = {https://doi.org/10.1137/1.9781611973082.61},
doi = {10.1137/1.9781611973082.61},
timestamp = {Tue, 02 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/LokshtanovMS11a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BateniCEHKM11,
author = {MohammadHossein Bateni and
Chandra Chekuri and
Alina Ene and
Mohammad Taghi Hajiaghayi and
Nitish Korula and
D{\'{a}}niel Marx},
editor = {Dana Randall},
title = {Prize-collecting Steiner Problems on Planar Graphs},
booktitle = {Proceedings of the Twenty-Second Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2011, San Francisco, California, USA, January 23-25,
2011},
pages = {1028--1049},
publisher = {{SIAM}},
year = {2011},
url = {https://doi.org/10.1137/1.9781611973082.79},
doi = {10.1137/1.9781611973082.79},
timestamp = {Tue, 02 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/BateniCEHKM11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/MarxR11,
author = {D{\'{a}}niel Marx and
Igor Razgon},
editor = {Lance Fortnow and
Salil P. Vadhan},
title = {Fixed-parameter tractability of multicut parameterized by the size
of the cutset},
booktitle = {Proceedings of the 43rd {ACM} Symposium on Theory of Computing, {STOC}
2011, San Jose, CA, USA, 6-8 June 2011},
pages = {469--478},
publisher = {{ACM}},
year = {2011},
url = {https://doi.org/10.1145/1993636.1993699},
doi = {10.1145/1993636.1993699},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/MarxR11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/GroheKMW11,
author = {Martin Grohe and
Ken{-}ichi Kawarabayashi and
D{\'{a}}niel Marx and
Paul Wollan},
editor = {Lance Fortnow and
Salil P. Vadhan},
title = {Finding topological subgraphs is fixed-parameter tractable},
booktitle = {Proceedings of the 43rd {ACM} Symposium on Theory of Computing, {STOC}
2011, San Jose, CA, USA, 6-8 June 2011},
pages = {479--488},
publisher = {{ACM}},
year = {2011},
url = {https://doi.org/10.1145/1993636.1993700},
doi = {10.1145/1993636.1993700},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/GroheKMW11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/Marx11,
author = {D{\'{a}}niel Marx},
editor = {Petr Kolman and
Jan Kratochv{\'{\i}}l},
title = {Important Separators and Parameterized Algorithms},
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 = {5--10},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-25870-1\_2},
doi = {10.1007/978-3-642-25870-1\_2},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/wg/Marx11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/CyganMPPS11,
author = {Marek Cygan and
D{\'{a}}niel Marx and
Marcin Pilipczuk and
Michal Pilipczuk and
Ildik{\'{o}} Schlotter},
editor = {Petr Kolman and
Jan Kratochv{\'{\i}}l},
title = {Parameterized Complexity of Eulerian Deletion Problems},
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 = {131--142},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-25870-1\_13},
doi = {10.1007/978-3-642-25870-1\_13},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wg/CyganMPPS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1110-0259,
author = {Rajesh Hemant Chitnis and
MohammadTaghi Hajiaghayi and
D{\'{a}}niel Marx},
title = {Fixed-Parameter Tractability of Directed Multiway Cut Parameterized
by the Size of the Cutset},
journal = {CoRR},
volume = {abs/1110.0259},
year = {2011},
url = {http://arxiv.org/abs/1110.0259},
eprinttype = {arXiv},
eprint = {1110.0259},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1110-0259.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1110-4765,
author = {D{\'{a}}niel Marx and
Barry O'Sullivan and
Igor Razgon},
title = {Finding small separators in linear time via treewidth reduction},
journal = {CoRR},
volume = {abs/1110.4765},
year = {2011},
url = {http://arxiv.org/abs/1110.4765},
eprinttype = {arXiv},
eprint = {1110.4765},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1110-4765.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1111-1109,
author = {Martin Grohe and
D{\'{a}}niel Marx},
title = {Structure Theorem and Isomorphism Test for Graphs with Excluded Topological
Subgraphs},
journal = {CoRR},
volume = {abs/1111.1109},
year = {2011},
url = {http://arxiv.org/abs/1111.1109},
eprinttype = {arXiv},
eprint = {1111.1109},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1111-1109.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1112-2275,
author = {Marek Cygan and
Holger Dell and
Daniel Lokshtanov and
D{\'{a}}niel Marx and
Jesper Nederlof and
Yoshio Okamoto and
Ramamohan Paturi and
Saket Saurabh and
Magnus Wahlstr{\"{o}}m},
title = {On Problems as Hard as {CNFSAT}},
journal = {CoRR},
volume = {abs/1112.2275},
year = {2011},
url = {http://arxiv.org/abs/1112.2275},
eprinttype = {arXiv},
eprint = {1112.2275},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1112-2275.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Marx10,
author = {D{\'{a}}niel Marx},
title = {Chordal Deletion is Fixed-Parameter Tractable},
journal = {Algorithmica},
volume = {57},
number = {4},
pages = {747--768},
year = {2010},
url = {https://doi.org/10.1007/s00453-008-9233-8},
doi = {10.1007/S00453-008-9233-8},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/Marx10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/MarxS10,
author = {D{\'{a}}niel Marx and
Ildik{\'{o}} Schlotter},
title = {Parameterized Complexity and Local Search Approaches for the Stable
Marriage Problem with Ties},
journal = {Algorithmica},
volume = {58},
number = {1},
pages = {170--187},
year = {2010},
url = {https://doi.org/10.1007/s00453-009-9326-z},
doi = {10.1007/S00453-009-9326-Z},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/MarxS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cacm/BulatovM10,
author = {Andrei A. Bulatov and
D{\'{a}}niel Marx},
title = {Constraint satisfaction problems and global cardinality constraints},
journal = {Commun. {ACM}},
volume = {53},
number = {9},
pages = {99--106},
year = {2010},
url = {https://doi.org/10.1145/1810891.1810914},
doi = {10.1145/1810891.1810914},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cacm/BulatovM10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1010-0201,
author = {Andrei A. Bulatov and
D{\'{a}}niel Marx},
title = {The complexity of global cardinality constraints},
journal = {Log. Methods Comput. Sci.},
volume = {6},
number = {4},
year = {2010},
url = {https://doi.org/10.2168/LMCS-6(4:4)2010},
doi = {10.2168/LMCS-6(4:4)2010},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1010-0201.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijcga/GiannopoulosKKKM10,
author = {Panos Giannopoulos and
Rolf Klein and
Christian Knauer and
Martin Kutz and
D{\'{a}}niel Marx},
title = {Computing Geometric Minimum-Dilation Graphs is NP-Hard},
journal = {Int. J. Comput. Geom. Appl.},
volume = {20},
number = {2},
pages = {147--173},
year = {2010},
url = {https://doi.org/10.1142/S0218195910003244},
doi = {10.1142/S0218195910003244},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijcga/GiannopoulosKKKM10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/Marx10,
author = {D{\'{a}}niel Marx},
title = {Approximating fractional hypertree width},
journal = {{ACM} Trans. Algorithms},
volume = {6},
number = {2},
pages = {29:1--29:17},
year = {2010},
url = {https://doi.org/10.1145/1721837.1721845},
doi = {10.1145/1721837.1721845},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/talg/Marx10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toc/Marx10,
author = {D{\'{a}}niel Marx},
title = {Can You Beat Treewidth?},
journal = {Theory Comput.},
volume = {6},
number = {1},
pages = {85--112},
year = {2010},
url = {https://doi.org/10.4086/toc.2010.v006a005},
doi = {10.4086/TOC.2010.V006A005},
timestamp = {Sun, 21 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/toc/Marx10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Marx10,
author = {D{\'{a}}niel Marx},
title = {Completely Inapproximable Monotone and Antimonotone Parameterized
Problems},
booktitle = {Proceedings of the 25th Annual {IEEE} Conference on Computational
Complexity, {CCC} 2010, Cambridge, Massachusetts, USA, June 9-12,
2010},
pages = {181--187},
publisher = {{IEEE} Computer Society},
year = {2010},
url = {https://doi.org/10.1109/CCC.2010.25},
doi = {10.1109/CCC.2010.25},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Marx10.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/stacs/MarxOR10,
author = {D{\'{a}}niel Marx and
Barry O'Sullivan and
Igor Razgon},
editor = {Jean{-}Yves Marion and
Thomas Schwentick},
title = {Treewidth Reduction for Constrained Separation and Bipartization Problems},
booktitle = {27th International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2010, March 4-6, 2010, Nancy, France},
series = {LIPIcs},
volume = {5},
pages = {561--572},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2010},
url = {https://doi.org/10.4230/LIPIcs.STACS.2010.2485},
doi = {10.4230/LIPICS.STACS.2010.2485},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/stacs/MarxOR10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BateniHM10,
author = {MohammadHossein Bateni and
MohammadTaghi Hajiaghayi and
D{\'{a}}niel Marx},
editor = {Leonard J. Schulman},
title = {Approximation schemes for steiner forest on planar graphs and graphs
of bounded treewidth},
booktitle = {Proceedings of the 42nd {ACM} Symposium on Theory of Computing, {STOC}
2010, Cambridge, Massachusetts, USA, 5-8 June 2010},
pages = {211--220},
publisher = {{ACM}},
year = {2010},
url = {https://doi.org/10.1145/1806689.1806720},
doi = {10.1145/1806689.1806720},
timestamp = {Mon, 12 Aug 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/BateniHM10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Marx10,
author = {D{\'{a}}niel Marx},
editor = {Leonard J. Schulman},
title = {Tractable hypergraph properties for constraint satisfaction and conjunctive
queries},
booktitle = {Proceedings of the 42nd {ACM} Symposium on Theory of Computing, {STOC}
2010, Cambridge, Massachusetts, USA, 5-8 June 2010},
pages = {735--744},
publisher = {{ACM}},
year = {2010},
url = {https://doi.org/10.1145/1806689.1806790},
doi = {10.1145/1806689.1806790},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Marx10.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}
}
@inproceedings{DBLP:conf/wg/MarxS10,
author = {D{\'{a}}niel Marx and
Ildik{\'{o}} Schlotter},
editor = {Dimitrios M. Thilikos},
title = {Parameterized Complexity of the Arc-Preserving Subsequence Problem},
booktitle = {Graph Theoretic Concepts in Computer Science - 36th International
Workshop, {WG} 2010, Zar{\'{o}}s, Crete, Greece, June 28-30,
2010 Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {6410},
pages = {244--255},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-16926-7\_23},
doi = {10.1007/978-3-642-16926-7\_23},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wg/MarxS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1003-1260,
author = {D{\'{a}}niel Marx and
Ildik{\'{o}} Schlotter},
title = {Cleaning Interval Graphs},
journal = {CoRR},
volume = {abs/1003.1260},
year = {2010},
url = {http://arxiv.org/abs/1003.1260},
eprinttype = {arXiv},
eprint = {1003.1260},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1003-1260.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1006-4339,
author = {MohammadHossein Bateni and
MohammadTaghi Hajiaghayi and
D{\'{a}}niel Marx},
title = {Prize-collecting Network Design on Planar Graphs},
journal = {CoRR},
volume = {abs/1006.4339},
year = {2010},
url = {http://arxiv.org/abs/1006.4339},
eprinttype = {arXiv},
eprint = {1006.4339},
timestamp = {Mon, 12 Aug 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1006-4339.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1007-5450,
author = {Daniel Lokshtanov and
D{\'{a}}niel Marx and
Saket Saurabh},
title = {Known Algorithms on Graphs of Bounded Treewidth are Probably Optimal},
journal = {CoRR},
volume = {abs/1007.5450},
year = {2010},
url = {http://arxiv.org/abs/1007.5450},
eprinttype = {arXiv},
eprint = {1007.5450},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1007-5450.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1010-3633,
author = {D{\'{a}}niel Marx and
Igor Razgon},
title = {Fixed-parameter tractability of multicut parameterized by the size
of the cutset},
journal = {CoRR},
volume = {abs/1010.3633},
year = {2010},
url = {http://arxiv.org/abs/1010.3633},
eprinttype = {arXiv},
eprint = {1010.3633},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1010-3633.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1011-1827,
author = {Martin Grohe and
Ken{-}ichi Kawarabayashi and
D{\'{a}}niel Marx and
Paul Wollan},
title = {Finding topological subgraphs is fixed-parameter tractable},
journal = {CoRR},
volume = {abs/1011.1827},
year = {2010},
url = {http://arxiv.org/abs/1011.1827},
eprinttype = {arXiv},
eprint = {1011.1827},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1011-1827.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/MarxS09,
author = {D{\'{a}}niel Marx and
Marcus Schaefer},
title = {The complexity of nonrepetitive coloring},
journal = {Discret. Appl. Math.},
volume = {157},
number = {1},
pages = {13--18},
year = {2009},
url = {https://doi.org/10.1016/j.dam.2008.04.015},
doi = {10.1016/J.DAM.2008.04.015},
timestamp = {Thu, 17 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/MarxS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Marx09,
author = {D{\'{a}}niel Marx},
title = {Complexity results for minimum sum edge coloring},
journal = {Discret. Appl. Math.},
volume = {157},
number = {5},
pages = {1034--1045},
year = {2009},
url = {https://doi.org/10.1016/j.dam.2008.04.002},
doi = {10.1016/J.DAM.2008.04.002},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/Marx09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/MarxS09a,
author = {D{\'{a}}niel Marx and
Ildik{\'{o}} Schlotter},
title = {Parameterized graph cleaning problems},
journal = {Discret. Appl. Math.},
volume = {157},
number = {15},
pages = {3258--3267},
year = {2009},
url = {https://doi.org/10.1016/j.dam.2009.06.022},
doi = {10.1016/J.DAM.2009.06.022},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/MarxS09a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/MarxR09,
author = {D{\'{a}}niel Marx and
Igor Razgon},
title = {Constant ratio fixed-parameter approximation of the edge multicut
problem},
journal = {Inf. Process. Lett.},
volume = {109},
number = {20},
pages = {1161--1166},
year = {2009},
url = {https://doi.org/10.1016/j.ipl.2009.07.016},
doi = {10.1016/J.IPL.2009.07.016},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/MarxR09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/GroheM09,
author = {Martin Grohe and
D{\'{a}}niel Marx},
title = {On tree width, bramble size, and expansion},
journal = {J. Comb. Theory, Ser. {B}},
volume = {99},
number = {1},
pages = {218--228},
year = {2009},
url = {https://doi.org/10.1016/j.jctb.2008.06.004},
doi = {10.1016/J.JCTB.2008.06.004},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/GroheM09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Marx09,
author = {D{\'{a}}niel Marx},
title = {A parameterized view on matroid optimization problems},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {44},
pages = {4471--4479},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.07.027},
doi = {10.1016/J.TCS.2009.07.027},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Marx09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cp/HebrardMOR09,
author = {Emmanuel Hebrard and
D{\'{a}}niel Marx and
Barry O'Sullivan and
Igor Razgon},
editor = {Ian P. Gent},
title = {Constraints of Difference and Equality: {A} Complete Taxonomic Characterisation},
booktitle = {Principles and Practice of Constraint Programming - {CP} 2009, 15th
International Conference, {CP} 2009, Lisbon, Portugal, September 20-24,
2009, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5732},
pages = {424--438},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-04244-7\_35},
doi = {10.1007/978-3-642-04244-7\_35},
timestamp = {Tue, 14 May 2019 10:00:45 +0200},
biburl = {https://dblp.org/rec/conf/cp/HebrardMOR09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/MarxR09,
author = {D{\'{a}}niel Marx and
Igor Razgon},
editor = {Amos Fiat and
Peter Sanders},
title = {Constant Ratio Fixed-Parameter Approximation of the Edge Multicut
Problem},
booktitle = {Algorithms - {ESA} 2009, 17th Annual European Symposium, Copenhagen,
Denmark, September 7-9, 2009. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5757},
pages = {647--658},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-04128-0\_58},
doi = {10.1007/978-3-642-04128-0\_58},
timestamp = {Tue, 14 May 2019 10:00:54 +0200},
biburl = {https://dblp.org/rec/conf/esa/MarxR09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/DemaineHM09,
author = {Erik D. Demaine and
MohammadTaghi Hajiaghayi and
D{\'{a}}niel Marx},
editor = {Amos Fiat and
Peter Sanders},
title = {Minimizing Movement: Fixed-Parameter Tractability},
booktitle = {Algorithms - {ESA} 2009, 17th Annual European Symposium, Copenhagen,
Denmark, September 7-9, 2009. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5757},
pages = {718--729},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-04128-0\_64},
doi = {10.1007/978-3-642-04128-0\_64},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/esa/DemaineHM09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/MarxS09,
author = {D{\'{a}}niel Marx and
Ildik{\'{o}} Schlotter},
editor = {Jianer Chen and
Fedor V. Fomin},
title = {Stable Assignment with Couples: Parameterized Complexity and Local
Search},
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 = {300--311},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-11269-0\_25},
doi = {10.1007/978-3-642-11269-0\_25},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/iwpec/MarxS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/lics/BulatovM09,
author = {Andrei A. Bulatov and
D{\'{a}}niel Marx},
title = {The Complexity of Global Cardinality Constraints},
booktitle = {Proceedings of the 24th Annual {IEEE} Symposium on Logic in Computer
Science, {LICS} 2009, 11-14 August 2009, Los Angeles, CA, {USA}},
pages = {419--428},
publisher = {{IEEE} Computer Society},
year = {2009},
url = {https://doi.org/10.1109/LICS.2009.38},
doi = {10.1109/LICS.2009.38},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/lics/BulatovM09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/Marx09,
author = {D{\'{a}}niel Marx},
editor = {Claire Mathieu},
title = {Approximating fractional hypertree width},
booktitle = {Proceedings of the Twentieth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2009, New York, NY, USA, January 4-6, 2009},
pages = {902--911},
publisher = {{SIAM}},
year = {2009},
url = {https://doi.org/10.1137/1.9781611973068.98},
doi = {10.1137/1.9781611973068.98},
timestamp = {Mon, 12 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/Marx09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/BulatovDGM09,
author = {Andrei A. Bulatov and
V{\'{\i}}ctor Dalmau and
Martin Grohe and
D{\'{a}}niel Marx},
editor = {Susanne Albers and
Jean{-}Yves Marion},
title = {Enumerating Homomorphisms},
booktitle = {26th International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2009, February 26-28, 2009, Freiburg, Germany, Proceedings},
series = {LIPIcs},
volume = {3},
pages = {231--242},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik, Germany},
year = {2009},
url = {https://doi.org/10.4230/LIPIcs.STACS.2009.1838},
doi = {10.4230/LIPICS.STACS.2009.1838},
timestamp = {Tue, 22 Jun 2021 15:43:57 +0200},
biburl = {https://dblp.org/rec/conf/stacs/BulatovDGM09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/Marx09,
author = {D{\'{a}}niel Marx},
editor = {Susanne Albers and
Jean{-}Yves Marion},
title = {Tractable Structures for Constraint Satisfaction with Truth Tables},
booktitle = {26th International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2009, February 26-28, 2009, Freiburg, Germany, Proceedings},
series = {LIPIcs},
volume = {3},
pages = {649--660},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik, Germany},
year = {2009},
url = {https://doi.org/10.4230/LIPIcs.STACS.2009.1807},
doi = {10.4230/LIPICS.STACS.2009.1807},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/Marx09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/dagstuhl/2009P9511,
editor = {Erik D. Demaine and
MohammadTaghi Hajiaghayi and
D{\'{a}}niel Marx},
title = {Parameterized complexity and approximation algorithms, 13.12. - 17.12.2009},
series = {Dagstuhl Seminar Proceedings},
volume = {09511},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik, Germany},
year = {2009},
url = {http://drops.dagstuhl.de/portals/09511/},
timestamp = {Thu, 10 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/dagstuhl/2009P9511.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dagstuhl/DemaineHM09,
author = {Erik D. Demaine and
MohammadTaghi Hajiaghayi and
D{\'{a}}niel Marx},
editor = {Erik D. Demaine and
MohammadTaghi Hajiaghayi and
D{\'{a}}niel Marx},
title = {09511 Abstracts Collection - Parameterized complexity and approximation
algorithms},
booktitle = {Parameterized complexity and approximation algorithms, 13.12. - 17.12.2009},
series = {Dagstuhl Seminar Proceedings},
volume = {09511},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik, Germany},
year = {2009},
url = {http://drops.dagstuhl.de/opus/volltexte/2010/2502/},
timestamp = {Thu, 10 Jun 2021 13:02:08 +0200},
biburl = {https://dblp.org/rec/conf/dagstuhl/DemaineHM09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dagstuhl/DemaineHM09a,
author = {Erik D. Demaine and
MohammadTaghi Hajiaghayi and
D{\'{a}}niel Marx},
editor = {Erik D. Demaine and
MohammadTaghi Hajiaghayi and
D{\'{a}}niel Marx},
title = {09511 Executive Summary - Parameterized complexity and approximation
algorithms},
booktitle = {Parameterized complexity and approximation algorithms, 13.12. - 17.12.2009},
series = {Dagstuhl Seminar Proceedings},
volume = {09511},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik, Germany},
year = {2009},
url = {http://drops.dagstuhl.de/opus/volltexte/2010/2501/},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/dagstuhl/DemaineHM09a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dagstuhl/DemaineHM09b,
author = {Erik D. Demaine and
MohammadTaghi Hajiaghayi and
D{\'{a}}niel Marx},
editor = {Erik D. Demaine and
MohammadTaghi Hajiaghayi and
D{\'{a}}niel Marx},
title = {09511 Open Problems - Parameterized complexity and approximation algorithms},
booktitle = {Parameterized complexity and approximation algorithms, 13.12. - 17.12.2009},
series = {Dagstuhl Seminar Proceedings},
volume = {09511},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik, Germany},
year = {2009},
url = {http://drops.dagstuhl.de/opus/volltexte/2010/2499/},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/dagstuhl/DemaineHM09b.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0902-1256,
author = {Andrei A. Bulatov and
V{\'{\i}}ctor Dalmau and
Martin Grohe and
D{\'{a}}niel Marx},
title = {Enumerating Homomorphisms},
journal = {CoRR},
volume = {abs/0902.1256},
year = {2009},
url = {http://arxiv.org/abs/0902.1256},
eprinttype = {arXiv},
eprint = {0902.1256},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0902-1256.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0902-3780,
author = {D{\'{a}}niel Marx and
Barry O'Sullivan and
Igor Razgon},
title = {Treewidth reduction for constrained separation and bipartization problems},
journal = {CoRR},
volume = {abs/0902.3780},
year = {2009},
url = {http://arxiv.org/abs/0902.3780},
eprinttype = {arXiv},
eprint = {0902.3780},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0902-3780.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0911-0801,
author = {D{\'{a}}niel Marx},
title = {Tractable hypergraph properties for constraint satisfaction and conjunctive
queries},
journal = {CoRR},
volume = {abs/0911.0801},
year = {2009},
url = {http://arxiv.org/abs/0911.0801},
eprinttype = {arXiv},
eprint = {0911.0801},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0911-0801.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0911-5143,
author = {MohammadHossein Bateni and
MohammadTaghi Hajiaghayi and
D{\'{a}}niel Marx},
title = {Approximation Schemes for Steiner Forest on Planar Graphs and Graphs
of Bounded Treewidth},
journal = {CoRR},
volume = {abs/0911.5143},
year = {2009},
url = {http://arxiv.org/abs/0911.5143},
eprinttype = {arXiv},
eprint = {0911.5143},
timestamp = {Mon, 12 Aug 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0911-5143.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cj/Marx08,
author = {D{\'{a}}niel Marx},
title = {Parameterized Complexity and Approximation Algorithms},
journal = {Comput. J.},
volume = {51},
number = {1},
pages = {60--78},
year = {2008},
url = {https://doi.org/10.1093/comjnl/bxm048},
doi = {10.1093/COMJNL/BXM048},
timestamp = {Sat, 20 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cj/Marx08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/Marx08,
author = {D{\'{a}}niel Marx},
title = {Searching the k-change neighborhood for {TSP} is W[1]-hard},
journal = {Oper. Res. Lett.},
volume = {36},
number = {1},
pages = {31--36},
year = {2008},
url = {https://doi.org/10.1016/j.orl.2007.02.008},
doi = {10.1016/J.ORL.2007.02.008},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/Marx08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Marx08,
author = {D{\'{a}}niel Marx},
title = {Closest Substring Problems with Small Distances},
journal = {{SIAM} J. Comput.},
volume = {38},
number = {4},
pages = {1382--1410},
year = {2008},
url = {https://doi.org/10.1137/060673898},
doi = {10.1137/060673898},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Marx08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Marx08,
author = {D{\'{a}}niel Marx},
title = {Complexity of unique list colorability},
journal = {Theor. Comput. Sci.},
volume = {401},
number = {1-3},
pages = {62--76},
year = {2008},
url = {https://doi.org/10.1016/j.tcs.2008.03.018},
doi = {10.1016/J.TCS.2008.03.018},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Marx08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/AtseriasGM08,
author = {Albert Atserias and
Martin Grohe and
D{\'{a}}niel Marx},
title = {Size Bounds and Query Plans for Relational Joins},
booktitle = {49th Annual {IEEE} Symposium on Foundations of Computer Science, {FOCS}
2008, October 25-28, 2008, Philadelphia, PA, {USA}},
pages = {739--748},
publisher = {{IEEE} Computer Society},
year = {2008},
url = {https://doi.org/10.1109/FOCS.2008.43},
doi = {10.1109/FOCS.2008.43},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/AtseriasGM08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/KrokhinM08,
author = {Andrei A. Krokhin and
D{\'{a}}niel Marx},
editor = {Luca Aceto and
Ivan Damg{\aa}rd and
Leslie Ann Goldberg and
Magn{\'{u}}s M. Halld{\'{o}}rsson and
Anna Ing{\'{o}}lfsd{\'{o}}ttir and
Igor Walukiewicz},
title = {On the Hardness of Losing Weight},
booktitle = {Automata, Languages and Programming, 35th International Colloquium,
{ICALP} 2008, Reykjavik, Iceland, July 7-11, 2008, Proceedings, Part
{I:} Tack {A:} Algorithms, Automata, Complexity, and Games},
series = {Lecture Notes in Computer Science},
volume = {5125},
pages = {662--673},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-70575-8\_54},
doi = {10.1007/978-3-540-70575-8\_54},
timestamp = {Fri, 27 Mar 2020 09:02:59 +0100},
biburl = {https://dblp.org/rec/conf/icalp/KrokhinM08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/MarxS08,
author = {D{\'{a}}niel Marx and
Ildik{\'{o}} Schlotter},
editor = {Hajo Broersma and
Thomas Erlebach and
Tom Friedetzky and
Dani{\"{e}}l Paulusma},
title = {Parameterized Graph Cleaning Problems},
booktitle = {Graph-Theoretic Concepts in Computer Science, 34th International Workshop,
{WG} 2008, Durham, UK, June 30 - July 2, 2008. Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {5344},
pages = {287--299},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-92248-3\_26},
doi = {10.1007/978-3-540-92248-3\_26},
timestamp = {Sun, 25 Oct 2020 23:07:56 +0100},
biburl = {https://dblp.org/rec/conf/wg/MarxS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0812-4919,
author = {D{\'{a}}niel Marx and
Ildik{\'{o}} Schlotter},
title = {Obtaining a Planar Graph by Vertex Deletion},
journal = {CoRR},
volume = {abs/0812.4919},
year = {2008},
url = {http://arxiv.org/abs/0812.4919},
eprinttype = {arXiv},
eprint = {0812.4919},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0812-4919.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Marx07,
author = {D{\'{a}}niel Marx},
title = {Can you beat treewidth?},
booktitle = {48th Annual {IEEE} Symposium on Foundations of Computer Science {(FOCS}
2007), October 20-23, 2007, Providence, RI, USA, Proceedings},
pages = {169--179},
publisher = {{IEEE} Computer Society},
year = {2007},
url = {https://doi.org/10.1109/FOCS.2007.18},
doi = {10.1109/FOCS.2007.18},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Marx07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Marx07a,
author = {D{\'{a}}niel Marx},
title = {On the Optimality of Planar and Geometric Approximation Schemes},
booktitle = {48th Annual {IEEE} Symposium on Foundations of Computer Science {(FOCS}
2007), October 20-23, 2007, Providence, RI, USA, Proceedings},
pages = {338--348},
publisher = {{IEEE} Computer Society},
year = {2007},
url = {https://doi.org/10.1109/FOCS.2007.50},
doi = {10.1109/FOCS.2007.50},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Marx07a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/MarxS07,
author = {D{\'{a}}niel Marx and
Ildik{\'{o}} Schlotter},
editor = {Andreas Brandst{\"{a}}dt and
Dieter Kratsch and
Haiko M{\"{u}}ller},
title = {Obtaining a Planar Graph by Vertex Deletion},
booktitle = {Graph-Theoretic Concepts in Computer Science, 33rd International Workshop,
{WG} 2007, Dornburg, Germany, June 21-23, 2007. Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {4769},
pages = {292--303},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-74839-7\_28},
doi = {10.1007/978-3-540-74839-7\_28},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wg/MarxS07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/dagstuhl/2007P7281,
editor = {Erik D. Demaine and
Gregory Z. Gutin and
D{\'{a}}niel Marx and
Ulrike Stege},
title = {Structure Theory and {FPT} Algorithmics for Graphs, Digraphs and Hypergraphs,
08.07. - 13.07.2007},
series = {Dagstuhl Seminar Proceedings},
volume = {07281},
publisher = {Internationales Begegnungs- und Forschungszentrum fuer Informatik
(IBFI), Schloss Dagstuhl, Germany},
year = {2007},
url = {http://drops.dagstuhl.de/portals/07281/},
timestamp = {Thu, 10 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/dagstuhl/2007P7281.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dagstuhl/DemaineGMS07,
author = {Erik D. Demaine and
Gregory Z. Gutin and
D{\'{a}}niel Marx and
Ulrike Stege},
editor = {Erik D. Demaine and
Gregory Z. Gutin and
D{\'{a}}niel Marx and
Ulrike Stege},
title = {07281 Abstracts Collection -- Structure Theory and {FPT} Algorithmics
for Graphs, Digraphs and Hypergraphs},
booktitle = {Structure Theory and {FPT} Algorithmics for Graphs, Digraphs and Hypergraphs,
08.07. - 13.07.2007},
series = {Dagstuhl Seminar Proceedings},
volume = {07281},
publisher = {Internationales Begegnungs- und Forschungszentrum fuer Informatik
(IBFI), Schloss Dagstuhl, Germany},
year = {2007},
url = {http://drops.dagstuhl.de/opus/volltexte/2007/1245},
timestamp = {Thu, 10 Jun 2021 13:02:09 +0200},
biburl = {https://dblp.org/rec/conf/dagstuhl/DemaineGMS07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dagstuhl/DemaineGMS07a,
author = {Erik D. Demaine and
Gregory Z. Gutin and
D{\'{a}}niel Marx and
Ulrike Stege},
editor = {Erik D. Demaine and
Gregory Z. Gutin and
D{\'{a}}niel Marx and
Ulrike Stege},
title = {07281 Open Problems -- Structure Theory and {FPT} Algorithmcs for
Graphs, Digraphs and Hypergraphs},
booktitle = {Structure Theory and {FPT} Algorithmics for Graphs, Digraphs and Hypergraphs,
08.07. - 13.07.2007},
series = {Dagstuhl Seminar Proceedings},
volume = {07281},
publisher = {Internationales Begegnungs- und Forschungszentrum fuer Informatik
(IBFI), Schloss Dagstuhl, Germany},
year = {2007},
url = {http://drops.dagstuhl.de/opus/volltexte/2007/1254},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/dagstuhl/DemaineGMS07a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/Marx06,
author = {D{\'{a}}niel Marx},
title = {The complexity of chromatic strength and chromatic edge strength},
journal = {Comput. Complex.},
volume = {14},
number = {4},
pages = {308--340},
year = {2006},
url = {https://doi.org/10.1007/s00037-005-0201-2},
doi = {10.1007/S00037-005-0201-2},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/Marx06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Marx06,
author = {D{\'{a}}niel Marx},
title = {Precoloring extension on unit interval graphs},
journal = {Discret. Appl. Math.},
volume = {154},
number = {6},
pages = {995--1002},
year = {2006},
url = {https://doi.org/10.1016/j.dam.2005.10.008},
doi = {10.1016/J.DAM.2005.10.008},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/Marx06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Marx06,
author = {D{\'{a}}niel Marx},
title = {Parameterized graph separation problems},
journal = {Theor. Comput. Sci.},
volume = {351},
number = {3},
pages = {394--406},
year = {2006},
url = {https://doi.org/10.1016/j.tcs.2005.10.007},
doi = {10.1016/J.TCS.2005.10.007},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Marx06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Marx06a,
author = {D{\'{a}}niel Marx},
title = {Parameterized coloring problems on chordal graphs},
journal = {Theor. Comput. Sci.},
volume = {351},
number = {3},
pages = {407--424},
year = {2006},
url = {https://doi.org/10.1016/j.tcs.2005.10.008},
doi = {10.1016/J.TCS.2005.10.008},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Marx06a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Marx06b,
author = {D{\'{a}}niel Marx},
title = {Minimum sum multicoloring on the edges of trees},
journal = {Theor. Comput. Sci.},
volume = {361},
number = {2-3},
pages = {133--149},
year = {2006},
url = {https://doi.org/10.1016/j.tcs.2006.05.006},
doi = {10.1016/J.TCS.2006.05.006},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Marx06b.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/acid/Marx06,
author = {D{\'{a}}niel Marx},
editor = {Hajo Broersma and
Stefan S. Dantchev and
Matthew Johnson and
Stefan Szeider},
title = {A Parameterized View on Matroid Optimization Problems},
booktitle = {Algorithms and Complexity in Durham 2006 - Proceedings of the Second
ACiD Workshop, 18-20 September 2006, Durham, {UK}},
series = {Texts in Algorithmics},
volume = {7},
pages = {158},
publisher = {King's College, London},
year = {2006},
timestamp = {Tue, 24 Jul 2007 20:35:24 +0200},
biburl = {https://dblp.org/rec/conf/acid/Marx06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/Marx06,
author = {D{\'{a}}niel Marx},
editor = {Michele Bugliesi and
Bart Preneel and
Vladimiro Sassone and
Ingo Wegener},
title = {A Parameterized View on Matroid Optimization Problems},
booktitle = {Automata, Languages and Programming, 33rd International Colloquium,
{ICALP} 2006, Venice, Italy, July 10-14, 2006, Proceedings, Part {I}},
series = {Lecture Notes in Computer Science},
volume = {4051},
pages = {655--666},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11786986\_57},
doi = {10.1007/11786986\_57},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/Marx06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/Marx06,
author = {D{\'{a}}niel Marx},
editor = {Hans L. Bodlaender and
Michael A. Langston},
title = {Parameterized Complexity of Independence and Domination on Geometric
Graphs},
booktitle = {Parameterized and Exact Computation, Second International Workshop,
{IWPEC} 2006, Z{\"{u}}rich, Switzerland, September 13-15, 2006,
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4169},
pages = {154--165},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11847250\_14},
doi = {10.1007/11847250\_14},
timestamp = {Tue, 14 May 2019 10:00:45 +0200},
biburl = {https://dblp.org/rec/conf/iwpec/Marx06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/GroheM06,
author = {Martin Grohe and
D{\'{a}}niel Marx},
title = {Constraint solving via fractional edge covers},
booktitle = {Proceedings of the Seventeenth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2006, Miami, Florida, USA, January 22-26, 2006},
pages = {289--298},
publisher = {{ACM} Press},
year = {2006},
url = {http://dl.acm.org/citation.cfm?id=1109557.1109590},
timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
biburl = {https://dblp.org/rec/conf/soda/GroheM06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/Marx06,
author = {D{\'{a}}niel Marx},
editor = {Fedor V. Fomin},
title = {Chordal Deletion Is Fixed-Parameter Tractable},
booktitle = {Graph-Theoretic Concepts in Computer Science, 32nd International Workshop,
{WG} 2006, Bergen, Norway, June 22-24, 2006, Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {4271},
pages = {37--48},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11917496\_4},
doi = {10.1007/11917496\_4},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/wg/Marx06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/Marx05,
author = {D{\'{a}}niel Marx},
title = {Parameterized complexity of constraint satisfaction problems},
journal = {Comput. Complex.},
volume = {14},
number = {2},
pages = {153--183},
year = {2005},
url = {https://doi.org/10.1007/s00037-005-0195-9},
doi = {10.1007/S00037-005-0195-9},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/Marx05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Marx05,
author = {D{\'{a}}niel Marx},
title = {NP-completeness of list coloring and precoloring extension on the
edges of planar graphs},
journal = {J. Graph Theory},
volume = {49},
number = {4},
pages = {313--324},
year = {2005},
url = {https://doi.org/10.1002/jgt.20085},
doi = {10.1002/JGT.20085},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Marx05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/Marx05,
author = {D{\'{a}}niel Marx},
title = {A short proof of the NP-completeness of minimum sum interval coloring},
journal = {Oper. Res. Lett.},
volume = {33},
number = {4},
pages = {382--384},
year = {2005},
url = {https://doi.org/10.1016/j.orl.2004.07.006},
doi = {10.1016/J.ORL.2004.07.006},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/Marx05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/Marx05,
author = {D{\'{a}}niel Marx},
editor = {Gerth St{\o}lting Brodal and
Stefano Leonardi},
title = {Efficient Approximation Schemes for Geometric Problems?},
booktitle = {Algorithms - {ESA} 2005, 13th Annual European Symposium, Palma de
Mallorca, Spain, October 3-6, 2005, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3669},
pages = {448--459},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/11561071\_41},
doi = {10.1007/11561071\_41},
timestamp = {Tue, 27 Dec 2022 09:06:31 +0100},
biburl = {https://dblp.org/rec/conf/esa/Marx05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Marx05,
author = {D{\'{a}}niel Marx},
title = {The Closest Substring problem with small distances},
booktitle = {46th Annual {IEEE} Symposium on Foundations of Computer Science {(FOCS}
2005), 23-25 October 2005, Pittsburgh, PA, USA, Proceedings},
pages = {63--72},
publisher = {{IEEE} Computer Society},
year = {2005},
url = {https://doi.org/10.1109/SFCS.2005.70},
doi = {10.1109/SFCS.2005.70},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Marx05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Marx04,
author = {D{\'{a}}niel Marx},
title = {Eulerian disjoint paths problem in grid graphs is NP-complete},
journal = {Discret. Appl. Math.},
volume = {143},
number = {1-3},
pages = {336--341},
year = {2004},
url = {https://doi.org/10.1016/j.dam.2003.12.003},
doi = {10.1016/J.DAM.2003.12.003},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/Marx04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Marx04,
author = {D{\'{a}}niel Marx},
title = {List edge multicoloring in graphs with few cycles},
journal = {Inf. Process. Lett.},
volume = {89},
number = {2},
pages = {85--90},
year = {2004},
url = {https://doi.org/10.1016/j.ipl.2003.09.016},
doi = {10.1016/J.IPL.2003.09.016},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Marx04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Marx04,
author = {D{\'{a}}niel Marx},
title = {Parameterized Complexity of Constraint Satisfaction Problems},
booktitle = {19th Annual {IEEE} Conference on Computational Complexity {(CCC} 2004),
21-24 June 2004, Amherst, MA, {USA}},
pages = {139--149},
publisher = {{IEEE} Computer Society},
year = {2004},
url = {https://doi.org/10.1109/CCC.2004.1313823},
doi = {10.1109/CCC.2004.1313823},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Marx04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/Marx04,
author = {D{\'{a}}niel Marx},
editor = {Rodney G. Downey and
Michael R. Fellows and
Frank K. H. A. Dehne},
title = {Parameterized Graph Separation Problems},
booktitle = {Parameterized and Exact Computation, First International Workshop,
{IWPEC} 2004, Bergen, Norway, September 14-17, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3162},
pages = {71--82},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-28639-4\_7},
doi = {10.1007/978-3-540-28639-4\_7},
timestamp = {Tue, 14 May 2019 10:00:45 +0200},
biburl = {https://dblp.org/rec/conf/iwpec/Marx04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/Marx04a,
author = {D{\'{a}}niel Marx},
editor = {Rodney G. Downey and
Michael R. Fellows and
Frank K. H. A. Dehne},
title = {Parameterized Coloring Problems on Chordal Graphs},
booktitle = {Parameterized and Exact Computation, First International Workshop,
{IWPEC} 2004, Bergen, Norway, September 14-17, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3162},
pages = {83--95},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-28639-4\_8},
doi = {10.1007/978-3-540-28639-4\_8},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/iwpec/Marx04a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/waoa/Marx04,
author = {D{\'{a}}niel Marx},
editor = {Giuseppe Persiano and
Roberto Solis{-}Oba},
title = {Minimum Sum Multicoloring on the Edges of Planar Graphs and Partial
k-Trees},
booktitle = {Approximation and Online Algorithms, Second International Workshop,
{WAOA} 2004, Bergen, Norway, September 14-16, 2004, Revised Selected
Papers},
series = {Lecture Notes in Computer Science},
volume = {3351},
pages = {9--22},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-31833-0\_3},
doi = {10.1007/978-3-540-31833-0\_3},
timestamp = {Tue, 14 May 2019 10:00:46 +0200},
biburl = {https://dblp.org/rec/conf/waoa/Marx04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/waoa/Marx03,
author = {D{\'{a}}niel Marx},
editor = {Klaus Jansen and
Roberto Solis{-}Oba},
title = {Minimum Sum Multicoloring on the Edges of Trees: (Extended Abstract)},
booktitle = {Approximation and Online Algorithms, First International Workshop,
{WAOA} 2003, Budapest, Hungary, September 16-18, 2003, Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {2909},
pages = {214--226},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/978-3-540-24592-6\_17},
doi = {10.1007/978-3-540-24592-6\_17},
timestamp = {Tue, 14 May 2019 10:00:46 +0200},
biburl = {https://dblp.org/rec/conf/waoa/Marx03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/Marx02,
author = {D{\'{a}}niel Marx},
editor = {Krzysztof Diks and
Wojciech Rytter},
title = {The Complexity of Tree Multicolorings},
booktitle = {Mathematical Foundations of Computer Science 2002, 27th International
Symposium, {MFCS} 2002, Warsaw, Poland, August 26-30, 2002, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2420},
pages = {532--542},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-45687-2\_44},
doi = {10.1007/3-540-45687-2\_44},
timestamp = {Tue, 14 May 2019 10:00:37 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/Marx02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/infocom/CinklerMLF00,
author = {Tibor Cinkler and
D{\'{a}}niel Marx and
Claus Popp Larsen and
D{\'{a}}niel Fogaras},
title = {Heuristic Algorithms for Joint Configuration of the Optical and Electrical
Layer in Multi-Hop Wavelength Routing Networks},
booktitle = {Proceedings {IEEE} {INFOCOM} 2000, The Conference on Computer Communications,
Nineteenth Annual Joint Conference of the {IEEE} Computer and Communications
Societies, Reaching the Promised Land of Communications, Tel Aviv,
Israel, March 26-30, 2000},
pages = {1000--1009},
publisher = {{IEEE} Computer Society},
year = {2000},
url = {https://doi.org/10.1109/INFCOM.2000.832275},
doi = {10.1109/INFCOM.2000.832275},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/infocom/CinklerMLF00.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-11 20:11 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:
