Leon Kellerhals

According to our database, Leon Kellerhals authored at least 28 papers between 2017 and 2026.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2026

Designing Approximate Binary Trees for Trees.

Leon Kellerhals, Mitja Krebs, André Nichterlein, Stefan Schmid

CoRR, April, 2026

Proportional clustering, the β-plurality problem, and metric distortion.

Leon Kellerhals, Jannik Peters

Oper. Res. Lett., 2026

The Harmonic Policy for Online Buffer Sharing is (2 + ln n)-Competitive: A Simple Proof.

Vamsi Addanki, Julien Dallot, Leon Kellerhals, Maciej Pacut, Stefan Schmid

Proceedings of the 2026 Symposium on Simplicity in Algorithms, 2026

2025

The Core in Max-Loss Non-Centroid Clustering Can Be Empty.

Robert Bredereck, Eva Michelle Deltl, Leon Kellerhals, Jannik Peters

CoRR, November, 2025

Placing Green Bridges Optimally, with Close-Range Habitats in Sparse Graphs.

Christian Wallisch, Till Fluschnik, Leon Kellerhals

CoRR, October, 2025

How to Resolve Envy by Adding Goods.

Matthias Bentert, Robert Bredereck, Eva Michelle Deltl, Pallavi Jain, Leon Kellerhals

Proceedings of the Thirty-Fourth International Joint Conference on Artificial Intelligence, 2025

2024

Approximating sparse quadratic programs.

Danny Hermelin, Leon Kellerhals, Rolf Niedermeier, Rami Pugatch

Theor. Comput. Sci., February, 2024

Multivariate complexity analyses for algorithmic challenges in fairness and sustainability.

Leon Kellerhals

PhD thesis, 2024

Structural Parameterizations of the Biclique-Free Vertex Deletion Problem.

Lito Goldmann, Leon Kellerhals, Tomohiro Koana

Discret. Math. Theor. Comput. Sci., 2024

Proportional Fairness in Clustering: A Social Choice Perspective.

Leon Kellerhals, Jannik Peters

Proceedings of the Advances in Neural Information Processing Systems 37: Annual Conference on Neural Information Processing Systems 2024, 2024

Locally Rainbow Paths.

Till Fluschnik, Leon Kellerhals, Malte Renken

Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

2023

Parameterized Algorithms for Colored Clustering.

Leon Kellerhals, Tomohiro Koana, Pascal Kunz, Rolf Niedermeier

Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

Fair Short Paths in Vertex-Colored Graphs.

Matthias Bentert, Leon Kellerhals, Rolf Niedermeier

Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

2022

The structural complexity landscape of finding balance-fair shortest paths.

Matthias Bentert, Leon Kellerhals, Rolf Niedermeier

Theor. Comput. Sci., 2022

Finding Balance-Fair Short Paths in Graphs.

Matthias Bentert, Leon Kellerhals, Rolf Niedermeier

CoRR, 2022

Vertex Cover and Feedback Vertex Set Above and Below Structural Guarantees.

Leon Kellerhals, Tomohiro Koana, Pascal Kunz

Proceedings of the 17th International Symposium on Parameterized and Exact Computation, 2022

Placing Green Bridges Optimally, with Habitats Inducing Cycles.

Maike Herkenrath, Till Fluschnik, Francesco Grothe, Leon Kellerhals

Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, 2022

Single-Peaked Opinion Updates.

Robert Bredereck, Anne-Marie George, Jonas Israel, Leon Kellerhals

Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, 2022

Modification-Fair Cluster Editing.

Vincent Froese, Leon Kellerhals, Rolf Niedermeier

Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

2021

Optimal Virtual Network Embeddings for Tree Topologies.

Aleksander Figiel, Leon Kellerhals, Rolf Niedermeier, Matthias Rost, Stefan Schmid, Philipp Zschoche

Proceedings of the SPAA '21: 33rd ACM Symposium on Parallelism in Algorithms and Architectures, 2021

The PACE 2021 Parameterized Algorithms and Computational Experiments Challenge: Cluster Editing.

Leon Kellerhals, Tomohiro Koana, André Nichterlein, Philipp Zschoche

Proceedings of the 16th International Symposium on Parameterized and Exact Computation, 2021

Parameterized Algorithms for Diverse Multistage Problems.

Leon Kellerhals, Malte Renken, Philipp Zschoche

Proceedings of the 29th Annual European Symposium on Algorithms, 2021

Placing Green Bridges Optimally, with a Multivariate Analysis.

Till Fluschnik, Leon Kellerhals

Proceedings of the Connecting with Computability, 2021

2020

Parameterized Complexity of Geodetic Set.

Leon Kellerhals, Tomohiro Koana

Proceedings of the 15th International Symposium on Parameterized and Exact Computation, 2020

Maximizing the Spread of an Opinion in Few Steps: Opinion Diffusion in Non-Binary Networks.

Robert Bredereck, Lilian Jacobs, Leon Kellerhals

Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, 2020

2018

Towards Improving Brandes' Algorithm for Betweenness Centrality.

Matthias Bentert, Alexander Dittmann, Leon Kellerhals, André Nichterlein, Rolf Niedermeier

CoRR, 2018

An Adaptive Version of Brandes' Algorithm for Betweenness Centrality.

Matthias Bentert, Alexander Dittmann, Leon Kellerhals, André Nichterlein, Rolf Niedermeier

Proceedings of the 29th International Symposium on Algorithms and Computation, 2018

2017

On the Computational Complexity of Variants of Combinatorial Voter Control in Elections.

Leon Kellerhals, Viatcheslav Korenwein, Philipp Zschoche, Robert Bredereck, Jiehua Chen

Proceedings of the Theory and Applications of Models of Computation, 2017