4 citations · 9 across the 11 of their papers we have counts for
3 papers · 1 filter
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…
The Complexity of Binary Matrix Completion Under Diameter Constraints
Tomohiro Koana, Vincent Froese, Rolf Niedermeier
We thoroughly study a novel but basic combinatorial matrix completion problem: Given a binary incomplete matrix, fill in the missing entries so that every pair of rows in the resul…