10 citations · 23 across the 7 of their papers we have counts for
7 papers
Separating Bounded and Unbounded Asynchrony for Autonomous Robots: Point Convergence with Limited Visibility
David Kirkpatrick, Irina Kostitsyna, Alfredo Navarra +2
Among fundamental problems in the context of distributed computing by autonomous mobile entities, one of the most representative and well studied is {\sc Point Convergence}: given…
Optimal Collusion-Free Teaching
David Kirkpatrick, Hans U. Simon, Sandra Zilles
Formal models of learning from teachers need to respect certain criteria to avoid collusion. The most commonly accepted notion of collusion-freeness was proposed by Goldman and Mat…
Absolute and arbitrary orientation of single molecule shapes
Ashwin Gopinath, Chris Thachuk, Anya Mitskovets +3
DNA origami is a modular platform for the combination of molecular and colloidal components to create optical, electronic, and biological devices. Integration of such nanoscale dev…
Swapping Colored Tokens on Graphs
Katsuhisa Yamanaka, Takashi Horiyama, J. Mark Keil +5
We investigate the computational complexity of the following problem. We are given a graph in which each vertex has an initial and a target color. Each pair of adjacent vertices ca…
Characterizing minimum-length coordinated motions for two discs
David Kirkpatrick, Paul Liu
We study the problem of determining optimal coordinated motions for two disc robots in an otherwise obstacle-free plane. Using the total path length traced by the two disc centres…
Discrete Dubins Paths
Sylvester Eriksson-Bique, David Kirkpatrick, Valentin Polishchuk
A Dubins path is a shortest path with bounded curvature. The seminal result in non-holonomic motion planning is that (in the absence of obstacles) a Dubins path consists either fro…