On the Computational Complexity of Variants of Combinatorial Voter Control in Elections. - Leon Kellerhals; Viatcheslav Korenwein; Philipp Zschoche; Robert Bredereck; Jiehua Chen 001 (TAMC, 2017)

Towards Improving Brandes' Algorithm for Betweenness Centrality. - Matthias Bentert; Alexander Dittmann; Leon Kellerhals; André Nichterlein; Rolf Niedermeier (CoRR, 2018)

Maximizing the Spread of an Opinion in Few Steps: Opinion Diffusion in Non-Binary Networks. - Robert Bredereck; Lilian Jacobs; Leon Kellerhals (IJCAI, 2020)

An Adaptive Version of Brandes' Algorithm for Betweenness Centrality. - Matthias Bentert; Alexander Dittmann; Leon Kellerhals; André Nichterlein; Rolf Niedermeier (J. Graph Algorithms Appl., 2020)

Parameterized Algorithms for Diverse Multistage Problems. - Leon Kellerhals; Malte Renken; Philipp Zschoche (ESA, 2021)

The PACE 2021 Parameterized Algorithms and Computational Experiments Challenge: Cluster Editing. - Leon Kellerhals; Tomohiro Koana; André Nichterlein; Philipp Zschoche (IPEC, 2021)

Optimal Virtual Network Embeddings for Tree Topologies. - Aleksander Figiel; Leon Kellerhals; Rolf Niedermeier; Matthias Rost; Stefan Schmid 001; Philipp Zschoche (SPAA, 2021)

Single-Peaked Opinion Updates. - Robert Bredereck; Anne-Marie George; Jonas Israel; Leon Kellerhals (IJCAI, 2022)

Placing Green Bridges Optimally, with Habitats Inducing Cycles. - Maike Herkenrath; Till Fluschnik; Francesco Grothe; Leon Kellerhals (IJCAI, 2022)

Vertex Cover and Feedback Vertex Set Above and Below Structural Guarantees. - Leon Kellerhals; Tomohiro Koana; Pascal Kunz 001 (IPEC, 2022)

Finding Balance-Fair Short Paths in Graphs. - Matthias Bentert; Leon Kellerhals; Rolf Niedermeier (CoRR, 2022)

Parameterized Complexity of Geodetic Set. - Leon Kellerhals; Tomohiro Koana (J. Graph Algorithms Appl., 2022)

The structural complexity landscape of finding balance-fair shortest paths. - Matthias Bentert; Leon Kellerhals; Rolf Niedermeier (Theor. Comput. Sci., 2022)

Fair Short Paths in Vertex-Colored Graphs. - Matthias Bentert; Leon Kellerhals; Rolf Niedermeier (AAAI, 2023)

Parameterized Algorithms for Colored Clustering. - Leon Kellerhals; Tomohiro Koana; Pascal Kunz 001; Rolf Niedermeier (AAAI, 2023)

Locally Rainbow Paths. - Till Fluschnik; Leon Kellerhals; Malte Renken (AAAI, 2024)

Proportional Fairness in Clustering: A Social Choice Perspective. - Leon Kellerhals; Jannik Peters 001 (NeurIPS, 2024)

Structural Parameterizations of the Biclique-Free Vertex Deletion Problem. - Lito Goldmann; Leon Kellerhals; Tomohiro Koana (Discret. Math. Theor. Comput. Sci., 2024)

Multivariate complexity analyses for algorithmic challenges in fairness and sustainability. - Leon Kellerhals (2024)

Approximating sparse quadratic programs. - Danny Hermelin; Leon Kellerhals; Rolf Niedermeier; Rami Pugatch (Theor. Comput. Sci., 2024)

Placing Green Bridges Optimally, with a Multivariate Analysis. - Till Fluschnik; Leon Kellerhals (Theory Comput. Syst., 2024)

Modification-fair cluster editing. - Vincent Froese; Leon Kellerhals; Rolf Niedermeier (Soc. Netw. Anal. Min., 2024)

Proportional Clustering, the β-Plurality Problem, and Metric Distortion. - Leon Kellerhals; Jannik Peters 001 (CoRR, 2025)