| Balanced partitions of trees and applications AE Feldmann, L Foschini Algorithmica 71 (2), 354-376, 2015 | 109 | 2015 |
| Fast balanced partitioning is hard even on grids and trees AE Feldmann Theoretical Computer Science 485, 61-68, 2013 | 62 | 2013 |
| A survey on approximation in parameterized complexity: Hardness and algorithms AE Feldmann, E Lee, P Manurangsi Algorithms 13 (6), 146, 2020 | 59 | 2020 |
| Fixed-Parameter Approximations for k-Center Problems in Low Highway Dimension Graphs AE Feldmann Algorithmica 81, 1031-1052, 2019 | 42 | 2019 |
| A -Embedding of Low Highway Dimension Graphs into Bounded Treewidth Graphs AE Feldmann, WS Fung, J Könemann, I Post SIAM Journal on Computing 47 (4), 1667-1704, 2018 | 39 | 2018 |
| An time algorithm to compute the bisection width of solid grid graphs AE Feldmann, P Widmayer European Symposium on Algorithms, 143-154, 2011 | 35* | 2011 |
| 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 | 33 | 2021 |
| The Parameterized Hardness of the k-Center Problem in Transportation Networks AE Feldmann, D Marx Algorithmica 82, 1989-2005, 2020 | 29 | 2020 |
| The complexity landscape of fixed-parameter directed Steiner network problems AE Feldmann, D Marx ACM Transactions on Computation Theory, 2017 | 25 | 2017 |
| 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 | 21 | 2016 |
| 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 | 21 | 2015 |
| 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 | 21 | 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 | 18 | 2021 |
| 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 | 14 | 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 | 11 | 2012 |
| Computing approximate nash equilibria in network congestion games AE Feldmann, H Röglin, B Vöcking International Colloquium on Structural Information and Communication …, 2008 | 10 | 2008 |
| 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 | 9 | 2022 |
| Parameterized inapproximability of independent set in H-free graphs P Dvořák, AE Feldmann, A Rai, P Rzążewski Algorithmica 85 (4), 902-928, 2023 | 8 | 2023 |
| Near-Linear Time Approximations Schemes for Clustering in Doubling Metrics. D Saulpic, V Cohen-Addad, AE Feldmann FOCS, 540-559, 2019 | 8 | 2019 |
| Restricted cuts for bisections in solid grids: A proof via polygons AE Feldmann, S Das, P Widmayer Graph-Theoretic Concepts in Computer Science: 37th International Workshop …, 2011 | 8 | 2011 |
Yann DisserProfessor for Combinatorial Optimization, Department of Mathematics, TU DarmstadtVerified email at mathematik.tu-darmstadt.de
