( en | de | ru )

 

Disambiguation of "Feldmann, Andreas Emil"

Author of the publication

copydeleteadd this publication to your clipboard
Efficient fully dynamic elimination forests with applications to detecting long paths and cycles.

, , , , , , , , , , and . SODA, page 796-809. SIAM, (2021)

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

The Parameterized Complexity of the Survivable Network Design Problem., , and . SOSA, page 37-56. SIAM, (2022)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)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)The Parameterized Hardness of the k-Center Problem in Transportation Networks., and . Algorithmica, 82 (7): 1989-2005 (2020)A Tight Lower Bound for Planar Steiner Orientation., , and . Algorithmica, 81 (8): 3200-3216 (2019)A (1+ε)-Embedding of Low Highway Dimension Graphs into Bounded Treewidth Graphs., , , and . SIAM J. Comput., 47 (4): 1667-1704 (2018)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)FPT Inapproximability of Directed Cut and Connectivity Problems., and . IPEC, volume 148 of LIPIcs, page 8:1-8:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Travelling on Graphs with Small Highway Dimension., , , and . WG, volume 11789 of Lecture Notes in Computer Science, page 175-189. Springer, (2019)On Sparse Hitting Sets: From Fair Vertex Cover to Highway Dimension., , , , and . IPEC, volume 249 of LIPIcs, page 5:1-5:23. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)