default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Dusan Knop
@article{DBLP:journals/aamas/BoehmerBHKL24,
author = {Niclas Boehmer and
Robert Bredereck and
Klaus Heeger and
Dusan Knop and
Junjie Luo},
title = {Multivariate algorithmics for eliminating envy by donating goods},
journal = {Auton. Agents Multi Agent Syst.},
volume = {38},
number = {2},
pages = {43},
year = {2024},
url = {https://doi.org/10.1007/s10458-024-09674-5},
doi = {10.1007/S10458-024-09674-5},
timestamp = {Tue, 17 Sep 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/aamas/BoehmerBHKL24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aaai/FioravantesKKMO24,
author = {Foivos Fioravantes and
Dusan Knop and
Jan Maty{\'{a}}s Kristan and
Nikolaos Melissinos and
Michal Opler},
editor = {Michael J. Wooldridge and
Jennifer G. Dy and
Sriraam Natarajan},
title = {Exact Algorithms and Lowerbounds for Multiagent Path Finding: Power
of Treelike Topology},
booktitle = {Thirty-Eighth {AAAI} Conference on Artificial Intelligence, {AAAI}
2024, Thirty-Sixth Conference on Innovative Applications of Artificial
Intelligence, {IAAI} 2024, Fourteenth Symposium on Educational Advances
in Artificial Intelligence, {EAAI} 2014, February 20-27, 2024, Vancouver,
Canada},
pages = {17380--17388},
publisher = {{AAAI} Press},
year = {2024},
url = {https://doi.org/10.1609/aaai.v38i16.29686},
doi = {10.1609/AAAI.V38I16.29686},
timestamp = {Tue, 02 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/aaai/FioravantesKKMO24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/BlazejKPS24,
author = {V{\'{a}}clav Blazej and
Dusan Knop and
Jan Pokorn{\'{y}} and
Simon Schierreich},
editor = {Rastislav Kr{\'{a}}lovic and
Anton{\'{\i}}n Kucera},
title = {Equitable Connected Partition and Structural Parameters Revisited:
N-Fold Beats Lenstra},
booktitle = {49th International Symposium on Mathematical Foundations of Computer
Science, {MFCS} 2024, August 26-30, 2024, Bratislava, Slovakia},
series = {LIPIcs},
volume = {306},
pages = {29:1--29:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2024},
url = {https://doi.org/10.4230/LIPIcs.MFCS.2024.29},
doi = {10.4230/LIPICS.MFCS.2024.29},
timestamp = {Mon, 26 Aug 2024 16:40:52 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/BlazejKPS24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2404-14128,
author = {Argyrios Deligkas and
Eduard Eiben and
Dusan Knop and
Simon Schierreich},
title = {Individual Rationality in Topological Distance Games is Surprisingly
Hard},
journal = {CoRR},
volume = {abs/2404.14128},
year = {2024},
url = {https://doi.org/10.48550/arXiv.2404.14128},
doi = {10.48550/ARXIV.2404.14128},
eprinttype = {arXiv},
eprint = {2404.14128},
timestamp = {Sat, 25 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2404-14128.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2404-18968,
author = {V{\'{a}}clav Blazej and
Dusan Knop and
Jan Pokorn{\'{y}} and
Simon Schierreich},
title = {Equitable Connected Partition and Structural Parameters Revisited:
N-fold Beats Lenstra},
journal = {CoRR},
volume = {abs/2404.18968},
year = {2024},
url = {https://doi.org/10.48550/arXiv.2404.18968},
doi = {10.48550/ARXIV.2404.18968},
eprinttype = {arXiv},
eprint = {2404.18968},
timestamp = {Mon, 27 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2404-18968.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/aamas/BoehmerBKL23,
author = {Niclas Boehmer and
Robert Bredereck and
Dusan Knop and
Junjie Luo},
title = {Fine-grained view on bribery for group identification},
journal = {Auton. Agents Multi Agent Syst.},
volume = {37},
number = {1},
pages = {21},
year = {2023},
url = {https://doi.org/10.1007/s10458-023-09597-7},
doi = {10.1007/S10458-023-09597-7},
timestamp = {Sat, 13 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/aamas/BoehmerBKL23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ai/GanianHKSS23,
author = {Robert Ganian and
Thekla Hamm and
Dusan Knop and
Simon Schierreich and
Ondrej Such{\'{y}}},
title = {Hedonic diversity games: {A} complexity picture with more than two
colors},
journal = {Artif. Intell.},
volume = {325},
pages = {104017},
year = {2023},
url = {https://doi.org/10.1016/j.artint.2023.104017},
doi = {10.1016/J.ARTINT.2023.104017},
timestamp = {Sun, 17 Dec 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ai/GanianHKSS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/disopt/BlazejCKKSV23,
author = {V{\'{a}}clav Blazej and
Pratibha Choudhary and
Dusan Knop and
Jan Maty{\'{a}}s Kristan and
Ondrej Such{\'{y}} and
Tom{\'{a}}s Valla},
title = {Constant factor approximation for tracking paths and fault tolerant
feedback vertex set},
journal = {Discret. Optim.},
volume = {47},
pages = {100756},
year = {2023},
url = {https://doi.org/10.1016/j.disopt.2022.100756},
doi = {10.1016/J.DISOPT.2022.100756},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/disopt/BlazejCKKSV23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BlazejCKKSV23,
author = {V{\'{a}}clav Blazej and
Pratibha Choudhary and
Dusan Knop and
Jan Maty{\'{a}}s Kristan and
Ondrej Such{\'{y}} and
Tom{\'{a}}s Valla},
title = {Polynomial kernels for tracking shortest paths},
journal = {Inf. Process. Lett.},
volume = {179},
pages = {106315},
year = {2023},
url = {https://doi.org/10.1016/j.ipl.2022.106315},
doi = {10.1016/J.IPL.2022.106315},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BlazejCKKSV23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/KnopKLMO23,
author = {Dusan Knop and
Martin Kouteck{\'{y}} and
Asaf Levin and
Matthias Mnich and
Shmuel Onn},
title = {High-multiplicity N-fold {IP} via configuration {LP}},
journal = {Math. Program.},
volume = {200},
number = {1},
pages = {199--227},
year = {2023},
url = {https://doi.org/10.1007/s10107-022-01882-9},
doi = {10.1007/S10107-022-01882-9},
timestamp = {Tue, 12 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/KnopKLMO23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aaai/BlazejGKPSS23,
author = {V{\'{a}}clav Blazej and
Robert Ganian and
Dusan Knop and
Jan Pokorn{\'{y}} and
Simon Schierreich and
Kirill Simonov},
editor = {Brian Williams and
Yiling Chen and
Jennifer Neville},
title = {The Parameterized Complexity of Network Microaggregation},
booktitle = {Thirty-Seventh {AAAI} Conference on Artificial Intelligence, {AAAI}
2023, Thirty-Fifth Conference on Innovative Applications of Artificial
Intelligence, {IAAI} 2023, Thirteenth Symposium on Educational Advances
in Artificial Intelligence, {EAAI} 2023, Washington, DC, USA, February
7-14, 2023},
pages = {6262--6270},
publisher = {{AAAI} Press},
year = {2023},
url = {https://doi.org/10.1609/aaai.v37i5.25771},
doi = {10.1609/AAAI.V37I5.25771},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/aaai/BlazejGKPSS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/atal/KnopS23,
author = {Dusan Knop and
Simon Schierreich},
editor = {Noa Agmon and
Bo An and
Alessandro Ricci and
William Yeoh},
title = {Host Community Respecting Refugee Housing},
booktitle = {Proceedings of the 2023 International Conference on Autonomous Agents
and Multiagent Systems, {AAMAS} 2023, London, United Kingdom, 29 May
2023 - 2 June 2023},
pages = {966--975},
publisher = {{ACM}},
year = {2023},
url = {https://dl.acm.org/doi/10.5555/3545946.3598736},
doi = {10.5555/3545946.3598736},
timestamp = {Tue, 23 May 2023 14:27:14 +0200},
biburl = {https://dblp.org/rec/conf/atal/KnopS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/atal/KusekBF0K23,
author = {Bartosz Kusek and
Robert Bredereck and
Piotr Faliszewski and
Andrzej Kaczmarczyk and
Dusan Knop},
editor = {Noa Agmon and
Bo An and
Alessandro Ricci and
William Yeoh},
title = {Bribery Can Get Harder in Structured Multiwinner Approval Election},
booktitle = {Proceedings of the 2023 International Conference on Autonomous Agents
and Multiagent Systems, {AAMAS} 2023, London, United Kingdom, 29 May
2023 - 2 June 2023},
pages = {1725--1733},
publisher = {{ACM}},
year = {2023},
url = {https://dl.acm.org/doi/10.5555/3545946.3598831},
doi = {10.5555/3545946.3598831},
timestamp = {Tue, 23 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/atal/KusekBF0K23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ecai/Bredereck0KN23,
author = {Robert Bredereck and
Andrzej Kaczmarczyk and
Dusan Knop and
Rolf Niedermeier},
editor = {Kobi Gal and
Ann Now{\'{e}} and
Grzegorz J. Nalepa and
Roy Fairstein and
Roxana Radulescu},
title = {High-Multiplicity Fair Allocation Using Parametric Integer Linear
Programming},
booktitle = {{ECAI} 2023 - 26th European Conference on Artificial Intelligence,
September 30 - October 4, 2023, Krak{\'{o}}w, Poland - Including
12th Conference on Prestigious Applications of Intelligent Systems
{(PAIS} 2023)},
series = {Frontiers in Artificial Intelligence and Applications},
volume = {372},
pages = {303--310},
publisher = {{IOS} Press},
year = {2023},
url = {https://doi.org/10.3233/FAIA230284},
doi = {10.3233/FAIA230284},
timestamp = {Fri, 27 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ecai/Bredereck0KN23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/BodlaenderBJKLM23,
author = {Hans L. Bodlaender and
{\'{E}}douard Bonnet and
Lars Jaffke and
Dusan Knop and
Paloma T. Lima and
Martin Milanic and
Sebastian Ordyniak and
Sukanya Pandey and
Ondrej Such{\'{y}}},
editor = {Neeldhara Misra and
Magnus Wahlstr{\"{o}}m},
title = {Treewidth Is NP-Complete on Cubic Graphs},
booktitle = {18th International Symposium on Parameterized and Exact Computation,
{IPEC} 2023, September 6-8, 2023, Amsterdam, The Netherlands},
series = {LIPIcs},
volume = {285},
pages = {7:1--7:13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.IPEC.2023.7},
doi = {10.4230/LIPICS.IPEC.2023.7},
timestamp = {Wed, 21 Aug 2024 22:46:00 +0200},
biburl = {https://dblp.org/rec/conf/iwpec/BodlaenderBJKLM23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/waw/DvorakKS23,
author = {Michal Dvor{\'{a}}k and
Dusan Knop and
Simon Schierreich},
editor = {Megan Dewar and
Pawel Pralat and
Przemyslaw Szufel and
Fran{\c{c}}ois Th{\'{e}}berge and
Malgorzata Wrzosek},
title = {Establishing Herd Immunity is Hard Even in Simple Geometric Networks},
booktitle = {Algorithms and Models for the Web Graph - 18th International Workshop,
{WAW} 2023, Toronto, ON, Canada, May 23-26, 2023, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {13894},
pages = {68--82},
publisher = {Springer},
year = {2023},
url = {https://doi.org/10.1007/978-3-031-32296-9\_5},
doi = {10.1007/978-3-031-32296-9\_5},
timestamp = {Fri, 02 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/waw/DvorakKS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:journals/corr/abs-2307-05061,
author = {Robert Ganian and
Thekla Hamm and
Dusan Knop and
Sanjukta Roy and
Simon Schierreich and
Ondrej Such{\'{y}}},
editor = {Rineke Verbrugge},
title = {Maximizing Social Welfare in Score-Based Social Distance Games},
booktitle = {Proceedings Nineteenth conference on Theoretical Aspects of Rationality
and Knowledge, {TARK} 2023, Oxford, United Kingdom, 28-30th June 2023},
series = {{EPTCS}},
volume = {379},
pages = {272--286},
year = {2023},
url = {https://doi.org/10.4204/EPTCS.379.22},
doi = {10.4204/EPTCS.379.22},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2307-05061.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2301-10031,
author = {Hans L. Bodlaender and
{\'{E}}douard Bonnet and
Lars Jaffke and
Dusan Knop and
Paloma T. Lima and
Martin Milanic and
Sebastian Ordyniak and
Sukanya Pandey and
Ondrej Such{\'{y}}},
title = {Treewidth is NP-Complete on Cubic Graphs (and related results)},
journal = {CoRR},
volume = {abs/2301.10031},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2301.10031},
doi = {10.48550/ARXIV.2301.10031},
eprinttype = {arXiv},
eprint = {2301.10031},
timestamp = {Thu, 26 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2301-10031.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2302-13997,
author = {Dusan Knop and
Simon Schierreich},
title = {Host Community Respecting Refugee Housing},
journal = {CoRR},
volume = {abs/2302.13997},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2302.13997},
doi = {10.48550/ARXIV.2302.13997},
eprinttype = {arXiv},
eprint = {2302.13997},
timestamp = {Tue, 28 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2302-13997.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2307-06976,
author = {Michal Dvor{\'{a}}k and
Dusan Knop and
Simon Schierreich},
title = {Establishing Herd Immunity is Hard Even in Simple Geometric Networks},
journal = {CoRR},
volume = {abs/2307.06976},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2307.06976},
doi = {10.48550/ARXIV.2307.06976},
eprinttype = {arXiv},
eprint = {2307.06976},
timestamp = {Mon, 24 Jul 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2307-06976.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2312-07632,
author = {Robert Ganian and
Thekla Hamm and
Dusan Knop and
Sanjukta Roy and
Simon Schierreich and
Ondrej Such{\'{y}}},
title = {Maximizing Social Welfare in Score-Based Social Distance Games},
journal = {CoRR},
volume = {abs/2312.07632},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2312.07632},
doi = {10.48550/ARXIV.2312.07632},
eprinttype = {arXiv},
eprint = {2312.07632},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2312-07632.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2312-09646,
author = {Foivos Fioravantes and
Dusan Knop and
Jan Maty{\'{a}}s Kristan and
Nikolaos Melissinos and
Michal Opler},
title = {Exact Algorithms and Lowerbounds for Multiagent Pathfinding: Power
of Treelike Topology},
journal = {CoRR},
volume = {abs/2312.09646},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2312.09646},
doi = {10.48550/ARXIV.2312.09646},
eprinttype = {arXiv},
eprint = {2312.09646},
timestamp = {Tue, 09 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2312-09646.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/disopt/GavenciakKK22,
author = {Tomas Gavenciak and
Martin Kouteck{\'{y}} and
Dusan Knop},
title = {Integer programming in parameterized complexity: Five miniatures},
journal = {Discret. Optim.},
volume = {44},
number = {Part},
pages = {100596},
year = {2022},
url = {https://doi.org/10.1016/j.disopt.2020.100596},
doi = {10.1016/J.DISOPT.2020.100596},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/disopt/GavenciakKK22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/BredereckHKN22,
author = {Robert Bredereck and
Klaus Heeger and
Dusan Knop and
Rolf Niedermeier},
title = {Parameterized complexity of stable roommates with ties and incomplete
lists through the lens of graph parameters},
journal = {Inf. Comput.},
volume = {289},
number = {Part},
pages = {104943},
year = {2022},
url = {https://doi.org/10.1016/j.ic.2022.104943},
doi = {10.1016/J.IC.2022.104943},
timestamp = {Mon, 05 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iandc/BredereckHKN22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/BentertHK22,
author = {Matthias Bentert and
Klaus Heeger and
Dusan Knop},
title = {Length-bounded cuts: Proper interval graphs and structural parameters},
journal = {J. Comput. Syst. Sci.},
volume = {126},
pages = {21--43},
year = {2022},
url = {https://doi.org/10.1016/j.jcss.2021.12.002},
doi = {10.1016/J.JCSS.2021.12.002},
timestamp = {Fri, 13 May 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jcss/BentertHK22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/DvorakKT22,
author = {Pavel Dvor{\'{a}}k and
Dusan Knop and
Tom{\'{a}}s Toufar},
title = {Target Set Selection in Dense Graph Classes},
journal = {{SIAM} J. Discret. Math.},
volume = {36},
number = {1},
pages = {536--572},
year = {2022},
url = {https://doi.org/10.1137/20m1337624},
doi = {10.1137/20M1337624},
timestamp = {Wed, 07 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamdm/DvorakKT22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aaai/GanianHKSS22,
author = {Robert Ganian and
Thekla Hamm and
Dusan Knop and
Simon Schierreich and
Ondrej Such{\'{y}}},
title = {Hedonic Diversity Games: {A} Complexity Picture with More than Two
Colors},
booktitle = {Thirty-Sixth {AAAI} Conference on Artificial Intelligence, {AAAI}
2022, Thirty-Fourth Conference on Innovative Applications of Artificial
Intelligence, {IAAI} 2022, The Twelveth Symposium on Educational Advances
in Artificial Intelligence, {EAAI} 2022 Virtual Event, February 22
- March 1, 2022},
pages = {5034--5042},
publisher = {{AAAI} Press},
year = {2022},
url = {https://doi.org/10.1609/aaai.v36i5.20435},
doi = {10.1609/AAAI.V36I5.20435},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/aaai/GanianHKSS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aaai/BlazejKS22,
author = {V{\'{a}}clav Blazej and
Dusan Knop and
Simon Schierreich},
title = {Controlling the Spread of Two Secrets in Diverse Social Networks (Student
Abstract)},
booktitle = {Thirty-Sixth {AAAI} Conference on Artificial Intelligence, {AAAI}
2022, Thirty-Fourth Conference on Innovative Applications of Artificial
Intelligence, {IAAI} 2022, The Twelveth Symposium on Educational Advances
in Artificial Intelligence, {EAAI} 2022 Virtual Event, February 22
- March 1, 2022},
pages = {12919--12920},
publisher = {{AAAI} Press},
year = {2022},
url = {https://doi.org/10.1609/aaai.v36i11.21596},
doi = {10.1609/AAAI.V36I11.21596},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/aaai/BlazejKS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aaai/KnopSS22,
author = {Dusan Knop and
Simon Schierreich and
Ondrej Such{\'{y}}},
title = {Balancing the Spread of Two Opinions in Sparse Social Networks (Student
Abstract)},
booktitle = {Thirty-Sixth {AAAI} Conference on Artificial Intelligence, {AAAI}
2022, Thirty-Fourth Conference on Innovative Applications of Artificial
Intelligence, {IAAI} 2022, The Twelveth Symposium on Educational Advances
in Artificial Intelligence, {EAAI} 2022 Virtual Event, February 22
- March 1, 2022},
pages = {12987--12988},
publisher = {{AAAI} Press},
year = {2022},
url = {https://doi.org/10.1609/aaai.v36i11.21630},
doi = {10.1609/AAAI.V36I11.21630},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/aaai/KnopSS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/atal/BoehmerBHK022,
author = {Niclas Boehmer and
Robert Bredereck and
Klaus Heeger and
Dusan Knop and
Junjie Luo},
editor = {Piotr Faliszewski and
Viviana Mascardi and
Catherine Pelachaud and
Matthew E. Taylor},
title = {Multivariate Algorithmics for Eliminating Envy by Donating Goods},
booktitle = {21st International Conference on Autonomous Agents and Multiagent
Systems, {AAMAS} 2022, Auckland, New Zealand, May 9-13, 2022},
pages = {127--135},
publisher = {International Foundation for Autonomous Agents and Multiagent Systems
{(IFAAMAS)}},
year = {2022},
url = {https://www.ifaamas.org/Proceedings/aamas2022/pdfs/p127.pdf},
doi = {10.5555/3535850.3535866},
timestamp = {Mon, 18 Jul 2022 17:13:00 +0200},
biburl = {https://dblp.org/rec/conf/atal/BoehmerBHK022.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/BlazejCKSSV22,
author = {V{\'{a}}clav Blazej and
Pratibha Choudhary and
Dusan Knop and
Simon Schierreich and
Ondrej Such{\'{y}} and
Tom{\'{a}}s Valla},
editor = {Shiri Chechik and
Gonzalo Navarro and
Eva Rotenberg and
Grzegorz Herman},
title = {On Polynomial Kernels for Traveling Salesperson Problem and Its Generalizations},
booktitle = {30th Annual European Symposium on Algorithms, {ESA} 2022, September
5-9, 2022, Berlin/Potsdam, Germany},
series = {LIPIcs},
volume = {244},
pages = {22:1--22:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.ESA.2022.22},
doi = {10.4230/LIPICS.ESA.2022.22},
timestamp = {Wed, 21 Aug 2024 22:46:00 +0200},
biburl = {https://dblp.org/rec/conf/esa/BlazejCKSSV22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/KnopK22,
author = {Dusan Knop and
Martin Kouteck{\'{y}}},
editor = {Shiri Chechik and
Gonzalo Navarro and
Eva Rotenberg and
Grzegorz Herman},
title = {Scheduling Kernels via Configuration {LP}},
booktitle = {30th Annual European Symposium on Algorithms, {ESA} 2022, September
5-9, 2022, Berlin/Potsdam, Germany},
series = {LIPIcs},
volume = {244},
pages = {73:1--73:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.ESA.2022.73},
doi = {10.4230/LIPICS.ESA.2022.73},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/esa/KnopK22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2202-01716,
author = {Niclas Boehmer and
Robert Bredereck and
Klaus Heeger and
Dusan Knop and
Junjie Luo},
title = {Multivariate Algorithmics for Eliminating Envy by Donating Goods},
journal = {CoRR},
volume = {abs/2202.01716},
year = {2022},
url = {https://arxiv.org/abs/2202.01716},
eprinttype = {arXiv},
eprint = {2202.01716},
timestamp = {Wed, 09 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2202-01716.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2202-09210,
author = {Robert Ganian and
Thekla Hamm and
Dusan Knop and
Simon Schierreich and
Ondrej Such{\'{y}}},
title = {Hedonic Diversity Games: {A} Complexity Picture with More than Two
Colors},
journal = {CoRR},
volume = {abs/2202.09210},
year = {2022},
url = {https://arxiv.org/abs/2202.09210},
eprinttype = {arXiv},
eprint = {2202.09210},
timestamp = {Tue, 01 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2202-09210.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2202-11927,
author = {V{\'{a}}clav Blazej and
Pratibha Choudhary and
Dusan Knop and
Jan Maty{\'{a}}s Kristan and
Ondrej Such{\'{y}} and
Tom{\'{a}}s Valla},
title = {Polynomial Kernels for Tracking Shortest Paths},
journal = {CoRR},
volume = {abs/2202.11927},
year = {2022},
url = {https://arxiv.org/abs/2202.11927},
eprinttype = {arXiv},
eprint = {2202.11927},
timestamp = {Wed, 02 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2202-11927.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2207-01109,
author = {V{\'{a}}clav Blazej and
Pratibha Choudhary and
Dusan Knop and
Simon Schierreich and
Ondrej Such{\'{y}} and
Tom{\'{a}}s Valla},
title = {On Polynomial Kernels for Traveling Salesperson Problem and its Generalizations},
journal = {CoRR},
volume = {abs/2207.01109},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2207.01109},
doi = {10.48550/ARXIV.2207.01109},
eprinttype = {arXiv},
eprint = {2207.01109},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2207-01109.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ai/DvorakEGKO21,
author = {Pavel Dvor{\'{a}}k and
Eduard Eiben and
Robert Ganian and
Dusan Knop and
Sebastian Ordyniak},
title = {The complexity landscape of decompositional parameters for {ILP:}
Programs with few global variables and constraints},
journal = {Artif. Intell.},
volume = {300},
pages = {103561},
year = {2021},
url = {https://doi.org/10.1016/j.artint.2021.103561},
doi = {10.1016/J.ARTINT.2021.103561},
timestamp = {Sat, 25 Dec 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ai/DvorakEGKO21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Knop21,
author = {Dusan Knop},
title = {Local linear set on graphs with bounded twin cover number},
journal = {Inf. Process. Lett.},
volume = {170},
pages = {106118},
year = {2021},
url = {https://doi.org/10.1016/j.ipl.2021.106118},
doi = {10.1016/J.IPL.2021.106118},
timestamp = {Tue, 15 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Knop21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/KnopKLMO21,
author = {Dusan Knop and
Martin Kouteck{\'{y}} and
Asaf Levin and
Matthias Mnich and
Shmuel Onn},
title = {Parameterized complexity of configuration integer programs},
journal = {Oper. Res. Lett.},
volume = {49},
number = {6},
pages = {908--913},
year = {2021},
url = {https://doi.org/10.1016/j.orl.2021.11.005},
doi = {10.1016/J.ORL.2021.11.005},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/orl/KnopKLMO21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/DvorakFKMTV21,
author = {Pavel Dvor{\'{a}}k and
Andreas Emil Feldmann and
Dusan Knop and
Tom{\'{a}}s Masar{\'{\i}}k and
Tom{\'{a}}s Toufar and
Pavel Vesel{\'{y}}},
title = {Parameterized Approximation Schemes for Steiner Trees with Small Number
of Steiner Vertices},
journal = {{SIAM} J. Discret. Math.},
volume = {35},
number = {1},
pages = {546--574},
year = {2021},
url = {https://doi.org/10.1137/18M1209489},
doi = {10.1137/18M1209489},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamdm/DvorakFKMTV21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/ChaplickFGKZ21,
author = {Steven Chaplick and
Fedor V. Fomin and
Petr A. Golovach and
Dusan Knop and
Peter Zeman},
title = {Kernelization of Graph Hamiltonicity: Proper H-Graphs},
journal = {{SIAM} J. Discret. Math.},
volume = {35},
number = {2},
pages = {840--892},
year = {2021},
url = {https://doi.org/10.1137/19M1299001},
doi = {10.1137/19M1299001},
timestamp = {Thu, 29 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/ChaplickFGKZ21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/KlavikKZ21,
author = {Pavel Klav{\'{\i}}k and
Dusan Knop and
Peter Zeman},
title = {Graph isomorphism restricted by lists},
journal = {Theor. Comput. Sci.},
volume = {860},
pages = {51--71},
year = {2021},
url = {https://doi.org/10.1016/j.tcs.2021.01.027},
doi = {10.1016/J.TCS.2021.01.027},
timestamp = {Fri, 14 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/KlavikKZ21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/atal/BredereckF0KN21,
author = {Robert Bredereck and
Aleksander Figiel and
Andrzej Kaczmarczyk and
Dusan Knop and
Rolf Niedermeier},
editor = {Frank Dignum and
Alessio Lomuscio and
Ulle Endriss and
Ann Now{\'{e}}},
title = {High-Multiplicity Fair Allocation Made More Practical},
booktitle = {{AAMAS} '21: 20th International Conference on Autonomous Agents and
Multiagent Systems, Virtual Event, United Kingdom, May 3-7, 2021},
pages = {260--268},
publisher = {{ACM}},
year = {2021},
url = {https://www.ifaamas.org/Proceedings/aamas2021/pdfs/p260.pdf},
doi = {10.5555/3463952.3463988},
timestamp = {Wed, 20 Jul 2022 17:03:47 +0200},
biburl = {https://dblp.org/rec/conf/atal/BredereckF0KN21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/waoa/BlazejCKKSV21,
author = {V{\'{a}}clav Blazej and
Pratibha Choudhary and
Dusan Knop and
Jan Maty{\'{a}}s Kristan and
Ondrej Such{\'{y}} and
Tom{\'{a}}s Valla},
editor = {Jochen K{\"{o}}nemann and
Britta Peis},
title = {Constant Factor Approximation for Tracking Paths and Fault Tolerant
Feedback Vertex Set},
booktitle = {Approximation and Online Algorithms - 19th International Workshop,
{WAOA} 2021, Lisbon, Portugal, September 6-10, 2021, Revised Selected
Papers},
series = {Lecture Notes in Computer Science},
volume = {12982},
pages = {23--38},
publisher = {Springer},
year = {2021},
url = {https://doi.org/10.1007/978-3-030-92702-8\_2},
doi = {10.1007/978-3-030-92702-8\_2},
timestamp = {Tue, 28 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/waoa/BlazejCKKSV21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2104-10124,
author = {Niclas Boehmer and
Robert Bredereck and
Dusan Knop and
Junjie Luo},
title = {Finding Small Multi-Demand Set Covers with Ubiquitous Elements and
Large Sets is Fixed-Parameter Tractable},
journal = {CoRR},
volume = {abs/2104.10124},
year = {2021},
url = {https://arxiv.org/abs/2104.10124},
eprinttype = {arXiv},
eprint = {2104.10124},
timestamp = {Wed, 11 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2104-10124.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2105-08376,
author = {Niclas Boehmer and
Robert Bredereck and
Dusan Knop and
Junjie Luo},
title = {Fine-Grained View on Bribery for Group Identification},
journal = {CoRR},
volume = {abs/2105.08376},
year = {2021},
url = {https://arxiv.org/abs/2105.08376},
eprinttype = {arXiv},
eprint = {2105.08376},
timestamp = {Wed, 11 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2105-08376.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2105-10184,
author = {Dusan Knop and
Simon Schierreich and
Ondrej Such{\'{y}}},
title = {Balancing the Spread of Two Opinions in Sparse Social Networks},
journal = {CoRR},
volume = {abs/2105.10184},
year = {2021},
url = {https://arxiv.org/abs/2105.10184},
eprinttype = {arXiv},
eprint = {2105.10184},
timestamp = {Mon, 31 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2105-10184.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2108-01430,
author = {V{\'{a}}clav Blazej and
Pratibha Choudhary and
Dusan Knop and
Jan Maty{\'{a}}s Kristan and
Ondrej Such{\'{y}} and
Tom{\'{a}}s Valla},
title = {Constant Factor Approximation for Tracking Paths and Fault Tolerant
Feedback Vertex Set},
journal = {CoRR},
volume = {abs/2108.01430},
year = {2021},
url = {https://arxiv.org/abs/2108.01430},
eprinttype = {arXiv},
eprint = {2108.01430},
timestamp = {Thu, 05 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2108-01430.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Knop20,
author = {Dusan Knop},
title = {Partitioning graphs into induced subgraphs},
journal = {Discret. Appl. Math.},
volume = {272},
pages = {31--42},
year = {2020},
url = {https://doi.org/10.1016/j.dam.2019.01.010},
doi = {10.1016/J.DAM.2019.01.010},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/Knop20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/KnopKM20,
author = {Dusan Knop and
Martin Kouteck{\'{y}} and
Matthias Mnich},
title = {Combinatorial n-fold integer programming and applications},
journal = {Math. Program.},
volume = {184},
number = {1},
pages = {1--34},
year = {2020},
url = {https://doi.org/10.1007/s10107-019-01402-2},
doi = {10.1007/S10107-019-01402-2},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mp/KnopKM20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/BulteauHKLV20,
author = {Laurent Bulteau and
Danny Hermelin and
Dusan Knop and
Anthony Labarre and
St{\'{e}}phane Vialette},
title = {The Clever Shopper Problem},
journal = {Theory Comput. Syst.},
volume = {64},
number = {1},
pages = {17--34},
year = {2020},
url = {https://doi.org/10.1007/s00224-019-09917-z},
doi = {10.1007/S00224-019-09917-Z},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/BulteauHKLV20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/teco/KnopKM20,
author = {Dusan Knop and
Martin Kouteck{\'{y}} and
Matthias Mnich},
title = {Voting and Bribing in Single-Exponential Time},
journal = {{ACM} Trans. Economics and Comput.},
volume = {8},
number = {3},
pages = {12:1--12:28},
year = {2020},
url = {https://doi.org/10.1145/3396855},
doi = {10.1145/3396855},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/teco/KnopKM20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toct/KnopPW20,
author = {Dusan Knop and
Michal Pilipczuk and
Marcin Wrochna},
title = {Tight Complexity Lower Bounds for Integer Linear Programming with
Few Constraints},
journal = {{ACM} Trans. Comput. Theory},
volume = {12},
number = {3},
pages = {19:1--19:19},
year = {2020},
url = {https://doi.org/10.1145/3397484},
doi = {10.1145/3397484},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/toct/KnopPW20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aaai/BredereckCKLN20,
author = {Robert Bredereck and
Jiehua Chen and
Dusan Knop and
Junjie Luo and
Rolf Niedermeier},
title = {Adapting Stable Matchings to Evolving Preferences},
booktitle = {The Thirty-Fourth {AAAI} Conference on Artificial Intelligence, {AAAI}
2020, The Thirty-Second Innovative Applications of Artificial Intelligence
Conference, {IAAI} 2020, The Tenth {AAAI} Symposium on Educational
Advances in Artificial Intelligence, {EAAI} 2020, New York, NY, USA,
February 7-12, 2020},
pages = {1830--1837},
publisher = {{AAAI} Press},
year = {2020},
url = {https://doi.org/10.1609/aaai.v34i02.5550},
doi = {10.1609/AAAI.V34I02.5550},
timestamp = {Mon, 04 Sep 2023 12:29:24 +0200},
biburl = {https://dblp.org/rec/conf/aaai/BredereckCKLN20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aaai/BredereckF0KN20,
author = {Robert Bredereck and
Piotr Faliszewski and
Andrzej Kaczmarczyk and
Dusan Knop and
Rolf Niedermeier},
title = {Parameterized Algorithms for Finding a Collective Set of Items},
booktitle = {The Thirty-Fourth {AAAI} Conference on Artificial Intelligence, {AAAI}
2020, The Thirty-Second Innovative Applications of Artificial Intelligence
Conference, {IAAI} 2020, The Tenth {AAAI} Symposium on Educational
Advances in Artificial Intelligence, {EAAI} 2020, New York, NY, USA,
February 7-12, 2020},
pages = {1838--1845},
publisher = {{AAAI} Press},
year = {2020},
url = {https://doi.org/10.1609/aaai.v34i02.5551},
doi = {10.1609/AAAI.V34I02.5551},
timestamp = {Fri, 08 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/aaai/BredereckF0KN20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ijcai/BoehmerBKL20,
author = {Niclas Boehmer and
Robert Bredereck and
Dusan Knop and
Junjie Luo},
editor = {Christian Bessiere},
title = {Fine-Grained View on Bribery for Group Identification},
booktitle = {Proceedings of the Twenty-Ninth International Joint Conference on
Artificial Intelligence, {IJCAI} 2020},
pages = {67--73},
publisher = {ijcai.org},
year = {2020},
url = {https://doi.org/10.24963/ijcai.2020/10},
doi = {10.24963/IJCAI.2020/10},
timestamp = {Wed, 11 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ijcai/BoehmerBKL20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/BentertHK20,
author = {Matthias Bentert and
Klaus Heeger and
Dusan Knop},
editor = {Yixin Cao and
Siu{-}Wing Cheng and
Minming Li},
title = {Length-Bounded Cuts: Proper Interval Graphs and Structural Parameters},
booktitle = {31st International Symposium on Algorithms and Computation, {ISAAC}
2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)},
series = {LIPIcs},
volume = {181},
pages = {36:1--36:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2020.36},
doi = {10.4230/LIPICS.ISAAC.2020.36},
timestamp = {Wed, 21 Aug 2024 22:46:00 +0200},
biburl = {https://dblp.org/rec/conf/isaac/BentertHK20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/ChaplickGHK20,
author = {Steven Chaplick and
Petr A. Golovach and
Tim A. Hartmann and
Dusan Knop},
editor = {Yixin Cao and
Marcin Pilipczuk},
title = {Recognizing Proper Tree-Graphs},
booktitle = {15th International Symposium on Parameterized and Exact Computation,
{IPEC} 2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)},
series = {LIPIcs},
volume = {180},
pages = {8:1--8:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.IPEC.2020.8},
doi = {10.4230/LIPICS.IPEC.2020.8},
timestamp = {Wed, 21 Aug 2024 22:46:00 +0200},
biburl = {https://dblp.org/rec/conf/iwpec/ChaplickGHK20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/HusekKM20,
author = {Radek Husek and
Dusan Knop and
Tom{\'{a}}s Masar{\'{\i}}k},
editor = {Yixin Cao and
Marcin Pilipczuk},
title = {Approximation Algorithms for Steiner Tree Based on Star Contractions:
{A} Unified View},
booktitle = {15th International Symposium on Parameterized and Exact Computation,
{IPEC} 2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)},
series = {LIPIcs},
volume = {180},
pages = {16:1--16:18},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.IPEC.2020.16},
doi = {10.4230/LIPICS.IPEC.2020.16},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/iwpec/HusekKM20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/KlavikKZ20,
author = {Pavel Klav{\'{\i}}k and
Dusan Knop and
Peter Zeman},
editor = {Isolde Adler and
Haiko M{\"{u}}ller},
title = {Graph Isomorphism Restricted by Lists},
booktitle = {Graph-Theoretic Concepts in Computer Science - 46th International
Workshop, {WG} 2020, Leeds, UK, June 24-26, 2020, Revised Selected
Papers},
series = {Lecture Notes in Computer Science},
volume = {12301},
pages = {106--118},
publisher = {Springer},
year = {2020},
url = {https://doi.org/10.1007/978-3-030-60440-0\_9},
doi = {10.1007/978-3-030-60440-0\_9},
timestamp = {Thu, 22 Oct 2020 11:34:57 +0200},
biburl = {https://dblp.org/rec/conf/wg/KlavikKZ20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wine/BredereckHKN20,
author = {Robert Bredereck and
Klaus Heeger and
Dusan Knop and
Rolf Niedermeier},
editor = {Xujin Chen and
Nikolai Gravin and
Martin Hoefer and
Ruta Mehta},
title = {Multidimensional Stable Roommates with Master List},
booktitle = {Web and Internet Economics - 16th International Conference, {WINE}
2020, Beijing, China, December 7-11, 2020, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {12495},
pages = {59--73},
publisher = {Springer},
year = {2020},
url = {https://doi.org/10.1007/978-3-030-64946-3\_5},
doi = {10.1007/978-3-030-64946-3\_5},
timestamp = {Fri, 26 Mar 2021 08:28:34 +0100},
biburl = {https://dblp.org/rec/conf/wine/BredereckHKN20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2002-03583,
author = {Radek Husek and
Dusan Knop and
Tom{\'{a}}s Masar{\'{\i}}k},
title = {Approximation Algorithms for Steiner Tree Based on Star Contractions:
{A} Unified View},
journal = {CoRR},
volume = {abs/2002.03583},
year = {2020},
url = {https://arxiv.org/abs/2002.03583},
eprinttype = {arXiv},
eprint = {2002.03583},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2002-03583.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2003-02187,
author = {Dusan Knop and
Martin Kouteck{\'{y}}},
title = {Scheduling Kernels via Configuration {LP}},
journal = {CoRR},
volume = {abs/2003.02187},
year = {2020},
url = {https://arxiv.org/abs/2003.02187},
eprinttype = {arXiv},
eprint = {2003.02187},
timestamp = {Tue, 10 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2003-02187.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2005-04907,
author = {Robert Bredereck and
Andrzej Kaczmarczyk and
Dusan Knop and
Rolf Niedermeier},
title = {High-Multiplicity Fair Allocation Using Parametric Integer Linear
Programming},
journal = {CoRR},
volume = {abs/2005.04907},
year = {2020},
url = {https://arxiv.org/abs/2005.04907},
eprinttype = {arXiv},
eprint = {2005.04907},
timestamp = {Thu, 14 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2005-04907.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2009-14191,
author = {Robert Bredereck and
Klaus Heeger and
Dusan Knop and
Rolf Niedermeier},
title = {Multidimensional Stable Roommates with Master List},
journal = {CoRR},
volume = {abs/2009.14191},
year = {2020},
url = {https://arxiv.org/abs/2009.14191},
eprinttype = {arXiv},
eprint = {2009.14191},
timestamp = {Wed, 30 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2009-14191.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2011-11670,
author = {Steven Chaplick and
Petr A. Golovach and
Tim A. Hartmann and
Dusan Knop},
title = {Recognizing Proper Tree-Graphs},
journal = {CoRR},
volume = {abs/2011.11670},
year = {2020},
url = {https://arxiv.org/abs/2011.11670},
eprinttype = {arXiv},
eprint = {2011.11670},
timestamp = {Thu, 26 Nov 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2011-11670.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2012-00079,
author = {Eduard Eiben and
Robert Ganian and
Dusan Knop and
Sebastian Ordyniak and
Michal Pilipczuk and
Marcin Wrochna},
title = {Integer Programming and Incidence Treedepth},
journal = {CoRR},
volume = {abs/2012.00079},
year = {2020},
url = {https://arxiv.org/abs/2012.00079},
eprinttype = {arXiv},
eprint = {2012.00079},
timestamp = {Fri, 04 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2012-00079.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/AltmanovaKK19,
author = {Katerina Altmanov{\'{a}} and
Dusan Knop and
Martin Kouteck{\'{y}}},
title = {Evaluating and Tuning \emph{n}-fold Integer Programming},
journal = {{ACM} J. Exp. Algorithmics},
volume = {24},
number = {1},
pages = {2.2:1--2.2:22},
year = {2019},
url = {https://doi.org/10.1145/3330137},
doi = {10.1145/3330137},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jea/AltmanovaKK19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/lmcs/KnopKMT19,
author = {Dusan Knop and
Martin Kouteck{\'{y}} and
Tom{\'{a}}s Masar{\'{\i}}k and
Tom{\'{a}}s Toufar},
title = {Simplified Algorithmic Metatheorems Beyond {MSO:} Treewidth and Neighborhood
Diversity},
journal = {Log. Methods Comput. Sci.},
volume = {15},
number = {4},
year = {2019},
url = {https://doi.org/10.23638/LMCS-15(4:12)2019},
doi = {10.23638/LMCS-15(4:12)2019},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/lmcs/KnopKMT19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aaai/EibenGKO19,
author = {Eduard Eiben and
Robert Ganian and
Dusan Knop and
Sebastian Ordyniak},
title = {Solving Integer Quadratic Programming via Explicit and Structural
Restrictions},
booktitle = {The Thirty-Third {AAAI} Conference on Artificial Intelligence, {AAAI}
2019, The Thirty-First Innovative Applications of Artificial Intelligence
Conference, {IAAI} 2019, The Ninth {AAAI} Symposium on Educational
Advances in Artificial Intelligence, {EAAI} 2019, Honolulu, Hawaii,
USA, January 27 - February 1, 2019},
pages = {1477--1484},
publisher = {{AAAI} Press},
year = {2019},
url = {https://doi.org/10.1609/aaai.v33i01.33011477},
doi = {10.1609/AAAI.V33I01.33011477},
timestamp = {Mon, 04 Sep 2023 12:29:24 +0200},
biburl = {https://dblp.org/rec/conf/aaai/EibenGKO19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ec/Bredereck0KN19,
author = {Robert Bredereck and
Andrzej Kaczmarczyk and
Dusan Knop and
Rolf Niedermeier},
editor = {Anna R. Karlin and
Nicole Immorlica and
Ramesh Johari},
title = {High-Multiplicity Fair Allocation: Lenstra Empowered by N-fold Integer
Programming},
booktitle = {Proceedings of the 2019 {ACM} Conference on Economics and Computation,
{EC} 2019, Phoenix, AZ, USA, June 24-28, 2019},
pages = {505--523},
publisher = {{ACM}},
year = {2019},
url = {https://doi.org/10.1145/3328526.3329649},
doi = {10.1145/3328526.3329649},
timestamp = {Thu, 04 Apr 2024 16:56:10 +0200},
biburl = {https://dblp.org/rec/conf/ec/Bredereck0KN19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipco/EibenGKOPW19,
author = {Eduard Eiben and
Robert Ganian and
Dusan Knop and
Sebastian Ordyniak and
Michal Pilipczuk and
Marcin Wrochna},
editor = {Andrea Lodi and
Viswanath Nagarajan},
title = {Integer Programming and Incidence Treedepth},
booktitle = {Integer Programming and Combinatorial Optimization - 20th International
Conference, {IPCO} 2019, Ann Arbor, MI, USA, May 22-24, 2019, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {11480},
pages = {194--204},
publisher = {Springer},
year = {2019},
url = {https://doi.org/10.1007/978-3-030-17953-3\_15},
doi = {10.1007/978-3-030-17953-3\_15},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/ipco/EibenGKOPW19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/BredereckHKN19,
author = {Robert Bredereck and
Klaus Heeger and
Dusan Knop and
Rolf Niedermeier},
editor = {Pinyan Lu and
Guochuan Zhang},
title = {Parameterized Complexity of Stable Roommates with Ties and Incomplete
Lists Through the Lens of Graph Parameters},
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 = {44:1--44:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2019.44},
doi = {10.4230/LIPICS.ISAAC.2019.44},
timestamp = {Wed, 21 Aug 2024 22:46:00 +0200},
biburl = {https://dblp.org/rec/conf/isaac/BredereckHKN19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/KnopMT19,
author = {Dusan Knop and
Tom{\'{a}}s Masar{\'{\i}}k and
Tom{\'{a}}s Toufar},
editor = {Peter Rossmanith and
Pinar Heggernes and
Joost{-}Pieter Katoen},
title = {Parameterized Complexity of Fair Vertex Evaluation Problems},
booktitle = {44th International Symposium on Mathematical Foundations of Computer
Science, {MFCS} 2019, August 26-30, 2019, Aachen, Germany},
series = {LIPIcs},
volume = {138},
pages = {33:1--33:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.MFCS.2019.33},
doi = {10.4230/LIPICS.MFCS.2019.33},
timestamp = {Wed, 21 Aug 2024 22:46:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/KnopMT19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/EibenKPS19,
author = {Eduard Eiben and
Dusan Knop and
Fahad Panolan and
Ondrej Such{\'{y}}},
editor = {Rolf Niedermeier and
Christophe Paul},
title = {Complexity of the Steiner Network Problem with Respect to the Number
of Terminals},
booktitle = {36th International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2019, March 13-16, 2019, Berlin, Germany},
series = {LIPIcs},
volume = {126},
pages = {25:1--25:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.STACS.2019.25},
doi = {10.4230/LIPICS.STACS.2019.25},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/stacs/EibenKPS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/KnopPW19,
author = {Dusan Knop and
Michal Pilipczuk and
Marcin Wrochna},
editor = {Rolf Niedermeier and
Christophe Paul},
title = {Tight Complexity Lower Bounds for Integer Linear Programming with
Few Constraints},
booktitle = {36th International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2019, March 13-16, 2019, Berlin, Germany},
series = {LIPIcs},
volume = {126},
pages = {44:1--44:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.STACS.2019.44},
doi = {10.4230/LIPICS.STACS.2019.44},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stacs/KnopPW19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/ChaplickFGK019,
author = {Steven Chaplick and
Fedor V. Fomin and
Petr A. Golovach and
Dusan Knop and
Peter Zeman},
editor = {Zachary Friggstad and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Mohammad R. Salavatipour},
title = {Kernelization of Graph Hamiltonicity: Proper H-Graphs},
booktitle = {Algorithms and Data Structures - 16th International Symposium, {WADS}
2019, Edmonton, AB, Canada, August 5-7, 2019, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {11646},
pages = {296--310},
publisher = {Springer},
year = {2019},
url = {https://doi.org/10.1007/978-3-030-24766-9\_22},
doi = {10.1007/978-3-030-24766-9\_22},
timestamp = {Mon, 15 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wads/ChaplickFGK019.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1907-01375,
author = {Robert Bredereck and
Jiehua Chen and
Dusan Knop and
Junjie Luo and
Rolf Niedermeier},
title = {Adapting Stable Matchings to Evolving Preferences},
journal = {CoRR},
volume = {abs/1907.01375},
year = {2019},
url = {http://arxiv.org/abs/1907.01375},
eprinttype = {arXiv},
eprint = {1907.01375},
timestamp = {Wed, 11 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1907-01375.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1909-07326,
author = {Dusan Knop and
Martin Kouteck{\'{y}} and
Asaf Levin and
Matthias Mnich and
Shmuel Onn},
title = {Multitype Integer Monoid Optimization and Applications},
journal = {CoRR},
volume = {abs/1909.07326},
year = {2019},
url = {http://arxiv.org/abs/1909.07326},
eprinttype = {arXiv},
eprint = {1909.07326},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1909-07326.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1910-03409,
author = {Matthias Bentert and
Klaus Heeger and
Dusan Knop},
title = {Length-Bounded Cuts: Proper Interval Graphs and Structural Parameters},
journal = {CoRR},
volume = {abs/1910.03409},
year = {2019},
url = {http://arxiv.org/abs/1910.03409},
eprinttype = {arXiv},
eprint = {1910.03409},
timestamp = {Wed, 09 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1910-03409.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1911-09379,
author = {Robert Bredereck and
Klaus Heeger and
Dusan Knop and
Rolf Niedermeier},
title = {Parameterized Complexity of Stable Roommates with Ties and Incomplete
Lists Through the Lens of Graph Parameters},
journal = {CoRR},
volume = {abs/1911.09379},
year = {2019},
url = {http://arxiv.org/abs/1911.09379},
eprinttype = {arXiv},
eprint = {1911.09379},
timestamp = {Tue, 03 Dec 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1911-09379.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/DvorakK18,
author = {Pavel Dvor{\'{a}}k and
Dusan Knop},
title = {Parameterized Complexity of Length-bounded Cuts and Multicuts},
journal = {Algorithmica},
volume = {80},
number = {12},
pages = {3597--3617},
year = {2018},
url = {https://doi.org/10.1007/s00453-018-0408-7},
doi = {10.1007/S00453-018-0408-7},
timestamp = {Wed, 25 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/DvorakK18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/KnopM18,
author = {Dusan Knop and
Tom{\'{a}}s Masar{\'{\i}}k},
title = {Computational complexity of distance edge labeling},
journal = {Discret. Appl. Math.},
volume = {246},
pages = {80--98},
year = {2018},
url = {https://doi.org/10.1016/j.dam.2017.01.007},
doi = {10.1016/J.DAM.2017.01.007},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/KnopM18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/FialaGKKK18,
author = {Jir{\'{\i}} Fiala and
Tomas Gavenciak and
Dusan Knop and
Martin Kouteck{\'{y}} and
Jan Kratochv{\'{\i}}l},
title = {Parameterized complexity of distance labeling and uniform channel
assignment problems},
journal = {Discret. Appl. Math.},
volume = {248},
pages = {46--55},
year = {2018},
url = {https://doi.org/10.1016/j.dam.2017.02.010},
doi = {10.1016/J.DAM.2017.02.010},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/FialaGKKK18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/scheduling/KnopK18,
author = {Dusan Knop and
Martin Kouteck{\'{y}}},
title = {Scheduling meets n-fold integer programming},
journal = {J. Sched.},
volume = {21},
number = {5},
pages = {493--503},
year = {2018},
url = {https://doi.org/10.1007/s10951-017-0550-0},
doi = {10.1007/S10951-017-0550-0},
timestamp = {Wed, 01 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/scheduling/KnopK18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/atal/KnopKM18,
author = {Dusan Knop and
Martin Kouteck{\'{y}} and
Matthias Mnich},
editor = {Elisabeth Andr{\'{e}} and
Sven Koenig and
Mehdi Dastani and
Gita Sukthankar},
title = {A Unifying Framework for Manipulation Problems},
booktitle = {Proceedings of the 17th International Conference on Autonomous Agents
and MultiAgent Systems, {AAMAS} 2018, Stockholm, Sweden, July 10-15,
2018},
pages = {256--264},
publisher = {International Foundation for Autonomous Agents and Multiagent Systems
Richland, SC, {USA} / {ACM}},
year = {2018},
url = {http://dl.acm.org/citation.cfm?id=3237427},
timestamp = {Sat, 30 Sep 2023 09:34:53 +0200},
biburl = {https://dblp.org/rec/conf/atal/KnopKM18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ijcai/EibenGKO18,
author = {Eduard Eiben and
Robert Ganian and
Dusan Knop and
Sebastian Ordyniak},
editor = {J{\'{e}}r{\^{o}}me Lang},
title = {Unary Integer Linear Programming with Structural Restrictions},
booktitle = {Proceedings of the Twenty-Seventh International Joint Conference on
Artificial Intelligence, {IJCAI} 2018, July 13-19, 2018, Stockholm,
Sweden},
pages = {1284--1290},
publisher = {ijcai.org},
year = {2018},
url = {https://doi.org/10.24963/ijcai.2018/179},
doi = {10.24963/IJCAI.2018/179},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ijcai/EibenGKO18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/DvorakKT18,
author = {Pavel Dvor{\'{a}}k and
Dusan Knop and
Tom{\'{a}}s Toufar},
editor = {Wen{-}Lian Hsu and
Der{-}Tsai Lee and
Chung{-}Shou Liao},
title = {Target Set Selection in Dense Graph Classes},
booktitle = {29th International Symposium on Algorithms and Computation, {ISAAC}
2018, December 16-19, 2018, Jiaoxi, Yilan, Taiwan},
series = {LIPIcs},
volume = {123},
pages = {18:1--18:13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2018.18},
doi = {10.4230/LIPICS.ISAAC.2018.18},
timestamp = {Wed, 07 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/isaac/DvorakKT18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/GavenciakKK18,
author = {Tomas Gavenciak and
Dusan Knop and
Martin Kouteck{\'{y}}},
editor = {Christophe Paul and
Michal Pilipczuk},
title = {Integer Programming in Parameterized Complexity: Three Miniatures},
booktitle = {13th International Symposium on Parameterized and Exact Computation,
{IPEC} 2018, August 20-24, 2018, Helsinki, Finland},
series = {LIPIcs},
volume = {115},
pages = {21:1--21:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.IPEC.2018.21},
doi = {10.4230/LIPICS.IPEC.2018.21},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/iwpec/GavenciakKK18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/DvorakFKMTV18,
author = {Pavel Dvor{\'{a}}k and
Andreas Emil Feldmann and
Dusan Knop and
Tom{\'{a}}s Masar{\'{\i}}k and
Tomas Toufar and
Pavel Vesel{\'{y}}},
editor = {Rolf Niedermeier and
Brigitte Vall{\'{e}}e},
title = {Parameterized Approximation Schemes for Steiner Trees with Small Number
of Steiner Vertices},
booktitle = {35th Symposium on Theoretical Aspects of Computer Science, {STACS}
2018, February 28 to March 3, 2018, Caen, France},
series = {LIPIcs},
volume = {96},
pages = {26:1--26:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.STACS.2018.26},
doi = {10.4230/LIPICS.STACS.2018.26},
timestamp = {Tue, 29 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stacs/DvorakFKMTV18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wea/AltmanovaKK18,
author = {Katerina Altmanov{\'{a}} and
Dusan Knop and
Martin Kouteck{\'{y}}},
editor = {Gianlorenzo D'Angelo},
title = {Evaluating and Tuning n-fold Integer Programming},
booktitle = {17th International Symposium on Experimental Algorithms, {SEA} 2018,
June 27-29, 2018, L'Aquila, Italy},
series = {LIPIcs},
volume = {103},
pages = {10:1--10:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.SEA.2018.10},
doi = {10.4230/LIPICS.SEA.2018.10},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/wea/AltmanovaKK18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1801-09584,
author = {Dusan Knop and
Martin Kouteck{\'{y}} and
Matthias Mnich},
title = {A Unifying Framework for Manipulation Problems},
journal = {CoRR},
volume = {abs/1801.09584},
year = {2018},
url = {http://arxiv.org/abs/1801.09584},
eprinttype = {arXiv},
eprint = {1801.09584},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1801-09584.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1802-08189,
author = {Eduard Eiben and
Dusan Knop and
Fahad Panolan and
Ondrej Such{\'{y}}},
title = {Complexity of the Steiner Network Problem with Respect to the Number
of Terminals},
journal = {CoRR},
volume = {abs/1802.08189},
year = {2018},
url = {http://arxiv.org/abs/1802.08189},
eprinttype = {arXiv},
eprint = {1802.08189},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1802-08189.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1802-09007,
author = {Katerina Altmanov{\'{a}} and
Dusan Knop and
Martin Kouteck{\'{y}}},
title = {Evaluating and Tuning n-fold Integer Programming},
journal = {CoRR},
volume = {abs/1802.09007},
year = {2018},
url = {http://arxiv.org/abs/1802.09007},
eprinttype = {arXiv},
eprint = {1802.09007},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1802-09007.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1803-06878,
author = {Dusan Knop and
Tom{\'{a}}s Masar{\'{\i}}k and
Tom{\'{a}}s Toufar},
title = {Parameterized complexity of fair deletion problems {II}},
journal = {CoRR},
volume = {abs/1803.06878},
year = {2018},
url = {http://arxiv.org/abs/1803.06878},
eprinttype = {arXiv},
eprint = {1803.06878},
timestamp = {Tue, 17 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1803-06878.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1811-01296,
author = {Dusan Knop and
Michal Pilipczuk and
Marcin Wrochna},
title = {Tight complexity lower bounds for integer linear programming with
few constraints},
journal = {CoRR},
volume = {abs/1811.01296},
year = {2018},
url = {http://arxiv.org/abs/1811.01296},
eprinttype = {arXiv},
eprint = {1811.01296},
timestamp = {Thu, 22 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1811-01296.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1812-01852,
author = {Dusan Knop and
Martin Kouteck{\'{y}} and
Matthias Mnich},
title = {Voting and Bribing in Single-Exponential Time},
journal = {CoRR},
volume = {abs/1812.01852},
year = {2018},
url = {http://arxiv.org/abs/1812.01852},
eprinttype = {arXiv},
eprint = {1812.01852},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1812-01852.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/FolwarcznyK17,
author = {Luk'av{s} Folwarczn'y and
Dusan Knop},
title = {IV-matching is strongly NP-hard},
journal = {Inf. Process. Lett.},
volume = {125},
pages = {5--8},
year = {2017},
url = {https://doi.org/10.1016/j.ipl.2017.04.014},
doi = {10.1016/J.IPL.2017.04.014},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/FolwarcznyK17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/KnopKM17,
author = {Dusan Knop and
Martin Kouteck{\'{y}} and
Matthias Mnich},
editor = {Kirk Pruhs and
Christian Sohler},
title = {Combinatorial n-fold Integer Programming and Applications},
booktitle = {25th Annual European Symposium on Algorithms, {ESA} 2017, September
4-6, 2017, Vienna, Austria},
series = {LIPIcs},
volume = {87},
pages = {54:1--54:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.ESA.2017.54},
doi = {10.4230/LIPICS.ESA.2017.54},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/esa/KnopKM17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ijcai/DvorakEGKO17,
author = {Pavel Dvor{\'{a}}k and
Eduard Eiben and
Robert Ganian and
Dusan Knop and
Sebastian Ordyniak},
editor = {Carles Sierra},
title = {Solving Integer Linear Programs with a Small Number of Global Variables
and Constraints},
booktitle = {Proceedings of the Twenty-Sixth International Joint Conference on
Artificial Intelligence, {IJCAI} 2017, Melbourne, Australia, August
19-25, 2017},
pages = {607--613},
publisher = {ijcai.org},
year = {2017},
url = {https://doi.org/10.24963/ijcai.2017/85},
doi = {10.24963/IJCAI.2017/85},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ijcai/DvorakEGKO17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/lata/Knop17,
author = {Dusan Knop},
editor = {Frank Drewes and
Carlos Mart{\'{\i}}n{-}Vide and
Bianca Truthe},
title = {Partitioning Graphs into Induced Subgraphs},
booktitle = {Language and Automata Theory and Applications - 11th International
Conference, {LATA} 2017, Ume{\aa}, Sweden, March 6-9, 2017, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10168},
pages = {338--350},
year = {2017},
url = {https://doi.org/10.1007/978-3-319-53733-7\_25},
doi = {10.1007/978-3-319-53733-7\_25},
timestamp = {Mon, 16 Sep 2019 15:27:03 +0200},
biburl = {https://dblp.org/rec/conf/lata/Knop17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/KnopKM17,
author = {Dusan Knop and
Martin Kouteck{\'{y}} and
Matthias Mnich},
editor = {Heribert Vollmer and
Brigitte Vall{\'{e}}e},
title = {Voting and Bribing in Single-Exponential Time},
booktitle = {34th Symposium on Theoretical Aspects of Computer Science, {STACS}
2017, March 8-11, 2017, Hannover, Germany},
series = {LIPIcs},
volume = {66},
pages = {46:1--46:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.STACS.2017.46},
doi = {10.4230/LIPICS.STACS.2017.46},
timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stacs/KnopKM17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/KnopKMT17,
author = {Dusan Knop and
Martin Kouteck{\'{y}} and
Tom{\'{a}}s Masar{\'{\i}}k and
Tom{\'{a}}s Toufar},
editor = {Hans L. Bodlaender and
Gerhard J. Woeginger},
title = {Simplified Algorithmic Metatheorems Beyond {MSO:} Treewidth and Neighborhood
Diversity},
booktitle = {Graph-Theoretic Concepts in Computer Science - 43rd International
Workshop, {WG} 2017, Eindhoven, The Netherlands, June 21-23, 2017,
Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {10520},
pages = {344--357},
publisher = {Springer},
year = {2017},
url = {https://doi.org/10.1007/978-3-319-68705-6\_26},
doi = {10.1007/978-3-319-68705-6\_26},
timestamp = {Mon, 15 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wg/KnopKMT17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/KnopKMT17,
author = {Dusan Knop and
Martin Kouteck{\'{y}} and
Tom{\'{a}}s Masar{\'{\i}}k and
Tom{\'{a}}s Toufar},
title = {Simplified Algorithmic Metatheorems Beyond {MSO:} Treewidth and Neighborhood
Diversity},
journal = {CoRR},
volume = {abs/1703.00544},
year = {2017},
url = {http://arxiv.org/abs/1703.00544},
eprinttype = {arXiv},
eprint = {1703.00544},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/KnopKMT17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/KnopKM17,
author = {Dusan Knop and
Martin Kouteck{\'{y}} and
Matthias Mnich},
title = {Combinatorial n-fold Integer Programming and Applications},
journal = {CoRR},
volume = {abs/1705.08657},
year = {2017},
url = {http://arxiv.org/abs/1705.08657},
eprinttype = {arXiv},
eprint = {1705.08657},
timestamp = {Sat, 23 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/KnopKM17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/DvorakEGKO17,
author = {Pavel Dvor{\'{a}}k and
Eduard Eiben and
Robert Ganian and
Dusan Knop and
Sebastian Ordyniak},
title = {Solving Integer Linear Programs with a Small Number of Global Variables
and Constraints},
journal = {CoRR},
volume = {abs/1706.06084},
year = {2017},
url = {http://arxiv.org/abs/1706.06084},
eprinttype = {arXiv},
eprint = {1706.06084},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/DvorakEGKO17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1710-00668,
author = {Pavel Dvor{\'{a}}k and
Andreas Emil Feldmann and
Dusan Knop and
Tom{\'{a}}s Masar{\'{\i}}k and
Tom{\'{a}}s Toufar and
Pavel Vesel{\'{y}}},
title = {Parameterized Approximation Schemes for Steiner Trees with Small Number
of Steiner Vertices},
journal = {CoRR},
volume = {abs/1710.00668},
year = {2017},
url = {http://arxiv.org/abs/1710.00668},
eprinttype = {arXiv},
eprint = {1710.00668},
timestamp = {Tue, 29 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1710-00668.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1711-02032,
author = {Tomas Gavenciak and
Dusan Knop and
Martin Kouteck{\'{y}}},
title = {Applying Convex Integer Programming: Sum Multicoloring and Bounded
Neighborhood Diversity},
journal = {CoRR},
volume = {abs/1711.02032},
year = {2017},
url = {http://arxiv.org/abs/1711.02032},
eprinttype = {arXiv},
eprint = {1711.02032},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1711-02032.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoon/FialaGKKK16,
author = {Jir{\'{\i}} Fiala and
Tomas Gavenciak and
Dusan Knop and
Martin Kouteck{\'{y}} and
Jan Kratochv{\'{\i}}l},
editor = {Thang N. Dinh and
My T. Thai},
title = {Fixed Parameter Complexity of Distance Constrained Labeling and Uniform
Channel Assignment Problems - (Extended Abstract)},
booktitle = {Computing and Combinatorics - 22nd International Conference, {COCOON}
2016, Ho Chi Minh City, Vietnam, August 2-4, 2016, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9797},
pages = {67--78},
publisher = {Springer},
year = {2016},
url = {https://doi.org/10.1007/978-3-319-42634-1\_6},
doi = {10.1007/978-3-319-42634-1\_6},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cocoon/FialaGKKK16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:journals/corr/DvorakKM16a,
author = {Pavel Dvor{\'{a}}k and
Dusan Knop and
Tom{\'{a}}s Masar{\'{\i}}k},
editor = {Jan Bouda and
Luk{\'{a}}s Hol{\'{\i}}k and
Jan Kofron and
Jan Strejcek and
Adam Rambousek},
title = {Anti-Path Cover on Sparse Graph Classes},
booktitle = {Proceedings 11th Doctoral Workshop on Mathematical and Engineering
Methods in Computer Science, {MEMICS} 2016, Tel{\v{c}}, Czech Republic,
21st-23rd October 2016},
series = {{EPTCS}},
volume = {233},
pages = {82--86},
year = {2016},
url = {https://doi.org/10.4204/EPTCS.233.8},
doi = {10.4204/EPTCS.233.8},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/DvorakKM16a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/KnopK16,
author = {Dusan Knop and
Martin Kouteck{\'{y}}},
title = {Scheduling meets n-fold Integer Programming},
journal = {CoRR},
volume = {abs/1603.02611},
year = {2016},
url = {http://arxiv.org/abs/1603.02611},
eprinttype = {arXiv},
eprint = {1603.02611},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/KnopK16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/KlavikKZ16,
author = {Pavel Klav{\'{\i}}k and
Dusan Knop and
Peter Zeman},
title = {Graph Isomorphism Restricted by Lists},
journal = {CoRR},
volume = {abs/1607.03918},
year = {2016},
url = {http://arxiv.org/abs/1607.03918},
eprinttype = {arXiv},
eprint = {1607.03918},
timestamp = {Thu, 23 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/KlavikKZ16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/DvorakKT16,
author = {Pavel Dvor{\'{a}}k and
Dusan Knop and
Tom{\'{a}}s Toufar},
title = {Target Set Selection in Dense Graph Classes},
journal = {CoRR},
volume = {abs/1610.07530},
year = {2016},
url = {http://arxiv.org/abs/1610.07530},
eprinttype = {arXiv},
eprint = {1610.07530},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/DvorakKT16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwoca/KnopM15,
author = {Dusan Knop and
Tom{\'{a}}s Masar{\'{\i}}k},
editor = {Zsuzsanna Lipt{\'{a}}k and
William F. Smyth},
title = {Computational Complexity of Distance Edge Labeling},
booktitle = {Combinatorial Algorithms - 26th International Workshop, {IWOCA} 2015,
Verona, Italy, October 5-7, 2015, Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {9538},
pages = {287--298},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-319-29516-9\_24},
doi = {10.1007/978-3-319-29516-9\_24},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/iwoca/KnopM15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/tamc/DvorakK15,
author = {Pavel Dvorak and
Dusan Knop},
editor = {Rahul Jain and
Sanjay Jain and
Frank Stephan},
title = {Parametrized Complexity of Length-Bounded Cuts and Multi-cuts},
booktitle = {Theory and Applications of Models of Computation - 12th Annual Conference,
{TAMC} 2015, Singapore, May 18-20, 2015, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9076},
pages = {441--452},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-319-17142-5\_37},
doi = {10.1007/978-3-319-17142-5\_37},
timestamp = {Mon, 16 Sep 2019 15:30:10 +0200},
biburl = {https://dblp.org/rec/conf/tamc/DvorakK15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/FolwarcznyK15,
author = {Luk'av{s} Folwarczn'y and
Dusan Knop},
title = {IV-matching is strongly NP-hard},
journal = {CoRR},
volume = {abs/1506.08388},
year = {2015},
url = {http://arxiv.org/abs/1506.08388},
eprinttype = {arXiv},
eprint = {1506.08388},
timestamp = {Wed, 24 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/FolwarcznyK15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/FialaGKKK15,
author = {Jir{\'{\i}} Fiala and
Tomas Gavenciak and
Dusan Knop and
Martin Kouteck{\'{y}} and
Jan Kratochv{\'{\i}}l},
title = {Distance constrained labeling on graphs with bounded neighborhood
diversity},
journal = {CoRR},
volume = {abs/1507.00640},
year = {2015},
url = {http://arxiv.org/abs/1507.00640},
eprinttype = {arXiv},
eprint = {1507.00640},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/FialaGKKK15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/KnopM15,
author = {Dusan Knop and
Tom{\'{a}}s Masar{\'{\i}}k},
title = {Computational complexity of distance edge labeling},
journal = {CoRR},
volume = {abs/1508.01014},
year = {2015},
url = {http://arxiv.org/abs/1508.01014},
eprinttype = {arXiv},
eprint = {1508.01014},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/KnopM15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/Knop15,
author = {Dusan Knop},
title = {A note on partition into triangles parametrized by tree-width},
journal = {CoRR},
volume = {abs/1508.04725},
year = {2015},
url = {http://arxiv.org/abs/1508.04725},
eprinttype = {arXiv},
eprint = {1508.04725},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/Knop15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/KnopD15,
author = {Dusan Knop and
Pavel Dvorak},
title = {Parameterized complexity of length-bounded cuts and multi-cuts},
journal = {CoRR},
volume = {abs/1511.02801},
year = {2015},
url = {http://arxiv.org/abs/1511.02801},
eprinttype = {arXiv},
eprint = {1511.02801},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/KnopD15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
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-09-19 00:33 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:
