| Balanced partitions of trees and applications AE Feldmann, L Foschini Algorithmica 71 (2), 354-376, 2015 | 127 | 2015 |
| A survey on approximation in parameterized complexity: Hardness and algorithms AE Feldmann, E Lee, P Manurangsi Algorithms 13 (6), 146, 2020 | 76 | 2020 |
| Fast balanced partitioning is hard even on grids and trees AE Feldmann Theoretical Computer Science 485, 61-68, 2013 | 65 | 2013 |
| Near-linear time approximation schemes for clustering in doubling metrics V Cohen-Addad, AE Feldmann, D Saulpic Journal of the ACM (JACM) 68 (6), 1-34, 2021 | 53 | 2021 |
| Fixed-Parameter Approximations for k-Center Problems in Low Highway Dimension Graphs AE Feldmann Algorithmica 81, 1031-1052, 2019 | 48 | 2019 |
| A -Embedding of Low Highway Dimension Graphs into Bounded Treewidth Graphs AE Feldmann, WS Fung, J Konemann, I Post SIAM Journal on Computing 47 (4), 1667-1704, 2018 | 44 | 2018 |
| An time algorithm to compute the bisection width of solid grid graphs AE Feldmann, P Widmayer European Symposium on Algorithms, 143-154, 2011 | 37* | 2011 |
| The Parameterized Hardness of the k-Center Problem in Transportation Networks AE Feldmann, D Marx Algorithmica 82, 1989-2005, 2020 | 36 | 2020 |
| The complexity landscape of fixed-parameter directed steiner network problems AE Feldmann, D Marx arXiv preprint arXiv:1707.06808, 2017 | 28 | 2017 |
| On the parameterized complexity of computing balanced partitions in graphs R Van Bevern, AE Feldmann, M Sorge, O Suchý Theory of Computing Systems 57, 1-35, 2015 | 26 | 2015 |
| Efficient fully dynamic elimination forests with applications to detecting long paths and cycles J Chen, W Czerwiński, Y Disser, AE Feldmann, D Hermelin, W Nadara, ... Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA …, 2021 | 24 | 2021 |
| On the equivalence of the bidirected and hypergraphic relaxations for Steiner tree AE Feldmann, J Könemann, N Olver, L Sanitŕ Mathematical programming 160, 379-406, 2016 | 24 | 2016 |
| Parameterized approximation algorithms for bidirected steiner network problems R Chitnis, AE Feldmann, P Manurangsi ACM Transactions on Algorithms (TALG) 17 (2), 1-68, 2021 | 23 | 2021 |
| Improving the Hk-bound on the price of stability in undirected shapley network design games Y Disser, AE Feldmann, M Klimm, M Mihalák Theoretical Computer Science 562, 557-564, 2015 | 22 | 2015 |
| Parameterized approximation algorithms for bidirected steiner network problems R Chitnis, AE Feldmann, P Manurangsi Leibniz International Proceedings in Informatics, LIPIcs 112, 2018 | 20 | 2018 |
| Parameterized approximation schemes for steiner trees with small number of steiner vertices P Dvorák, AE Feldmann, D Knop, T Masarík, T Toufar, P Veselý Leibniz International Proceedings in Informatics, LIPIcs 96, 26, 2018 | 17 | 2018 |
| On the parameterized complexity of computing graph bisections R Van Bevern, AE Feldmann, M Sorge, O Suchý Graph-Theoretic Concepts in Computer Science: 39th International Workshop …, 2013 | 15 | 2013 |
| Balanced partitioning of grids and related graphs: A theoretical study of data distribution in parallel finite element model simulations AE Feldmann Cuvillier Verlag, 2012 | 13 | 2012 |
| The parameterized complexity of the survivable network design problem AE Feldmann, A Mukherjee, EJ van Leeuwen Symposium on Simplicity in Algorithms (SOSA), 37-56, 2022 | 12 | 2022 |
| Near-Linear Time Approximations Schemes for Clustering in Doubling Metrics. D Saulpic, V Cohen-Addad, AE Feldmann FOCS, 540-559, 2019 | 10 | 2019 |
Yann DisserProfessor for Combinatorial Optimization, Department of Mathematics, TU DarmstadtVerified email at mathematik.tu-darmstadt.de
