Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Andreas Emil Feldmann
@article{DBLP:journals/corr/abs-2402-09835,
author = {Andreas Emil Feldmann and
Michael Lampis},
title = {Parameterized Algorithms for Steiner Forest in Bounded Width Graphs},
journal = {CoRR},
volume = {abs/2402.09835},
year = {2024},
url = {https://doi.org/10.48550/arXiv.2402.09835},
doi = {10.48550/ARXIV.2402.09835},
eprinttype = {arXiv},
eprint = {2402.09835},
timestamp = {Tue, 20 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2402-09835.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2402-13938,
author = {J{\'{u}}lia Balig{\'{a}}cs and
Yann Disser and
Andreas Emil Feldmann and
Anna Zych{-}Pawlewicz},
title = {A (5/3+{\(\epsilon\)})-Approximation for Tricolored Non-crossing Euclidean
{TSP}},
journal = {CoRR},
volume = {abs/2402.13938},
year = {2024},
url = {https://doi.org/10.48550/arXiv.2402.13938},
doi = {10.48550/ARXIV.2402.13938},
eprinttype = {arXiv},
eprint = {2402.13938},
timestamp = {Fri, 22 Mar 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2402-13938.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/DvorakFRR23,
author = {Pavel Dvor{\'{a}}k and
Andreas Emil Feldmann and
Ashutosh Rai and
Pawel Rzazewski},
title = {Parameterized Inapproximability of Independent Set in H-Free Graphs},
journal = {Algorithmica},
volume = {85},
number = {4},
pages = {902--928},
year = {2023},
url = {https://doi.org/10.1007/s00453-022-01052-5},
doi = {10.1007/S00453-022-01052-5},
timestamp = {Mon, 01 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/DvorakFRR23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/LieskovskySF23,
author = {Matej Lieskovsk{\'{y}} and
Jir{\'{\i}} Sgall and
Andreas Emil Feldmann},
editor = {Nicole Megow and
Adam D. Smith},
title = {Approximation Algorithms and Lower Bounds for Graph Burning},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2023, September 11-13, 2023, Atlanta,
Georgia, {USA}},
series = {LIPIcs},
volume = {275},
pages = {9:1--9:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2023.9},
doi = {10.4230/LIPICS.APPROX/RANDOM.2023.9},
timestamp = {Sat, 09 Sep 2023 00:04:38 +0200},
biburl = {https://dblp.org/rec/conf/approx/LieskovskySF23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/0001DF0Z22,
author = {Johannes Blum and
Yann Disser and
Andreas Emil Feldmann and
Siddharth Gupta and
Anna Zych{-}Pawlewicz},
editor = {Holger Dell and
Jesper Nederlof},
title = {On Sparse Hitting Sets: From Fair Vertex Cover to Highway Dimension},
booktitle = {17th International Symposium on Parameterized and Exact Computation,
{IPEC} 2022, September 7-9, 2022, Potsdam, Germany},
series = {LIPIcs},
volume = {249},
pages = {5:1--5:23},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.IPEC.2022.5},
doi = {10.4230/LIPICS.IPEC.2022.5},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/iwpec/0001DF0Z22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sosa/Feldmann0L22,
author = {Andreas Emil Feldmann and
Anish Mukherjee and
Erik Jan van Leeuwen},
editor = {Karl Bringmann and
Timothy M. Chan},
title = {The Parameterized Complexity of the Survivable Network Design Problem},
booktitle = {5th Symposium on Simplicity in Algorithms, SOSA@SODA 2022, Virtual
Conference, January 10-11, 2022},
pages = {37--56},
publisher = {{SIAM}},
year = {2022},
url = {https://doi.org/10.1137/1.9781611977066.4},
doi = {10.1137/1.9781611977066.4},
timestamp = {Sat, 19 Aug 2023 18:10:48 +0200},
biburl = {https://dblp.org/rec/conf/sosa/Feldmann0L22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/FeldmannV22,
author = {Andreas Emil Feldmann and
Tung Anh Vu},
editor = {Michael A. Bekos and
Michael Kaufmann},
title = {Generalized k-Center: Distinguishing Doubling and Highway Dimension},
booktitle = {Graph-Theoretic Concepts in Computer Science - 48th International
Workshop, {WG} 2022, T{\"{u}}bingen, Germany, June 22-24, 2022,
Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {13453},
pages = {215--229},
publisher = {Springer},
year = {2022},
url = {https://doi.org/10.1007/978-3-031-15914-5\_16},
doi = {10.1007/978-3-031-15914-5\_16},
timestamp = {Tue, 18 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wg/FeldmannV22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2208-14132,
author = {Johannes Blum and
Yann Disser and
Andreas Emil Feldmann and
Siddharth Gupta and
Anna Zych{-}Pawlewicz},
title = {On Sparse Hitting Sets: from Fair Vertex Cover to Highway Dimension},
journal = {CoRR},
volume = {abs/2208.14132},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2208.14132},
doi = {10.48550/ARXIV.2208.14132},
eprinttype = {arXiv},
eprint = {2208.14132},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2208-14132.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2209-00675,
author = {Andreas Emil Feldmann and
Tung Anh Vu},
title = {Generalized {\textdollar}k{\textdollar}-Center: Distinguishing Doubling
and Highway Dimension},
journal = {CoRR},
volume = {abs/2209.00675},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2209.00675},
doi = {10.48550/ARXIV.2209.00675},
eprinttype = {arXiv},
eprint = {2209.00675},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2209-00675.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/DisserFKK21,
author = {Yann Disser and
Andreas Emil Feldmann and
Max Klimm and
Jochen K{\"{o}}nemann},
title = {Travelling on Graphs with Small Highway Dimension},
journal = {Algorithmica},
volume = {83},
number = {5},
pages = {1352--1370},
year = {2021},
url = {https://doi.org/10.1007/s00453-020-00785-5},
doi = {10.1007/S00453-020-00785-5},
timestamp = {Thu, 29 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/DisserFKK21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Cohen-AddadFS21,
author = {Vincent Cohen{-}Addad and
Andreas Emil Feldmann and
David Saulpic},
title = {Near-linear Time Approximation Schemes for Clustering in Doubling
Metrics},
journal = {J. {ACM}},
volume = {68},
number = {6},
pages = {44:1--44:34},
year = {2021},
url = {https://doi.org/10.1145/3477541},
doi = {10.1145/3477541},
timestamp = {Sat, 08 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Cohen-AddadFS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/FeldmannS21,
author = {Andreas Emil Feldmann and
David Saulpic},
title = {Polynomial time approximation schemes for clustering in low highway
dimension graphs},
journal = {J. Comput. Syst. Sci.},
volume = {122},
pages = {72--93},
year = {2021},
url = {https://doi.org/10.1016/j.jcss.2021.06.002},
doi = {10.1016/J.JCSS.2021.06.002},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jcss/FeldmannS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/BorgwardtBFK21,
author = {Steffen Borgwardt and
Cornelius Brand and
Andreas Emil Feldmann and
Martin Kouteck{\'{y}}},
title = {A note on the approximability of deepest-descent circuit steps},
journal = {Oper. Res. Lett.},
volume = {49},
number = {3},
pages = {310--315},
year = {2021},
url = {https://doi.org/10.1016/j.orl.2021.02.003},
doi = {10.1016/J.ORL.2021.02.003},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/orl/BorgwardtBFK21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/DvorakFKMTV21,
author = {Pavel Dvor{\'{a}}k and
Andreas Emil Feldmann and
Dusan Knop and
Tom{\'{a}}s Masar{\'{\i}}k and
Tom{\'{a}}s Toufar and
Pavel Vesel{\'{y}}},
title = {Parameterized Approximation Schemes for Steiner Trees with Small Number
of Steiner Vertices},
journal = {{SIAM} J. Discret. Math.},
volume = {35},
number = {1},
pages = {546--574},
year = {2021},
url = {https://doi.org/10.1137/18M1209489},
doi = {10.1137/18M1209489},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamdm/DvorakFKMTV21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/ChitnisFM21,
author = {Rajesh Chitnis and
Andreas Emil Feldmann and
Pasin Manurangsi},
title = {Parameterized Approximation Algorithms for Bidirected Steiner Network
Problems},
journal = {{ACM} Trans. Algorithms},
volume = {17},
number = {2},
pages = {12:1--12:68},
year = {2021},
url = {https://doi.org/10.1145/3447584},
doi = {10.1145/3447584},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/talg/ChitnisFM21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/Feldmann021,
author = {Andreas Emil Feldmann and
Ashutosh Rai},
editor = {Petr A. Golovach and
Meirav Zehavi},
title = {On Extended Formulations For Parameterized Steiner Trees},
booktitle = {16th International Symposium on Parameterized and Exact Computation,
{IPEC} 2021, September 8-10, 2021, Lisbon, Portugal},
series = {LIPIcs},
volume = {214},
pages = {18:1--18:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.IPEC.2021.18},
doi = {10.4230/LIPICS.IPEC.2021.18},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/iwpec/Feldmann021.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/ChenCDFHNPPSWZ21,
author = {Jiehua Chen and
Wojciech Czerwinski and
Yann Disser and
Andreas Emil Feldmann and
Danny Hermelin and
Wojciech Nadara and
Marcin Pilipczuk and
Michal Pilipczuk and
Manuel Sorge and
Bartlomiej Wr{\'{o}}blewski and
Anna Zych{-}Pawlewicz},
editor = {D{\'{a}}niel Marx},
title = {Efficient fully dynamic elimination forests with applications to detecting
long paths and cycles},
booktitle = {Proceedings of the 2021 {ACM-SIAM} Symposium on Discrete Algorithms,
{SODA} 2021, Virtual Conference, January 10 - 13, 2021},
pages = {796--809},
publisher = {{SIAM}},
year = {2021},
url = {https://doi.org/10.1137/1.9781611976465.50},
doi = {10.1137/1.9781611976465.50},
timestamp = {Wed, 07 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/ChenCDFHNPPSWZ21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2111-02295,
author = {Andreas Emil Feldmann and
Anish Mukherjee and
Erik Jan van Leeuwen},
title = {The Parameterized Complexity of the Survivable Network Design Problem},
journal = {CoRR},
volume = {abs/2111.02295},
year = {2021},
url = {https://arxiv.org/abs/2111.02295},
eprinttype = {arXiv},
eprint = {2111.02295},
timestamp = {Tue, 19 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2111-02295.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/FeldmannM20,
author = {Andreas Emil Feldmann and
D{\'{a}}niel Marx},
title = {The Parameterized Hardness of the k-Center Problem in Transportation
Networks},
journal = {Algorithmica},
volume = {82},
number = {7},
pages = {1989--2005},
year = {2020},
url = {https://doi.org/10.1007/s00453-020-00683-w},
doi = {10.1007/S00453-020-00683-W},
timestamp = {Tue, 16 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/FeldmannM20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithms/FeldmannSLM20,
author = {Andreas Emil Feldmann and
{Karthik {C. S.}} and
Euiwoong Lee and
Pasin Manurangsi},
title = {A Survey on Approximation in Parameterized Complexity: Hardness and
Algorithms},
journal = {Algorithms},
volume = {13},
number = {6},
pages = {146},
year = {2020},
url = {https://doi.org/10.3390/a13060146},
doi = {10.3390/A13060146},
timestamp = {Wed, 07 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithms/FeldmannSLM20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ChitnisFHM20,
author = {Rajesh Hemant Chitnis and
Andreas Emil Feldmann and
Mohammad Taghi Hajiaghayi and
D{\'{a}}niel Marx},
title = {Tight Bounds for Planar Strongly Connected Steiner Subgraph with Fixed
Number of Terminals (and Extensions)},
journal = {{SIAM} J. Comput.},
volume = {49},
number = {2},
pages = {318--364},
year = {2020},
url = {https://doi.org/10.1137/18M122371X},
doi = {10.1137/18M122371X},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/ChitnisFHM20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/FeldmannS20,
author = {Andreas Emil Feldmann and
David Saulpic},
editor = {Fabrizio Grandoni and
Grzegorz Herman and
Peter Sanders},
title = {Polynomial Time Approximation Schemes for Clustering in Low Highway
Dimension Graphs},
booktitle = {28th Annual European Symposium on Algorithms, {ESA} 2020, September
7-9, 2020, Pisa, Italy (Virtual Conference)},
series = {LIPIcs},
volume = {173},
pages = {46:1--46:22},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.ESA.2020.46},
doi = {10.4230/LIPICS.ESA.2020.46},
timestamp = {Thu, 16 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/esa/FeldmannS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/FeldmannI020,
author = {Andreas Emil Feldmann and
Davis Issac and
Ashutosh Rai},
editor = {Yixin Cao and
Marcin Pilipczuk},
title = {Fixed-Parameter Tractability of the Weighted Edge Clique Partition
Problem},
booktitle = {15th International Symposium on Parameterized and Exact Computation,
{IPEC} 2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)},
series = {LIPIcs},
volume = {180},
pages = {17:1--17:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.IPEC.2020.17},
doi = {10.4230/LIPICS.IPEC.2020.17},
timestamp = {Thu, 16 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/iwpec/FeldmannI020.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/BosekDFPZ20,
author = {Bartlomiej Bosek and
Yann Disser and
Andreas Emil Feldmann and
Jakub Pawlewicz and
Anna Zych{-}Pawlewicz},
editor = {Susanne Albers},
title = {Recoloring Interval Graphs with Limited Recourse Budget},
booktitle = {17th Scandinavian Symposium and Workshops on Algorithm Theory, {SWAT}
2020, June 22-24, 2020, T{\'{o}}rshavn, Faroe Islands},
series = {LIPIcs},
volume = {162},
pages = {17:1--17:23},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.SWAT.2020.17},
doi = {10.4230/LIPICS.SWAT.2020.17},
timestamp = {Tue, 16 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/BosekDFPZ20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/DvorakFRR20,
author = {Pavel Dvor{\'{a}}k and
Andreas Emil Feldmann and
Ashutosh Rai and
Pawel Rzazewski},
editor = {Isolde Adler and
Haiko M{\"{u}}ller},
title = {Parameterized Inapproximability of Independent Set in H-Free Graphs},
booktitle = {Graph-Theoretic Concepts in Computer Science - 46th International
Workshop, {WG} 2020, Leeds, UK, June 24-26, 2020, Revised Selected
Papers},
series = {Lecture Notes in Computer Science},
volume = {12301},
pages = {40--53},
publisher = {Springer},
year = {2020},
url = {https://doi.org/10.1007/978-3-030-60440-0\_4},
doi = {10.1007/978-3-030-60440-0\_4},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/wg/DvorakFRR20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2002-07761,
author = {Andreas Emil Feldmann and
Davis Issac and
Ashutosh Rai},
title = {Fixed-Parameter Tractability of the Weighted Edge Clique Partition
Problem},
journal = {CoRR},
volume = {abs/2002.07761},
year = {2020},
url = {https://arxiv.org/abs/2002.07761},
eprinttype = {arXiv},
eprint = {2002.07761},
timestamp = {Tue, 18 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2002-07761.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2006-00571,
author = {Jiehua Chen and
Wojciech Czerwinski and
Yann Disser and
Andreas Emil Feldmann and
Danny Hermelin and
Wojciech Nadara and
Michal Pilipczuk and
Marcin Pilipczuk and
Manuel Sorge and
Bartlomiej Wr{\'{o}}blewski and
Anna Zych{-}Pawlewicz},
title = {On Dynamic Parameterized k-Path},
journal = {CoRR},
volume = {abs/2006.00571},
year = {2020},
url = {https://arxiv.org/abs/2006.00571},
eprinttype = {arXiv},
eprint = {2006.00571},
timestamp = {Mon, 30 May 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2006-00571.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2006-04411,
author = {Andreas Emil Feldmann and
{Karthik {C. S.}} and
Euiwoong Lee and
Pasin Manurangsi},
title = {A Survey on Approximation in Parameterized Complexity: Hardness and
Algorithms},
journal = {CoRR},
volume = {abs/2006.04411},
year = {2020},
url = {https://arxiv.org/abs/2006.04411},
eprinttype = {arXiv},
eprint = {2006.04411},
timestamp = {Fri, 12 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2006-04411.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2006-10444,
author = {Pavel Dvor{\'{a}}k and
Andreas Emil Feldmann and
Ashutosh Rai and
Pawel Rzazewski},
title = {Parameterized Inapproximability of Independent Set in H-Free Graphs},
journal = {CoRR},
volume = {abs/2006.10444},
year = {2020},
url = {https://arxiv.org/abs/2006.10444},
eprinttype = {arXiv},
eprint = {2006.10444},
timestamp = {Tue, 18 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2006-10444.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2006-12897,
author = {Andreas Emil Feldmann and
David Saulpic},
title = {Polynomial Time Approximation Schemes for Clustering in Low Highway
Dimension Graphs},
journal = {CoRR},
volume = {abs/2006.12897},
year = {2020},
url = {https://arxiv.org/abs/2006.12897},
eprinttype = {arXiv},
eprint = {2006.12897},
timestamp = {Wed, 01 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2006-12897.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2010-10809,
author = {Steffen Borgwardt and
Cornelius Brand and
Andreas Emil Feldmann and
Martin Kouteck{\'{y}}},
title = {A Note on the Approximability of Deepest-Descent Circuit Steps},
journal = {CoRR},
volume = {abs/2010.10809},
year = {2020},
url = {https://arxiv.org/abs/2010.10809},
eprinttype = {arXiv},
eprint = {2010.10809},
timestamp = {Tue, 27 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2010-10809.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/FeldmannSLM20,
author = {Andreas Emil Feldmann and
{Karthik {C. S.}} and
Euiwoong Lee and
Pasin Manurangsi},
title = {A Survey on Approximation in Parameterized Complexity: Hardness and
Algorithms},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR20-086}},
year = {2020},
url = {https://eccc.weizmann.ac.il/report/2020/086},
eprinttype = {ECCC},
eprint = {TR20-086},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/FeldmannSLM20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Feldmann19,
author = {Andreas Emil Feldmann},
title = {Fixed-Parameter Approximations for k-Center Problems in Low Highway
Dimension Graphs},
journal = {Algorithmica},
volume = {81},
number = {3},
pages = {1031--1052},
year = {2019},
url = {https://doi.org/10.1007/s00453-018-0455-0},
doi = {10.1007/S00453-018-0455-0},
timestamp = {Fri, 12 Apr 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/Feldmann19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/ChitnisFS19,
author = {Rajesh Chitnis and
Andreas Emil Feldmann and
Ondrej Such{\'{y}}},
title = {A Tight Lower Bound for Planar Steiner Orientation},
journal = {Algorithmica},
volume = {81},
number = {8},
pages = {3200--3216},
year = {2019},
url = {https://doi.org/10.1007/s00453-019-00580-x},
doi = {10.1007/S00453-019-00580-X},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/ChitnisFS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/SaulpicCF19,
author = {David Saulpic and
Vincent Cohen{-}Addad and
Andreas Emil Feldmann},
editor = {David Zuckerman},
title = {Near-Linear Time Approximations Schemes for Clustering in Doubling
Metrics},
booktitle = {60th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2019, Baltimore, Maryland, USA, November 9-12, 2019},
pages = {540--559},
publisher = {{IEEE} Computer Society},
year = {2019},
url = {https://doi.org/10.1109/FOCS.2019.00041},
doi = {10.1109/FOCS.2019.00041},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/SaulpicCF19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/ChitnisF19,
author = {Rajesh Chitnis and
Andreas Emil Feldmann},
editor = {Bart M. P. Jansen and
Jan Arne Telle},
title = {{FPT} Inapproximability of Directed Cut and Connectivity Problems},
booktitle = {14th International Symposium on Parameterized and Exact Computation,
{IPEC} 2019, September 11-13, 2019, Munich, Germany},
series = {LIPIcs},
volume = {148},
pages = {8:1--8:20},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.IPEC.2019.8},
doi = {10.4230/LIPICS.IPEC.2019.8},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/iwpec/ChitnisF19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/DisserFKK19,
author = {Yann Disser and
Andreas Emil Feldmann and
Max Klimm and
Jochen K{\"{o}}nemann},
editor = {Ignasi Sau and
Dimitrios M. Thilikos},
title = {Travelling on Graphs with Small Highway Dimension},
booktitle = {Graph-Theoretic Concepts in Computer Science - 45th International
Workshop, {WG} 2019, Vall de N{\'{u}}ria, Spain, June 19-21,
2019, Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {11789},
pages = {175--189},
publisher = {Springer},
year = {2019},
url = {https://doi.org/10.1007/978-3-030-30786-8\_14},
doi = {10.1007/978-3-030-30786-8\_14},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/wg/DisserFKK19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1902-07040,
author = {Yann Disser and
Andreas Emil Feldmann and
Max Klimm and
Jochen K{\"{o}}nemann},
title = {Travelling on Graphs with Small Highway Dimension},
journal = {CoRR},
volume = {abs/1902.07040},
year = {2019},
url = {http://arxiv.org/abs/1902.07040},
eprinttype = {arXiv},
eprint = {1902.07040},
timestamp = {Tue, 21 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1902-07040.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1910-01934,
author = {Rajesh Chitnis and
Andreas Emil Feldmann},
title = {{FPT} Inapproximability of Directed Cut and Connectivity Problems},
journal = {CoRR},
volume = {abs/1910.01934},
year = {2019},
url = {http://arxiv.org/abs/1910.01934},
eprinttype = {arXiv},
eprint = {1910.01934},
timestamp = {Wed, 09 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1910-01934.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1911-13161,
author = {Rajesh Chitnis and
Andreas Emil Feldmann and
MohammadTaghi Hajiaghayi and
D{\'{a}}niel Marx},
title = {Tight Bounds for Planar Strongly Connected Steiner Subgraph with Fixed
Number of Terminals (and Extensions)},
journal = {CoRR},
volume = {abs/1911.13161},
year = {2019},
url = {http://arxiv.org/abs/1911.13161},
eprinttype = {arXiv},
eprint = {1911.13161},
timestamp = {Wed, 08 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1911-13161.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/FeldmannFKP18,
author = {Andreas Emil Feldmann and
Wai Shing Fung and
Jochen K{\"{o}}nemann and
Ian Post},
title = {A (1+{\(\epsilon\)})-Embedding of Low Highway Dimension Graphs into
Bounded Treewidth Graphs},
journal = {{SIAM} J. Comput.},
volume = {47},
number = {4},
pages = {1667--1704},
year = {2018},
url = {https://doi.org/10.1137/16M1067196},
doi = {10.1137/16M1067196},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/FeldmannFKP18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/csr/ChitnisF18,
author = {Rajesh Chitnis and
Andreas Emil Feldmann},
editor = {Fedor V. Fomin and
Vladimir V. Podolskii},
title = {A Tight Lower Bound for Steiner Orientation},
booktitle = {Computer Science - Theory and Applications - 13th International Computer
Science Symposium in Russia, {CSR} 2018, Moscow, Russia, June 6-10,
2018, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10846},
pages = {65--77},
publisher = {Springer},
year = {2018},
url = {https://doi.org/10.1007/978-3-319-90530-3\_7},
doi = {10.1007/978-3-319-90530-3\_7},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/csr/ChitnisF18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/ChitnisFM18,
author = {Rajesh Chitnis and
Andreas Emil Feldmann and
Pasin Manurangsi},
editor = {Yossi Azar and
Hannah Bast and
Grzegorz Herman},
title = {Parameterized Approximation Algorithms for Bidirected Steiner Network
Problems},
booktitle = {26th Annual European Symposium on Algorithms, {ESA} 2018, August 20-22,
2018, Helsinki, Finland},
series = {LIPIcs},
volume = {112},
pages = {20:1--20:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.ESA.2018.20},
doi = {10.4230/LIPICS.ESA.2018.20},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/esa/ChitnisFM18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/DvorakFKMTV18,
author = {Pavel Dvor{\'{a}}k and
Andreas Emil Feldmann and
Dusan Knop and
Tom{\'{a}}s Masar{\'{\i}}k and
Tomas Toufar and
Pavel Vesel{\'{y}}},
editor = {Rolf Niedermeier and
Brigitte Vall{\'{e}}e},
title = {Parameterized Approximation Schemes for Steiner Trees with Small Number
of Steiner Vertices},
booktitle = {35th Symposium on Theoretical Aspects of Computer Science, {STACS}
2018, February 28 to March 3, 2018, Caen, France},
series = {LIPIcs},
volume = {96},
pages = {26:1--26:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.STACS.2018.26},
doi = {10.4230/LIPICS.STACS.2018.26},
timestamp = {Tue, 29 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stacs/DvorakFKMTV18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/FeldmannM18,
author = {Andreas Emil Feldmann and
D{\'{a}}niel Marx},
editor = {David Eppstein},
title = {The Parameterized Hardness of the k-Center Problem in Transportation
Networks},
booktitle = {16th Scandinavian Symposium and Workshops on Algorithm Theory, {SWAT}
2018, June 18-20, 2018, Malm{\"{o}}, Sweden},
series = {LIPIcs},
volume = {101},
pages = {19:1--19:13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.SWAT.2018.19},
doi = {10.4230/LIPICS.SWAT.2018.19},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/FeldmannM18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1802-08563,
author = {Andreas Emil Feldmann and
D{\'{a}}niel Marx},
title = {The Parameterized Hardness of the k-Center Problem in Transportation
Networks},
journal = {CoRR},
volume = {abs/1802.08563},
year = {2018},
url = {http://arxiv.org/abs/1802.08563},
eprinttype = {arXiv},
eprint = {1802.08563},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1802-08563.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1812-08664,
author = {Vincent Cohen{-}Addad and
Andreas Emil Feldmann and
David Saulpic},
title = {Near-Linear Time Approximation Schemes for Clustering in Doubling
Metrics},
journal = {CoRR},
volume = {abs/1812.08664},
year = {2018},
url = {http://arxiv.org/abs/1812.08664},
eprinttype = {arXiv},
eprint = {1812.08664},
timestamp = {Wed, 02 Jan 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1812-08664.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/ChitnisFM17,
author = {Rajesh Chitnis and
Andreas Emil Feldmann and
Pasin Manurangsi},
title = {Parameterized Approximation Algorithms for Directed Steiner Network
Problems},
journal = {CoRR},
volume = {abs/1707.06499},
year = {2017},
url = {http://arxiv.org/abs/1707.06499},
eprinttype = {arXiv},
eprint = {1707.06499},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/ChitnisFM17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/FeldmannM17,
author = {Andreas Emil Feldmann and
D{\'{a}}niel Marx},
title = {The Complexity Landscape of Fixed-Parameter Directed Steiner Network
Problems},
journal = {CoRR},
volume = {abs/1707.06808},
year = {2017},
url = {http://arxiv.org/abs/1707.06808},
eprinttype = {arXiv},
eprint = {1707.06808},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/FeldmannM17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1710-00668,
author = {Pavel Dvor{\'{a}}k and
Andreas Emil Feldmann and
Dusan Knop and
Tom{\'{a}}s Masar{\'{\i}}k and
Tom{\'{a}}s Toufar and
Pavel Vesel{\'{y}}},
title = {Parameterized Approximation Schemes for Steiner Trees with Small Number
of Steiner Vertices},
journal = {CoRR},
volume = {abs/1710.00668},
year = {2017},
url = {http://arxiv.org/abs/1710.00668},
eprinttype = {arXiv},
eprint = {1710.00668},
timestamp = {Tue, 29 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1710-00668.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/FeldmannKOS16,
author = {Andreas Emil Feldmann and
Jochen K{\"{o}}nemann and
Neil Olver and
Laura Sanit{\`{a}}},
title = {On the equivalence of the bidirected and hypergraphic relaxations
for Steiner tree},
journal = {Math. Program.},
volume = {160},
number = {1-2},
pages = {379--406},
year = {2016},
url = {https://doi.org/10.1007/s10107-016-0987-5},
doi = {10.1007/S10107-016-0987-5},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mp/FeldmannKOS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/AbdiFGKS16,
author = {Ahmad Abdi and
Andreas Emil Feldmann and
Bertrand Guenin and
Jochen K{\"{o}}nemann and
Laura Sanit{\`{a}}},
title = {Lehman's Theorem and the Directed Steiner Tree Problem},
journal = {{SIAM} J. Discret. Math.},
volume = {30},
number = {1},
pages = {141--153},
year = {2016},
url = {https://doi.org/10.1137/15M1007185},
doi = {10.1137/15M1007185},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/AbdiFGKS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/FeldmannM16,
author = {Andreas Emil Feldmann and
D{\'{a}}niel Marx},
editor = {Ioannis Chatzigiannakis and
Michael Mitzenmacher and
Yuval Rabani and
Davide Sangiorgi},
title = {The Complexity Landscape of Fixed-Parameter Directed Steiner Network
Problems},
booktitle = {43rd International Colloquium on Automata, Languages, and Programming,
{ICALP} 2016, July 11-15, 2016, Rome, Italy},
series = {LIPIcs},
volume = {55},
pages = {27:1--27:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2016.27},
doi = {10.4230/LIPICS.ICALP.2016.27},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/icalp/FeldmannM16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/FeldmannKPS16,
author = {Andreas Emil Feldmann and
Jochen K{\"{o}}nemann and
Kanstantsin Pashkovich and
Laura Sanit{\`{a}}},
editor = {Seok{-}Hee Hong},
title = {Fast Approximation Algorithms for the Generalized Survivable Network
Design Problem},
booktitle = {27th International Symposium on Algorithms and Computation, {ISAAC}
2016, December 12-14, 2016, Sydney, Australia},
series = {LIPIcs},
volume = {64},
pages = {33:1--33:12},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2016.33},
doi = {10.4230/LIPICS.ISAAC.2016.33},
timestamp = {Thu, 27 Apr 2023 14:57:19 +0200},
biburl = {https://dblp.org/rec/conf/isaac/FeldmannKPS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/FeldmannKPS16,
author = {Andreas Emil Feldmann and
Jochen K{\"{o}}nemann and
Kanstantsin Pashkovich and
Laura Sanit{\`{a}}},
title = {Fast Approximation Algorithms for the Generalized Survivable Network
Design Problem},
journal = {CoRR},
volume = {abs/1604.07049},
year = {2016},
url = {http://arxiv.org/abs/1604.07049},
eprinttype = {arXiv},
eprint = {1604.07049},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/FeldmannKPS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/Feldmann16,
author = {Andreas Emil Feldmann},
title = {Fixed Parameter Approximations for k-Center Problems in Low Highway
Dimension Graphs},
journal = {CoRR},
volume = {abs/1605.02530},
year = {2016},
url = {http://arxiv.org/abs/1605.02530},
eprinttype = {arXiv},
eprint = {1605.02530},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/Feldmann16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/FeldmannW15,
author = {Andreas Emil Feldmann and
Peter Widmayer},
title = {An O(n\({}^{\mbox{4}}\)) Time Algorithm to Compute the Bisection Width
of Solid Grid Graphs},
journal = {Algorithmica},
volume = {71},
number = {1},
pages = {181--200},
year = {2015},
url = {https://doi.org/10.1007/s00453-014-9928-y},
doi = {10.1007/S00453-014-9928-Y},
timestamp = {Thu, 15 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/FeldmannW15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/FeldmannF15,
author = {Andreas Emil Feldmann and
Luca Foschini},
title = {Balanced Partitions of Trees and Applications},
journal = {Algorithmica},
volume = {71},
number = {2},
pages = {354--376},
year = {2015},
url = {https://doi.org/10.1007/s00453-013-9802-3},
doi = {10.1007/S00453-013-9802-3},
timestamp = {Thu, 13 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/FeldmannF15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/BevernFSS15,
author = {Ren{\'{e}} van Bevern and
Andreas Emil Feldmann and
Manuel Sorge and
Ondrej Such{\'{y}}},
title = {On the Parameterized Complexity of Computing Balanced Partitions in
Graphs},
journal = {Theory Comput. Syst.},
volume = {57},
number = {1},
pages = {1--35},
year = {2015},
url = {https://doi.org/10.1007/s00224-014-9557-5},
doi = {10.1007/S00224-014-9557-5},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/BevernFSS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/DisserFKM15,
author = {Yann Disser and
Andreas Emil Feldmann and
Max Klimm and
Mat{\'{u}}s Mihal{\'{a}}k},
title = {Improving the Hk-bound on the price of stability in undirected Shapley
network design games},
journal = {Theor. Comput. Sci.},
volume = {562},
pages = {557--564},
year = {2015},
url = {https://doi.org/10.1016/j.tcs.2014.10.037},
doi = {10.1016/J.TCS.2014.10.037},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/DisserFKM15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/FeldmannFKP15,
author = {Andreas Emil Feldmann and
Wai Shing Fung and
Jochen K{\"{o}}nemann and
Ian Post},
editor = {Magn{\'{u}}s M. Halld{\'{o}}rsson and
Kazuo Iwama and
Naoki Kobayashi and
Bettina Speckmann},
title = {A (1+{\(\epsilon\)})-Embedding of Low Highway Dimension Graphs into
Bounded Treewidth Graphs},
booktitle = {Automata, Languages, and Programming - 42nd International Colloquium,
{ICALP} 2015, Kyoto, Japan, July 6-10, 2015, Proceedings, Part {I}},
series = {Lecture Notes in Computer Science},
volume = {9134},
pages = {469--480},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-662-47672-7\_38},
doi = {10.1007/978-3-662-47672-7\_38},
timestamp = {Fri, 27 Mar 2020 09:02:59 +0100},
biburl = {https://dblp.org/rec/conf/icalp/FeldmannFKP15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/Feldmann15,
author = {Andreas Emil Feldmann},
editor = {Magn{\'{u}}s M. Halld{\'{o}}rsson and
Kazuo Iwama and
Naoki Kobayashi and
Bettina Speckmann},
title = {Fixed Parameter Approximations for k-Center Problems in Low Highway
Dimension Graphs},
booktitle = {Automata, Languages, and Programming - 42nd International Colloquium,
{ICALP} 2015, Kyoto, Japan, July 6-10, 2015, Proceedings, Part {II}},
series = {Lecture Notes in Computer Science},
volume = {9135},
pages = {588--600},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-662-47666-6\_47},
doi = {10.1007/978-3-662-47666-6\_47},
timestamp = {Fri, 27 Mar 2020 09:02:59 +0100},
biburl = {https://dblp.org/rec/conf/icalp/Feldmann15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/FeldmannFKP15,
author = {Andreas Emil Feldmann and
Wai Shing Fung and
Jochen K{\"{o}}nemann and
Ian Post},
title = {A {(1} + {\(\epsilon\)})-Embedding of Low Highway Dimension Graphs
into Bounded Treewidth Graphs},
journal = {CoRR},
volume = {abs/1502.04588},
year = {2015},
url = {http://arxiv.org/abs/1502.04588},
eprinttype = {arXiv},
eprint = {1502.04588},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/FeldmannFKP15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/FeldmannKOS14,
author = {Andreas Emil Feldmann and
Jochen K{\"{o}}nemann and
Neil Olver and
Laura Sanit{\`{a}}},
editor = {Klaus Jansen and
Jos{\'{e}} D. P. Rolim and
Nikhil R. Devanur and
Cristopher Moore},
title = {On the Equivalence of the Bidirected and Hypergraphic Relaxations
for Steiner Tree},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2014, September 4-6, 2014, Barcelona,
Spain},
series = {LIPIcs},
volume = {28},
pages = {176--191},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2014},
url = {https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2014.176},
doi = {10.4230/LIPICS.APPROX-RANDOM.2014.176},
timestamp = {Tue, 21 Sep 2021 09:36:24 +0200},
biburl = {https://dblp.org/rec/conf/approx/FeldmannKOS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Feldmann0W13,
author = {Andreas Emil Feldmann and
Shantanu Das and
Peter Widmayer},
title = {Corner cuts are close to optimal: From solid grids to polygons and
back},
journal = {Discret. Appl. Math.},
volume = {161},
number = {7-8},
pages = {970--998},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2012.12.002},
doi = {10.1016/J.DAM.2012.12.002},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/Feldmann0W13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Feldmann13,
author = {Andreas Emil Feldmann},
title = {Fast balanced partitioning is hard even on grids and trees},
journal = {Theor. Comput. Sci.},
volume = {485},
pages = {61--68},
year = {2013},
url = {https://doi.org/10.1016/j.tcs.2013.03.014},
doi = {10.1016/J.TCS.2013.03.014},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Feldmann13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/DisserFKM13,
author = {Yann Disser and
Andreas Emil Feldmann and
Max Klimm and
Mat{\'{u}}s Mihal{\'{a}}k},
editor = {Paul G. Spirakis and
Maria J. Serna},
title = {Improving the \emph{H} \({}_{\mbox{ \emph{k} }}\)-Bound on the Price
of Stability in Undirected Shapley Network Design Games},
booktitle = {Algorithms and Complexity, 8th International Conference, {CIAC} 2013,
Barcelona, Spain, May 22-24, 2013. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7878},
pages = {158--169},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-38233-8\_14},
doi = {10.1007/978-3-642-38233-8\_14},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/ciac/DisserFKM13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/BevernFSS13,
author = {Ren{\'{e}} van Bevern and
Andreas Emil Feldmann and
Manuel Sorge and
Ondrej Such{\'{y}}},
editor = {Andreas Brandst{\"{a}}dt and
Klaus Jansen and
R{\"{u}}diger Reischuk},
title = {On the Parameterized Complexity of Computing Graph Bisections},
booktitle = {Graph-Theoretic Concepts in Computer Science - 39th International
Workshop, {WG} 2013, L{\"{u}}beck, Germany, June 19-21, 2013,
Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {8165},
pages = {76--87},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-45043-3\_8},
doi = {10.1007/978-3-642-45043-3\_8},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/wg/BevernFSS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BevernFSS13,
author = {Ren{\'{e}} van Bevern and
Andreas Emil Feldmann and
Manuel Sorge and
Ondrej Such{\'{y}}},
title = {On the Parameterized Complexity of Computing Balanced Partitions in
Graphs},
journal = {CoRR},
volume = {abs/1312.7014},
year = {2013},
url = {http://arxiv.org/abs/1312.7014},
eprinttype = {arXiv},
eprint = {1312.7014},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BevernFSS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@phdthesis{DBLP:phd/dnb/Feldmann12a,
author = {Andreas Emil Feldmann},
title = {Balanced partitioning of grids and related graphs: a theoretical study
of data distribution in parallel finite element model simulations},
school = {{ETH} Zurich},
year = {2012},
url = {https://d-nb.info/102353617X},
doi = {10.3929/ETHZ-A-007321964},
isbn = {978-3-95404-125-1},
timestamp = {Sat, 17 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/phd/dnb/Feldmann12a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/FeldmannRV12,
author = {Andreas Emil Feldmann and
Heiko R{\"{o}}glin and
Berthold V{\"{o}}cking},
title = {Computing approximate Nash equilibria in network congestion games},
journal = {Networks},
volume = {59},
number = {4},
pages = {380--386},
year = {2012},
url = {https://doi.org/10.1002/net.20444},
doi = {10.1002/NET.20444},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/FeldmannRV12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/Feldmann12,
author = {Andreas Emil Feldmann},
editor = {Branislav Rovan and
Vladimiro Sassone and
Peter Widmayer},
title = {Fast Balanced Partitioning Is Hard Even on Grids and Trees},
booktitle = {Mathematical Foundations of Computer Science 2012 - 37th International
Symposium, {MFCS} 2012, Bratislava, Slovakia, August 27-31, 2012.
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7464},
pages = {372--382},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-32589-2\_34},
doi = {10.1007/978-3-642-32589-2\_34},
timestamp = {Tue, 14 May 2019 10:00:37 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/Feldmann12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/FeldmannF12,
author = {Andreas Emil Feldmann and
Luca Foschini},
editor = {Christoph D{\"{u}}rr and
Thomas Wilke},
title = {Balanced Partitions of Trees and Applications},
booktitle = {29th International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2012, February 29th - March 3rd, 2012, Paris, France},
series = {LIPIcs},
volume = {14},
pages = {100--111},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2012},
url = {https://doi.org/10.4230/LIPIcs.STACS.2012.100},
doi = {10.4230/LIPICS.STACS.2012.100},
timestamp = {Thu, 13 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stacs/FeldmannF12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1211-2090,
author = {Yann Disser and
Andreas Emil Feldmann and
Max Klimm and
Mat{\'{u}}s Mihal{\'{a}}k},
title = {Improving the {\textdollar}H{\_}k{\textdollar}-Bound on the Price
of Stability in Undirected Shapley Network Design Games},
journal = {CoRR},
volume = {abs/1211.2090},
year = {2012},
url = {http://arxiv.org/abs/1211.2090},
eprinttype = {arXiv},
eprint = {1211.2090},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1211-2090.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/FeldmannW11,
author = {Andreas Emil Feldmann and
Peter Widmayer},
editor = {Camil Demetrescu and
Magn{\'{u}}s M. Halld{\'{o}}rsson},
title = {An {\textdollar}{\textbackslash}mathcal\{O\}(n{\^{}}4){\textdollar}
Time Algorithm to Compute the Bisection Width of Solid Grid Graphs},
booktitle = {Algorithms - {ESA} 2011 - 19th Annual European Symposium, Saarbr{\"{u}}cken,
Germany, September 5-9, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6942},
pages = {143--154},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-23719-5\_13},
doi = {10.1007/978-3-642-23719-5\_13},
timestamp = {Tue, 14 May 2019 10:00:54 +0200},
biburl = {https://dblp.org/rec/conf/esa/FeldmannW11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/FeldmannDW11,
author = {Andreas Emil Feldmann and
Shantanu Das and
Peter Widmayer},
editor = {Petr Kolman and
Jan Kratochv{\'{\i}}l},
title = {Restricted Cuts for Bisections in Solid Grids: {A} Proof via Polygons},
booktitle = {Graph-Theoretic Concepts in Computer Science - 37th International
Workshop, {WG} 2011, Tepl{\'{a}} Monastery, Czech Republic, June
21-24, 2011. Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {6986},
pages = {143--154},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-25870-1\_14},
doi = {10.1007/978-3-642-25870-1\_14},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/wg/FeldmannDW11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1111-6745,
author = {Andreas Emil Feldmann},
title = {Fast Balanced Partitioning of Grid Graphs is Hard},
journal = {CoRR},
volume = {abs/1111.6745},
year = {2011},
url = {http://arxiv.org/abs/1111.6745},
eprinttype = {arXiv},
eprint = {1111.6745},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1111-6745.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoa/FeldmannDW10,
author = {Andreas Emil Feldmann and
Shantanu Das and
Peter Widmayer},
editor = {Weili Wu and
Ovidiu Daescu},
title = {Simple Cuts Are Fast and Good: Optimum Right-Angled Cuts in Solid
Grids},
booktitle = {Combinatorial Optimization and Applications - 4th International Conference,
{COCOA} 2010, Kailua-Kona, HI, USA, December 18-20, 2010, Proceedings,
Part {I}},
series = {Lecture Notes in Computer Science},
volume = {6508},
pages = {11--20},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-17458-2\_2},
doi = {10.1007/978-3-642-17458-2\_2},
timestamp = {Thu, 02 Dec 2021 16:45:00 +0100},
biburl = {https://dblp.org/rec/conf/cocoa/FeldmannDW10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sirocco/FeldmannRV08,
author = {Andreas Emil Feldmann and
Heiko R{\"{o}}glin and
Berthold V{\"{o}}cking},
editor = {Alexander A. Shvartsman and
Pascal Felber},
title = {Computing Approximate Nash Equilibria in Network Congestion Games},
booktitle = {Structural Information and Communication Complexity, 15th International
Colloquium, {SIROCCO} 2008, Villars-sur-Ollon, Switzerland, June 17-20,
2008, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5058},
pages = {209--220},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-69355-0\_18},
doi = {10.1007/978-3-540-69355-0\_18},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sirocco/FeldmannRV08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
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.
last updated on 2024-03-24 00:09 CET 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:
