On flat-state connectivity of chains with fixed acute angles. - Greg Aloupis; Erik D. Demaine; Henk Meijer; Joseph O'Rourke; Ileana Streinu; Godfried T. Toussaint (CCCG, 2002)

Flat-State Connectivity of Linkages under Dihedral Motions. - Greg Aloupis; Erik D. Demaine; Vida Dujmovic; Jeff Erickson 001; Stefan Langerman; Henk Meijer; Joseph O'Rourke; Mark H. Overmars; Michael A. Soss; Ileana Streinu; Godfried T. Toussaint (ISAAC, 2002)

Computing the Similarity of two Melodies. - Greg Aloupis; Thomas Fevens; Stefan Langerman; Tomomi Matsui; Antonio Mesa; Yurai Núñez Rodríguez; David Rappaport; Godfried T. Toussaint (CCCG, 2003)

Geometric measures of data depth. - Greg Aloupis (Data Depth: Robust Multivariate Analysis, Computational Geometry and Applications, 2003)

Algorithms for bivariate medians and a Fermat-Torricelli problem for lines. - Greg Aloupis; Stefan Langerman; Michael A. Soss; Godfried T. Toussaint (Comput. Geom., 2003)

Unfolding polyhedral bands. - Greg Aloupis; Erik D. Demaine; Stefan Langerman; Pat Morin; Joseph O'Rourke; Ileana Streinu; Godfried T. Toussaint (CCCG, 2004)

A lower bound for computing Oja depth. - Greg Aloupis; Erin McLeish (Inf. Process. Lett., 2005)

LUMINESStrategies. - Greg Aloupis; Jean Cardinal; Sébastien Collette; Stefan Langerman (Computers and Games, 2006)

Algorithms for Computing Geometric Measures of Melodic Similarity. - Greg Aloupis; Thomas Fevens; Stefan Langerman; Tomomi Matsui; Antonio Mesa; Yurai Núñez Rodríguez; David Rappaport; Godfried T. Toussaint (Comput. Music. J., 2006)

Vertex Pops and Popturns. - Greg Aloupis; Brad Ballinger; Prosenjit Bose; Mirela Damian; Erik D. Demaine; Martin L. Demaine; Robin Y. Flatland; Ferran Hurtado; Stefan Langerman; Joseph O'Rourke; Perouz Taslakian; Godfried T. Toussaint (CCCG, 2007)

Reconfiguring Triangulations with Edge Flips and Point Moves. - Greg Aloupis; Prosenjit Bose; Pat Morin (Algorithmica, 2007)

Reconfiguration of Cube-Style Modular Robots Using O(logn) Parallel Moves. - Greg Aloupis; Sébastien Collette; Erik D. Demaine; Stefan Langerman; Vera Sacristán Adinolfi; Stefanie Wuhrer (ISAAC, 2008)

Realistic Reconfiguration of Crystalline (and Telecube) Robots. - Greg Aloupis; Sébastien Collette; Mirela Damian; Erik D. Demaine; Dania El-Khechen; Robin Y. Flatland; Stefan Langerman; Joseph O'Rourke; Val Pinciu; Suneeta Ramaswami; Vera Sacristán Adinolfi; Stefanie Wuhrer (WAFR, 2008)

Edge-unfolding nested polyhedral bands. - Greg Aloupis; Erik D. Demaine; Stefan Langerman; Pat Morin; Joseph O'Rourke; Ileana Streinu; Godfried T. Toussaint (Comput. Geom., 2008)

Linear reconfiguration of cube-style modular robots. - Greg Aloupis; Sébastien Collette; Mirela Damian; Erik D. Demaine; Robin Y. Flatland; Stefan Langerman; Joseph O'Rourke; Suneeta Ramaswami; Vera Sacristán Adinolfi; Stefanie Wuhrer (Comput. Geom., 2009)

Reconfiguration of 3D Crystalline Robots Using O(log n) Parallel Moves - Greg Aloupis; Sébastien Collette; Erik D. Demaine; Stefan Langerman; Vera Sacristán; Stefanie Wuhrer (CoRR, 2009)

Detecting all regular polygons in a point set - Greg Aloupis; Jean Cardinal; Sébastien Collette; John Iacono; Stefan Langerman (CoRR, 2009)

Minimum feature size preserving decompositions - Greg Aloupis; Erik D. Demaine; Martin L. Demaine; Vida Dujmovic; John Iacono (CoRR, 2009)

Coloring Geometric Range Spaces. - Greg Aloupis; Jean Cardinal; Sébastien Collette; Stefan Langerman; Shakhar Smorodinsky (Discret. Comput. Geom., 2009)

Common Unfoldings of Polyominoes and Polycubes. - Greg Aloupis; Prosenjit Bose; Sébastien Collette; Erik D. Demaine; Martin L. Demaine; Karim Douïeb; Vida Dujmovic; John Iacono; Stefan Langerman; Pat Morin (CGGA, 2010)

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; et al. (LATIN, 2010)

Highway hull revisited. - Greg Aloupis; Jean Cardinal; Sébastien Collette; Ferran Hurtado; Stefan Langerman; Joseph O'Rourke; Belén Palop (Comput. Geom., 2010)

Decomposition of Multiple Coverings into More Parts. - Greg Aloupis; Jean Cardinal; Sébastien Collette; Stefan Langerman; David Orden; Pedro Ramos 001 (Discret. Comput. Geom., 2010)

Convexifying Polygons Without Losing Visibilities. - Oswin Aichholzer; Greg Aloupis; Erik D. Demaine; Martin L. Demaine; Vida Dujmovic; Ferran Hurtado; Anna Lubiw; Günter Rote; André Schulz 001; Diane L. Souvaine; Andrew Winslow (CCCG, 2011)

Meshes Preserving Minimum Feature Size. - Greg Aloupis; Erik D. Demaine; Martin L. Demaine; Vida Dujmovic; John Iacono (EGC, 2011)

Colorful Strips. - Greg Aloupis; Jean Cardinal; Sébastien Collette; Shinji Imahori; Matias Korman; Stefan Langerman; Oded Schwartz; Shakhar Smorodinsky; Perouz Taslakian (Graphs Comb., 2011)

Computing Signed Permutations of Polygons. - Greg Aloupis; Prosenjit Bose; Erik D. Demaine; Stefan Langerman; Henk Meijer; Mark H. Overmars; Godfried T. Toussaint (Int. J. Comput. Geom. Appl., 2011)

Efficient constant-velocity reconfiguration of crystalline robots. - Greg Aloupis; Sébastien Collette; Mirela Damian; Erik D. Demaine; Robin Y. Flatland; Stefan Langerman; Joseph O'Rourke; Val Pinciu; Suneeta Ramaswami; Vera Sacristán; Stefanie Wuhrer (Robotica, 2011)

Covering Points with Disjoint Unit Disks. - Greg Aloupis; Robert A. Hearn; Hirokazu Iwasawa; Ryuhei Uehara (CCCG, 2012)

Circle Separability Queries in Logarithmic Time. - Luis Felipe Barba Flores; Stefan Langerman; Greg Aloupis (CCCG, 2012)

Classic Nintendo Games are (NP-)Hard - Greg Aloupis; Erik D. Demaine; Alan Guo (CoRR, 2012)

Fitting Voronoi Diagrams to Planar Tesselations. - Greg Aloupis; Hebert Pérez-Rosés; Guillermo Pineda-Villavicencio; Perouz Taslakian; Dannier Trinchet-Almaguer (IWOCA, 2013)

Efficient reconfiguration of lattice-based modular robots. - Greg Aloupis; Nadia M. Benbernou; Mirela Damian; Erik D. Demaine; Robin Y. Flatland; John Iacono; Stefanie Wuhrer (Comput. Geom., 2013)

Non-crossing matchings of points with geometric objects. - 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; et al. (Comput. Geom., 2013)

Establishing strong connectivity using optimal radius half-disk antennas. - Greg Aloupis; Mirela Damian; Robin Y. Flatland; Matias Korman; Özgür Özkan; David Rappaport; Stefanie Wuhrer (Comput. Geom., 2013)

The Complexity of Order Type Isomorphism. - Greg Aloupis; John Iacono; Stefan Langerman; Özgür Özkan (CoRR, 2013)

Editorial. - Greg Aloupis; David Bremner (Comput. Geom., 2014)

Triangulating and guarding realistic polygons. - Greg Aloupis; Prosenjit Bose; Vida Dujmovic; Chris Gray; Stefan Langerman; Bettina Speckmann (Comput. Geom., 2014)

Draining a polygon - or - rolling a ball out of a polygon. - Greg Aloupis; Jean Cardinal; Sébastien Collette; Ferran Hurtado; Stefan Langerman; Joseph O'Rourke (Comput. Geom., 2014)

Covering Folded Shapes. - Oswin Aichholzer; Greg Aloupis; Erik D. Demaine; Martin L. Demaine; Sándor P. Fekete; Michael Hoffmann 001; Anna Lubiw; Jack Snoeyink; Andrew Winslow (J. Comput. Geom., 2014)

Bichromatic compatible matchings. - Greg Aloupis; Luis Barba; Stefan Langerman; Diane L. Souvaine (Comput. Geom., 2015)

Compatible Connectivity Augmentation of Planar Disconnected Graphs. - Greg Aloupis; Luis Barba; Paz Carmi; Vida Dujmovic; Fabrizio Frati; Pat Morin (Discret. Comput. Geom., 2015)

Isoperimetric Enclosures. - Greg Aloupis; Luis Barba; Jean-Lou De Carufel; Stefan Langerman; Diane L. Souvaine (Graphs Comb., 2015)

Classic Nintendo games are (computationally) hard. - Greg Aloupis; Erik D. Demaine; Alan Guo; Giovanni Viglietta (Theor. Comput. Sci., 2015)

Recognizing Weakly Simple Polygons. - Hugo A. Akitaya; Greg Aloupis; Jeff Erickson 001; Csaba D. Tóth (Discret. Comput. Geom., 2017)

Bottleneck detour tree of points on a path. - Greg Aloupis; Paz Carmi; Lilach Chaitman-Yerushalmi; Matthew J. Katz; Stefan Langerman (Comput. Geom., 2019)

Computing Colourful Simplicial Depth and Median in ℝ2. - Greg Aloupis; Tamon Stephen; Olga Zasenko (Theory Comput. Syst., 2022)

Noncrossing Longest Paths and Cycles. - Greg Aloupis; Ahmad Biniaz; Prosenjit Bose; Jean-Lou De Carufel; David Eppstein; Anil Maheshwari; Saeed Odak; Michiel Smid; Csaba D. Tóth; Pavel Valtr 001 (GD, 2024)

The Complexity of Order Type Isomorphism. - Greg Aloupis; John Iacono; Stefan Langerman; Özgür Özkan; Stefanie Wuhrer (Discret. Comput. Geom., 2024)

An Improved Bound for Plane Covering Paths. - Hugo A. Akitaya; Greg Aloupis; Ahmad Biniaz; Prosenjit Bose; Jean-Lou De Carufel; Cyril Gavoille; John Iacono; Linda Kleist; Michiel Smid; Diane L. Souvaine; Leonidas Theocharous (CoRR, 2025)