Andreas Emil Feldmann
Orcid: 0000-0001-6229-5332Affiliations:
- University of Sheffield, UK
- Charles University, Prague, Czechia (former)
According to our database1,
Andreas Emil Feldmann
authored at least 47 papers
between 2010 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
On csauthors.net:
Bibliography
2024
Proceedings of the 51st International Colloquium on Automata, Languages, and Programming, 2024
2023
Algorithmica, April, 2023
Proceedings of the Approximation, 2023
2022
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2022
Proceedings of the 5th Symposium on Simplicity in Algorithms, 2022
Proceedings of the 17th International Symposium on Parameterized and Exact Computation, 2022
2021
ACM Trans. Algorithms, 2021
Parameterized Approximation Schemes for Steiner Trees with Small Number of Steiner Vertices.
SIAM J. Discret. Math., 2021
Oper. Res. Lett., 2021
Polynomial time approximation schemes for clustering in low highway dimension graphs.
J. Comput. Syst. Sci., 2021
J. ACM, 2021
Efficient fully dynamic elimination forests with applications to detecting long paths and cycles.
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021
Proceedings of the 16th International Symposium on Parameterized and Exact Computation, 2021
2020
Tight Bounds for Planar Strongly Connected Steiner Subgraph with Fixed Number of Terminals (and Extensions).
SIAM J. Comput., 2020
Algorithms, 2020
Algorithmica, 2020
Proceedings of the 17th Scandinavian Symposium and Workshops on Algorithm Theory, 2020
Proceedings of the 15th International Symposium on Parameterized and Exact Computation, 2020
2019
Fixed-Parameter Approximations for k-Center Problems in Low Highway Dimension Graphs.
Algorithmica, 2019
Proceedings of the 14th International Symposium on Parameterized and Exact Computation, 2019
Proceedings of the 60th IEEE Annual Symposium on Foundations of Computer Science, 2019
2018
SIAM J. Comput., 2018
Proceedings of the Computer Science - Theory and Applications, 2018
2017
CoRR, 2017
2016
Math. Program., 2016
Proceedings of the 27th International Symposium on Algorithms and Computation, 2016
Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016
2015
Improving the Hk-bound on the price of stability in undirected Shapley network design games.
Theor. Comput. Sci., 2015
Theory Comput. Syst., 2015
An O(n<sup>4</sup>) Time Algorithm to Compute the Bisection Width of Solid Grid Graphs.
Algorithmica, 2015
2013
Theor. Comput. Sci., 2013
Discret. Appl. Math., 2013
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2013
Improving the <i>H</i> <sub> <i>k</i> </sub>-Bound on the Price of Stability in Undirected Shapley Network Design Games.
Proceedings of the Algorithms and Complexity, 8th International Conference, 2013
2012
Balanced partitioning of grids and related graphs: a theoretical study of data distribution in parallel finite element model simulations.
PhD thesis, 2012
Improving the $H_k$-Bound on the Price of Stability in Undirected Shapley Network Design Games
CoRR, 2012
2011
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2011
An $\mathcal{O}(n^4)$ Time Algorithm to Compute the Bisection Width of Solid Grid Graphs.
Proceedings of the Algorithms - ESA 2011, 2011
2010
Proceedings of the Combinatorial Optimization and Applications, 2010