Leon Kellerhals

Orcid: 0000-0001-6565-3983

According to our database1, Leon Kellerhals authored at least 22 papers between 2017 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Modification-fair cluster editing.
Soc. Netw. Anal. Min., December, 2024

Approximating sparse quadratic programs.
Theor. Comput. Sci., February, 2024

Multivariate complexity analyses for algorithmic challenges in fairness and sustainability.
PhD thesis, 2024

Locally Rainbow Paths.
Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

2023
Proportional Fairness in Clustering: A Social Choice Perspective.
CoRR, 2023

Structural Parameterizations of the Biclique-Free Vertex Deletion Problem.
CoRR, 2023

Parameterized Algorithms for Colored Clustering.
Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

Fair Short Paths in Vertex-Colored Graphs.
Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

2022
The structural complexity landscape of finding balance-fair shortest paths.
Theor. Comput. Sci., 2022

Parameterized Complexity of Geodetic Set.
J. Graph Algorithms Appl., 2022

Finding Balance-Fair Short Paths in Graphs.
CoRR, 2022

Vertex Cover and Feedback Vertex Set Above and Below Structural Guarantees.
Proceedings of the 17th International Symposium on Parameterized and Exact Computation, 2022

Placing Green Bridges Optimally, with Habitats Inducing Cycles.
Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, 2022

Single-Peaked Opinion Updates.
Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, 2022

2021
Optimal Virtual Network Embeddings for Tree Topologies.
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.
Proceedings of the 16th International Symposium on Parameterized and Exact Computation, 2021

Parameterized Algorithms for Diverse Multistage Problems.
Proceedings of the 29th Annual European Symposium on Algorithms, 2021

Placing Green Bridges Optimally, with a Multivariate Analysis.
Proceedings of the Connecting with Computability, 2021

2020
An Adaptive Version of Brandes' Algorithm for Betweenness Centrality.
J. Graph Algorithms Appl., 2020

Maximizing the Spread of an Opinion in Few Steps: Opinion Diffusion in Non-Binary Networks.
Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, 2020

2018
Towards Improving Brandes' Algorithm for Betweenness Centrality.
CoRR, 2018

2017
On the Computational Complexity of Variants of Combinatorial Voter Control in Elections.
Proceedings of the Theory and Applications of Models of Computation, 2017


  Loading...