Simple Cuts Are Fast and Good: Optimum Right-Angled Cuts in Solid Grids. - Andreas Emil Feldmann; Shantanu Das 001; Peter Widmayer (COCOA (1), 2010)

An $ mathcal{O}(n^4)$ Time Algorithm to Compute the Bisection Width of Solid Grid Graphs. - Andreas Emil Feldmann; Peter Widmayer (ESA, 2011)

Restricted Cuts for Bisections in Solid Grids: A Proof via Polygons. - Andreas Emil Feldmann; Shantanu Das 001; Peter Widmayer (WG, 2011)

Fast Balanced Partitioning of Grid Graphs is Hard - Andreas Emil Feldmann (CoRR, 2011)

Improving the $H_k$-Bound on the Price of Stability in Undirected Shapley Network Design Games - Yann Disser; Andreas Emil Feldmann; Max Klimm; Matús Mihalák (CoRR, 2012)

Computing approximate Nash equilibria in network congestion games. - Andreas Emil Feldmann; Heiko Röglin; Berthold Vöcking (Networks, 2012)

Balanced partitioning of grids and related graphs: a theoretical study of data distribution in parallel finite element model simulations. - Andreas Emil Feldmann (Cuvillier, 2012)

Improving the H k -Bound on the Price of Stability in Undirected Shapley Network Design Games. - Yann Disser; Andreas Emil Feldmann; Max Klimm; Matús Mihalák (CIAC, 2013)

On the Parameterized Complexity of Computing Graph Bisections. - René van Bevern; Andreas Emil Feldmann; Manuel Sorge; Ondrej Suchý 001 (WG, 2013)

Corner cuts are close to optimal: From solid grids to polygons and back. - Andreas Emil Feldmann; Shantanu Das 001; Peter Widmayer (Discret. Appl. Math., 2013)

Fast balanced partitioning is hard even on grids and trees. - Andreas Emil Feldmann (Theor. Comput. Sci., 2013)

Balanced Partitions of Trees and Applications. - Andreas Emil Feldmann; Luca Foschini 002 (Algorithmica, 2015)

An O(n4) Time Algorithm to Compute the Bisection Width of Solid Grid Graphs. - Andreas Emil Feldmann; Peter Widmayer (Algorithmica, 2015)

On the Parameterized Complexity of Computing Balanced Partitions in Graphs. - René van Bevern; Andreas Emil Feldmann; Manuel Sorge; Ondrej Suchý 001 (Theory Comput. Syst., 2015)

Improving the Hk-bound on the price of stability in undirected Shapley network design games. - Yann Disser; Andreas Emil Feldmann; Max Klimm; Matús Mihalák (Theor. Comput. Sci., 2015)

Fast Approximation Algorithms for the Generalized Survivable Network Design Problem. - Andreas Emil Feldmann; Jochen Könemann; Kanstantsin Pashkovich; Laura Sanità (ISAAC, 2016)

On the equivalence of the bidirected and hypergraphic relaxations for Steiner tree. - Andreas Emil Feldmann; Jochen Könemann; Neil Olver; Laura Sanità (Math. Program., 2016)

Lehman's Theorem and the Directed Steiner Tree Problem. - Ahmad Abdi; Andreas Emil Feldmann; Bertrand Guenin; Jochen Könemann; Laura Sanità (SIAM J. Discret. Math., 2016)

Parameterized Approximation Algorithms for Directed Steiner Network Problems. - Rajesh Chitnis; Andreas Emil Feldmann; Pasin Manurangsi (CoRR, 2017)

A Tight Lower Bound for Steiner Orientation. - Rajesh Chitnis; Andreas Emil Feldmann (CSR, 2018)

A (1+ε)-Embedding of Low Highway Dimension Graphs into Bounded Treewidth Graphs. - Andreas Emil Feldmann; Wai Shing Fung; Jochen Könemann; Ian Post (SIAM J. Comput., 2018)

Near-Linear Time Approximations Schemes for Clustering in Doubling Metrics. - David Saulpic; Vincent Cohen-Addad; Andreas Emil Feldmann (FOCS, 2019)

FPT Inapproximability of Directed Cut and Connectivity Problems. - Rajesh Chitnis; Andreas Emil Feldmann (IPEC, 2019)

A Tight Lower Bound for Planar Steiner Orientation. - Rajesh Chitnis; Andreas Emil Feldmann; Ondrej Suchý 001 (Algorithmica, 2019)

Fixed-Parameter Approximations for k-Center Problems in Low Highway Dimension Graphs. - Andreas Emil Feldmann (Algorithmica, 2019)

Fixed-Parameter Tractability of the Weighted Edge Clique Partition Problem. - Andreas Emil Feldmann; Davis Issac; Ashutosh Rai 001 (IPEC, 2020)

Recoloring Interval Graphs with Limited Recourse Budget. - Bartlomiej Bosek; Yann Disser; Andreas Emil Feldmann; Jakub Pawlewicz; Anna Zych-Pawlewicz (SWAT, 2020)

The Parameterized Hardness of the k-Center Problem in Transportation Networks. - Andreas Emil Feldmann; Dániel Marx (Algorithmica, 2020)

A Survey on Approximation in Parameterized Complexity: Hardness and Algorithms. - Andreas Emil Feldmann; Karthik C. S. 001; Euiwoong Lee; Pasin Manurangsi (Algorithms, 2020)

On Dynamic Parameterized k-Path. - Jiehua Chen 001; Wojciech Czerwinski; Yann Disser; Andreas Emil Feldmann; Danny Hermelin; Wojciech Nadara; Michal Pilipczuk; Marcin Pilipczuk; Manuel Sorge; Bartlomiej Wróblewski 002; Anna Zych-Pawlewicz (CoRR, 2020)

Tight Bounds for Planar Strongly Connected Steiner Subgraph with Fixed Number of Terminals (and Extensions). - Rajesh Hemant Chitnis; Andreas Emil Feldmann; Mohammad Taghi Hajiaghayi; Dániel Marx (SIAM J. Comput., 2020)

On Extended Formulations For Parameterized Steiner Trees. - Andreas Emil Feldmann; Ashutosh Rai 001 (IPEC, 2021)

Efficient fully dynamic elimination forests with applications to detecting long paths and cycles. - Jiehua Chen 001; Wojciech Czerwinski; Yann Disser; Andreas Emil Feldmann; Danny Hermelin; Wojciech Nadara; Marcin Pilipczuk; Michal Pilipczuk; Manuel Sorge; Bartlomiej Wróblewski 002; Anna Zych-Pawlewicz (SODA, 2021)

Travelling on Graphs with Small Highway Dimension. - Yann Disser; Andreas Emil Feldmann; Max Klimm; Jochen Könemann (Algorithmica, 2021)

Near-linear Time Approximation Schemes for Clustering in Doubling Metrics. - Vincent Cohen-Addad; Andreas Emil Feldmann; David Saulpic (J. ACM, 2021)

Polynomial time approximation schemes for clustering in low highway dimension graphs. - Andreas Emil Feldmann; David Saulpic (J. Comput. Syst. Sci., 2021)

A note on the approximability of deepest-descent circuit steps. - Steffen Borgwardt; Cornelius Brand; Andreas Emil Feldmann; Martin Koutecký (Oper. Res. Lett., 2021)

Parameterized Approximation Schemes for Steiner Trees with Small Number of Steiner Vertices. - Pavel Dvorák; Andreas Emil Feldmann; Dusan Knop; Tomás Masarík; Tomás Toufar; Pavel Veselý 001 (SIAM J. Discret. Math., 2021)

Parameterized Approximation Algorithms for Bidirected Steiner Network Problems. - Rajesh Chitnis; Andreas Emil Feldmann; Pasin Manurangsi (ACM Trans. Algorithms, 2021)

On Sparse Hitting Sets: From Fair Vertex Cover to Highway Dimension. - Johannes Blum 001; Yann Disser; Andreas Emil Feldmann; Siddharth Gupta 002; Anna Zych-Pawlewicz (IPEC, 2022)

Generalized k-Center: Distinguishing Doubling and Highway Dimension. - Andreas Emil Feldmann; Tung Anh Vu (WG, 2022)

Approximation Algorithms and Lower Bounds for Graph Burning. - Matej Lieskovský; Jirí Sgall; Andreas Emil Feldmann (APPROX/RANDOM, 2023)

The Complexity Landscape of Fixed-Parameter Directed Steiner Network Problems. - Andreas Emil Feldmann; Dániel Marx (ACM Trans. Comput. Theory, 2023)

Parameterized Inapproximability of Independent Set in H-Free Graphs. - Pavel Dvorák; Andreas Emil Feldmann; Ashutosh Rai 001; Pawel Rzazewski (Algorithmica, 2023)

A (5/3+ε)-Approximation for Tricolored Non-Crossing Euclidean TSP. - Júlia Baligács; Yann Disser; Andreas Emil Feldmann; Anna Zych-Pawlewicz (ESA, 2024)

Parameterized Algorithms for Steiner Forest in Bounded Width Graphs. - Andreas Emil Feldmann; Michael Lampis (ICALP, 2024)

Highway Dimension: a Metric View. - Andreas Emil Feldmann; Arnold Filtser (SODA, 2025)

The parameterized complexity of the survivable network design problem. - Andreas Emil Feldmann; Anish Mukherjee 001; Erik Jan van Leeuwen (J. Comput. Syst. Sci., 2025)

Parameterized Complexity of Directed Traveling Salesman Problem. - Václav Blazej; Andreas Emil Feldmann; Foivos Fioravantes; Pawel Rzazewski; Ondrej Suchý 001 (CoRR, 2025)