( en | de | ru )

 

Disambiguation of "Feldmann, Andreas Emil"

Author of the publication

copydeleteadd this publication to your clipboard
Tight Bounds for Planar Strongly Connected Steiner Subgraph with Fixed Number of Terminals (and Extensions).

, , , and . SIAM J. Comput., 49 (2): 318-364 (2020)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Andreas Emil Feldmann

Emil Feldmann

Andreas Feldmann

Markus Emili

Bernhard Emil

 

Other publications of authors with the same name

A (5/3+ε)-Approximation for Tricolored Non-crossing Euclidean TSP., , , and . CoRR, (2024)Polynomial Time Approximation Schemes for Clustering in Low Highway Dimension Graphs., and . ESA, volume 173 of LIPIcs, page 46:1-46:22. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)The Parameterized Complexity of the Survivable Network Design Problem., , and . SOSA, page 37-56. SIAM, (2022)A (1+ε)-Embedding of Low Highway Dimension Graphs into Bounded Treewidth Graphs., , , and . ICALP (1), volume 9134 of Lecture Notes in Computer Science, page 469-480. Springer, (2015)Recoloring Interval Graphs with Limited Recourse Budget., , , , and . SWAT, volume 162 of LIPIcs, page 17:1-17:23. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)The Parameterized Hardness of the k-Center Problem in Transportation Networks., and . Algorithmica, 82 (7): 1989-2005 (2020)Parameterized Approximation Schemes for Steiner Trees with Small Number of Steiner Vertices., , , , , and . SIAM J. Discret. Math., 35 (1): 546-574 (2021)Near-linear Time Approximation Schemes for Clustering in Doubling Metrics., , and . J. ACM, 68 (6): 44:1-44:34 (2021)Parameterized Approximation Algorithms for Bidirected Steiner Network Problems., , and . ACM Trans. Algorithms, 17 (2): 12:1-12:68 (2021)A Tight Lower Bound for Planar Steiner Orientation., , and . Algorithmica, 81 (8): 3200-3216 (2019)