4 citations · 6 across the 3 of their papers we have counts for
3 papers
An Optimal Algorithm for Minimum-Link Rectilinear Paths in Triangulated Rectilinear Domains
Joseph S. B. Mitchell, Valentin Polishchuk, Mikko Sysikaski +1
We consider the problem of finding minimum-link rectilinear paths in rectilinear polygonal domains in the plane. A path or a polygon is rectilinear if all its edges are axis-parall…
Minimum-Link Paths Revisited
Joseph S. B. Mitchell, Valentin Polishchuk, Mikko Sysikaski
A path or a polygonal domain is C-oriented if the orientations of its edges belong to a set of C given orientations; this is a generalization of the notable rectilinear case (C = 2…
Improved approximations for robust mincut and shortest path
Valentin Polishchuk, Mikko Sysikaski
In two-stage robust optimization the solution to a problem is built in two stages: In the first stage a partial, not necessarily feasible, solution is exhibited. Then the adversary…