Publications
Usually, the arXiv versions are kept up-to-date to reflect the most recent published state.
(Also have a look at my DBLP and Google Scholar pages)
Vamsi Addanki, Julien Dallot, Leon Kellerhals, Maciej Pacut, and Stefan Schmid
The Harmonic Policy for Online Buffer Sharing is (2+ln n)-Competitive: A Simple Proof
accepted to SOSA 2026 | arXiv (2025) | BibTeXBibTeX
The Harmonic Policy for Online Buffer Sharing is (2+ln n)-Competitive: A Simple Proof
accepted to SOSA 2026 | arXiv (2025) | BibTeXBibTeX
@article{addanki2025harmonic,
author = {Vamsi Addanki and Julien Dallot and Leon Kellerhals and Maciej Pacut and Stefan Schmid},
title = {The Harmonic Policy for Online Buffer Sharing is $(2+\ln n)$-Competitive: A Simple Proof},
year = {2025},
eprint = {2511.26514},
archivePrefix = {arXiv},
doi = {10.48550/arXiv.2511.26514},
url = {https://arxiv.org/abs/2511.26514},
}
Christian Wallisch, Till Fluschnik, and Leon Kellerhals
Placing Green Bridges Optimally, with Close-Range Habitats in Sparse Graphs
arXiv (2025) | BibTeXBibTeX
Placing Green Bridges Optimally, with Close-Range Habitats in Sparse Graphs
arXiv (2025) | BibTeXBibTeX
@article{wallisch2025placing,
author = {Christian Wallisch and Till Fluschnik and Leon Kellerhals},
title = {Placing Green Bridges Optimally, with Close-Range Habitats in Sparse Graphs},
year = {2025},
eprint = {2510.21540},
archivePrefix = {arXiv},
doi = {10.48550/arXiv.2510.21540},
url = {https://arxiv.org/abs/2510.21540},
}
Matthias Bentert, Robert Bredereck, Eva Deltl, Pallavi Jain, and Leon Kellerhals
How to Resolve Envy by Adding Goods
IJCAI 2025 | arXiv (2025) | BibTeXBibTeX
How to Resolve Envy by Adding Goods
IJCAI 2025 | arXiv (2025) | BibTeXBibTeX
@inproceedings{bentert2025resolve,
author = {Matthias Bentert and Robert Bredereck and Eva Deltl and Pallavi Jain and Leon Kellerhals},
title = {How to Resolve Envy by Adding Goods},
booktitle = {Proceedings of the 34th International Joint Conference on Artificial Intelligence (IJCAI)},
year = {2025},
pages = {3753--3761},
doi = {10.24963/ijcai.2025/417},
url = {https://doi.org/10.24963/ijcai.2025/417},
}
Leon Kellerhals and Jannik Peters
Proportional Clustering, the β-Plurality Problem, and Metric Distortion
arXiv (2025) | BibTeXBibTeX
Proportional Clustering, the β-Plurality Problem, and Metric Distortion
arXiv (2025) | BibTeXBibTeX
@article{kellerhals2025plurality,
author = {Leon Kellerhals and Jannik Peters},
title = {Proportional Clustering, the $\beta$-Plurality Problem, and Metric Distortion},
year = {2025},
eprint = {2502.10068},
archivePrefix = {arXiv},
doi = {10.48550/arXiv.2502.10068},
url = {https://arxiv.org/abs/2502.10068},
}
Leon Kellerhals and Jannik Peters
Proportional Fairness in Clustering: A Social Choice Perspective
NeurIPS 2024 | arXiv (2023) | BibTeXBibTeX
Proportional Fairness in Clustering: A Social Choice Perspective
NeurIPS 2024 | arXiv (2023) | BibTeXBibTeX
@inproceedings{kellerhals2024proportional,
author = {Leon Kellerhals and Jannik Peters},
booktitle = {Proceedings of the 38th Conference on Neural Information Processing Systems (NeurIPS)},
title = {Proportional Fairness in Clustering: A Social Choice Perspective},
year = {2024},
pages = {111299--111317},
url = {https://proceedings.neurips.cc/paper_files/paper/2024/hash/c981fd12b1d5703f19bd8289da9fc996-Abstract-Conference.html},
}
Till Fluschnik, Leon Kellerhals, and Malte Renken
Locally Rainbow Paths
AAAI 2024 | arXiv (2024) | BibTeXBibTeX
Locally Rainbow Paths
AAAI 2024 | arXiv (2024) | BibTeXBibTeX
@inproceedings{fluschnik2024locally,
title = {Locally Rainbow Paths},
author = {Till Fluschnik
and Leon Kellerhals
and Malte Renken},
year = {2024},
booktitle = {Proceedings of the 38th Conference on Artificial Intelligence (AAAI~'24)},
pages = {8013--8021},
url = {https://doi.org/10.1609/aaai.v38i8.28639},
doi = {10.1609/aaai.v38i8.28639},
}
Leon Kellerhals
Multivariate Complexity Analyses for Algorithmic Challenges in Fairness and Sustainability
Technische Universität Berlin (2023) | BibTeXBibTeX
Multivariate Complexity Analyses for Algorithmic Challenges in Fairness and Sustainability
Technische Universität Berlin (2023) | BibTeXBibTeX
@phdthesis{kellerhals2023multivariate,
title = {Multivariate Complexity Analyses for Algorithmic Challenges in Fairness and Sustainability},
author = {Leon Kellerhals},
year = {2023},
school = {Technische Universität Berlin},
type = {Doctoral Thesis},
address = {Berlin},
url = {https://doi.org/10.14279/depositonce-19670},
doi = {10.14279/depositonce-19670},
}
Lito Goldmann, Leon Kellerhals, and Tomohiro Koana
Structural Parameterizations of the Biclique-Free Deletion Problem
Discret. Math. Theor. Comput. Sci. (2024) | arXiv (2023) | BibTeXBibTeX
Structural Parameterizations of the Biclique-Free Deletion Problem
Discret. Math. Theor. Comput. Sci. (2024) | arXiv (2023) | BibTeXBibTeX
@misc{goldmann2023structural,
title = {Structural Parameterizations of the Biclique-Free Deletion Problem},
author = {Lito Goldmann
and Leon Kellerhals
and Tomohiro Koana},
year = {2023},
journal = {CoRR},
archivePrefix = {arXiv},
eprint = {2308.00501},
url = {https://doi.org/10.48550/arXiv.2308.00501},
doi = {10.48550/arXiv.2308.00501},
}
@article{goldmann2024structural,
author = {Lito Goldmann and
Leon Kellerhals and
Tomohiro Koana},
title = {Structural Parameterizations of the Biclique-Free Vertex Deletion
Problem},
journal = {Discrete Mathematics and Theoretical Computer Science},
volume = {26},
number = {3},
year = {2024},
url = {https://doi.org/10.46298/dmtcs.13018},
doi = {10.46298/DMTCS.13018},
}
Leon Kellerhals, Tomohiro Koana, Pascal Kunz, and Rolf Niedermeier
Parameterized Algorithms for Colored Clustering
AAAI 2023 | arXiv (2023) | BibTeXBibTeX
Parameterized Algorithms for Colored Clustering
AAAI 2023 | arXiv (2023) | BibTeXBibTeX
@inproceedings{kellerhals2023colored,
title = {Parameterized Algorithms for Colored Clustering},
author = {Leon Kellerhals
and Tomohiro Koana
and Pascal Kunz
and Rolf Niedermeier},
year = {2023},
booktitle = {Proceedings of the 37th Conference on Artificial Intelligence (AAAI~'23)},
pages = {4400--4408},
doi = {10.1609/aaai.v37i4.25560},
url = {https://doi.org/10.1609/aaai.v37i4.25560},
}
Matthias Bentert, Leon Kellerhals, and Rolf Niedermeier
The Structural Complexity Landscape of Finding Balance-Fair Shortest Paths
Theor. Comput. Sci. (2022) | arXiv (2024) | BibTeXBibTeX
The Structural Complexity Landscape of Finding Balance-Fair Shortest Paths
Theor. Comput. Sci. (2022) | arXiv (2024) | BibTeXBibTeX
@article{bentert2022structural,
title = {The Structural Complexity Landscape of Finding Balance-Fair Shortest Paths},
author = {Matthias Bentert
and Leon Kellerhals
and Rolf Niedermeier},
year = {2022},
journal = {Theoretical Computer Science},
doi = {10.1016/j.tcs.2022.08.023},
}
Robert Bredereck, Anne-Marie George, Jonas Israel, and Leon Kellerhals
Single-Peaked Opinion Updates
IJCAI 2022 | arXiv (2022) | BibTeXBibTeX
Single-Peaked Opinion Updates
IJCAI 2022 | arXiv (2022) | BibTeXBibTeX
@inproceedings{bredereck2022single,
title = {Single-Peaked Opinion Updates},
author = {Robert Bredereck
and Anne-Marie George
and Jonas Israel
and Leon Kellerhals},
year = {2022},
booktitle = {Proceedings of the 31st International Joint Conference on Artificial Intelligence (IJCAI '22)},
pages = {137--143},
doi = {10.24963/ijcai.2022/20},
}
Matthias Bentert, Leon Kellerhals, and Rolf Niedermeier
Fair Short Paths in Vertex-Colored Graphs
AAAI 2023 | arXiv (2022) | BibTeXBibTeX
Fair Short Paths in Vertex-Colored Graphs
AAAI 2023 | arXiv (2022) | BibTeXBibTeX
@article{bentert2022finding,
title = {Fair Short Paths in Vertex-Colored Graphs},
author = {Matthias Bentert
and Leon Kellerhals
and Rolf Niedermeier},
year = {2022},
pages ={12346--12354},
url = {https://doi.org/10.1609/aaai.v37i10.26455},
doi = {10.1609/aaai.v37i10.26455},
}
Leon Kellerhals, Tomohiro Koana, and Pascal Kunz
Vertex Cover and Feedback Vertex Set Above and Below Structural Guarantees
IPEC 2022 | arXiv (2022) | BibTeXBibTeX
Vertex Cover and Feedback Vertex Set Above and Below Structural Guarantees
IPEC 2022 | arXiv (2022) | BibTeXBibTeX
@inproceedings{kellerhals2022vertex,
title = {Vertex Cover and Feedback Vertex Set Above and Below Structural Guarantees},
author = {Tomohiro Koana
and Leon Kellerhals
and Pascal Kunz},
booktitle = {Proceedings of the 17th International Symposium on Parameterized and Exact Computation},
volume = {249},
pages = {19:1--19:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
doi = {10.4230/LIPIcs.IPEC.2022.19},
url = {https://doi.org/10.4230/LIPIcs.IPEC.2022.19},
}
Maike Herkenrath, Till Fluschnik, Francesco Grothe, and Leon Kellerhals
Placing Green Bridges Optimally, with Habitats Inducing Cycles
IJCAI 2022 | arXiv (2022) | BibTeXBibTeX
Placing Green Bridges Optimally, with Habitats Inducing Cycles
IJCAI 2022 | arXiv (2022) | BibTeXBibTeX
@inproceedings{herkenrath2022placing,
title = {Placing Green Bridges Optimally, with Habitats Inducing Cycles},
author = {Maike Herkenrath
and Till Fluschnik
and Francesco Grothe
and Leon Kellerhals},
year = {2022},
booktitle = {Proceedings of the 31st International Joint Conference on Artificial Intelligence (IJCAI '22)},
pages = {3825--3831},
doi = {10.24963/ijcai.2022/531},
}
Vincent Froese, Leon Kellerhals, and Rolf Niedermeier
Modification-Fair Cluster Editing
Soc. Netw. Anal. Min. (2024) | AAAI 2022 | arXiv (2021) | BibTeXBibTeX
Modification-Fair Cluster Editing
Soc. Netw. Anal. Min. (2024) | AAAI 2022 | arXiv (2021) | BibTeXBibTeX
@article{froese2024modification,
title = {Modification-Fair Cluster Editing},
author = {Vincent Froese
and Leon Kellerhals
and Rolf Niedermeier}},
journal = {Social Network Analysis and Mining},
volume = {14},
number = {1},
pages = {109},
year = {2024},
url = {https://doi.org/10.1007/s13278-024-01259-0},
doi = {10.1007/s13278-024-01259-0},
}
Leon Kellerhals, Malte Renken, and Philipp Zschoche
Parameterized Algorithms for Diverse Multistage Problems
ESA 2021 | arXiv (2021) | BibTeXBibTeX
Parameterized Algorithms for Diverse Multistage Problems
ESA 2021 | arXiv (2021) | BibTeXBibTeX
@inproceedings{kellerhals2021parameterized,
title = {Parameterized Algorithms for Diverse Multistage Problems},
author = {Leon Kellerhals
and Malte Renken
and Philipp Zschoche},
booktitle = {Proceedings of the 29th Annual European Symposium on Algorithms (ESA~'21)},
year = {2021},
volume = {204},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
doi = {10.4230/LIPIcs.ESA.2021.55},
}
Alexander Figiel, Leon Kellerhals, Rolf Niedermeier, Matthias Rost, Stefan Schmid, and Philipp Zschoche
Optimal Virtual Network Embeddings for Tree Topologies
SPAA 2021 | arXiv (2021) | BibTeXBibTeX
Optimal Virtual Network Embeddings for Tree Topologies
SPAA 2021 | arXiv (2021) | BibTeXBibTeX
@inproceedings{figiel2021virtual,
title = {Optimal Virtual Network Embeddings for Tree Topologies},
author = {Alexander Figiel
and Leon Kellerhals
and Rolf Niedermeier
and Matthias Rost
and Stefan Schmid
and Philipp Zschoche},
year = {2021},
booktitle= {Proceedings of the 33rd {ACM} Symposium on Parallelism in Algorithms and Architechtures (SPAA~'21)},
pages = {221--231},
publisher = {{ACM}},
doi = {10.1145/3409964.3461787},
}
Till Fluschnik and Leon Kellerhals
Placing Green Bridges Optimally, with a Multivariate Analysis
Theory Comput. Syst. (2024) | CiE 2021 | arXiv (2021) | BibTeXBibTeX
Placing Green Bridges Optimally, with a Multivariate Analysis
Theory Comput. Syst. (2024) | CiE 2021 | arXiv (2021) | BibTeXBibTeX
@article{fluschnik2024placing,
title = {Placing Green Bridges Optimally, with a Multivariate Analysis},
author = {Till Fluschnik
and Leon Kellerhals},
year = {2024},
journal = {Theory of Computing Systems},
doi = {10.1007/s00224-023-10157-5},
url = {https://doi.org/10.1007/s00224-023-10157-5},
}
Ran Yaacoby, Nathan Schaar, Leon Kellerhals, Oren Raz, Danny Hermelin, and Rami Pugatch
Comparison between a quantum annealer and a classical approximation algorithm for computing the ground state of an Ising spin glass
Phys. Rev. E (2022) | arXiv (2021) | BibTeXBibTeX
Comparison between a quantum annealer and a classical approximation algorithm for computing the ground state of an Ising spin glass
Phys. Rev. E (2022) | arXiv (2021) | BibTeXBibTeX
@article{yacooby2022comparison,
title = {Comparison between a quantum annealer and a classical approximation algorithm for computing the ground state of an Ising spin glass},
author = {Ran Yaacoby
and Nathan Schaar
and Leon Kellerhals
and Oren Raz
and Danny Hermelin
and Rami Pugatch},
journal = {Phys. Rev. E},
volume = {105},
issue = {3},
year = {2022},
publisher = {American Physical Society},
doi = {10.1103/PhysRevE.105.035305},
}
Leon Kellerhals, Tomohiro Koana, André Nichterlein, and Philipp Zschoche
The PACE 2021 Parameterized Algorithms and Computational Experiments Challenge: Cluster Editing
IPEC 2021 | BibTeXBibTeX
The PACE 2021 Parameterized Algorithms and Computational Experiments Challenge: Cluster Editing
IPEC 2021 | BibTeXBibTeX
@inproceedings{kellerhals2021pace,
title = {The PACE 2021 Parameterized Algorithms and Computational Experiments Challenge: Cluster Editing},
author = {Leon Kellerhals
and Tomohiro Koana
and Andr{\'{e}} Nichterlein
and Philipp Zschoche},
booktitle = {Proceedings of the 16th International Symposium on Parameterized and Exact Computation (IPEC~'21)},
year = {2021},
volume = {214},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
doi = {10.4230/LIPIcs.IPEC.2021.26},
}
Danny Hermelin, Leon Kellerhals, Rolf Niedermeier, and Rami Pugatch
Approximating Sparse Quadratic Programs
Theor. Comput. Sci. (2024) | arXiv (2020) | BibTeXBibTeX
Approximating Sparse Quadratic Programs
Theor. Comput. Sci. (2024) | arXiv (2020) | BibTeXBibTeX
@article{hermelin2020approximating,
title = {Approximating Sparse Quadratic Programs},
author = {Danny Hermelin
and Leon Kellerhals
and Rolf Niedermeier
and Rami Pugatch},
journal = {Theoretical Computer Science},
volume = {984},
pages = {114319},
year = {2024},
doi = {10.1016/j.tcs.2023.114319},
}
Robert Bredereck, Lilian Jacobs, and Leon Kellerhals
Maximizing the Spread of an Opinion in Few Steps: Opinion Diffusion in Non-Binary Networks
IJCAI 2020 | BibTeXBibTeX
Maximizing the Spread of an Opinion in Few Steps: Opinion Diffusion in Non-Binary Networks
IJCAI 2020 | BibTeXBibTeX
@inproceedings{bredereck2020maximizing,
title = {Maximizing the Spread of an Opinion in Few Steps: Opinion Diffusion in Non-Binary Networks},
author = {Robert Bredereck
and Lilian Jacobs
and Leon Kellerhals},
booktitle = {Proceedings of the 29th International Joint Conference on Artificial Intelligence (IJCAI '20)},
pages = {1622--1628},
publisher = {ijcai.org},
year = {2020},
}
Leon Kellerhals and Tomohiro Koana
Parameterized Complexity of Geodetic Set
J. Graph Algorithms Appl. (2022) | IPEC (2020) | arXiv (2020) | BibTeXBibTeX
Parameterized Complexity of Geodetic Set
J. Graph Algorithms Appl. (2022) | IPEC (2020) | arXiv (2020) | BibTeXBibTeX
@article{kellerhals2022parameterized,
title = {Parameterized Complexity of Geodetic Set},
author = {Leon Kellerhals
and Tomohiro Koana},
journal = {Journal of Graph Algorithms and Applications},
volume = {26},
number = {4},
pages = {401--419},
year = {2022},
doi = {10.7155/jgaa.00601},
}
Matthias Bentert, Alexander Dittmann, Leon Kellerhals, André Nichterlein, and Rolf Niedermeier
An Adaptive Version of Brandes' Algorithm for Betweenness Centrality
J. Graph Algorithms Appl. (2020) | ISAAC (2018) | arXiv (2018) | BibTeXBibTeX
An Adaptive Version of Brandes' Algorithm for Betweenness Centrality
J. Graph Algorithms Appl. (2020) | ISAAC (2018) | arXiv (2018) | BibTeXBibTeX
@article{bentert2020adaptive,
title = {An Adaptive Version of Brandes' Algorithm for Betweenness Centrality},
author = {Matthias Bentert and Alexander Dittmann and Leon Kellerhals
and Andr{\'e} Nichterlein and Rolf Niedermeier},
journal = {Journal of Graph Algorithms and Applications},
volume={24},
number={3},
pages={483--522},
year = {2020},
}
Leon Kellerhals
Parameterized Algorithms for Network Flows
Master's Thesis (2018) | BibTeXBibTeX
Parameterized Algorithms for Network Flows
Master's Thesis (2018) | BibTeXBibTeX
@mastersthesis{kellerhals2018parameterized,
title = {Parameterized Algorithms for Network Flows},
author = {Leon Kellerhals},
year = {2018},
school = {TU Berlin},
note = {Master's thesis},
url = {https://fpt.akt.tu-berlin.de/publications/thesis/MA-leon-kellerhals.pdf},
}
Leon Kellerhals, Viatcheslav Korenwein, Philipp Zschoche, Robert Bredereck, and Jiehua Chen
On the Computational Complexity of Variants of Combinatorial Voter Control in Elections
TAMC 2017 | arXiv (2017) | BibTeXBibTeX
On the Computational Complexity of Variants of Combinatorial Voter Control in Elections
TAMC 2017 | arXiv (2017) | BibTeXBibTeX
@inproceedings{kellerhals2017computational,
title = {On the Computational Complexity of Variants of
Combinatorial Voter Control in Elections},
author = {Leon Kellerhals and Viatcheslav Korenwein and
Philipp Zschoche and Robert Bredereck and Jiehua Chen},
booktitle = {Proceedings of the 14th Conference on Theory and
Applications of Models of Computation ({TAMC}~'17)},
pages = {348--361},
year = {2017},
url = {https://link.springer.com/chapter/10.1007%2F978-3-319-55911-7_25,
https://arxiv.org/abs/1701.05108},
}
Leon Kellerhals
Optimierung der Suche von “Looping GIFs” aus beliebigen Videodateien mit einem Evolutionären Algorithmus
Bachelor's Thesis
Optimierung der Suche von “Looping GIFs” aus beliebigen Videodateien mit einem Evolutionären Algorithmus
Bachelor's Thesis
