E-LIB Suche - Ergebnisse für: Feldmann, Andreas Emil

1

The Complexity Landscape of Fixed-Parameter Directed Steine..:

Feldmann, Andreas Emil ; Marx, Dániel
ACM Transactions on Computation Theory. 15 (2023) 3-4 - p. 1-28 , 2023

Link: https://doi.org/10.1145/..

2

Generalized $$k$$-Center: Distinguishing Doubling and Highw..:

, In: Lecture Notes in Computer Science; Graph-Theoretic Concepts in Computer Science,

Feldmann, Andreas Emil ; Vu, Tung Anh - p. 215-229 , 2022

Link: https://doi.org/10.1007/..

3

Parameterized Inapproximability of Independent Set in H-Fre..:

Dvořák, Pavel ; Feldmann, Andreas Emil ; Rai, Ashutosh.
Algorithmica. 85 (2022) 4 - p. 902-928 , 2022

Link: https://doi.org/10.1007/..

4

Near-linear Time Approximation Schemes for Clustering in Do..:

Cohen-Addad, Vincent ; Feldmann, Andreas Emil ; Saulpic, David
Journal of the ACM (JACM). 68 (2021) 6 - p. 1-34 , 2021

Link: https://dl.acm.org/doi/1..

5

Polynomial time approximation schemes for clustering in low..:

Feldmann, Andreas Emil ; Saulpic, David
Journal of Computer and System Sciences. 122 (2021) - p. 72-93 , 2021

Link: https://doi.org/10.1016/..

6

Near-linear Time Approximation Schemes for Clustering in Do..:

Cohen-Addad, Vincent ; Feldmann, Andreas Emil ; Saulpic, David
Journal of the ACM. 68 (2021) 6 - p. 1-34 , 2021

Link: https://doi.org/10.1145/..

7

Travelling on Graphs with Small Highway Dimension:

Disser, Yann ; Feldmann, Andreas Emil ; Klimm, Max.
Algorithmica. 83 (2021) 5 - p. 1352-1370 , 2021

Link: https://doi.org/10.1007/..

8

A note on the approximability of deepest-descent circuit st..:

Borgwardt, Steffen ; Brand, Cornelius ; Feldmann, Andreas Emil.
Operations Research Letters. 49 (2021) 3 - p. 310-315 , 2021

Link: https://doi.org/10.1016/..

9

Parameterized Approximation Algorithms for Bidirected Stein..:

Chitnis, Rajesh ; Feldmann, Andreas Emil ; Manurangsi, Pasin
ACM Transactions on Algorithms. 17 (2021) 2 - p. 1-68 , 2021

Link: https://doi.org/10.1145/..

10

Efficient fully dynamic elimination forests with applicatio..:

, In: Proceedings of the Thirty-Second Annual ACM-SIAM Symposium on Discrete Algorithms,

Chen, Jiehua ; Czerwiński, Wojciech ; Disser, Yann... - p. 796-809 , 2021

Link: https://dl.acm.org/doi/1..

11

Efficient fully dynamic elimination forests with applicatio..:

, In: Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA),

Chen, Jiehua ; Czerwiński, Wojciech ; Disser, Yann... - p. 796-809 , 2021

Link: https://doi.org/10.1137/..

12

Parameterized Approximation Algorithms for Bidirected Stein..:

Chitnis, Rajesh ; Feldmann, Andreas Emil ; Manurangsi, Pasin
ACM Transactions on Algorithms (TALG). 17 (2021) 2 - p. 1-68 , 2021

Link: https://dl.acm.org/doi/1..

13

A Survey on Approximation in Parameterized Complexity: Hard..:

Feldmann, Andreas Emil ; Karthik C. S., Karthik C. ; Lee, Euiwoong.
Algorithms. 13 (2020) 6 - p. 146 , 2020

Link: https://doi.org/10.3390/..

14

The Parameterized Hardness of the k-Center Problem in Trans..:

Feldmann, Andreas Emil ; Marx, Dániel
Algorithmica. 82 (2020) 7 - p. 1989-2005 , 2020

Link: https://doi.org/10.1007/..

15

Parameterized Inapproximability of Independent Set in H-Fre..:

, In: Lecture Notes in Computer Science; Graph-Theoretic Concepts in Computer Science,

Dvořák, Pavel ; Feldmann, Andreas Emil ; Rai, Ashutosh. - p. 40-53 , 2020

Link: https://doi.org/10.1007/..