Vincent Froese

Technische Universität Berlin — Germany

Computer Science · Physical Sciences

10h-index282citations77works0.42yr avg
OpenAlex↗Google Scholar↗Lab page↗

Accepting Students?

No reports yet. Know if this professor is taking students?

Research Topics

Advanced Graph Theory Research(27), Complexity and Algorithms in Graphs(21), Data Management and Algorithms(19), Complex Network Analysis Techniques(14), Game Theory and Applications(10)

Publications77 total

Density Matters: A Complexity Dichotomy of Deleting Edges to Bound Subgraph Density
arXiv (Cornell University)·2026Open Access
Density Matters: A Complexity Dichotomy of Deleting Edges to Bound Subgraph Density
ArXiv.org·2026Open Access
Density Matters: A Complexity Dichotomy of Deleting Edges to Bound Subgraph Density
Leibniz-Zentrum für Informatik (Schloss Dagstuhl)·2026Open Access
Parameterized Hardness of Zonotope Containment and Neural Network Verification
arXiv (Cornell University)·2025Open Access
Complexity of Injectivity and Verification of ReLU Neural Networks
arXiv (Cornell University)·2024Open Access
Modification-fair cluster editing
Social Network Analysis and Mining·2024· 1 citedOpen Access
Equilibria in schelling games: computational hardness and robustness
Autonomous Agents and Multi-Agent Systems·2024· 3 citedOpen Access
Nash Equilibria in Reverse Temporal Voronoi Games
arXiv (Cornell University)·2024Open Access
Nash Equilibria in Reverse Temporal Voronoi Games
Journal of Graph Algorithms and Applications·2024Open Access
Disentangling the Computational Complexity of Network Untangling
Theory of Computing Systems·2023· 2 citedOpen Access
Terrain-like graphs and the median Genocchi numbers
European Journal of Combinatorics·2023
An average-compress algorithm for the sample mean problem under dynamic time warping
Journal of Global Optimization·2023· 3 citedOpen Access
Training Neural Networks is NP-Hard in Fixed Dimension
arXiv (Cornell University)·2023· 4 citedOpen Access
Terrain-like Graphs and the Median Genocchi Numbers
arXiv (Cornell University)·2022Open Access
The complexity of binary matrix completion under diameter constraints
Journal of Computer and System Sciences·2022· 4 cited
Fast Exact Dynamic Time Warping on Run-Length Encoded Time Series
Algorithmica·2022· 3 citedOpen Access
The Computational Complexity of ReLU Network Training Parameterized by Data Dimensionality
Journal of Artificial Intelligence Research·2022· 18 citedOpen Access
Disentangling the Computational Complexity of Network Untangling
Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence·2022· 5 citedOpen Access
Modification-Fair Cluster Editing
Proceedings of the AAAI Conference on Artificial Intelligence·2022· 5 citedOpen Access
Equilibria in Schelling Games: Computational Hardness and Robustness
2022· 1 cited
page 1 of 4Next →

Frequent Co-authors

Rolf Niedermeier(33), Laurent Bulteau(12), René van Bevern(9), Robert Bredereck(8), André Nichterlein(6), Jiehua Chen(6), Gerhard J. Woeginger(6), Malte Renken(6), Nimrod Talmon(5), Sepp Hartung(4), Tomohiro Koana(4), Brijnesh J. Jain(4), Niclas Boehmer(4), Manuel Sorge(3), Pascal Kunz(3), Leon Kellerhals(3), Luca Kreisel(3), Konstantin Kutzkov(2), Rasmus Pagh(2), Christoph Hertrich(2)