112 citations · 298 across the 40 of their papers we have counts for
5 papers · 1 filter
Colored Non-Crossing Euclidean Steiner Forest
Sergey Bereg, Krzysztof Fleszar, Philipp Kindermann +3
Given a set of -colored points in the plane, we consider the problem of finding trees such that each tree connects all points of one color class, no two trees cross, and the…
On Embeddability of Buses in Point Sets
Till Bruckdorfer, Michael Kaufmann, Stephen Kobourov +1
Set membership of points in the plane can be visualized by connecting corresponding points via graphical features, like paths, trees, polygons, ellipses. In this paper we study the…
Representing Permutations with Few Moves
Sergey Bereg, Alexander E. Holroyd, Lev Nachmanson +1
Consider a finite sequence of permutations of the elements 1,...,n, with the property that each element changes its position by at most 1 from any permutation to the next. We call…
Phase locking a clock oscillator to a coherent atomic ensemble
R. Kohlhaas, A. Bertoldi, E. Cantin +3
The sensitivity of an atomic interferometer increases when the phase evolution of its quantum superposition state is measured over a longer interrogation interval. In practice, a l…
Contact Representations of Sparse Planar Graphs
Md. Jawaherul Alam, David Eppstein, Michael Kaufmann +4
We study representations of graphs by contacts of circular arcs, CCA-representations for short, where the vertices are interior-disjoint circular arcs in the plane and each edge is…