Andreas Emil Feldmann

Publication Activity (10 Years)

Years Active: 2008-2024
Publications (10 Years): 57

Top Topics

Approximation Algorithms

Bounded Treewidth

Top Venues

ETH Zurich (PHD)

Education History

ETH Zurich

PHD

Publications

Andreas Emil Feldmann, Michael Lampis
Parameterized Algorithms for Steiner Forest in Bounded Width Graphs. CoRR (2024)
Júlia Baligács, Yann Disser, Andreas Emil Feldmann, Anna Zych-Pawlewicz
A (5/3+ε)-Approximation for Tricolored Non-crossing Euclidean TSP. CoRR (2024)
Andreas Emil Feldmann, Michael Lampis
Parameterized Algorithms for Steiner Forest in Bounded Width Graphs. ICALP (2024)
Pavel Dvorák, Andreas Emil Feldmann, Ashutosh Rai, Pawel Rzazewski
Parameterized Inapproximability of Independent Set in H-Free Graphs. Algorithmica 85 (4) (2023)
Matej Lieskovský, Jirí Sgall, Andreas Emil Feldmann
Approximation Algorithms and Lower Bounds for Graph Burning. APPROX/RANDOM (2023)
Johannes Blum, Yann Disser, Andreas Emil Feldmann, Siddharth Gupta, Anna Zych-Pawlewicz
On Sparse Hitting Sets: from Fair Vertex Cover to Highway Dimension. CoRR (2022)
Andreas Emil Feldmann, Anish Mukherjee, Erik Jan van Leeuwen
The Parameterized Complexity of the Survivable Network Design Problem. SOSA (2022)
Andreas Emil Feldmann, Tung Anh Vu
Generalized $k$-Center: Distinguishing Doubling and Highway Dimension. CoRR (2022)
Andreas Emil Feldmann, Tung Anh Vu
Generalized k-Center: Distinguishing Doubling and Highway Dimension. WG (2022)
Johannes Blum, Yann Disser, Andreas Emil Feldmann, Siddharth Gupta, Anna Zych-Pawlewicz
On Sparse Hitting Sets: From Fair Vertex Cover to Highway Dimension. IPEC (2022)
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. SIAM J. Discret. Math. 35 (1) (2021)
Steffen Borgwardt, Cornelius Brand, Andreas Emil Feldmann, Martin Koutecký
A note on the approximability of deepest-descent circuit steps. Oper. Res. Lett. 49 (3) (2021)
Andreas Emil Feldmann, David Saulpic
Polynomial time approximation schemes for clustering in low highway dimension graphs. J. Comput. Syst. Sci. 122 (2021)
Andreas Emil Feldmann, Ashutosh Rai
On Extended Formulations For Parameterized Steiner Trees. IPEC (2021)
Rajesh Chitnis, Andreas Emil Feldmann, Pasin Manurangsi
Parameterized Approximation Algorithms for Bidirected Steiner Network Problems. ACM Trans. Algorithms 17 (2) (2021)
Yann Disser, Andreas Emil Feldmann, Max Klimm, Jochen Könemann
Travelling on Graphs with Small Highway Dimension. Algorithmica 83 (5) (2021)
Vincent Cohen-Addad, Andreas Emil Feldmann, David Saulpic
Near-linear Time Approximation Schemes for Clustering in Doubling Metrics. J. ACM 68 (6) (2021)
Andreas Emil Feldmann, Anish Mukherjee, Erik Jan van Leeuwen
The Parameterized Complexity of the Survivable Network Design Problem. CoRR (2021)
Jiehua Chen, Wojciech Czerwinski, Yann Disser, Andreas Emil Feldmann, Danny Hermelin, Wojciech Nadara, Marcin Pilipczuk, Michal Pilipczuk, Manuel Sorge, Bartlomiej Wróblewski, Anna Zych-Pawlewicz
Efficient fully dynamic elimination forests with applications to detecting long paths and cycles. SODA (2021)
Andreas Emil Feldmann, Davis Issac, Ashutosh Rai
Fixed-Parameter Tractability of the Weighted Edge Clique Partition Problem. IPEC (2020)
Rajesh Hemant Chitnis, Andreas Emil Feldmann, Mohammad Taghi Hajiaghayi, Dániel Marx
Tight Bounds for Planar Strongly Connected Steiner Subgraph with Fixed Number of Terminals (and Extensions). SIAM J. Comput. 49 (2) (2020)
Jiehua Chen, Wojciech Czerwinski, Yann Disser, Andreas Emil Feldmann, Danny Hermelin, Wojciech Nadara, Michal Pilipczuk, Marcin Pilipczuk, Manuel Sorge, Bartlomiej Wróblewski, Anna Zych-Pawlewicz
On Dynamic Parameterized k-Path. CoRR (2020)
Andreas Emil Feldmann, David Saulpic
Polynomial Time Approximation Schemes for Clustering in Low Highway Dimension Graphs. CoRR (2020)
Pavel Dvorák, Andreas Emil Feldmann, Ashutosh Rai, Pawel Rzazewski
Parameterized Inapproximability of Independent Set in H-Free Graphs. CoRR (2020)
Andreas Emil Feldmann, Karthik C. S., Euiwoong Lee, Pasin Manurangsi
A Survey on Approximation in Parameterized Complexity: Hardness and Algorithms. Algorithms 13 (6) (2020)
Bartlomiej Bosek, Yann Disser, Andreas Emil Feldmann, Jakub Pawlewicz, Anna Zych-Pawlewicz
Recoloring Interval Graphs with Limited Recourse Budget. SWAT (2020)
Pavel Dvorák, Andreas Emil Feldmann, Ashutosh Rai, Pawel Rzazewski
Parameterized Inapproximability of Independent Set in H-Free Graphs. WG (2020)
Andreas Emil Feldmann, Dániel Marx
The Parameterized Hardness of the k-Center Problem in Transportation Networks. Algorithmica 82 (7) (2020)
Steffen Borgwardt, Cornelius Brand, Andreas Emil Feldmann, Martin Koutecký
A Note on the Approximability of Deepest-Descent Circuit Steps. CoRR (2020)
Andreas Emil Feldmann, David Saulpic
Polynomial Time Approximation Schemes for Clustering in Low Highway Dimension Graphs. ESA (2020)
Andreas Emil Feldmann, Karthik C. S., Euiwoong Lee, Pasin Manurangsi
A Survey on Approximation in Parameterized Complexity: Hardness and Algorithms. Electron. Colloquium Comput. Complex. 27 (2020)
Andreas Emil Feldmann, Davis Issac, Ashutosh Rai
Fixed-Parameter Tractability of the Weighted Edge Clique Partition Problem. CoRR (2020)
Andreas Emil Feldmann, Karthik C. S., Euiwoong Lee, Pasin Manurangsi
A Survey on Approximation in Parameterized Complexity: Hardness and Algorithms. CoRR (2020)
Rajesh Chitnis, Andreas Emil Feldmann, Ondrej Suchý
A Tight Lower Bound for Planar Steiner Orientation. Algorithmica 81 (8) (2019)
Rajesh Chitnis, Andreas Emil Feldmann
FPT Inapproximability of Directed Cut and Connectivity Problems. CoRR (2019)
Yann Disser, Andreas Emil Feldmann, Max Klimm, Jochen Könemann
Travelling on Graphs with Small Highway Dimension. WG (2019)
Andreas Emil Feldmann
Fixed-Parameter Approximations for k-Center Problems in Low Highway Dimension Graphs. Algorithmica 81 (3) (2019)
Rajesh Chitnis, Andreas Emil Feldmann
FPT Inapproximability of Directed Cut and Connectivity Problems. IPEC (2019)
Yann Disser, Andreas Emil Feldmann, Max Klimm, Jochen Könemann
Travelling on Graphs with Small Highway Dimension. CoRR (2019)
David Saulpic, Vincent Cohen-Addad, Andreas Emil Feldmann
Near-Linear Time Approximations Schemes for Clustering in Doubling Metrics. FOCS (2019)
Rajesh Chitnis, Andreas Emil Feldmann, MohammadTaghi Hajiaghayi, Dániel Marx
Tight Bounds for Planar Strongly Connected Steiner Subgraph with Fixed Number of Terminals (and Extensions). CoRR (2019)
Vincent Cohen-Addad, Andreas Emil Feldmann, David Saulpic
Near-Linear Time Approximation Schemes for Clustering in Doubling Metrics. CoRR (2018)
Rajesh Chitnis, Andreas Emil Feldmann, Pasin Manurangsi
Parameterized Approximation Algorithms for Bidirected Steiner Network Problems. ESA (2018)
Rajesh Chitnis, Andreas Emil Feldmann
A Tight Lower Bound for Steiner Orientation. CSR (2018)
Andreas Emil Feldmann, Wai Shing Fung, Jochen Könemann, Ian Post
A (1+ε)-Embedding of Low Highway Dimension Graphs into Bounded Treewidth Graphs. SIAM J. Comput. 47 (4) (2018)
Andreas Emil Feldmann, Dániel Marx
The Parameterized Hardness of the k-Center Problem in Transportation Networks. CoRR (2018)
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)
Andreas Emil Feldmann, Dániel Marx
The Parameterized Hardness of the k-Center Problem in Transportation Networks. SWAT (2018)
Rajesh Chitnis, Andreas Emil Feldmann, Pasin Manurangsi
Parameterized Approximation Algorithms for Directed Steiner Network Problems. CoRR (2017)
Andreas Emil Feldmann, Dániel Marx
The Complexity Landscape of Fixed-Parameter Directed Steiner Network Problems. CoRR (2017)
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 (2017)
Andreas Emil Feldmann, Jochen Könemann, Kanstantsin Pashkovich, Laura Sanità
Fast Approximation Algorithms for the Generalized Survivable Network Design Problem. ISAAC (2016)
Andreas Emil Feldmann, Jochen Könemann, Kanstantsin Pashkovich, Laura Sanità
Fast Approximation Algorithms for the Generalized Survivable Network Design Problem. CoRR (2016)
Andreas Emil Feldmann, Dániel Marx
The Complexity Landscape of Fixed-Parameter Directed Steiner Network Problems. ICALP (2016)
Ahmad Abdi, Andreas Emil Feldmann, Bertrand Guenin, Jochen Könemann, Laura Sanità
Lehman's Theorem and the Directed Steiner Tree Problem. SIAM J. Discret. Math. 30 (1) (2016)
Andreas Emil Feldmann
Fixed Parameter Approximations for k-Center Problems in Low Highway Dimension Graphs. CoRR (2016)
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) (2016)
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) (2015)
Andreas Emil Feldmann, Peter Widmayer
) Time Algorithm to Compute the Bisection Width of Solid Grid Graphs. Algorithmica 71 (1) (2015)
Andreas Emil Feldmann, Luca Foschini
Balanced Partitions of Trees and Applications. Algorithmica 71 (2) (2015)
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 (2015)
Andreas Emil Feldmann, Wai Shing Fung, Jochen Könemann, Ian Post
A (1+ε)-Embedding of Low Highway Dimension Graphs into Bounded Treewidth Graphs. ICALP (1) (2015)
Andreas Emil Feldmann, Wai Shing Fung, Jochen Könemann, Ian Post
A (1 + ε)-Embedding of Low Highway Dimension Graphs into Bounded Treewidth Graphs. CoRR (2015)
Andreas Emil Feldmann
Fixed Parameter Approximations for k-Center Problems in Low Highway Dimension Graphs. ICALP (2) (2015)
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)
Andreas Emil Feldmann, Shantanu Das, Peter Widmayer
Corner cuts are close to optimal: From solid grids to polygons and back. Discret. Appl. Math. 161 (7-8) (2013)
Yann Disser, Andreas Emil Feldmann, Max Klimm, Matús Mihalák
-Bound on the Price of Stability in Undirected Shapley Network Design Games. CIAC (2013)
Andreas Emil Feldmann
Fast balanced partitioning is hard even on grids and trees. Theor. Comput. Sci. 485 (2013)
René van Bevern, Andreas Emil Feldmann, Manuel Sorge, Ondrej Suchý
On the Parameterized Complexity of Computing Graph Bisections. WG (2013)
René van Bevern, Andreas Emil Feldmann, Manuel Sorge, Ondrej Suchý
On the Parameterized Complexity of Computing Balanced Partitions in Graphs. CoRR (2013)
Andreas Emil Feldmann, Heiko Röglin, Berthold Vöcking
Computing approximate Nash equilibria in network congestion games. Networks 59 (4) (2012)
Andreas Emil Feldmann
Fast Balanced Partitioning Is Hard Even on Grids and Trees. MFCS (2012)
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 (2012)
Andreas Emil Feldmann, Luca Foschini
Balanced Partitions of Trees and Applications. STACS (2012)
Andreas Emil Feldmann
Fast Balanced Partitioning of Grid Graphs is Hard CoRR (2011)
Andreas Emil Feldmann, Shantanu Das, Peter Widmayer
Restricted Cuts for Bisections in Solid Grids: A Proof via Polygons. WG (2011)
Andreas Emil Feldmann, Peter Widmayer
An $\mathcal{O}(n^4)$ Time Algorithm to Compute the Bisection Width of Solid Grid Graphs. ESA (2011)
Andreas Emil Feldmann, Shantanu Das, Peter Widmayer
Simple Cuts Are Fast and Good: Optimum Right-Angled Cuts in Solid Grids. COCOA (1) (2010)
Andreas Emil Feldmann, Heiko Röglin, Berthold Vöcking
Computing Approximate Nash Equilibria in Network Congestion Games. SIROCCO (2008)