Items where authors include "Feldmann, A.E."

Article

Feldmann, A.E. orcid.org/0000-0001-6229-5332, Mukherjee, A. and van Leeuwen, E.J. (2025) The parameterized complexity of the survivable network design problem. Journal of Computer and System Sciences, 148. 103604. ISSN 0022-0000

Feldmann, A.E. orcid.org/0000-0001-6229-5332 and Marx, D. (2023) The complexity landscape of fixed-parameter Directed Steiner Network problems. ACM Transactions on Computation Theory, 15 (3-4). ISSN 1942-3454

Dvořák, P. orcid.org/0000-0002-6838-1538, Feldmann, A.E. orcid.org/0000-0001-6229-5332, Rai, A. et al. (1 more author) (2023) Parameterized inapproximability of independent set in H-free graphs. Algorithmica, 85 (4). pp. 902-928. ISSN 0178-4617

Cohen-Addad, V., Feldmann, A.E. orcid.org/0000-0001-6229-5332 and Saulpic, D. orcid.org/0000-0003-4208-8541 (2021) Near-linear time approximation schemes for clustering in doubling metrics. Journal of the ACM, 68 (6). 44. ISSN 0004-5411

Feldmann, A.E. orcid.org/0000-0001-6229-5332 and Saulpic, D. orcid.org/0000-0003-4208-8541 (2021) Polynomial time approximation schemes for clustering in low highway dimension graphs. Journal of Computer and System Sciences, 122. pp. 72-93. ISSN 0022-0000

Disser, Y., Feldmann, A.E. orcid.org/0000-0001-6229-5332, Klimm, M. et al. (1 more author) (2021) Travelling on graphs with small highway dimension. Algorithmica, 83 (5). pp. 1352-1370. ISSN 0178-4617

Borgwardt, S. orcid.org/0000-0002-8069-5046, Brand, C., Feldmann, A.E. orcid.org/0000-0001-6229-5332 et al. (1 more author) (2021) A note on the approximability of deepest-descent circuit steps. Operations Research Letters, 49 (3). pp. 310-315. ISSN 0167-6377

Chitnis, R., Feldmann, A.E. orcid.org/0000-0001-6229-5332 and Manurangsi, P. (2021) Parameterized approximation algorithms for bidirected Steiner network problems. ACM Transactions on Algorithms, 17 (2). ARTN 12. pp. 1-68. ISSN 1549-6325

Dvořák, P., Feldmann, A.E. orcid.org/0000-0001-6229-5332, Knop, D. orcid.org/0000-0003-2588-5709 et al. (3 more authors) (2021) Parameterized approximation schemes for Steiner Trees with small number of Steiner vertices. SIAM Journal on Discrete Mathematics, 35 (1). pp. 546-574. ISSN 0895-4801

Feldmann, A.E. orcid.org/0000-0001-6229-5332 and Marx, D. (2020) The parameterized hardness of the k-center problem in transportation networks. Algorithmica, 82 (7). pp. 1989-2005. ISSN 0178-4617

Feldmann, A.E. orcid.org/0000-0001-6229-5332, Karthik C. S., K.C., Lee, E. et al. (1 more author) (2020) A survey on approximation in parameterized complexity: hardness and algorithms. Algorithms, 13 (6). 146. ISSN 1999-4893

Chitnis, R.H. orcid.org/0000-0002-6098-7770, Feldmann, A.E. orcid.org/0000-0001-6229-5332, HajiAghayi, M.T. et al. (1 more author) (2020) Tight bounds for planar strongly connected steiner subgraph with fixed number of terminals (and extensions). SIAM Journal on Computing, 49 (2). pp. 318-364. ISSN 0097-5397

Chitnis, R., Feldmann, A.E. orcid.org/0000-0001-6229-5332 and Suchý, O. (2019) A Tight Lower Bound for Planar Steiner Orientation. Algorithmica, 81 (8). pp. 3200-3216. ISSN 0178-4617

Feldmann, A.E. orcid.org/0000-0001-6229-5332 (2019) Fixed-parameter approximations for k-Center problems in low highway dimension graphs. Algorithmica, 81 (3). pp. 1031-1052. ISSN 0178-4617

Feldmann, A.E. orcid.org/0000-0001-6229-5332, Fung, W.S., Könemann, J. et al. (1 more author) (2018) A (1+ε)-embedding of low highway dimension graphs into bounded treewidth graphs. SIAM Journal on Computing, 47 (4). pp. 1667-1704. ISSN 0097-5397

Proceedings Paper

Baligács, J., Disser, Y., Feldmann, A.E. orcid.org/0000-0001-6229-5332 et al. (1 more author) (2024) A (5/3+ε)-approximation for tricolored non-crossing Euclidean TSP. In: 32nd Annual European Symposium on Algorithms (ESA 2024). 32nd Annual European Symposium on Algorithms (ESA 2024), 02-04 Sep 2024, London, UK. Leibniz International Proceedings in Informatics, LIPIcs, 308 . Schloss Dagstuhl – Leibniz-Zentrum für Informatik , 15:1-15:15.

Feldmann, A.E. orcid.org/0000-0001-6229-5332 and Lampis, M. orcid.org/0000-0002-5791-0887 (2024) Parameterized algorithms for Steiner forest in bounded width graphs. In: Bringmann, K., Grohe, M., Puppis, G. and Svensson, O., (eds.) 51st International Colloquium on Automata, Languages, and Programming (ICALP 2024). International Colloquium on Automata, Languages, and Programming (ICALP), 08-12 Jul 2024, Tallinn, Estonia. Leibniz International Proceedings in Informatics, LIPIcs, 297 . , 61:1-61:20. ISBN 978-3-95977-322-5

Lieskovský, M., Sgall, J. and Feldmann, A.E. orcid.org/0000-0001-6229-5332 (2023) Approximation algorithms and lower bounds for graph burning. In: Megow, N. and Smith, A., (eds.) Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques. Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2023), 11-13 Sep 2023, Georgia, USA. Leibniz International Proceedings in Informatics, LIPIcs, 275 . , 9:1-9:17. ISBN 978-3-95977-296-9

Blum, J., Disser, Y., Feldmann, A.E. orcid.org/0000-0001-6229-5332 et al. (2 more authors) (2022) On sparse hitting sets: from fair vertex cover to highway dimension. In: Dell, H. and Nederlof, J., (eds.) Leibniz International Proceedings in Informatics (LIPIcs). 17th International Symposium on Parameterized and Exact Computation (IPEC 2022), 07-09 Sep 2022, Potsdam, Germany. Leibniz International Proceedings in Informatics (LIPIcs), 249 . Schloss Dagstuhl -- Leibniz-Zentrum , Dagstuhl, Germany , 5:1-5:23. ISBN 978-3-95977-260-0

Feldmann, A.E. orcid.org/0000-0001-6229-5332 and Vu, T.A. orcid.org/0000-0002-8902-5196 (2022) Generalized k-center: distinguishing doubling and highway dimension. In: Bekos, M. A. and Kaufmann, M., (eds.) Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 48th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2022, 22-24 Jun 2022, Tübingen, Germany. Lecture Notes in Computer Science, 13453 . Springer International Publishing , pp. 215-229. ISBN 978-3-031-15914-5

Feldmann, A.E. orcid.org/0000-0001-6229-5332 and Rai, A. (2021) On extended formulations for parameterized Steiner trees. In: Golovach, P. A. and Zehavi, M., (eds.) Leibniz International Proceedings in Informatics, LIPIcs. 16th International Symposium on Parameterized and Exact Computation (IPEC 2021), 08-10 Sep 2021, Virtual event. Leibniz International Proceedings in Informatics, 214 . Schloss Dagstuhl - Leibniz-Zentrum , Dagstuhl, Germany , 18:1-18:16. ISBN 978-3-95977-216-7

Feldmann, A.E. orcid.org/0000-0001-6229-5332, Issac, D. and Rai, A. (2020) Fixed-parameter tractability of the weighted edge clique partition problem. In: Cao, Y. and Pilipczuk, M., (eds.) Leibniz International Proceedings in Informatics, LIPIcs. 15th International Symposium on Parameterized and Exact Computation (IPEC 2020), 14-18 Dec 2020, Virtual conference. Leibniz International Proceedings in Informatics, 180 . Schloss Dagstuhl--Leibniz-Zentrum , Dagstuhl, Germany , 17:1-17:16. ISBN 978-3-95977-172-6

Dvořák, P., Feldmann, A.E. orcid.org/0000-0001-6229-5332, Rai, A. et al. (1 more author) (2020) Parameterized inapproximability of independent set in H-free graphs. In: Adler, I. and Müller, H., (eds.) Graph-Theoretic Concepts in Computer Science: 46th International Workshop, WG 2020, Leeds, UK, June 24–26, 2020, Revised Selected Papers. 46th International Workshop, WG 2020, 24-26 Jun 2020, Leeds, UK. Lecture Notes in Computer Science, LNCS 12301 . Springer International Publishing , pp. 40-53. ISBN 9783030604394

Feldmann, A.E. orcid.org/0000-0001-6229-5332 and Saulpic, D. (2020) Polynomial time approximation schemes for clustering in low highway dimension graphs. In: Grandoni, F., Herman, G. and Sanders, P., (eds.) Leibniz International Proceedings in Informatics, LIPIcs. 28th Annual European Symposium on Algorithms (ESA 2020), 07-09 Sep 2020, Pisa, Italy. Leibniz International Proceedings in Informatics, 173 . Schloss Dagstuhl - Leibniz-Zentrum , Dagstuhl, Germany , 46:1-46:22. ISBN 978-3-95977-162-7

Bosek, B., Disser, Y., Feldmann, A.E. orcid.org/0000-0001-6229-5332 et al. (2 more authors) (2020) Recoloring interval graphs with limited recourse budget. In: Albers, S., (ed.) Leibniz International Proceedings in Informatics, LIPIcs. 17th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2020), 22-24 Jun 2020, Tórshavn, Faroe Islands. Schloss Dagstuhl--Leibniz-Zentrum für Informatik , 17:1-17:23. ISBN 9783959771504

Cohen-Addad, V., Feldmann, A.E. orcid.org/0000-0001-6229-5332 and Saulpic, D. (2020) Near-linear time approximations schemes for clustering in doubling metrics. In: 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS). 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS), 09-12 Nov 2019, Baltimore, MD, USA. Institute of Electrical and Electronics Engineers (IEEE) , pp. 540-559. ISBN 9781728149530

Chitnis, R. and Feldmann, A.E. orcid.org/0000-0001-6229-5332 (2019) FPT inapproximability of directed cut and connectivity problems. In: Jansen, B. M. P. and Telle, J. A., (eds.) Leibniz International Proceedings in Informatics, LIPIcs. 14th International Symposium on Parameterized and Exact Computation (IPEC 2019), 11-13 Sep 2019, Munich, Germany. Leibniz International Proceedings in Informatics, 148 . Schloss Dagstuhl - Leibniz-Zentrum , Dagstuhl, Germany , 8:1-8:20. ISBN 978-3-95977-129-0

Disser, Y., Feldmann, A.E. orcid.org/0000-0001-6229-5332, Klimm, M. et al. (1 more author) (2019) Travelling on graphs with small highway dimension. In: Sau, I. and Thilikos, D.M., (eds.) Graph-Theoretic Concepts in Computer Science: 45th International Workshop, WG 2019, Vall de Núria, Spain, June 19–21, 2019, Revised Papers. 45th International Workshop, WG 2019, 19-21 Jun 2019, Vall de Núria, Spain. Lecture Notes in Computer Science, LNTCS 11789 . Springer International Publishing , pp. 175-189. ISBN 9783030307851

Chitnis, R., Feldmann, A.E. orcid.org/0000-0001-6229-5332 and Manurangsi, P. (2018) Parameterized approximation algorithms for bidirected steiner network problems. In: Azar, Y., Bast, H. and Herman, G., (eds.) Leibniz International Proceedings in Informatics, LIPIcs. 26th Annual European Symposium on Algorithms (ESA 2018), 20-24 Aug 2018, Helsinki, Finland. Leibniz International Proceedings in Informatics, 112 . Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik , Dagstuhl, Germany . ISBN 978-3-95977-081-1

Feldmann, A.E. orcid.org/0000-0001-6229-5332 and Marx, D. (2018) The parameterized hardness of the k-center problem in transportation networks. In: Eppstein, D., (ed.) Leibniz International Proceedings in Informatics, LIPIcs. 16th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2018), 18-20 Jun 2018, Malmö, Sweden. Schloss Dagstuhl--Leibniz-Zentrum für Informatik , 19:1-19:13. ISBN 9783959770682

Chitnis, R. and Feldmann, A.E. orcid.org/0000-0001-6229-5332 (2018) A tight lower bound for Steiner Orientation. In: Fomin, F.V. and Podolskii, V.V., (eds.) Computer Science – Theory and Applications: 13th International Computer Science Symposium in Russia, CSR 2018, Moscow, Russia, June 6–10, 2018, Proceedings. 13th International Computer Science Symposium in Russia, CSR 2018, 06-10 Jun 2018, Moscow, Russia. Lecture Notes in Computer Science, LNTCS 10846 . Springer International Publishing , pp. 65-77. ISBN 9783319905297

Dvorák, P., Feldmann, A.E. orcid.org/0000-0001-6229-5332, Knop, D. et al. (3 more authors) (2018) Parameterized approximation schemes for steiner trees with small number of Steiner vertices. In: Niedermeier, R. and Vall, B., (eds.) Leibniz International Proceedings in Informatics, LIPIcs. 35th Symposium on Theoretical Aspects of Computer Science (STACS 2018), 28 Feb - 03 Mar 2018, Caen, France. Leibniz International Proceedings in Informatics, 96 . Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik , Dagstuhl, Germany , 26:1-26:15. ISBN 978-3-95977-062-0

Feldmann, A.E. orcid.org/0000-0001-6229-5332, Könemann, J., Pashkovich, K. et al. (1 more author) (2016) Fast approximation algorithms for the generalized survivable network design problem. In: Hong, S., (ed.) Leibniz International Proceedings in Informatics, LIPIcs. 27th International Symposium on Algorithms and Computation (ISAAC 2016), 12-14 Dec 2016, Sydney, Australia. Leibniz International Proceedings in Informatics, 64 . Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik , Dagstuhl, Germany , 33.1-33.12. ISBN 978-3-95977-026-2

Feldmann, A.E. orcid.org/0000-0001-6229-5332 and Marx, D. (2016) The complexity landscape of fixed-parameter directed steiner network problems. In: Chatzigiannakis, I., Mitzenmacher, M., Rabani, Y. and Sangiorgi, D., (eds.) Leibniz International Proceedings in Informatics, LIPIcs. 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016), 12-15 Jul 2016, Rome, Italy. Leibniz International Proceedings in Informatics, 55 . Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik , Dagstuhl, Germany , 27:1-27:14. ISBN 978-3-95977-013-2