Google
Google Scholar
MS Academic
CiteSeerX
CORE
Semantic ScholarAndreas Emil Feldmann
Refine list
refinements active!
zoomed in on ?? of ?? records
showing all ?? records
2010 – today
- 2016
[i6]Andreas Emil Feldmann, Jochen Könemann, Kanstantsin Pashkovich, Laura Sanità:
Fast Approximation Algorithms for the Generalized Survivable Network Design Problem. CoRR abs/1604.07049 (2016)- [i5]Andreas Emil Feldmann:
Fixed Parameter Approximations for k-Center Problems in Low Highway Dimension Graphs. CoRR abs/1605.02530 (2016) - [j9]Andreas Emil Feldmann, Jochen Könemann, Neil Olver, Laura Sanità:
On the equivalence of the bidirected and hypergraphic relaxations for Steiner tree. Math. Program. 160(1-2): 379-406 (2016) - [j8]Ahmad Abdi, Andreas Emil Feldmann, Bertrand Guenin, Jochen Könemann, Laura Sanità:
Lehman's Theorem and the Directed Steiner Tree Problem. SIAM J. Discrete Math. 30(1): 141-153 (2016) - [c13]Andreas Emil Feldmann, Dániel Marx:
The Complexity Landscape of Fixed-Parameter Directed Steiner Network Problems. ICALP 2016: 27:1-27:14 - [c12]Andreas Emil Feldmann, Jochen Könemann, Kanstantsin Pashkovich, Laura Sanità:
Fast Approximation Algorithms for the Generalized Survivable Network Design Problem. ISAAC 2016: 33:1-33:12 - 2015
- [j7]Andreas Emil Feldmann, Peter Widmayer:
An O(n4) Time Algorithm to Compute the Bisection Width of Solid Grid Graphs. Algorithmica 71(1): 181-200 (2015) - [j6]Andreas Emil Feldmann, Luca Foschini:
Balanced Partitions of Trees and Applications. Algorithmica 71(2): 354-376 (2015) - [i4]Andreas Emil Feldmann, Wai Shing Fung, Jochen Könemann, Ian Post:
A (1 + ε)-Embedding of Low Highway Dimension Graphs into Bounded Treewidth Graphs. CoRR abs/1502.04588 (2015) - [j5]René van Bevern, Andreas Emil Feldmann, Manuel Sorge, Ondrej Suchý:
On the Parameterized Complexity of Computing Balanced Partitions in Graphs. Theory Comput. Syst. 57(1): 1-35 (2015) - [j4]Yann Disser, Andreas Emil Feldmann, Max Klimm, Matús Mihalák:
Improving the Hk-bound on the price of stability in undirected Shapley network design games. Theor. Comput. Sci. 562: 557-564 (2015) - [c11]Andreas Emil Feldmann, Wai Shing Fung, Jochen Könemann, Ian Post:
A (1+ε ) ( 1 + ε ) -Embedding of Low Highway Dimension Graphs into Bounded Treewidth Graphs. ICALP (1) 2015: 469-480 - [c10]Andreas Emil Feldmann:
Fixed Parameter Approximations for k-Center Problems in Low Highway Dimension Graphs. ICALP (2) 2015: 588-600 - 2014
- [c9]Andreas Emil Feldmann, Jochen Könemann, Neil Olver, Laura Sanità:
On the Equivalence of the Bidirected and Hypergraphic Relaxations for Steiner Tree. APPROX-RANDOM 2014: 176-191 - 2013
- [i3]René van Bevern, Andreas Emil Feldmann, Manuel Sorge, Ondrej Suchý:
On the Parameterized Complexity of Computing Balanced Partitions in Graphs. CoRR abs/1312.7014 (2013) - [j3]Andreas Emil Feldmann, Shantanu Das, Peter Widmayer:
Corner cuts are close to optimal: From solid grids to polygons and back. Discrete Applied Mathematics 161(7-8): 970-998 (2013) - [j2]Andreas Emil Feldmann:
Fast balanced partitioning is hard even on grids and trees. Theor. Comput. Sci. 485: 61-68 (2013) - [c8]Yann Disser, Andreas Emil Feldmann, Max Klimm, Matús Mihalák:
Improving the H k -Bound on the Price of Stability in Undirected Shapley Network Design Games. CIAC 2013: 158-169 - [c7]René van Bevern, Andreas Emil Feldmann, Manuel Sorge, Ondrej Suchý:
On the Parameterized Complexity of Computing Graph Bisections. WG 2013: 76-87 - 2012
- [b1]Andreas Emil Feldmann:
Balanced partitioning of grids and related graphs: a theoretical study of data distribution in parallel finite element model simulations. Cuvillier ETH Zurich 2012, ISBN 978-3-95404-125-1, pp. 1-201 - [i2]Yann Disser, Andreas Emil Feldmann, Max Klimm, Matús Mihalák:
Improving the $H_k$-Bound on the Price of Stability in Undirected Shapley Network Design Games. CoRR abs/1211.2090 (2012) - [j1]Andreas Emil Feldmann, Heiko Röglin, Berthold Vöcking:
Computing approximate Nash equilibria in network congestion games. Networks 59(4): 380-386 (2012) - [c6]Andreas Emil Feldmann:
Fast Balanced Partitioning Is Hard Even on Grids and Trees. MFCS 2012: 372-382 - [c5]Andreas Emil Feldmann, Luca Foschini:
Balanced Partitions of Trees and Applications. STACS 2012: 100-111 - 2011
- [i1]
- [c4]Andreas Emil Feldmann, Peter Widmayer:
An $\mathcal{O}(n^4)$ Time Algorithm to Compute the Bisection Width of Solid Grid Graphs. ESA 2011: 143-154 - [c3]Andreas Emil Feldmann, Shantanu Das, Peter Widmayer:
Restricted Cuts for Bisections in Solid Grids: A Proof via Polygons. WG 2011: 143-154 - 2010
- [c2]Andreas Emil Feldmann, Shantanu Das, Peter Widmayer:
Simple Cuts Are Fast and Good: Optimum Right-Angled Cuts in Solid Grids. COCOA (1) 2010: 11-20
2000 – 2009
- 2008
- [c1]Andreas Emil Feldmann, Heiko Röglin, Berthold Vöcking:
Computing Approximate Nash Equilibria in Network Congestion Games. SIROCCO 2008: 209-220
Coauthor Index
maintained by 
at 
at 
data released under the ODC-BY 1.0 license; see also our legal information page
last updated on 2017-06-17 00:59 CEST by the dblp team