| Balanced partitions of trees and applications AE Feldmann, L Foschini Algorithmica 71 (2), 354-376, 2015 | 106 | 2015 |
| Fast balanced partitioning is hard even on grids and trees AE Feldmann Theoretical Computer Science 485, 61-68, 2013 | 61 | 2013 |
| A survey on approximation in parameterized complexity: Hardness and algorithms AE Feldmann, E Lee, P Manurangsi Algorithms 13 (6), 146, 2020 | 46 | 2020 |
| Fixed-Parameter Approximations for k-Center Problems in Low Highway Dimension Graphs AE Feldmann Algorithmica 81, 1031-1052, 2019 | 41 | 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 | 37 | 2018 |
| 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 | 34 | 2021 |
| An Time Algorithm to Compute the Bisection Width of Solid Grid Graphs AE Feldmann, P Widmayer Algorithms–ESA 2011: 19th Annual European Symposium, Saarbrücken, Germany …, 2011 | 33* | 2011 |
| The Parameterized Hardness of the k-Center Problem in Transportation Networks AE Feldmann, D Marx Algorithmica 82, 1989-2005, 2020 | 27 | 2020 |
| 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 |
| The complexity landscape of fixed-parameter directed Steiner network problems AE Feldmann, D Marx arXiv preprint arXiv:1707.06808, 2017 | 22 | 2017 |
| 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 | 20 | 2015 |
| 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 | 17 | 2015 |
| 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 | 16 | 2016 |
| 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 | 14 | 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 Structural Information and Communication Complexity: 15th International …, 2008 | 9* | 2008 |
| 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 |
| 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 | 7 | 2023 |
Yann DisserProfessor of Mathematics, TU DarmstadtVerified email at mathematik.tu-darmstadt.de
