Vincent Froese

ORCID

Publication Activity (10 Years)

Years Active: 2013-2024
Publications (10 Years): 70

Top Venues

CoRR

J. Comput. Syst. Sci.

Algorithmica

Theory Comput. Syst.

Technical University of Berlin, Germany (PHD)

Education History

Technical University of Berlin, Germany

PHD

Publications

Vincent Froese, Leon Kellerhals, Rolf Niedermeier
Modification-fair cluster editing. Soc. Netw. Anal. Min. 14 (1) (2024)
Vincent Froese, Pascal Kunz, Philipp Zschoche
Disentangling the Computational Complexity of Network Untangling. Theory Comput. Syst. 68 (1) (2024)
Luca Kreisel, Niclas Boehmer, Vincent Froese, Rolf Niedermeier
Equilibria in schelling games: computational hardness and robustness. Auton. Agents Multi Agent Syst. 38 (1) (2024)
Vincent Froese, Malte Renken
Terrain-like graphs and the median Genocchi numbers. Eur. J. Comb. 115 (2024)
Vincent Froese, Moritz Grillo, Martin Skutella
Complexity of Deciding Injectivity and Surjectivity of ReLU Neural Networks. CoRR (2024)
Simeon Pawlowski, Vincent Froese
Nash Equilibria in Reverse Temporal Voronoi Games. CoRR (2024)
Vincent Froese, Brijnesh J. Jain, Maciej Rymar, Mathias Weller
Fast Exact Dynamic Time Warping on Run-Length Encoded Time Series. Algorithmica 85 (2) (2023)
Tomohiro Koana, Vincent Froese, Rolf Niedermeier
The complexity of binary matrix completion under diameter constraints. J. Comput. Syst. Sci. 132 (2023)
Vincent Froese, Christoph Hertrich
Training Neural Networks is NP-Hard in Fixed Dimension. CoRR (2023)
Brijnesh J. Jain, Vincent Froese, David Schultz
An average-compress algorithm for the sample mean problem under dynamic time warping. J. Glob. Optim. 86 (4) (2023)
Vincent Froese, Christoph Hertrich
Training Neural Networks is NP-Hard in Fixed Dimension. NeurIPS (2023)
Aleksander Figiel, Vincent Froese, André Nichterlein, Rolf Niedermeier
There and Back Again: On Applying Data Reduction Rules by Undoing Others. CoRR (2022)
Vincent Froese, Christoph Hertrich, Rolf Niedermeier
The Computational Complexity of ReLU Network Training Parameterized by Data Dimensionality. J. Artif. Intell. Res. 74 (2022)
Vincent Froese, Pascal Kunz, Philipp Zschoche
Disentangling the Computational Complexity of Network Untangling. IJCAI (2022)
Luca Kreisel, Niclas Boehmer, Vincent Froese, Rolf Niedermeier
Equilibria in Schelling Games: Computational Hardness and Robustness. AAMAS (2022)
Vincent Froese, Pascal Kunz, Philipp Zschoche
Disentangling the Computational Complexity of Network Untangling. CoRR (2022)
Vincent Froese, Malte Renken
Terrain-like Graphs and the Median Genocchi Numbers. CoRR (2022)
Vincent Froese, Leon Kellerhals, Rolf Niedermeier
Modification-Fair Cluster Editing. AAAI (2022)
Aleksander Figiel, Vincent Froese, André Nichterlein, Rolf Niedermeier
There and Back Again: On Applying Data Reduction Rules by Undoing Others. ESA (2022)
Niclas Boehmer, Vincent Froese, Julia Henkel, Yvonne Lasars, Rolf Niedermeier, Malte Renken
Two Influence Maximization Games on Graphs Made Temporal. IJCAI (2021)
Luca Kreisel, Niclas Boehmer, Vincent Froese, Rolf Niedermeier
Equilibria in Schelling Games: Computational Complexity and Robustness. CoRR (2021)
Vincent Froese, Christoph Hertrich, Rolf Niedermeier
The Computational Complexity of ReLU Network Training Parameterized by Data Dimensionality. CoRR (2021)
Vincent Froese, Malte Renken
Persistent Graphs and Cyclic Polytope Triangulations. Comb. 41 (3) (2021)
Vincent Froese, Malte Renken
A Fast Shortest Path Algorithm on Terrain-like Graphs. Discret. Comput. Geom. 66 (2) (2021)
Tomohiro Koana, Vincent Froese, Rolf Niedermeier
Binary Matrix Completion Under Diameter Constraints. STACS (2021)
Vincent Froese, Leon Kellerhals, Rolf Niedermeier
Modification-Fair Cluster Editing. CoRR (2021)
Niclas Boehmer, Vincent Froese, Julia Henkel, Yvonne Lasars, Rolf Niedermeier, Malte Renken
Two Influence Maximization Games on Graphs Made Temporal. CoRR (2021)
Tomohiro Koana, Vincent Froese, Rolf Niedermeier
Parameterized Algorithms for Matrix Completion with Radius Constraints. CPM (2020)
Tomohiro Koana, Vincent Froese, Rolf Niedermeier
Complexity of Combinatorial Matrix Completion With Diameter Constraints. CoRR (2020)
Laurent Bulteau, Vincent Froese, Rolf Niedermeier
Tight Hardness Results for Consensus Problems on Circular Strings and Time Series. SIAM J. Discret. Math. 34 (3) (2020)
Vincent Froese, Brijnesh J. Jain, Rolf Niedermeier, Malte Renken
Comparing temporal graphs using dynamic time warping. Soc. Netw. Anal. Min. 10 (1) (2020)
Nathan Schaar, Vincent Froese, Rolf Niedermeier
Faster Binary Mean Computation Under Dynamic Time Warping. CPM (2020)
Nathan Schaar, Vincent Froese, Rolf Niedermeier
Faster Binary Mean Computation Under Dynamic Time Warping. CoRR (2020)
Tomohiro Koana, Vincent Froese, Rolf Niedermeier
Parameterized Algorithms for Matrix Completion With Radius Constraints. CoRR (2020)
Vincent Froese, Brijnesh J. Jain, Maciej Rymar, Mathias Weller
Fast Exact Dynamic Time Warping on Run-Length Encoded Time Series. CoRR (2019)
Vincent Froese, Christoph Hansknecht
Mathematical Programming Models for Mean Computation in Dynamic Time Warping Spaces. CoRR (2019)
Anne-Sophie Himmel, Clemens Hoffmann, Pascal Kunz, Vincent Froese, Manuel Sorge
Computational complexity aspects of point visibility graphs. Discret. Appl. Math. 254 (2019)
Robert Bredereck, Vincent Froese, Marcel Koseler, Marcelo Garlet Millani, André Nichterlein, Rolf Niedermeier
A Parameterized Algorithmics Framework for Degree Sequence Completion Problems in Directed Graphs. Algorithmica 81 (4) (2019)
Vincent Froese, Malte Renken
Terrain Visibility Graphs and Cyclic Polytope Triangulations. CoRR (2019)
Markus Brill, Till Fluschnik, Vincent Froese, Brijnesh J. Jain, Rolf Niedermeier, David Schultz
Exact mean computation in dynamic time warping spaces. Data Min. Knowl. Discov. 33 (1) (2019)
Vincent Froese, Brijnesh J. Jain, Rolf Niedermeier, Malte Renken
Comparing Temporal Graphs Using Dynamic Time Warping. COMPLEX NETWORKS (2) (2019)
Vincent Froese, Malte Renken
Advancing Through Terrains. CoRR (2019)
Brijnesh J. Jain, Vincent Froese, David Schultz
An Average-Compress Algorithm for the Sample Mean Problem under Dynamic Time Warping. CoRR (2019)
Matthias Bentert, Jiehua Chen, Vincent Froese, Gerhard J. Woeginger
Good Things Come to Those Who Swap Objects on Paths. CoRR (2019)
Markus Brill, Till Fluschnik, Vincent Froese, Brijnesh J. Jain, Rolf Niedermeier, David Schultz
Exact Mean Computation in Dynamic Time Warping Spaces. SDM (2018)
René van Bevern, Vincent Froese, Christian Komusiewicz
Parameterizing Edge Modification Problems Above Lower Bounds. Theory Comput. Syst. 62 (3) (2018)
Vincent Froese, Brijnesh J. Jain, Rolf Niedermeier, Malte Renken
Comparing Temporal Graphs Using Dynamic Time Warping. CoRR (2018)
Laurent Bulteau, Vincent Froese, Rolf Niedermeier
Hardness of Consensus Problems for Circular Strings and Time Series Averaging. CoRR (2018)
Vincent Froese, Iyad A. Kanj, André Nichterlein, Rolf Niedermeier
Finding Points in General Position. Int. J. Comput. Geom. Appl. 27 (4) (2017)
Anne-Sophie Himmel, Clemens Hoffmann, Pascal Kunz, Vincent Froese, Manuel Sorge
Algorithmic Aspects of Point Visibility Graphs. CoRR (2017)
Markus Brill, Till Fluschnik, Vincent Froese, Brijnesh J. Jain, Rolf Niedermeier, David Schultz
Exact Mean Computation in Dynamic Time Warping Spaces. CoRR (2017)
René van Bevern, Robert Bredereck, Laurent Bulteau, Jiehua Chen, Vincent Froese, Rolf Niedermeier, Gerhard J. Woeginger
Partitioning Perfect Graphs into Stars. J. Graph Theory 85 (2) (2017)
Laurent Bulteau, Stefan Fafianie, Vincent Froese, Rolf Niedermeier, Nimrod Talmon
The Complexity of Finding Effectors. Theory Comput. Syst. 60 (2) (2017)
Laurent Bulteau, Vincent Froese, Sepp Hartung, Rolf Niedermeier
Co-Clustering under the Maximum Norm. Algorithms 9 (1) (2016)
Robert Bredereck, Vincent Froese, Marcel Koseler, Marcelo Garlet Millani, André Nichterlein, Rolf Niedermeier
A Parameterized Algorithmics Framework for Digraph Degree Sequence Completion Problems. CoRR (2016)
Vincent Froese, Iyad A. Kanj, André Nichterlein, Rolf Niedermeier
Finding Points in General Position. CCCG (2016)
Laurent Bulteau, Vincent Froese, Konstantin Kutzkov, Rasmus Pagh
Triangle Counting in Dynamic Graph Streams. Algorithmica 76 (1) (2016)
Vincent Froese, André Nichterlein, Rolf Niedermeier
Win-win kernelization for degree sequence completion problems. J. Comput. Syst. Sci. 82 (6) (2016)
Robert Bredereck, Vincent Froese, Marcel Koseler, Marcelo Garlet Millani, André Nichterlein, Rolf Niedermeier
A Parameterized Algorithmics Framework for Degree Sequence Completion Problems in Directed Graphs. IPEC (2016)
Vincent Froese, René van Bevern, Rolf Niedermeier, Manuel Sorge
Exploiting hidden structure in selecting dimensions that distinguish vectors. J. Comput. Syst. Sci. 82 (3) (2016)
René van Bevern, Vincent Froese, Christian Komusiewicz
Parameterizing Edge Modification Problems Above Lower Bounds. CSR (2016)
Laurent Bulteau, Vincent Froese, Nimrod Talmon
Multi-Player Diffusion Games on Graph Classes. Internet Math. 12 (6) (2016)
René van Bevern, Vincent Froese, Christian Komusiewicz
Parameterizing edge modification problems above lower bounds. CoRR (2015)
Vincent Froese, René van Bevern, Rolf Niedermeier, Manuel Sorge
Exploiting Hidden Structure in Selecting Dimensions that Distinguish Vectors. CoRR (2015)
Laurent Bulteau, Vincent Froese, Nimrod Talmon
Multi-player Diffusion Games on Graph Classes. TAMC (2015)
Robert Bredereck, Vincent Froese, Sepp Hartung, André Nichterlein, Rolf Niedermeier, Nimrod Talmon
The complexity of degree anonymization by vertex addition. Theor. Comput. Sci. 607 (2015)
Laurent Bulteau, Vincent Froese, Sepp Hartung, Rolf Niedermeier
Co-Clustering Under the Maximum Norm. CoRR (2015)
Laurent Bulteau, Stefan Fafianie, Vincent Froese, Rolf Niedermeier, Nimrod Talmon
The Complexity of Finding Effectors. TAMC (2015)
René van Bevern, Robert Bredereck, Jiehua Chen, Vincent Froese, Rolf Niedermeier, Gerhard J. Woeginger
Network-Based Vertex Dissolution. SIAM J. Discret. Math. 29 (2) (2015)
Vincent Froese, Iyad A. Kanj, André Nichterlein, Rolf Niedermeier
Finding Points in General Position. CoRR (2015)
Vincent Froese, André Nichterlein, Rolf Niedermeier
Win-Win Kernelization for Degree Sequence Completion Problems. CoRR (2014)
Laurent Bulteau, Vincent Froese, Sepp Hartung, Rolf Niedermeier
Co-Clustering Under the Maximum Norm. ISAAC (2014)
Laurent Bulteau, Vincent Froese, Konstantin Kutzkov, Rasmus Pagh
Triangle counting in dynamic graph streams. CoRR (2014)
René van Bevern, Robert Bredereck, Jiehua Chen, Vincent Froese, Rolf Niedermeier, Gerhard J. Woeginger
Network-Based Dissolution. MFCS (2) (2014)
Laurent Bulteau, Vincent Froese, Nimrod Talmon
Multi-Player Diffusion Games on Graph Classes. CoRR (2014)
Robert Bredereck, Vincent Froese, Sepp Hartung, André Nichterlein, Rolf Niedermeier, Nimrod Talmon
The Complexity of Degree Anonymization by Vertex Addition. AAIM (2014)
Vincent Froese, André Nichterlein, Rolf Niedermeier
Win-Win Kernelization for Degree Sequence Completion Problems. SWAT (2014)
René van Bevern, Robert Bredereck, Jiehua Chen, Vincent Froese, Rolf Niedermeier, Gerhard J. Woeginger
Network-Based Dissolution. CoRR (2014)
René van Bevern, Robert Bredereck, Laurent Bulteau, Jiehua Chen, Vincent Froese, Rolf Niedermeier, Gerhard J. Woeginger
Star Partitions of Perfect Graphs. ICALP (1) (2014)
Laurent Bulteau, Stefan Fafianie, Vincent Froese, Rolf Niedermeier, Nimrod Talmon
The Complexity of Finding Effectors. CoRR (2014)
René van Bevern, Robert Bredereck, Laurent Bulteau, Jiehua Chen, Vincent Froese, Rolf Niedermeier, Gerhard J. Woeginger
Star Partitions of Perfect Graphs. CoRR (2014)
Vincent Froese, René van Bevern, Rolf Niedermeier, Manuel Sorge
A Parameterized Complexity Analysis of Combinatorial Feature Selection Problems. MFCS (2013)

Vincent Froese.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Vincent Froese