default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAndreas Emil Feldmann
2020 – today
- 2025
[j24]Andreas Emil Feldmann, Anish Mukherjee
, Erik Jan van Leeuwen:
The parameterized complexity of the survivable network design problem. J. Comput. Syst. Sci. 148: 103604 (2025)- [c33]Andreas Emil Feldmann, Arnold Filtser:
Highway Dimension: a Metric View. SODA 2025: 3267-3276 - 2024
- [c32]Júlia Baligács, Yann Disser, Andreas Emil Feldmann, Anna Zych-Pawlewicz:
A (5/3+ε)-Approximation for Tricolored Non-Crossing Euclidean TSP. ESA 2024: 15:1-15:15 - [c31]Andreas Emil Feldmann, Michael Lampis:
Parameterized Algorithms for Steiner Forest in Bounded Width Graphs. ICALP 2024: 61:1-61:20 - [i27]Andreas Emil Feldmann, Michael Lampis:
Parameterized Algorithms for Steiner Forest in Bounded Width Graphs. CoRR abs/2402.09835 (2024) - [i26]Júlia Baligács, Yann Disser, Andreas Emil Feldmann, Anna Zych-Pawlewicz:
A (5/3+ε)-Approximation for Tricolored Non-crossing Euclidean TSP. CoRR abs/2402.13938 (2024) - [i25]Andreas Emil Feldmann, Arnold Filtser:
Highway Dimension: a Metric View. CoRR abs/2412.20490 (2024) - 2023
- [j23]Pavel Dvorák, Andreas Emil Feldmann, Ashutosh Rai, Pawel Rzazewski:
Parameterized Inapproximability of Independent Set in H-Free Graphs. Algorithmica 85(4): 902-928 (2023) - [j22]Andreas Emil Feldmann, Dániel Marx:
The Complexity Landscape of Fixed-Parameter Directed Steiner Network Problems. ACM Trans. Comput. Theory 15(3-4): 4:1-4:28 (2023) - [c30]Matej Lieskovský, Jirí Sgall, Andreas Emil Feldmann:
Approximation Algorithms and Lower Bounds for Graph Burning. APPROX/RANDOM 2023: 9:1-9:17 - 2022
- [c29]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: 5:1-5:23 - [c28]Andreas Emil Feldmann, Anish Mukherjee, Erik Jan van Leeuwen:
The Parameterized Complexity of the Survivable Network Design Problem. SOSA 2022: 37-56 - [c27]Andreas Emil Feldmann, Tung Anh Vu:
Generalized k-Center: Distinguishing Doubling and Highway Dimension. WG 2022: 215-229 - [i24]Johannes Blum, Yann Disser, Andreas Emil Feldmann, Siddharth Gupta, Anna Zych-Pawlewicz:
On Sparse Hitting Sets: from Fair Vertex Cover to Highway Dimension. CoRR abs/2208.14132 (2022) - [i23]Andreas Emil Feldmann, Tung Anh Vu:
Generalized $k$-Center: Distinguishing Doubling and Highway Dimension. CoRR abs/2209.00675 (2022) - 2021
- [j21]Yann Disser, Andreas Emil Feldmann, Max Klimm, Jochen Könemann:
Travelling on Graphs with Small Highway Dimension. Algorithmica 83(5): 1352-1370 (2021) - [j20]Vincent Cohen-Addad, Andreas Emil Feldmann, David Saulpic:
Near-linear Time Approximation Schemes for Clustering in Doubling Metrics. J. ACM 68(6): 44:1-44:34 (2021) - [j19]Andreas Emil Feldmann, David Saulpic:
Polynomial time approximation schemes for clustering in low highway dimension graphs. J. Comput. Syst. Sci. 122: 72-93 (2021) - [j18]Steffen Borgwardt, Cornelius Brand, Andreas Emil Feldmann, Martin Koutecký:
A note on the approximability of deepest-descent circuit steps. Oper. Res. Lett. 49(3): 310-315 (2021) - [j17]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): 546-574 (2021) - [j16]Rajesh Chitnis, Andreas Emil Feldmann, Pasin Manurangsi:
Parameterized Approximation Algorithms for Bidirected Steiner Network Problems. ACM Trans. Algorithms 17(2): 12:1-12:68 (2021) - [c26]Andreas Emil Feldmann, Ashutosh Rai:
On Extended Formulations For Parameterized Steiner Trees. IPEC 2021: 18:1-18:16 - [c25]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: 796-809 - [i22]Andreas Emil Feldmann, Anish Mukherjee, Erik Jan van Leeuwen:
The Parameterized Complexity of the Survivable Network Design Problem. CoRR abs/2111.02295 (2021) - 2020
- [j15]Andreas Emil Feldmann, Dániel Marx:
The Parameterized Hardness of the k-Center Problem in Transportation Networks. Algorithmica 82(7): 1989-2005 (2020) - [j14]Andreas Emil Feldmann, Karthik C. S., Euiwoong Lee, Pasin Manurangsi:
A Survey on Approximation in Parameterized Complexity: Hardness and Algorithms. Algorithms 13(6): 146 (2020) - [j13]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): 318-364 (2020) - [c24]Andreas Emil Feldmann, David Saulpic:
Polynomial Time Approximation Schemes for Clustering in Low Highway Dimension Graphs. ESA 2020: 46:1-46:22 - [c23]Andreas Emil Feldmann, Davis Issac, Ashutosh Rai:
Fixed-Parameter Tractability of the Weighted Edge Clique Partition Problem. IPEC 2020: 17:1-17:16 - [c22]Bartlomiej Bosek, Yann Disser, Andreas Emil Feldmann, Jakub Pawlewicz, Anna Zych-Pawlewicz:
Recoloring Interval Graphs with Limited Recourse Budget. SWAT 2020: 17:1-17:23 - [c21]Pavel Dvorák, Andreas Emil Feldmann, Ashutosh Rai, Pawel Rzazewski:
Parameterized Inapproximability of Independent Set in H-Free Graphs. WG 2020: 40-53 - [i21]Andreas Emil Feldmann, Davis Issac, Ashutosh Rai:
Fixed-Parameter Tractability of the Weighted Edge Clique Partition Problem. CoRR abs/2002.07761 (2020) - [i20]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 abs/2006.00571 (2020) - [i19]Andreas Emil Feldmann, Karthik C. S., Euiwoong Lee, Pasin Manurangsi:
A Survey on Approximation in Parameterized Complexity: Hardness and Algorithms. CoRR abs/2006.04411 (2020) - [i18]Pavel Dvorák, Andreas Emil Feldmann, Ashutosh Rai, Pawel Rzazewski:
Parameterized Inapproximability of Independent Set in H-Free Graphs. CoRR abs/2006.10444 (2020) - [i17]Andreas Emil Feldmann, David Saulpic:
Polynomial Time Approximation Schemes for Clustering in Low Highway Dimension Graphs. CoRR abs/2006.12897 (2020) - [i16]Steffen Borgwardt, Cornelius Brand, Andreas Emil Feldmann, Martin Koutecký:
A Note on the Approximability of Deepest-Descent Circuit Steps. CoRR abs/2010.10809 (2020) - [i15]Andreas Emil Feldmann, Karthik C. S., Euiwoong Lee, Pasin Manurangsi:
A Survey on Approximation in Parameterized Complexity: Hardness and Algorithms. Electron. Colloquium Comput. Complex. TR20 (2020)
2010 – 2019
- 2019
- [j12]Andreas Emil Feldmann:
Fixed-Parameter Approximations for k-Center Problems in Low Highway Dimension Graphs. Algorithmica 81(3): 1031-1052 (2019) - [j11]Rajesh Chitnis, Andreas Emil Feldmann, Ondrej Suchý:
A Tight Lower Bound for Planar Steiner Orientation. Algorithmica 81(8): 3200-3216 (2019) - [c20]David Saulpic, Vincent Cohen-Addad, Andreas Emil Feldmann:
Near-Linear Time Approximations Schemes for Clustering in Doubling Metrics. FOCS 2019: 540-559 - [c19]Rajesh Chitnis, Andreas Emil Feldmann:
FPT Inapproximability of Directed Cut and Connectivity Problems. IPEC 2019: 8:1-8:20 - [c18]Yann Disser, Andreas Emil Feldmann, Max Klimm, Jochen Könemann:
Travelling on Graphs with Small Highway Dimension. WG 2019: 175-189 - [i14]Yann Disser, Andreas Emil Feldmann, Max Klimm, Jochen Könemann:
Travelling on Graphs with Small Highway Dimension. CoRR abs/1902.07040 (2019) - [i13]Rajesh Chitnis, Andreas Emil Feldmann:
FPT Inapproximability of Directed Cut and Connectivity Problems. CoRR abs/1910.01934 (2019) - [i12]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 abs/1911.13161 (2019) - 2018
- [j10]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): 1667-1704 (2018) - [c17]Rajesh Chitnis, Andreas Emil Feldmann:
A Tight Lower Bound for Steiner Orientation. CSR 2018: 65-77 - [c16]Rajesh Chitnis, Andreas Emil Feldmann, Pasin Manurangsi:
Parameterized Approximation Algorithms for Bidirected Steiner Network Problems. ESA 2018: 20:1-20:16 - [c15]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]Andreas Emil Feldmann, Dániel Marx:
The Parameterized Hardness of the k-Center Problem in Transportation Networks. SWAT 2018: 19:1-19:13 - [i11]Andreas Emil Feldmann, Dániel Marx:
The Parameterized Hardness of the k-Center Problem in Transportation Networks. CoRR abs/1802.08563 (2018) - [i10]Vincent Cohen-Addad, Andreas Emil Feldmann, David Saulpic:
Near-Linear Time Approximation Schemes for Clustering in Doubling Metrics. CoRR abs/1812.08664 (2018) - 2017
- [i9]Rajesh Chitnis, Andreas Emil Feldmann, Pasin Manurangsi:
Parameterized Approximation Algorithms for Directed Steiner Network Problems. CoRR abs/1707.06499 (2017) - [i8]Andreas Emil Feldmann, Dániel Marx:
The Complexity Landscape of Fixed-Parameter Directed Steiner Network Problems. CoRR abs/1707.06808 (2017) - [i7]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]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]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): 141-153 (2016) - [c13]Andreas Emil Feldmann, Dániel Marx:
The Complexity Landscape of Fixed-Parameter Directed Steiner Network Problems. ICALP 2016: 27:1-27:14 - [c12]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]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]Andreas Emil Feldmann:
Fixed Parameter Approximations for k-Center Problems in Low Highway Dimension Graphs. CoRR abs/1605.02530 (2016) - 2015
- [j7]Andreas Emil Feldmann, Peter Widmayer:
An O(n4) Time Algorithm to Compute the Bisection Width of Solid Grid Graphs. Algorithmica 71(1): 181-200 (2015) - [j6]Andreas Emil Feldmann, Luca Foschini:
Balanced Partitions of Trees and Applications. Algorithmica 71(2): 354-376 (2015) - [j5]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]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]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: 469-480 - [c10]Andreas Emil Feldmann:
Fixed Parameter Approximations for k-Center Problems in Low Highway Dimension Graphs. ICALP (2) 2015: 588-600 - [i4]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]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]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): 970-998 (2013) - [j2]Andreas Emil Feldmann:
Fast balanced partitioning is hard even on grids and trees. Theor. Comput. Sci. 485: 61-68 (2013) - [c8]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]René van Bevern, Andreas Emil Feldmann, Manuel Sorge, Ondrej Suchý:
On the Parameterized Complexity of Computing Graph Bisections. WG 2013: 76-87 - [i3]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]Andreas Emil Feldmann:
Balanced partitioning of grids and related graphs: a theoretical study of data distribution in parallel finite element model simulations. ETH Zurich, Cuvillier 2012, ISBN 978-3-95404-125-1, pp. 1-201 - [j1]Andreas Emil Feldmann, Heiko Röglin, Berthold Vöcking:
Computing approximate Nash equilibria in network congestion games. Networks 59(4): 380-386 (2012) - [c6]Andreas Emil Feldmann:
Fast Balanced Partitioning Is Hard Even on Grids and Trees. MFCS 2012: 372-382 - [c5]Andreas Emil Feldmann, Luca Foschini:
Balanced Partitions of Trees and Applications. STACS 2012: 100-111 - [i2]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]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]Andreas Emil Feldmann, Shantanu Das, Peter Widmayer:
Restricted Cuts for Bisections in Solid Grids: A Proof via Polygons. WG 2011: 143-154 - [i1]Andreas Emil Feldmann:
Fast Balanced Partitioning of Grid Graphs is Hard. CoRR abs/1111.6745 (2011) - 2010
- [c2]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
- 2008
- [c1]Andreas Emil Feldmann, Heiko Röglin, Berthold Vöcking:
Computing Approximate Nash Equilibria in Network Congestion Games. SIROCCO 2008: 209-220
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
[+][–] Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
[+][–] Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-05-08 22:23 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
