ask others

Andreas Emil Feldmann

> Home > Persons

Refine list

refinements active!

zoomed in on ?? of ?? records

view refined list in

showing all ?? records

2010 – today

see FAQ

What is the meaning of the colors in the publication lists?

2018
[c16]
- view
  - electronic edition via DOI
- export record
  dblp key:
  - conf/csr/ChitnisF18
- ask others
- share record
  short URL:
  - https://dblp.org/rec/conf/csr/ChitnisF18
Rajesh Chitnis, Andreas Emil Feldmann:
A Tight Lower Bound for Steiner Orientation. CSR 2018: 65-77
[c15]
- view
  - electronic edition via DOI
- export record
  dblp key:
  - conf/stacs/DvorakFKMTV18
- ask others
- share record
  short URL:
  - https://dblp.org/rec/conf/stacs/DvorakFKMTV18
Pavel Dvorák, Andreas Emil Feldmann, Dusan Knop, Tomás Masarík, Tomas Toufar, Pavel Veselý:
Parameterized Approximation Schemes for Steiner Trees with Small Number of Steiner Vertices. STACS 2018: 26:1-26:15
[c14]
- view
  - electronic edition via DOI
- export record
  dblp key:
  - conf/swat/FeldmannM18
- ask others
- share record
  short URL:
  - https://dblp.org/rec/conf/swat/FeldmannM18
Andreas Emil Feldmann, Dániel Marx:
The Parameterized Hardness of the k-Center Problem in Transportation Networks. SWAT 2018: 19:1-19:13
[i10]
- view
  - electronic edition @ arxiv.org
- export record
  dblp key:
  - journals/corr/abs-1802-08563
- ask others
- share record
  short URL:
  - https://dblp.org/rec/journals/corr/abs-1802-08563
Andreas Emil Feldmann, Dániel Marx:
The Parameterized Hardness of the k-Center Problem in Transportation Networks. CoRR abs/1802.08563 (2018)
2017
[i9]
- view
  - electronic edition @ arxiv.org
- export record
  dblp key:
  - journals/corr/ChitnisFM17
- ask others
- share record
  short URL:
  - https://dblp.org/rec/journals/corr/ChitnisFM17
Rajesh Chitnis, Andreas Emil Feldmann, Pasin Manurangsi:
Parameterized Approximation Algorithms for Directed Steiner Network Problems. CoRR abs/1707.06499 (2017)
[i8]
- view
  - electronic edition @ arxiv.org
- export record
  dblp key:
  - journals/corr/FeldmannM17
- ask others
- share record
  short URL:
  - https://dblp.org/rec/journals/corr/FeldmannM17
Andreas Emil Feldmann, Dániel Marx:
The Complexity Landscape of Fixed-Parameter Directed Steiner Network Problems. CoRR abs/1707.06808 (2017)
[i7]
- view
  - electronic edition @ arxiv.org
- export record
  dblp key:
  - journals/corr/abs-1710-00668
- ask others
- share record
  short URL:
  - https://dblp.org/rec/journals/corr/abs-1710-00668
Pavel Dvorák, Andreas Emil Feldmann, Dusan Knop, Tomás Masarík, Tomás Toufar, Pavel Veselý:
Parameterized Approximation Schemes for Steiner Trees with Small Number of Steiner Vertices. CoRR abs/1710.00668 (2017)
2016
[j9]
- view
  - electronic edition via DOI
- export record
  dblp key:
  - journals/mp/FeldmannKOS16
- ask others
- share record
  short URL:
  - https://dblp.org/rec/journals/mp/FeldmannKOS16
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]
- view
  - electronic edition via DOI
- export record
  dblp key:
  - journals/siamdm/AbdiFGKS16
- ask others
- share record
  short URL:
  - https://dblp.org/rec/journals/siamdm/AbdiFGKS16
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]
- view
  - electronic edition via DOI
- export record
  dblp key:
  - conf/icalp/FeldmannM16
- ask others
- share record
  short URL:
  - https://dblp.org/rec/conf/icalp/FeldmannM16
Andreas Emil Feldmann, Dániel Marx:
The Complexity Landscape of Fixed-Parameter Directed Steiner Network Problems. ICALP 2016: 27:1-27:14
[c12]
- view
  - electronic edition via DOI
- export record
  dblp key:
  - conf/isaac/FeldmannKPS16
- ask others
- share record
  short URL:
  - https://dblp.org/rec/conf/isaac/FeldmannKPS16
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
[i6]
- view
  - electronic edition @ arxiv.org
- export record
  dblp key:
  - journals/corr/FeldmannKPS16
- ask others
- share record
  short URL:
  - https://dblp.org/rec/journals/corr/FeldmannKPS16
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]
- view
  - electronic edition @ arxiv.org
- export record
  dblp key:
  - journals/corr/Feldmann16
- ask others
- share record
  short URL:
  - https://dblp.org/rec/journals/corr/Feldmann16
Andreas Emil Feldmann:
Fixed Parameter Approximations for k-Center Problems in Low Highway Dimension Graphs. CoRR abs/1605.02530 (2016)
2015
[j7]
- view
  - electronic edition via DOI
- export record
  dblp key:
  - journals/algorithmica/FeldmannW15
- ask others
- share record
  short URL:
  - https://dblp.org/rec/journals/algorithmica/FeldmannW15
Andreas Emil Feldmann, Peter Widmayer:
An O(n⁴) Time Algorithm to Compute the Bisection Width of Solid Grid Graphs. Algorithmica 71(1): 181-200 (2015)
[j6]
- view
  - electronic edition via DOI
- export record
  dblp key:
  - journals/algorithmica/FeldmannF15
- ask others
- share record
  short URL:
  - https://dblp.org/rec/journals/algorithmica/FeldmannF15
Andreas Emil Feldmann, Luca Foschini:
Balanced Partitions of Trees and Applications. Algorithmica 71(2): 354-376 (2015)
[j5]
- view
  - electronic edition via DOI
- export record
  dblp key:
  - journals/mst/BevernFSS15
- ask others
- share record
  short URL:
  - https://dblp.org/rec/journals/mst/BevernFSS15
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]
- view
  - electronic edition via DOI
- export record
  dblp key:
  - journals/tcs/DisserFKM15
- ask others
- share record
  short URL:
  - https://dblp.org/rec/journals/tcs/DisserFKM15
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]
- view
  - electronic edition via DOI
- export record
  dblp key:
  - conf/icalp/FeldmannFKP15
- ask others
- share record
  short URL:
  - https://dblp.org/rec/conf/icalp/FeldmannFKP15
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]
- view
  - electronic edition via DOI
- export record
  dblp key:
  - conf/icalp/Feldmann15
- ask others
- share record
  short URL:
  - https://dblp.org/rec/conf/icalp/Feldmann15
Andreas Emil Feldmann:
Fixed Parameter Approximations for k-Center Problems in Low Highway Dimension Graphs. ICALP (2) 2015: 588-600
[i4]
- view
  - electronic edition @ arxiv.org
- export record
  dblp key:
  - journals/corr/FeldmannFKP15
- ask others
- share record
  short URL:
  - https://dblp.org/rec/journals/corr/FeldmannFKP15
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)
2014
[c9]
- view
  - electronic edition via DOI
- export record
  dblp key:
  - conf/approx/FeldmannKOS14
- ask others
- share record
  short URL:
  - https://dblp.org/rec/conf/approx/FeldmannKOS14
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
[j3]
- view
  - electronic edition via DOI
- export record
  dblp key:
  - journals/dam/Feldmann0W13
- ask others
- share record
  short URL:
  - https://dblp.org/rec/journals/dam/Feldmann0W13
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]
- view
  - electronic edition via DOI
- export record
  dblp key:
  - journals/tcs/Feldmann13
- ask others
- share record
  short URL:
  - https://dblp.org/rec/journals/tcs/Feldmann13
Andreas Emil Feldmann:
Fast balanced partitioning is hard even on grids and trees. Theor. Comput. Sci. 485: 61-68 (2013)
[c8]
- view
  - electronic edition via DOI
- export record
  dblp key:
  - conf/ciac/DisserFKM13
- ask others
- share record
  short URL:
  - https://dblp.org/rec/conf/ciac/DisserFKM13
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]
- view
  - electronic edition via DOI
- export record
  dblp key:
  - conf/wg/BevernFSS13
- ask others
- share record
  short URL:
  - https://dblp.org/rec/conf/wg/BevernFSS13
René van Bevern, Andreas Emil Feldmann, Manuel Sorge, Ondrej Suchý:
On the Parameterized Complexity of Computing Graph Bisections. WG 2013: 76-87
[i3]
- view
  - electronic edition @ arxiv.org
- export record
  dblp key:
  - journals/corr/BevernFSS13
- ask others
- share record
  short URL:
  - https://dblp.org/rec/journals/corr/BevernFSS13
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)
2012
[b1]
- view
  - electronic edition @ d-nb.info
- export record
  dblp key:
  - phd/dnb/Feldmann12a
- ask others
- share record
  short URL:
  - https://dblp.org/rec/phd/dnb/Feldmann12a
Andreas Emil Feldmann:
Balanced partitioning of grids and related graphs: a theoretical study of data distribution in parallel finite element model simulations. Cuvillier 2012, ISBN 978-3-95404-125-1, pp. 1-201
[j1]
- view
  - electronic edition via DOI
- export record
  dblp key:
  - journals/networks/FeldmannRV12
- ask others
- share record
  short URL:
  - https://dblp.org/rec/journals/networks/FeldmannRV12
Andreas Emil Feldmann, Heiko Röglin, Berthold Vöcking:
Computing approximate Nash equilibria in network congestion games. Networks 59(4): 380-386 (2012)
[c6]
- view
  - electronic edition via DOI
- export record
  dblp key:
  - conf/mfcs/Feldmann12
- ask others
- share record
  short URL:
  - https://dblp.org/rec/conf/mfcs/Feldmann12
Andreas Emil Feldmann:
Fast Balanced Partitioning Is Hard Even on Grids and Trees. MFCS 2012: 372-382
[c5]
- view
  - electronic edition via DOI
- export record
  dblp key:
  - conf/stacs/FeldmannF12
- ask others
- share record
  short URL:
  - https://dblp.org/rec/conf/stacs/FeldmannF12
Andreas Emil Feldmann, Luca Foschini:
Balanced Partitions of Trees and Applications. STACS 2012: 100-111
[i2]
- view
  - electronic edition @ arxiv.org
- export record
  dblp key:
  - journals/corr/abs-1211-2090
- ask others
- share record
  short URL:
  - https://dblp.org/rec/journals/corr/abs-1211-2090
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)
2011
[c4]
- view
  - electronic edition via DOI
- export record
  dblp key:
  - conf/esa/FeldmannW11
- ask others
- share record
  short URL:
  - https://dblp.org/rec/conf/esa/FeldmannW11
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]
- view
  - electronic edition via DOI
- export record
  dblp key:
  - conf/wg/FeldmannDW11
- ask others
- share record
  short URL:
  - https://dblp.org/rec/conf/wg/FeldmannDW11
Andreas Emil Feldmann, Shantanu Das, Peter Widmayer:
Restricted Cuts for Bisections in Solid Grids: A Proof via Polygons. WG 2011: 143-154
[i1]
- view
  - electronic edition @ arxiv.org
- export record
  dblp key:
  - journals/corr/abs-1111-6745
- ask others
- share record
  short URL:
  - https://dblp.org/rec/journals/corr/abs-1111-6745
Andreas Emil Feldmann:
Fast Balanced Partitioning of Grid Graphs is Hard. CoRR abs/1111.6745 (2011)
2010
[c2]
- view
  - electronic edition via DOI
- export record
  dblp key:
  - conf/cocoa/FeldmannDW10
- ask others
- share record
  short URL:
  - https://dblp.org/rec/conf/cocoa/FeldmannDW10
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

see FAQ

What is the meaning of the colors in the publication lists?

2008
[c1]
- view
  - electronic edition via DOI
- export record
  dblp key:
  - conf/sirocco/FeldmannRV08
- ask others
- share record
  short URL:
  - https://dblp.org/rec/conf/sirocco/FeldmannRV08
Andreas Emil Feldmann, Heiko Röglin, Berthold Vöcking:
Computing Approximate Nash Equilibria in Network Congestion Games. SIROCCO 2008: 209-220

Coauthor Index

see FAQ

maintained by

at