Andreas Emil Feldmann

95 papers A* 5A 7B 14C 3Misc 1Journal 57Unranked 7

Year	Rank	Type	Title / Venue / Authors
2026	B	`conf`	Complexity Aspects of Homomorphisms of Ordered Graphs. SOFSEM Michal Certík, Andreas Emil Feldmann, Jaroslav Nesetril, Pawel Rzazewski
2026	J	`jnl`	Generalized k-Center: Distinguishing Doubling and Highway Dimension. Algorithmica Andreas Emil Feldmann, Tung Anh Vu
2026	C	`conf`	On Computational Aspects of Cores of Ordered Graphs. RAMICS Michal Certík, Andreas Emil Feldmann, Jaroslav Nesetril, Pawel Rzazewski
2025	J	`jnl`	Complexity Aspects of Homomorphisms of Ordered Graphs. CoRR Michal Certík, Andreas Emil Feldmann, Jaroslav Nesetril, Pawel Rzazewski
2025	A*	`conf`	Highway Dimension: a Metric View. SODA Andreas Emil Feldmann, Arnold Filtser
2025	J	`jnl`	On Computational Aspects of Cores of Ordered Graphs. CoRR Michal Certík, Andreas Emil Feldmann, Jaroslav Nesetril, Pawel Rzazewski
2025	C	`conf`	On Computational Aspects of Ordered Matching Problems. ICTAC Michal Certík, Andreas Emil Feldmann, Jaroslav Nesetril, Pawel Rzazewski
2025	J	`jnl`	On Computational Aspects of Ordered Matching Problems. CoRR Michal Certík, Andreas Emil Feldmann, Jaroslav Nesetril, Pawel Rzazewski
2025	J	`jnl`	Parameterized Algorithms for Steiner Forest in Bounded Width Graphs. ACM Trans. Algorithms Andreas Emil Feldmann, Michael Lampis
2025	B	`conf`	Parameterized Complexity of Directed Traveling Salesman Problem. ISAAC Václav Blazej, Andreas Emil Feldmann, Foivos Fioravantes, Pawel Rzazewski, Ondrej Suchý
2025	J	`jnl`	Parameterized Complexity of Directed Traveling Salesman Problem. CoRR Václav Blazej, Andreas Emil Feldmann, Foivos Fioravantes, Pawel Rzazewski, Ondrej Suchý
2025	J	`jnl`	The parameterized complexity of the survivable network design problem. J. Comput. Syst. Sci. Andreas Emil Feldmann, Anish Mukherjee, Erik Jan van Leeuwen
2024	A	`conf`	A (5/3+ε)-Approximation for Tricolored Non-Crossing Euclidean TSP. ESA Júlia Baligács, Yann Disser, Andreas Emil Feldmann, Anna Zych-Pawlewicz
2024	J	`jnl`	A (5/3+ε)-Approximation for Tricolored Non-crossing Euclidean TSP. CoRR Júlia Baligács, Yann Disser, Andreas Emil Feldmann, Anna Zych-Pawlewicz
2024	J	`jnl`	Highway Dimension: a Metric View. CoRR Andreas Emil Feldmann, Arnold Filtser
2024	A*	`conf`	Parameterized Algorithms for Steiner Forest in Bounded Width Graphs. ICALP Andreas Emil Feldmann, Michael Lampis
2024	J	`jnl`	Parameterized Algorithms for Steiner Forest in Bounded Width Graphs. CoRR Andreas Emil Feldmann, Michael Lampis
2023	A	`conf`	Approximation Algorithms and Lower Bounds for Graph Burning. APPROX/RANDOM Matej Lieskovský, Jirí Sgall, Andreas Emil Feldmann
2023	J	`jnl`	Parameterized Inapproximability of Independent Set in H-Free Graphs. Algorithmica Pavel Dvorák, Andreas Emil Feldmann, Ashutosh Rai, Pawel Rzazewski
2023	J	`jnl`	The Complexity Landscape of Fixed-Parameter Directed Steiner Network Problems. ACM Trans. Comput. Theory Andreas Emil Feldmann, Dániel Marx
2022	J	`jnl`	Generalized $k$-Center: Distinguishing Doubling and Highway Dimension. CoRR Andreas Emil Feldmann, Tung Anh Vu
2022	B	`conf`	Generalized k-Center: Distinguishing Doubling and Highway Dimension. WG Andreas Emil Feldmann, Tung Anh Vu
2022	B	`conf`	On Sparse Hitting Sets: From Fair Vertex Cover to Highway Dimension. IPEC Johannes Blum, Yann Disser, Andreas Emil Feldmann, Siddharth Gupta, Anna Zych-Pawlewicz
2022	J	`jnl`	On Sparse Hitting Sets: from Fair Vertex Cover to Highway Dimension. CoRR Johannes Blum, Yann Disser, Andreas Emil Feldmann, Siddharth Gupta, Anna Zych-Pawlewicz
2022	—	`conf`	The Parameterized Complexity of the Survivable Network Design Problem. SOSA Andreas Emil Feldmann, Anish Mukherjee, Erik Jan van Leeuwen
2021	J	`jnl`	A note on the approximability of deepest-descent circuit steps. Oper. Res. Lett. Steffen Borgwardt, Cornelius Brand, Andreas Emil Feldmann, Martin Koutecký
2021	A*	`conf`	Efficient fully dynamic elimination forests with applications to detecting long paths and cycles. SODA 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
2021	J	`jnl`	Near-linear Time Approximation Schemes for Clustering in Doubling Metrics. J. ACM Vincent Cohen-Addad, Andreas Emil Feldmann, David Saulpic
2021	B	`conf`	On Extended Formulations For Parameterized Steiner Trees. IPEC Andreas Emil Feldmann, Ashutosh Rai
2021	J	`jnl`	Parameterized Approximation Algorithms for Bidirected Steiner Network Problems. ACM Trans. Algorithms Rajesh Chitnis, Andreas Emil Feldmann, Pasin Manurangsi
2021	J	`jnl`	Parameterized Approximation Schemes for Steiner Trees with Small Number of Steiner Vertices. SIAM J. Discret. Math. Pavel Dvorák, Andreas Emil Feldmann, Dusan Knop, Tomás Masarík, Tomás Toufar, Pavel Veselý
2021	J	`jnl`	Polynomial time approximation schemes for clustering in low highway dimension graphs. J. Comput. Syst. Sci. Andreas Emil Feldmann, David Saulpic
2021	J	`jnl`	The Parameterized Complexity of the Survivable Network Design Problem. CoRR Andreas Emil Feldmann, Anish Mukherjee, Erik Jan van Leeuwen
2021	J	`jnl`	Travelling on Graphs with Small Highway Dimension. Algorithmica Yann Disser, Andreas Emil Feldmann, Max Klimm, Jochen Könemann
2020	J	`jnl`	A Note on the Approximability of Deepest-Descent Circuit Steps. CoRR Steffen Borgwardt, Cornelius Brand, Andreas Emil Feldmann, Martin Koutecký
2020	J	`jnl`	A Survey on Approximation in Parameterized Complexity: Hardness and Algorithms. Algorithms Andreas Emil Feldmann, Karthik C. S., Euiwoong Lee, Pasin Manurangsi
2020	J	`jnl`	A Survey on Approximation in Parameterized Complexity: Hardness and Algorithms. CoRR Andreas Emil Feldmann, Karthik C. S., Euiwoong Lee, Pasin Manurangsi
2020	J	`jnl`	A Survey on Approximation in Parameterized Complexity: Hardness and Algorithms. Electron. Colloquium Comput. Complex. Andreas Emil Feldmann, Karthik C. S., Euiwoong Lee, Pasin Manurangsi
2020	B	`conf`	Fixed-Parameter Tractability of the Weighted Edge Clique Partition Problem. IPEC Andreas Emil Feldmann, Davis Issac, Ashutosh Rai
2020	J	`jnl`	Fixed-Parameter Tractability of the Weighted Edge Clique Partition Problem. CoRR Andreas Emil Feldmann, Davis Issac, Ashutosh Rai
2020	J	`jnl`	On Dynamic Parameterized k-Path. CoRR 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
2020	B	`conf`	Parameterized Inapproximability of Independent Set in H-Free Graphs. WG Pavel Dvorák, Andreas Emil Feldmann, Ashutosh Rai, Pawel Rzazewski
2020	J	`jnl`	Parameterized Inapproximability of Independent Set in H-Free Graphs. CoRR Pavel Dvorák, Andreas Emil Feldmann, Ashutosh Rai, Pawel Rzazewski
2020	A	`conf`	Polynomial Time Approximation Schemes for Clustering in Low Highway Dimension Graphs. ESA Andreas Emil Feldmann, David Saulpic
2020	J	`jnl`	Polynomial Time Approximation Schemes for Clustering in Low Highway Dimension Graphs. CoRR Andreas Emil Feldmann, David Saulpic
2020	—	`conf`	Recoloring Interval Graphs with Limited Recourse Budget. SWAT Bartlomiej Bosek, Yann Disser, Andreas Emil Feldmann, Jakub Pawlewicz, Anna Zych-Pawlewicz
2020	J	`jnl`	The Parameterized Hardness of the k-Center Problem in Transportation Networks. Algorithmica Andreas Emil Feldmann, Dániel Marx
2020	J	`jnl`	Tight Bounds for Planar Strongly Connected Steiner Subgraph with Fixed Number of Terminals (and Extensions). SIAM J. Comput. Rajesh Hemant Chitnis, Andreas Emil Feldmann, Mohammad Taghi Hajiaghayi, Dániel Marx
2019	J	`jnl`	A Tight Lower Bound for Planar Steiner Orientation. Algorithmica Rajesh Chitnis, Andreas Emil Feldmann, Ondrej Suchý
2019	B	`conf`	FPT Inapproximability of Directed Cut and Connectivity Problems. IPEC Rajesh Chitnis, Andreas Emil Feldmann
2019	J	`jnl`	FPT Inapproximability of Directed Cut and Connectivity Problems. CoRR Rajesh Chitnis, Andreas Emil Feldmann
2019	J	`jnl`	Fixed-Parameter Approximations for k-Center Problems in Low Highway Dimension Graphs. Algorithmica Andreas Emil Feldmann
2019	A*	`conf`	Near-Linear Time Approximations Schemes for Clustering in Doubling Metrics. FOCS David Saulpic, Vincent Cohen-Addad, Andreas Emil Feldmann
2019	J	`jnl`	Tight Bounds for Planar Strongly Connected Steiner Subgraph with Fixed Number of Terminals (and Extensions). CoRR Rajesh Chitnis, Andreas Emil Feldmann, MohammadTaghi Hajiaghayi, Dániel Marx
2019	B	`conf`	Travelling on Graphs with Small Highway Dimension. WG Yann Disser, Andreas Emil Feldmann, Max Klimm, Jochen Könemann
2019	J	`jnl`	Travelling on Graphs with Small Highway Dimension. CoRR Yann Disser, Andreas Emil Feldmann, Max Klimm, Jochen Könemann
2018	J	`jnl`	A (1+ε)-Embedding of Low Highway Dimension Graphs into Bounded Treewidth Graphs. SIAM J. Comput. Andreas Emil Feldmann, Wai Shing Fung, Jochen Könemann, Ian Post
2018	Misc	`conf`	A Tight Lower Bound for Steiner Orientation. CSR Rajesh Chitnis, Andreas Emil Feldmann
2018	J	`jnl`	Near-Linear Time Approximation Schemes for Clustering in Doubling Metrics. CoRR Vincent Cohen-Addad, Andreas Emil Feldmann, David Saulpic
2018	A	`conf`	Parameterized Approximation Algorithms for Bidirected Steiner Network Problems. ESA Rajesh Chitnis, Andreas Emil Feldmann, Pasin Manurangsi
2018	A	`conf`	Parameterized Approximation Schemes for Steiner Trees with Small Number of Steiner Vertices. STACS Pavel Dvorák, Andreas Emil Feldmann, Dusan Knop, Tomás Masarík, Tomas Toufar, Pavel Veselý
2018	—	`conf`	The Parameterized Hardness of the k-Center Problem in Transportation Networks. SWAT Andreas Emil Feldmann, Dániel Marx
2018	J	`jnl`	The Parameterized Hardness of the k-Center Problem in Transportation Networks. CoRR Andreas Emil Feldmann, Dániel Marx
2017	J	`jnl`	Parameterized Approximation Algorithms for Directed Steiner Network Problems. CoRR Rajesh Chitnis, Andreas Emil Feldmann, Pasin Manurangsi
2017	J	`jnl`	Parameterized Approximation Schemes for Steiner Trees with Small Number of Steiner Vertices. CoRR Pavel Dvorák, Andreas Emil Feldmann, Dusan Knop, Tomás Masarík, Tomás Toufar, Pavel Veselý
2017	J	`jnl`	The Complexity Landscape of Fixed-Parameter Directed Steiner Network Problems. CoRR Andreas Emil Feldmann, Dániel Marx
2016	B	`conf`	Fast Approximation Algorithms for the Generalized Survivable Network Design Problem. ISAAC Andreas Emil Feldmann, Jochen Könemann, Kanstantsin Pashkovich, Laura Sanità
2016	J	`jnl`	Fast Approximation Algorithms for the Generalized Survivable Network Design Problem. CoRR Andreas Emil Feldmann, Jochen Könemann, Kanstantsin Pashkovich, Laura Sanità
2016	J	`jnl`	Fixed Parameter Approximations for k-Center Problems in Low Highway Dimension Graphs. CoRR Andreas Emil Feldmann
2016	J	`jnl`	Lehman's Theorem and the Directed Steiner Tree Problem. SIAM J. Discret. Math. Ahmad Abdi, Andreas Emil Feldmann, Bertrand Guenin, Jochen Könemann, Laura Sanità
2016	J	`jnl`	On the equivalence of the bidirected and hypergraphic relaxations for Steiner tree. Math. Program. Andreas Emil Feldmann, Jochen Könemann, Neil Olver, Laura Sanità
2016	A*	`conf`	The Complexity Landscape of Fixed-Parameter Directed Steiner Network Problems. ICALP Andreas Emil Feldmann, Dániel Marx
2015	J	`jnl`	A (1 + ε)-Embedding of Low Highway Dimension Graphs into Bounded Treewidth Graphs. CoRR Andreas Emil Feldmann, Wai Shing Fung, Jochen Könemann, Ian Post
2015	—	`conf`	A (1+ε)-Embedding of Low Highway Dimension Graphs into Bounded Treewidth Graphs. ICALP (1) Andreas Emil Feldmann, Wai Shing Fung, Jochen Könemann, Ian Post
2015	J	`jnl`	An O(n Algorithmica Andreas Emil Feldmann, Peter Widmayer
2015	J	`jnl`	Balanced Partitions of Trees and Applications. Algorithmica Andreas Emil Feldmann, Luca Foschini
2015	—	`conf`	Fixed Parameter Approximations for k-Center Problems in Low Highway Dimension Graphs. ICALP (2) Andreas Emil Feldmann
2015	J	`jnl`	Improving the Hk-bound on the price of stability in undirected Shapley network design games. Theor. Comput. Sci. Yann Disser, Andreas Emil Feldmann, Max Klimm, Matús Mihalák
2015	J	`jnl`	On the Parameterized Complexity of Computing Balanced Partitions in Graphs. Theory Comput. Syst. René van Bevern, Andreas Emil Feldmann, Manuel Sorge, Ondrej Suchý
2014	—	`conf`	On the Equivalence of the Bidirected and Hypergraphic Relaxations for Steiner Tree. APPROX-RANDOM Andreas Emil Feldmann, Jochen Könemann, Neil Olver, Laura Sanità
2013	J	`jnl`	Corner cuts are close to optimal: From solid grids to polygons and back. Discret. Appl. Math. Andreas Emil Feldmann, Shantanu Das, Peter Widmayer
2013	J	`jnl`	Fast balanced partitioning is hard even on grids and trees. Theor. Comput. Sci. Andreas Emil Feldmann
2013	C	`conf`	Improving the CIAC Yann Disser, Andreas Emil Feldmann, Max Klimm, Matús Mihalák
2013	J	`jnl`	On the Parameterized Complexity of Computing Balanced Partitions in Graphs. CoRR René van Bevern, Andreas Emil Feldmann, Manuel Sorge, Ondrej Suchý
2013	B	`conf`	On the Parameterized Complexity of Computing Graph Bisections. WG René van Bevern, Andreas Emil Feldmann, Manuel Sorge, Ondrej Suchý
2012	A	`conf`	Balanced Partitions of Trees and Applications. STACS Andreas Emil Feldmann, Luca Foschini
2012	—	`—`	Balanced partitioning of grids and related graphs: a theoretical study of data distribution in parallel finite element model simulations. Andreas Emil Feldmann
2012	J	`jnl`	Computing approximate Nash equilibria in network congestion games. Networks Andreas Emil Feldmann, Heiko Röglin, Berthold Vöcking
2012	B	`conf`	Fast Balanced Partitioning Is Hard Even on Grids and Trees. MFCS Andreas Emil Feldmann
2012	J	`jnl`	Improving the $H_k$-Bound on the Price of Stability in Undirected Shapley Network Design Games CoRR Yann Disser, Andreas Emil Feldmann, Max Klimm, Matús Mihalák
2011	A	`conf`	An $\mathcal{O}(n^4)$ Time Algorithm to Compute the Bisection Width of Solid Grid Graphs. ESA Andreas Emil Feldmann, Peter Widmayer
2011	J	`jnl`	Fast Balanced Partitioning of Grid Graphs is Hard CoRR Andreas Emil Feldmann
2011	B	`conf`	Restricted Cuts for Bisections in Solid Grids: A Proof via Polygons. WG Andreas Emil Feldmann, Shantanu Das, Peter Widmayer
2010	—	`conf`	Simple Cuts Are Fast and Good: Optimum Right-Angled Cuts in Solid Grids. COCOA (1) Andreas Emil Feldmann, Shantanu Das, Peter Widmayer
2008	B	`conf`	Computing Approximate Nash Equilibria in Network Congestion Games. SIROCCO Andreas Emil Feldmann, Heiko Röglin, Berthold Vöcking