1

Competitive Online Routing on Delaunay Triangulations
Let $G$ be a graph, $s ın G$ be a source node and $t ın G$ be a target node. The sequence of adjacent nodes (graph walk) visited by a …
Prosenjit Bose, Jean-Lou De Carufel, Stephane Durocher, Perouz Taslakian
Cite URL
Sum of Squared Edges for MST of a Point Set in a Unit Square
Oswin Aichholzer, Sarah R. Allen, Greg Aloupis, Luis Barba, Prosenjit Bose, Jean-Lou De Carufel, John Iacona an Stefan Langerman, Diane Souvaine, Perouz Taslakian, Mark Yagnatinsky
Cite
Fitting voronoi diagrams to planar tesselations
Given a tesselation of the plane, defined by a planar straight-line graph $G$, we want to find a minimal set $S$ of points in the …
Greg Aloupis, Hebert Pérez-Rosés, Guillermo Pineda-Villavicencio, Perouz Taslakian, Dannier Trinchet-Almaguer
Cite URL
Cannibal Animal Games: a new variant of Tic-Tac-Toe
Jean Cardinal, Sébastien Collette, Hiro Ito, Matias Korman, Stefan Langerman, Hikaru Sakaidani, Perouz Taslakian
Cite
Deflating Polygons to the Limit
In this paper we study polygonal transformations through an operation called deflation. It is known that some families of polygons …
Isabel Hubard, Perouz Taslakian
PDF Cite
Matching Points with Things
Greg Aloupis, Jean Cardinal, Sébastien Collette, Erik D. Demaine, Martin L. Demaine, Muriel Dulieu, Ruy Fabila-Monroy, Vi Hart, Ferran Hurtado, Stefan Langerman, Maria Saumell, Carlos Seara, Perouz Taslakian
Cite
Relaxed Gabriel Graphs
Prosenjit Bose, Jean Cardinal, Sébastien Collette, Erik D. Demaine, Belen Palop, Perouz Taslakian, Norbert Zeh
Cite
Reconstructing Points on a Circle from Labeled Distances
David Bremner, Erik D. Demaine, Perouz Taslakian, Godfried T. Toussaint
Cite
Convergence of the shadow sequence of inscribed polygons
Francisco Gomez-Martin, Perouz Taslakian, Godfried T. Toussaint
Cite
A Pumping Lemma for Homometric Rhythms
Joseph O'Rourke, Perouz Taslakian, Godfried T. Toussaint
Cite