9 citations · 9 across the 2 of their papers we have counts for
3 papers
cs.DM2014
The Maximum k-Differential Coloring Problem
Michael Bekos, Stephen Kobourov, Michael Kaufmann +1
Given an -vertex graph and two positive integers , the ()-differential coloring problem asks for a coloring of the vertices of (if one exists)…
cs.CG2012
Computing Consensus Curves
Livio De La Cruz, Stephen Kobourov, Sergey Pupyrev +2
We consider the problem of extracting accurate average ant trajectories from many (possibly inaccurate) input trajectories contributed by citizen scientists. Although there are man…
cs.CG2012★ 9 cited
Polylogarithmic Approximation for Generalized Minimum Manhattan Networks
Aparna Das, Krzysztof Fleszar, Stephen Kobourov +3
Given a set of terminals, which are points in -dimensional Euclidean space, the minimum Manhattan network problem (MMN) asks for a minimum-length rectilinear network that co…