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
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
Fixed-parameter approximations for k-center problems in low highway dimension graphs
AE Feldmann
Algorithmica 81 (3), 1031-1052, 2019
An Time Algorithm to Compute the Bisection Width of Solid Grid Graphs
AE Feldmann, P Widmayer
European Symposium on Algorithms, 143-154, 2011
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
The complexity landscape of fixed-parameter directed Steiner network problems
AE Feldmann, D Marx
arXiv preprint arXiv:1707.06808, 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), 1-35, 2015
On the parameterized complexity of computing graph bisections
R Van Bevern, AE Feldmann, M Sorge, O Suchý
International Workshop on Graph-Theoretic Concepts in Computer Science, 76-87, 2013
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
Balanced partitioning of grids and related graphs: A theoretical study of data distribution in parallel finite element model simulations
AE Feldmann
Cuvillier Verlag, 2012
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
Computing approximate nash equilibria in network congestion games
AE Feldmann, H Röglin, B Vöcking
International Colloquium on Structural Information and Communication …, 2008
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
Fast approximation algorithms for the generalized survivable network design problem
AE Feldmann, J Könemann, K Pashkovich, L Sanitŕ
arXiv preprint arXiv:1604.07049, 2016
Fast balanced partitioning of grid graphs is hard
AE Feldmann
ArXiv e-prints, 2011
Simple cuts are fast and good: Optimum right-angled cuts in solid grids
AE Feldmann, S Das, P Widmayer
International Conference on Combinatorial Optimization and Applications, 11-20, 2010
Corner cuts are close to optimal: From solid grids to polygons and back
AE Feldmann, S Das, P Widmayer
Discrete Applied Mathematics 161 (7-8), 970-998, 2013
The system can't perform the operation now. Try again later.
Articles 1–18