| Parameterized complexity of geodetic set L Kellerhals, T Koana arXiv preprint arXiv:2001.03098, 2020 | 31 | 2020 |
| An adaptive version of Brandes' algorithm for betweenness centrality M Bentert, A Dittmann, L Kellerhals, A Nichterlein, R Niedermeier arXiv preprint arXiv:1802.06701, 2018 | 27* | 2018 |
| The PACE 2021 parameterized algorithms and computational experiments challenge: Cluster editing L Kellerhals, T Koana, A Nichterlein, P Zschoche 16th International Symposium on Parameterized and Exact Computation (IPEC …, 2021 | 23 | 2021 |
| Comparison between a quantum annealer and a classical approximation algorithm for computing the ground state of an Ising spin glass R Yaacoby, N Schaar, L Kellerhals, O Raz, D Hermelin, R Pugatch Physical Review E 105 (3), 035305, 2022 | 16 | 2022 |
| Modification-fair cluster editing V Froese, L Kellerhals, R Niedermeier Social Network Analysis and Mining 14 (1), 109, 2024 | 15 | 2024 |
| Parameterized algorithms for diverse multistage problems L Kellerhals, M Renken, P Zschoche arXiv preprint arXiv:2105.04856, 2021 | 14 | 2021 |
| Maximizing the spread of an opinion in few steps: opinion diffusion in non-binary networks R Bredereck, L Jacobs, L Kellerhals Proceedings of the Twenty-Ninth International Conference on International …, 2021 | 11 | 2021 |
| Placing green bridges optimally, with a multivariate analysis T Fluschnik, L Kellerhals Theory of Computing Systems 68 (5), 1312-1338, 2024 | 9 | 2024 |
| Fair short paths in vertex-colored graphs M Bentert, L Kellerhals, R Niedermeier Proceedings of the AAAI Conference on Artificial Intelligence 37 (10), 12346 …, 2023 | 9* | 2023 |
| Placing green bridges optimally, with habitats inducing cycles M Herkenrath, T Fluschnik, F Grothe, L Kellerhals arXiv preprint arXiv:2201.12273, 2022 | 7 | 2022 |
| Proportional fairness in clustering: A social choice perspective L Kellerhals, J Peters Advances in Neural Information Processing Systems 37, 111299-111317, 2025 | 6 | 2025 |
| Vertex cover and feedback vertex set above and below structural guarantees L Kellerhals, T Koana, P Kunz arXiv preprint arXiv:2203.05887, 2022 | 6 | 2022 |
| Optimal virtual network embeddings for tree topologies A Figiel, L Kellerhals, R Niedermeier, M Rost, S Schmid, P Zschoche Proceedings of the 33rd ACM Symposium on Parallelism in Algorithms and …, 2021 | 6 | 2021 |
| Parameterized algorithms for colored clustering L Kellerhals, T Koana, P Kunz, R Niedermeier Proceedings of the AAAI Conference on Artificial Intelligence 37 (4), 4400-4408, 2023 | 5 | 2023 |
| The structural complexity landscape of finding balance-fair shortest paths M Bentert, L Kellerhals, R Niedermeier Theoretical Computer Science 933, 149-162, 2022 | 4 | 2022 |
| Approximating sparse quadratic programs D Hermelin, L Kellerhals, R Niedermeier, R Pugatch arXiv preprint arXiv:2007.01252, 2020 | 3* | 2020 |
| On the computational complexity of variants of combinatorial voter control in elections L Kellerhals, V Korenwein, P Zschoche, R Bredereck, J Chen International Conference on Theory and Applications of Models of Computation …, 2017 | 3 | 2017 |
| Single-Peaked Opinion Updates R Bredereck, AM George, J Israel, L Kellerhals arXiv preprint arXiv:2204.14094, 2022 | 2 | 2022 |
| Structural parameterizations of the biclique-free vertex deletion problem L Goldmann, L Kellerhals, T Koana Discrete Mathematics & Theoretical Computer Science 26 (Discrete Algorithms), 2024 | 1 | 2024 |
| Locally rainbow paths T Fluschnik, L Kellerhals, M Renken Proceedings of the AAAI Conference on Artificial Intelligence 38 (8), 8013-8021, 2024 | 1 | 2024 |
Rolf NiedermeierTU BerlinOverená e-mailová adresa na: tu-berlin.de