Vincent Froese

According to our database, Vincent Froese authored at least 47 papers between 2013 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Modification-fair cluster editing.

Vincent Froese, Leon Kellerhals, Rolf Niedermeier

Soc. Netw. Anal. Min., December, 2024

Equilibria in schelling games: computational hardness and robustness.

Luca Kreisel, Niclas Boehmer, Vincent Froese, Rolf Niedermeier

Auton. Agents Multi Agent Syst., June, 2024

Disentangling the Computational Complexity of Network Untangling.

Vincent Froese, Pascal Kunz, Philipp Zschoche

Theory Comput. Syst., February, 2024

Terrain-like graphs and the median Genocchi numbers.

Vincent Froese, Malte Renken

Eur. J. Comb., January, 2024

Nash Equilibria in Reverse Temporal Voronoi Games.

Simeon Pawlowski, Vincent Froese

J. Graph Algorithms Appl., 2024

Complexity of Deciding Injectivity and Surjectivity of ReLU Neural Networks.

Vincent Froese, Moritz Grillo, Martin Skutella

CoRR, 2024

2023

An average-compress algorithm for the sample mean problem under dynamic time warping.

Brijnesh J. Jain, Vincent Froese, David Schultz

J. Glob. Optim., August, 2023

Fast Exact Dynamic Time Warping on Run-Length Encoded Time Series.

Vincent Froese, Brijnesh J. Jain, Maciej Rymar, Mathias Weller

Algorithmica, February, 2023

The complexity of binary matrix completion under diameter constraints.

Tomohiro Koana, Vincent Froese, Rolf Niedermeier

J. Comput. Syst. Sci., 2023

Training Neural Networks is NP-Hard in Fixed Dimension.

Vincent Froese, Christoph Hertrich

Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

2022

The Computational Complexity of ReLU Network Training Parameterized by Data Dimensionality.

Vincent Froese, Christoph Hertrich, Rolf Niedermeier

J. Artif. Intell. Res., 2022

There and Back Again: On Applying Data Reduction Rules by Undoing Others.

Aleksander Figiel, Vincent Froese, André Nichterlein, Rolf Niedermeier

Proceedings of the 30th Annual European Symposium on Algorithms, 2022

2021

A Fast Shortest Path Algorithm on Terrain-like Graphs.

Vincent Froese, Malte Renken

Discret. Comput. Geom., 2021

Equilibria in Schelling Games: Computational Complexity and Robustness.

Luca Kreisel, Niclas Boehmer, Vincent Froese, Rolf Niedermeier

CoRR, 2021

Persistent Graphs and Cyclic Polytope Triangulations.

Vincent Froese, Malte Renken

Comb., 2021

Binary Matrix Completion Under Diameter Constraints.

Tomohiro Koana, Vincent Froese, Rolf Niedermeier

Proceedings of the 38th International Symposium on Theoretical Aspects of Computer Science, 2021

Two Influence Maximization Games on Graphs Made Temporal.

Niclas Boehmer, Vincent Froese, Julia Henkel, Yvonne Lasars, Rolf Niedermeier, Malte Renken

Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, 2021

2020

Comparing temporal graphs using dynamic time warping.

Vincent Froese, Brijnesh J. Jain, Rolf Niedermeier, Malte Renken

Soc. Netw. Anal. Min., 2020

Tight Hardness Results for Consensus Problems on Circular Strings and Time Series.

Laurent Bulteau, Vincent Froese, Rolf Niedermeier

SIAM J. Discret. Math., 2020

Complexity of Combinatorial Matrix Completion With Diameter Constraints.

Tomohiro Koana, Vincent Froese, Rolf Niedermeier

CoRR, 2020

Faster Binary Mean Computation Under Dynamic Time Warping.

Nathan Schaar, Vincent Froese, Rolf Niedermeier

Proceedings of the 31st Annual Symposium on Combinatorial Pattern Matching, 2020

Parameterized Algorithms for Matrix Completion with Radius Constraints.

Tomohiro Koana, Vincent Froese, Rolf Niedermeier

Proceedings of the 31st Annual Symposium on Combinatorial Pattern Matching, 2020

2019

Exact mean computation in dynamic time warping spaces.

Markus Brill, Till Fluschnik, Vincent Froese, Brijnesh J. Jain, Rolf Niedermeier, David Schultz

Data Min. Knowl. Discov., 2019

Computational complexity aspects of point visibility graphs.

Anne-Sophie Himmel, Clemens Hoffmann, Pascal Kunz, Vincent Froese, Manuel Sorge

Discret. Appl. Math., 2019

Mathematical Programming Models for Mean Computation in Dynamic Time Warping Spaces.

Vincent Froese, Christoph Hansknecht

CoRR, 2019

Terrain Visibility Graphs and Cyclic Polytope Triangulations.

Vincent Froese, Malte Renken

CoRR, 2019

Good Things Come to Those Who Swap Objects on Paths.

Matthias Bentert, Jiehua Chen, Vincent Froese, Gerhard J. Woeginger

CoRR, 2019

Advancing Through Terrains.

Vincent Froese, Malte Renken

CoRR, 2019

A Parameterized Algorithmics Framework for Degree Sequence Completion Problems in Directed Graphs.

Robert Bredereck, Vincent Froese, Marcel Koseler, Marcelo Garlet Millani, André Nichterlein, Rolf Niedermeier

Algorithmica, 2019

2018

Fine-grained complexity analysis of some combinatorial data science problems.

Vincent Froese

PhD thesis, 2018

Parameterizing Edge Modification Problems Above Lower Bounds.

René van Bevern, Vincent Froese, Christian Komusiewicz

Theory Comput. Syst., 2018

Hardness of Consensus Problems for Circular Strings and Time Series Averaging.

Laurent Bulteau, Vincent Froese, Rolf Niedermeier

CoRR, 2018

2017

The Complexity of Finding Effectors.

Laurent Bulteau, Stefan Fafianie, Vincent Froese, Rolf Niedermeier, Nimrod Talmon

Theory Comput. Syst., 2017

Partitioning Perfect Graphs into Stars.

René van Bevern, Robert Bredereck, Laurent Bulteau, Jiehua Chen, Vincent Froese, Rolf Niedermeier, Gerhard J. Woeginger

J. Graph Theory, 2017

Finding Points in General Position.

Vincent Froese, Iyad A. Kanj, André Nichterlein, Rolf Niedermeier

Int. J. Comput. Geom. Appl., 2017

Algorithmic Aspects of Point Visibility Graphs.

Anne-Sophie Himmel, Clemens Hoffmann, Pascal Kunz, Vincent Froese, Manuel Sorge

CoRR, 2017

2016

Win-win kernelization for degree sequence completion problems.

Vincent Froese, André Nichterlein, Rolf Niedermeier

J. Comput. Syst. Sci., 2016

Exploiting hidden structure in selecting dimensions that distinguish vectors.

Vincent Froese, René van Bevern, Rolf Niedermeier, Manuel Sorge

J. Comput. Syst. Sci., 2016

Multi-Player Diffusion Games on Graph Classes.

Laurent Bulteau, Vincent Froese, Nimrod Talmon

Internet Math., 2016

A Parameterized Algorithmics Framework for Digraph Degree Sequence Completion Problems.

Robert Bredereck, Vincent Froese, Marcel Koseler, Marcelo Garlet Millani, André Nichterlein, Rolf Niedermeier

CoRR, 2016

Co-Clustering under the Maximum Norm.

Laurent Bulteau, Vincent Froese, Sepp Hartung, Rolf Niedermeier

Algorithms, 2016

Triangle Counting in Dynamic Graph Streams.

Laurent Bulteau, Vincent Froese, Konstantin Kutzkov, Rasmus Pagh

Algorithmica, 2016

2015

The complexity of degree anonymization by vertex addition.

Robert Bredereck, Vincent Froese, Sepp Hartung, André Nichterlein, Rolf Niedermeier, Nimrod Talmon

Theor. Comput. Sci., 2015

Network-Based Vertex Dissolution.

René van Bevern, Robert Bredereck, Jiehua Chen, Vincent Froese, Rolf Niedermeier, Gerhard J. Woeginger

SIAM J. Discret. Math., 2015

2014

Network-Based Dissolution.

René van Bevern, Robert Bredereck, Jiehua Chen, Vincent Froese, Rolf Niedermeier, Gerhard J. Woeginger

Proceedings of the Mathematical Foundations of Computer Science 2014, 2014

Star Partitions of Perfect Graphs.

René van Bevern, Robert Bredereck, Laurent Bulteau, Jiehua Chen, Vincent Froese, Rolf Niedermeier, Gerhard J. Woeginger

Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014

2013

A Parameterized Complexity Analysis of Combinatorial Feature Selection Problems.

Vincent Froese, René van Bevern, Rolf Niedermeier, Manuel Sorge

Proceedings of the Mathematical Foundations of Computer Science 2013, 2013