Andreas Emil Feldmann
Andreas Emil Feldmann
Verified email at - Homepage
Cited by
Cited by
Balanced partitions of trees and applications
AE Feldmann, L Foschini
Algorithmica 71 (2), 354-376, 2015
Fast balanced partitioning is hard even on grids and trees
AE Feldmann
Theoretical Computer Science 485, 61-68, 2013
Fixed-parameter approximations for k-center problems in low highway dimension graphs
AE Feldmann
Algorithmica 81 (3), 1031-1052, 2019
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
A survey on approximation in parameterized complexity: Hardness and algorithms
AE Feldmann, E Lee, P Manurangsi
Algorithms 13 (6), 146, 2020
An Time Algorithm to Compute the Bisection Width of Solid Grid Graphs
AE Feldmann, P Widmayer
European Symposium on Algorithms, 143-154, 2011
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
The parameterized hardness of the k-center problem in transportation networks
AE Feldmann, D Marx
Algorithmica 82 (7), 1989-2005, 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
The complexity landscape of fixed-parameter directed Steiner network problems
AE Feldmann, D Marx
arXiv preprint arXiv:1707.06808, 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
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), 1-35, 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 (1), 379-406, 2016
On the parameterized complexity of computing graph bisections
R Bevern, AE Feldmann, M Sorge, O Suchý
International Workshop on Graph-Theoretic Concepts in Computer Science, 76-87, 2013
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
Balanced partitioning of grids and related graphs: A theoretical study of data distribution in parallel finite element model simulations
AE Feldmann
Cuvillier Verlag, 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
Restricted cuts for bisections in solid grids: A proof via polygons
AE Feldmann, S Das, P Widmayer
International Workshop on Graph-Theoretic Concepts in Computer Science, 143-154, 2011
Lehman's theorem and the directed Steiner tree problem
A Abdi, AE Feldmann, B Guenin, J Könemann, L Sanita
SIAM Journal on Discrete Mathematics 30 (1), 141-153, 2016
Parameterized inapproximability of independent set in H-free graphs
P Dvořák, AE Feldmann, A Rai, P Rzążewski
Algorithmica, 1-27, 2022
The system can't perform the operation now. Try again later.
Articles 1–20