Sébastien Collette

John Iacono

Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

2015

Cannibal Animal Games: a new variant of Tic-Tac-Toe.

[BibT_eX]

[DOI]

J. Inf. Process., 2015

2014

Draining a polygon - or - rolling a ball out of a polygon.

[BibT_eX]

[DOI]

Comput. Geom., 2014

2013

Coloring and Guarding Arrangements.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2013

Editorial.

[BibT_eX]

[DOI]

Lilach Chaitman-Yerushalmi

Comput. Geom., 2013

Some properties of k-Delaunay and k-Gabriel graphs.

[BibT_eX]

[DOI]

Comput. Geom., 2013

Stable Roommates Spanner.

[BibT_eX]

[DOI]

Prosenjit Bose

Paz Carmi

Matthew J. Katz

Comput. Geom., 2013

Non-crossing matchings of points with geometric objects.

[BibT_eX]

[DOI]

Comput. Geom., 2013

Coloring Hypergraphs Induced by Dynamic Point Sets and Bottomless Rectangles.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures - 13th International Symposium, 2013

2012

Entropy, triangulation, and point location in planar subdivisions.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2012

Confluent persistence revisited.

[BibT_eX]

[DOI]

John Iacono

Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012

De-amortizing Binary Search Trees.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages, and Programming - 39th International Colloquium, 2012

2011

Efficient constant-velocity reconfiguration of crystalline robots.

[BibT_eX]

[DOI]

Robotica, 2011

Colorful Strips.

[BibT_eX]

[DOI]

Graphs Comb., 2011

Every Large Point Set contains Many Collinear Points or an Empty Pentagon.

[BibT_eX]

[DOI]

Graphs Comb., 2011

2010

On the Stretch Factor of Convex Delaunay Graphs.

[BibT_eX]

[DOI]

J. Comput. Geom., 2010

Sigma-local graphs.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2010

Decomposition of Multiple Coverings into More Parts.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2010

Highway hull revisited.

[BibT_eX]

[DOI]

Comput. Geom., 2010

Matching Points with Things.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2010: Theoretical Informatics, 2010

Common Unfoldings of Polyominoes and Polycubes.

[BibT_eX]

[DOI]

Proceedings of the Computational Geometry, Graphs and Applications, 2010

Some properties of higher order delaunay and gabriel graphs.

[BibT_eX]

[DOI]

Proceedings of the 22nd Annual Canadian Conference on Computational Geometry, 2010

2009

Coloring Geometric Range Spaces.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2009

Detecting all regular polygons in a point set

[BibT_eX]

[DOI]

CoRR, 2009

Reconfiguration of 3D Crystalline Robots Using O(log n) Parallel Moves

[BibT_eX]

[DOI]

CoRR, 2009

Empty region graphs.

[BibT_eX]

[DOI]

Comput. Geom., 2009

Linear reconfiguration of cube-style modular robots.

[BibT_eX]

[DOI]

Vera Sacristán Adinolfi

Stefanie Wuhrer

Comput. Geom., 2009

Relaxed Gabriel Graphs.

[BibT_eX]

[DOI]

Proceedings of the 21st Annual Canadian Conference on Computational Geometry, 2009

2008

Integrating job parallelism in real-time scheduling theory.

[BibT_eX]

[DOI]

Liliana Cucu

Joël Goossens

Inf. Process. Lett., 2008

Cauchy's Arm Lemma on a Growing Sphere

[BibT_eX]

[DOI]

Godfried T. Toussaint

CoRR, 2008

Local properties of geometric graphs.

[BibT_eX]

[DOI]

Comput. Geom., 2008

Optimal location of transportation devices.

[BibT_eX]

[DOI]

Comput. Geom., 2008

Realistic Reconfiguration of Crystalline (and Telecube) Robots.

[BibT_eX]

[DOI]

Vera Sacristán Adinolfi

Stefanie Wuhrer

Proceedings of the Algorithmic Foundation of Robotics VIII, 2008

Distribution-sensitive point location in convex subdivisions.

[BibT_eX]

[DOI]

Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008

Reconfiguration of Cube-Style Modular Robots Using O(logn) Parallel Moves.

[BibT_eX]

[DOI]

Vera Sacristán Adinolfi

Stefanie Wuhrer

Proceedings of the Algorithms and Computation, 19th International Symposium, 2008

2007

Moving Walkways, Escalators, and Elevators

[BibT_eX]

[DOI]

CoRR, 2007

2006

On the Symbolic Computation of the Hardest Configurations of the RUSH HOUR Game.

[BibT_eX]

[DOI]

Jean-François Raskin

Frédéric Servais

Proceedings of the Computers and Games, 5th International Conference, 2006

LUMINESStrategies.

[BibT_eX]

[DOI]

Proceedings of the Computers and Games, 5th International Conference, 2006

2005

Region counting graphs.

[BibT_eX]

[DOI]

Proceedings of the (Informal) Proceedings of the 21st European Workshop on Computational Geometry, 2005

Region Counting Distances and Region Counting Circles.

[BibT_eX]

[DOI]