3 citations · 4 across the 4 of their papers we have counts for
12 papers
Terrain-like Graphs and the Median Genocchi Numbers
Vincent Froese, Malte Renken
A graph with vertex set is terrain-like if, for any edge pair with , the edge also exists. Terrain-like graphs frequently appe…
Disentangling the Computational Complexity of Network Untangling
Vincent Froese, Pascal Kunz, Philipp Zschoche
We study the network untangling problem introduced by Rozenshtein, Tatti, and Gionis [DMKD 2021], which is a variant of Vertex Cover on temporal graphs -- graphs whose edge set cha…
Parameterized Algorithms for Matrix Completion With Radius Constraints
Tomohiro Koana, Vincent Froese, Rolf Niedermeier
Considering matrices with missing entries, we study NP-hard matrix completion problems where the resulting completed matrix shall have limited (local) radius. In the pure radius ve…
Faster Binary Mean Computation Under Dynamic Time Warping
Nathan Schaar, Vincent Froese, Rolf Niedermeier
Many consensus string problems are based on Hamming distance. We replace Hamming distance by the more flexible (e.g., easily coping with different input string lengths) dynamic tim…
Mathematical Programming Models for Mean Computation in Dynamic Time Warping Spaces
Vincent Froese, Christoph Hansknecht
The dynamic time warping (dtw) distance is an established tool for mining time series data. The DTW-Mean problem consists of computing a series which minimizes the so-called Fréche…
Persistent Graphs and Cyclic Polytope Triangulations
Vincent Froese, Malte Renken
We prove a bijection between the triangulations of the 3-dimensional cyclic polytope C(n+2, 3) and persistent graphs with n vertices. We show that under this bijection the Stasheff…