56 citations · 118 across the 19 of their papers we have counts for
Showing 2010Show all
2 papers · 1 filter
cs.DS2010
Narrow sieves for parameterized paths and packings
Andreas Björklund, Thore Husfeldt, Petteri Kaski +1
We present randomized algorithms for some well-studied, hard combinatorial problems: the k-path problem, the p-packing of q-sets problem, and the q-dimensional p-matching problem.…
cs.CG2010★ 2 cited
Geodesic diameter of a polygonal domain in O(n^4 log n) time
Mikko Koivisto, Valentin Polishchuk
We show that the geodesic diameter of a polygonal domain with n vertices can be computed in O(n^4 log n) time by considering O(n^3) candidate diameter endpoints; the endpoints are…