| 2026 | ESA | Online and Incremental Fractional Vertex Cover on Trees. | Jlia Baligcs, Bartlomiej Bosek, Yann Disser, Andreas Emil Feldmann, Grzegorz Gutowski, Katarzyna Kepinska, Pawel Putra, Anna Zych-Pawlewicz |
| 2026 | SOFSEM | Complexity Aspects of Homomorphisms of Ordered Graphs. | Michal Certk, Andreas Emil Feldmann, Jaroslav Nesetril, Pawel Rzazewski |
| 2025 | ISAAC | Parameterized Complexity of Directed Traveling Salesman Problem. | Vclav Blazej, Andreas Emil Feldmann, Foivos Fioravantes, Pawel Rzazewski, Ondrej Such |
| 2025 | ICTAC | On Computational Aspects of Ordered Matching Problems. | Michal Certk, Andreas Emil Feldmann, Jaroslav Nesetril, Pawel Rzazewski |
| 2025 | SODA | Highway Dimension: a Metric View. | Andreas Emil Feldmann, Arnold Filtser |
| 2024 | ESA | A (5/3+ε)-Approximation for Tricolored Non-Crossing Euclidean TSP. | Jlia Baligcs, Yann Disser, Andreas Emil Feldmann, Anna Zych-Pawlewicz |
| 2024 | ICALP | Parameterized Algorithms for Steiner Forest in Bounded Width Graphs. | Andreas Emil Feldmann, Michael Lampis |
| 2022 | WG | Generalized k-Center: Distinguishing Doubling and Highway Dimension. | Andreas Emil Feldmann, Tung Anh Vu |
| 2021 | SODA | Efficient fully dynamic elimination forests with applications to detecting long paths and cycles. | Jiehua Chen, Wojciech Czerwinski, Yann Disser, Andreas Emil Feldmann, Danny Hermelin, Wojciech Nadara, Marcin Pilipczuk, Michal Pilipczuk, Manuel Sorge, Bartlomiej Wrblewski, Anna Zych-Pawlewicz |
| 2020 | ESA | Polynomial Time Approximation Schemes for Clustering in Low Highway Dimension Graphs. | Andreas Emil Feldmann, David Saulpic |
| 2020 | WG | Parameterized Inapproximability of Independent Set in H-Free Graphs. | Pavel Dvork, Andreas Emil Feldmann, Ashutosh Rai, Pawel Rzazewski |
| 2019 | FOCS | Near-Linear Time Approximations Schemes for Clustering in Doubling Metrics. | David Saulpic, Vincent Cohen-Addad, Andreas Emil Feldmann |
| 2019 | WG | Travelling on Graphs with Small Highway Dimension. | Yann Disser, Andreas Emil Feldmann, Max Klimm, Jochen Knemann |
| 2018 | CSR | A Tight Lower Bound for Steiner Orientation. | Rajesh Chitnis, Andreas Emil Feldmann |
| 2018 | ESA | Parameterized Approximation Algorithms for Bidirected Steiner Network Problems. | Rajesh Chitnis, Andreas Emil Feldmann, Pasin Manurangsi |
| 2018 | STACS | Parameterized Approximation Schemes for Steiner Trees with Small Number of Steiner Vertices. | Pavel Dvork, Andreas Emil Feldmann, Dusan Knop, Toms Masark, Tomas Toufar, Pavel Vesel |
| 2016 | ICALP | The Complexity Landscape of Fixed-Parameter Directed Steiner Network Problems. | Andreas Emil Feldmann, Dniel Marx |
| 2016 | ISAAC | Fast Approximation Algorithms for the Generalized Survivable Network Design Problem. | Andreas Emil Feldmann, Jochen Knemann, Kanstantsin Pashkovich, Laura Sanit |
| 2015 | ICALP | Fixed Parameter Approximations for k-Center Problems in Low Highway Dimension Graphs. | Andreas Emil Feldmann |
| 2015 | ICALP | A (1+ε)-Embedding of Low Highway Dimension Graphs into Bounded Treewidth Graphs. | Andreas Emil Feldmann, Wai Shing Fung, Jochen Knemann, Ian Post |
| 2013 | CIAC | Improving the | Yann Disser, Andreas Emil Feldmann, Max Klimm, Mats Mihalk |
| 2013 | WG | On the Parameterized Complexity of Computing Graph Bisections. | Ren van Bevern, Andreas Emil Feldmann, Manuel Sorge, Ondrej Such |
| 2012 | MFCS | Fast Balanced Partitioning Is Hard Even on Grids and Trees. | Andreas Emil Feldmann |
| 2012 | STACS | Balanced Partitions of Trees and Applications. | Andreas Emil Feldmann, Luca Foschini |
| 2011 | ESA | An $\mathcal{O}(n^4)$ Time Algorithm to Compute the Bisection Width of Solid Grid Graphs. | Andreas Emil Feldmann, Peter Widmayer |
| 2011 | WG | Restricted Cuts for Bisections in Solid Grids: A Proof via Polygons. | Andreas Emil Feldmann, Shantanu Das, Peter Widmayer |
| 2010 | COCOA | Simple Cuts Are Fast and Good: Optimum Right-Angled Cuts in Solid Grids. | Andreas Emil Feldmann, Shantanu Das, Peter Widmayer |
| 2008 | SIROCCO | Computing Approximate Nash Equilibria in Network Congestion Games. | Andreas Emil Feldmann, Heiko Rglin, Berthold Vcking |