default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGreg Aloupis
Person information
SPARQL queries 
🛈 Please note that only 63% of the records listed on this page have a DOI. Therefore, DOI-based queries can only provide partial results.
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j27]Greg Aloupis, John Iacono
, Stefan Langerman, Özgür Özkan, Stefanie Wuhrer:
The Complexity of Order Type Isomorphism. Discret. Comput. Geom. 72(2): 483-502 (2024)- [c34]Greg Aloupis, Ahmad Biniaz, Prosenjit Bose, Jean-Lou De Carufel, David Eppstein, Anil Maheshwari, Saeed Odak, Michiel Smid, Csaba D. Tóth, Pavel Valtr:
Noncrossing Longest Paths and Cycles. GD 2024: 36:1-36:17 - [i15]Greg Aloupis, Ahmad Biniaz, Prosenjit Bose, Jean-Lou De Carufel, David Eppstein, Anil Maheshwari, Saeed Odak, Michiel Smid, Csaba D. Tóth, Pavel Valtr:
Noncrossing Longest Paths and Cycles. CoRR abs/2410.05580 (2024) - 2022
- [j26]Greg Aloupis, Tamon Stephen, Olga Zasenko:
Computing Colourful Simplicial Depth and Median in ℝ2. Theory Comput. Syst. 66(2): 417-431 (2022)
2010 – 2019
- 2019
- [j25]Greg Aloupis, Paz Carmi, Lilach Chaitman-Yerushalmi, Matthew J. Katz, Stefan Langerman:
Bottleneck detour tree of points on a path. Comput. Geom. 79: 30-36 (2019) - 2017
- [j24]Hugo A. Akitaya, Greg Aloupis, Jeff Erickson, Csaba D. Tóth:
Recognizing Weakly Simple Polygons. Discret. Comput. Geom. 58(4): 785-821 (2017) - 2016
- [c33]Hugo A. Akitaya, Greg Aloupis, Jeff Erickson, Csaba D. Tóth:
Recognizing Weakly Simple Polygons. SoCG 2016: 8:1-8:16 - [i14]Hugo A. Akitaya, Greg Aloupis, Jeff Erickson, Csaba D. Tóth:
Recognizing Weakly Simple Polygons. CoRR abs/1603.07401 (2016) - 2015
- [j23]Greg Aloupis, Luis Barba, Stefan Langerman, Diane L. Souvaine:
Bichromatic compatible matchings. Comput. Geom. 48(8): 622-633 (2015) - [j22]Greg Aloupis, Luis Barba, Paz Carmi, Vida Dujmovic, Fabrizio Frati, Pat Morin:
Compatible Connectivity Augmentation of Planar Disconnected Graphs. Discret. Comput. Geom. 54(2): 459-480 (2015) - [j21]Greg Aloupis, Luis Barba, Jean-Lou De Carufel, Stefan Langerman, Diane L. Souvaine:
Isoperimetric Enclosures. Graphs Comb. 31(2): 361-392 (2015) - [j20]Greg Aloupis, Erik D. Demaine, Alan Guo, Giovanni Viglietta:
Classic Nintendo games are (computationally) hard. Theor. Comput. Sci. 586: 135-160 (2015) - [c32]Greg Aloupis, Luis Barba, Paz Carmi, Vida Dujmovic, Fabrizio Frati, Pat Morin:
Compatible Connectivity-Augmentation of Planar Disconnected Graphs. SODA 2015: 1602-1615 - 2014
- [j19]Greg Aloupis, David Bremner:
Editorial. Comput. Geom. 47(2): 111 (2014) - [j18]Greg Aloupis, Prosenjit Bose, Vida Dujmovic, Chris Gray, Stefan Langerman, Bettina Speckmann:
Triangulating and guarding realistic polygons. Comput. Geom. 47(2): 296-306 (2014) - [j17]Greg Aloupis, Jean Cardinal, Sébastien Collette, Ferran Hurtado, Stefan Langerman, Joseph O'Rourke:
Draining a polygon - or - rolling a ball out of a polygon. Comput. Geom. 47(2): 316-328 (2014) - [j16]Oswin Aichholzer, Greg Aloupis, Erik D. Demaine, Martin L. Demaine, Sándor P. Fekete, Michael Hoffmann, Anna Lubiw, Jack Snoeyink, Andrew Winslow:
Covering Folded Shapes. J. Comput. Geom. 5(1): 150-167 (2014) - [c31]Greg Aloupis, Erik D. Demaine, Alan Guo, Giovanni Viglietta:
Classic Nintendo Games Are (Computationally) Hard. FUN 2014: 40-51 - [c30]Greg Aloupis, John Iacono, Stefan Langerman, Özgür Özkan, Stefanie Wuhrer:
The Complexity of Order Type Isomorphism. SODA 2014: 405-415 - [i13]Oswin Aichholzer, Greg Aloupis, Erik D. Demaine, Martin L. Demaine, Sándor P. Fekete, Michael Hoffmann, Anna Lubiw, Jack Snoeyink, Andrew Winslow:
Covering Folded Shapes. CoRR abs/1405.2378 (2014) - [i12]Greg Aloupis, Luis Barba, Paz Carmi, Vida Dujmovic, Fabrizio Frati, Pat Morin:
Compatible Connectivity-Augmentation of Planar Disconnected Graphs. CoRR abs/1408.2436 (2014) - 2013
- [j15]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:
Non-crossing matchings of points with geometric objects. Comput. Geom. 46(1): 78-92 (2013) - [j14]Greg Aloupis, Mirela Damian, Robin Y. Flatland, Matias Korman, Özgür Özkan, David Rappaport, Stefanie Wuhrer:
Establishing strong connectivity using optimal radius half-disk antennas. Comput. Geom. 46(3): 328-339 (2013) - [j13]Greg Aloupis, Nadia M. Benbernou, Mirela Damian, Erik D. Demaine, Robin Y. Flatland, John Iacono, Stefanie Wuhrer:
Efficient reconfiguration of lattice-based modular robots. Comput. Geom. 46(8): 917-928 (2013) - [c29]Oswin Aichholzer, Greg Aloupis, Erik D. Demaine, Martin L. Demaine, Sándor P. Fekete, Michael Hoffmann, Anna Lubiw, Jack Snoeyink, Andrew Winslow:
Covering Folded Shapes. CCCG 2013 - [c28]Greg Aloupis, Luis Barba, Stefan Langerman, Diane L. Souvaine:
Bichromatic compatible matchings. SoCG 2013: 267-276 - [c27]Greg Aloupis, Hebert Pérez-Rosés, Guillermo Pineda-Villavicencio, Perouz Taslakian, Dannier Trinchet-Almaguer:
Fitting Voronoi Diagrams to Planar Tesselations. IWOCA 2013: 349-361 - [i11]Greg Aloupis, Hebert Pérez-Rosés, Guillermo Pineda-Villavicencio, Perouz Taslakian, Dannier Trinchet:
Fitting Voronoi Diagrams to Planar Tesselations. CoRR abs/1308.5550 (2013) - [i10]Greg Aloupis, John Iacono, Stefan Langerman, Özgür Özkan:
The Complexity of Order Type Isomorphism. CoRR abs/1311.0928 (2013) - 2012
- [c26]Greg Aloupis, Robert A. Hearn, Hirokazu Iwasawa, Ryuhei Uehara:
Covering Points with Disjoint Unit Disks. CCCG 2012: 41-46 - [c25]Luis Felipe Barba Flores, Stefan Langerman, Greg Aloupis:
Circle Separability Queries in Logarithmic Time. CCCG 2012: 113-118 - [i9]Greg Aloupis, Erik D. Demaine, Alan Guo:
Classic Nintendo Games are (NP-)Hard. CoRR abs/1203.1895 (2012) - [i8]Greg Aloupis, Luis Barba, Stefan Langerman:
Circle separability queries in logarithmic time. CoRR abs/1203.6266 (2012) - [i7]Greg Aloupis, Luis Barba, Stefan Langerman, Diane L. Souvaine:
Bichromatic compatible matchings. CoRR abs/1207.2375 (2012) - 2011
- [j12]Greg Aloupis, Jean Cardinal, Sébastien Collette, Shinji Imahori, Matias Korman, Stefan Langerman, Oded Schwartz, Shakhar Smorodinsky, Perouz Taslakian:
Colorful Strips. Graphs Comb. 27(3): 327-339 (2011) - [j11]Greg Aloupis, Prosenjit Bose, Erik D. Demaine, Stefan Langerman, Henk Meijer, Mark H. Overmars, Godfried T. Toussaint:
Computing Signed Permutations of Polygons. Int. J. Comput. Geom. Appl. 21(1): 87-100 (2011) - [j10]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:
Efficient constant-velocity reconfiguration of crystalline robots. Robotica 29(1): 59-71 (2011) - [c24]Oswin Aichholzer, Greg Aloupis, Erik D. Demaine, Martin L. Demaine, Vida Dujmovic, Ferran Hurtado, Anna Lubiw, Günter Rote, André Schulz, Diane L. Souvaine, Andrew Winslow:
Convexifying Polygons Without Losing Visibilities. CCCG 2011 - [c23]Greg Aloupis, Mirela Damian, Robin Y. Flatland, Matias Korman, Özgür Özkan, David Rappaport, Stefanie Wuhrer:
Establishing Strong Connectivity using Optimal Radius Half-Disk Antennas. CCCG 2011 - [c22]Greg Aloupis, Erik D. Demaine, Martin L. Demaine, Vida Dujmovic, John Iacono:
Meshes Preserving Minimum Feature Size. EGC 2011: 258-273 - 2010
- [j9]Greg Aloupis, Jean Cardinal, Sébastien Collette, Ferran Hurtado, Stefan Langerman, Joseph O'Rourke, Belén Palop:
Highway hull revisited. Comput. Geom. 43(2): 115-130 (2010) - [j8]Greg Aloupis, Jean Cardinal, Sébastien Collette, Stefan Langerman, David Orden, Pedro Ramos:
Decomposition of Multiple Coverings into More Parts. Discret. Comput. Geom. 44(3): 706-723 (2010) - [c21]Greg Aloupis, Prosenjit Bose, Sébastien Collette, Erik D. Demaine, Martin L. Demaine, Karim Douïeb, Vida Dujmovic, John Iacono, Stefan Langerman, Pat Morin:
Common Unfoldings of Polyominoes and Polycubes. CGGA 2010: 44-54 - [c20]Greg Aloupis, Jean Cardinal, Sébastien Collette, Shinji Imahori, Matias Korman, Stefan Langerman, Oded Schwartz, Shakhar Smorodinsky, Perouz Taslakian:
Colorful Strips. LATIN 2010: 2-13 - [c19]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:
Matching Points with Things. LATIN 2010: 456-467
2000 – 2009
- 2009
- [j7]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:
Linear reconfiguration of cube-style modular robots. Comput. Geom. 42(6-7): 652-663 (2009) - [j6]Greg Aloupis, Jean Cardinal, Sébastien Collette, Stefan Langerman, Shakhar Smorodinsky:
Coloring Geometric Range Spaces. Discret. Comput. Geom. 41(2): 348-362 (2009) - [c18]Greg Aloupis, Nadia M. Benbernou, Mirela Damian, Erik D. Demaine, Robin Y. Flatland, John Iacono, Stefanie Wuhrer:
Efficient Reconfiguration of Lattice-Based Modular Robots. ECMR 2009: 81-86 - [c17]Greg Aloupis, Jean Cardinal, Sébastien Collette, Stefan Langerman, David Orden, Pedro Ramos:
Decomposition of multiple coverings into more parts. SODA 2009: 302-310 - [i6]Greg Aloupis, Jean Cardinal, Sébastien Collette, Shinji Imahori, Matias Korman, Stefan Langerman, Oded Schwartz, Shakhar Smorodinsky, Perouz Taslakian:
Colorful Strips. CoRR abs/0904.2115 (2009) - [i5]Greg Aloupis, Sébastien Collette, Erik D. Demaine, Stefan Langerman, Vera Sacristán, Stefanie Wuhrer:
Reconfiguration of 3D Crystalline Robots Using O(log n) Parallel Moves. CoRR abs/0908.2440 (2009) - [i4]Greg Aloupis, Jean Cardinal, Sébastien Collette, John Iacono, Stefan Langerman:
Detecting all regular polygons in a point set. CoRR abs/0908.2442 (2009) - [i3]Greg Aloupis, Erik D. Demaine, Martin L. Demaine, Vida Dujmovic, John Iacono:
Minimum feature size preserving decompositions. CoRR abs/0908.2493 (2009) - 2008
- [j5]Greg Aloupis, Erik D. Demaine, Stefan Langerman, Pat Morin, Joseph O'Rourke, Ileana Streinu, Godfried T. Toussaint:
Edge-unfolding nested polyhedral bands. Comput. Geom. 39(1): 30-42 (2008) - [c16]Greg Aloupis, Prosenjit Bose, Vida Dujmovic, Chris Gray, Stefan Langerman, Bettina Speckmann:
Triangulating and Guarding Realistic Polygons. CCCG 2008 - [c15]Greg Aloupis, Jean Cardinal, Sébastien Collette, Ferran Hurtado, Stefan Langerman, Joseph O'Rourke:
Draining a Polygon - or - Rolling a Ball out of a Polygon. CCCG 2008 - [c14]Greg Aloupis, Sébastien Collette, Erik D. Demaine, Stefan Langerman, Vera Sacristán Adinolfi, Stefanie Wuhrer:
Reconfiguration of Cube-Style Modular Robots Using O(logn) Parallel Moves. ISAAC 2008: 342-353 - [c13]Greg Aloupis, Jean Cardinal, Sébastien Collette, Stefan Langerman, Shakhar Smorodinsky:
Coloring Geometric Range Spaces. LATIN 2008: 146-157 - [c12]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:
Realistic Reconfiguration of Crystalline (and Telecube) Robots. WAFR 2008: 433-447 - [i2]Greg Aloupis, Jean Cardinal, Sébastien Collette, Ferran Hurtado, Stefan Langerman, Joseph O'Rourke, Belén Palop:
Highway Hull Revisited. CoRR abs/0806.1416 (2008) - [i1]Greg Aloupis, Jean Cardinal, Sébastien Collette, Stefan Langerman, David Orden, Pedro Ramos:
Decomposition of Multiple Coverings into More Parts. CoRR abs/0807.0552 (2008) - 2007
- [j4]Greg Aloupis, Prosenjit Bose, Pat Morin:
Reconfiguring Triangulations with Edge Flips and Point Moves. Algorithmica 47(4): 367-378 (2007) - [c11]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:
Vertex Pops and Popturns. CCCG 2007: 137-140 - [c10]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:
Linear Reconfiguration of Cube-Style Modular Robots. ISAAC 2007: 208-219 - 2006
- [j3]Greg Aloupis, Thomas Fevens, Stefan Langerman, Tomomi Matsui, Antonio Mesa, Yurai Núñez Rodríguez, David Rappaport, Godfried T. Toussaint:
Algorithms for Computing Geometric Measures of Melodic Similarity. Comput. Music. J. 30(3): 67-76 (2006) - [c9]Greg Aloupis, Jean Cardinal, Sébastien Collette, Stefan Langerman:
LUMINESStrategies. Computers and Games 2006: 190-199 - 2005
- [j2]Greg Aloupis, Erin McLeish:
A lower bound for computing Oja depth. Inf. Process. Lett. 96(4): 151-153 (2005) - 2004
- [c8]Greg Aloupis, Erik D. Demaine, Stefan Langerman, Pat Morin, Joseph O'Rourke, Ileana Streinu, Godfried T. Toussaint:
Unfolding polyhedral bands. CCCG 2004: 60-63 - [c7]Greg Aloupis, Prosenjit Bose, Pat Morin:
Reconfiguring Triangulations with Edge Flips and Point Moves. GD 2004: 1-11 - 2003
- [j1]Greg Aloupis, Stefan Langerman, Michael A. Soss, Godfried T. Toussaint:
Algorithms for bivariate medians and a Fermat-Torricelli problem for lines. Comput. Geom. 26(1): 69-79 (2003) - [c6]Greg Aloupis, Thomas Fevens, Stefan Langerman, Tomomi Matsui, Antonio Mesa, Yurai Núñez Rodríguez, David Rappaport, Godfried T. Toussaint:
Computing the Similarity of two Melodies. CCCG 2003: 81-84 - [c5]Greg Aloupis:
Geometric measures of data depth. Data Depth: Robust Multivariate Analysis, Computational Geometry and Applications 2003: 147-158 - 2002
- [c4]Greg Aloupis, Erik D. Demaine, Henk Meijer, Joseph O'Rourke, Ileana Streinu, Godfried T. Toussaint:
On flat-state connectivity of chains with fixed acute angles. CCCG 2002: 27-30 - [c3]Greg Aloupis, Prosenjit Bose, Erik D. Demaine, Stefan Langerman, Henk Meijer, Mark H. Overmars, Godfried T. Toussaint:
Computing signed permutations of polygons. CCCG 2002: 68-71 - [c2]Greg Aloupis, Erik D. Demaine, Vida Dujmovic, Jeff Erickson, Stefan Langerman, Henk Meijer, Joseph O'Rourke, Mark H. Overmars, Michael A. Soss, Ileana Streinu, Godfried T. Toussaint:
Flat-State Connectivity of Linkages under Dihedral Motions. ISAAC 2002: 369-380 - 2001
- [c1]Greg Aloupis, Stefan Langerman, Michael A. Soss, Godfried T. Toussaint:
Algorithms for bivariate medians and a fermat-torricelli problem for lines. CCCG 2001: 21-24
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:16 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
