J.P. Locquet, J. Perret, et al.
SPIE Optical Science, Engineering, and Instrumentation 1998
Let n vertices be distributed on the circumference of a circle in the plane. We find, for every n, the minimum number of cycles with no crossing edges such that every pair of vertices is adjacent on at least one cycle. The problem arises from the design of a train shuttle service between n cities with continuous guaranteed service at all times, and minimum number of rail lanes. © 1993.
J.P. Locquet, J. Perret, et al.
SPIE Optical Science, Engineering, and Instrumentation 1998
Imran Nasim, Michael E. Henderson
Mathematics
Juliann Opitz, Robert D. Allen, et al.
Microlithography 1998
Jianke Yang, Robin Walters, et al.
ICML 2023