Greg Aloupis

According to our database1, Greg Aloupis authored at least 50 papers between 2001 and 2025.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2025
An Improved Bound for Plane Covering Paths.
Proceedings of the 33rd Annual European Symposium on Algorithms, 2025

2024
Noncrossing Longest Paths and Cycles.
Proceedings of the 32nd International Symposium on Graph Drawing and Network Visualization, 2024

2022
Computing Colourful Simplicial Depth and Median in ℝ<sub>2</sub>.
Theory Comput. Syst., 2022

2019
Bottleneck detour tree of points on a path.
Comput. Geom., 2019

2016
Recognizing Weakly Simple Polygons.
Proceedings of the 32nd International Symposium on Computational Geometry, 2016

2015
Isoperimetric Enclosures.
Graphs Comb., 2015

Compatible Connectivity-Augmentation of Planar Disconnected Graphs.
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015

2014
Editorial.
Comput. Geom., 2014

The Complexity of Order Type Isomorphism.
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014

Classic Nintendo Games Are (Computationally) Hard.
Proceedings of the Fun with Algorithms - 7th International Conference, 2014

2013
The Complexity of Order Type Isomorphism.
CoRR, 2013

Non-crossing matchings of points with geometric objects.
Comput. Geom., 2013

Fitting Voronoi Diagrams to Planar Tesselations.
Proceedings of the Combinatorial Algorithms - 24th International Workshop, 2013

Bichromatic compatible matchings.
Proceedings of the Symposium on Computational Geometry 2013, 2013

Covering Folded Shapes.
Proceedings of the 25th Canadian Conference on Computational Geometry, 2013

2012
Classic Nintendo Games are (NP-)Hard
CoRR, 2012

Circle Separability Queries in Logarithmic Time.
Proceedings of the 24th Canadian Conference on Computational Geometry, 2012

Covering Points with Disjoint Unit Disks.
Proceedings of the 24th Canadian Conference on Computational Geometry, 2012

2011
Efficient constant-velocity reconfiguration of crystalline robots.
Robotica, 2011

Meshes Preserving Minimum Feature Size.
Proceedings of the Computational Geometry - XIV Spanish Meeting on Computational Geometry, 2011

Establishing Strong Connectivity using Optimal Radius Half-Disk Antennas.
Proceedings of the 23rd Annual Canadian Conference on Computational Geometry, 2011

Convexifying Polygons Without Losing Visibilities.
Proceedings of the 23rd Annual Canadian Conference on Computational Geometry, 2011

2010
Highway hull revisited.
Comput. Geom., 2010



Common Unfoldings of Polyominoes and Polycubes.
Proceedings of the Computational Geometry, Graphs and Applications, 2010

2009
Minimum feature size preserving decompositions
CoRR, 2009

Detecting all regular polygons in a point set
CoRR, 2009

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

Decomposition of multiple coverings into more parts.
Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009

Efficient Reconfiguration of Lattice-Based Modular Robots.
Proceedings of the 4th European Conference on Mobile Robots, 2009

2008
Edge-unfolding nested polyhedral bands.
Comput. Geom., 2008

Realistic Reconfiguration of Crystalline (and Telecube) Robots.
Proceedings of the Algorithmic Foundation of Robotics VIII, 2008

Coloring Geometric Range Spaces.
Proceedings of the LATIN 2008: Theoretical Informatics, 2008

Reconfiguration of Cube-Style Modular Robots Using O(logn) Parallel Moves.
Proceedings of the Algorithms and Computation, 19th International Symposium, 2008

Draining a Polygon - or - Rolling a Ball out of a Polygon.
Proceedings of the 20th Annual Canadian Conference on Computational Geometry, 2008

Triangulating and Guarding Realistic Polygons.
Proceedings of the 20th Annual Canadian Conference on Computational Geometry, 2008

2007
Linear Reconfiguration of Cube-Style Modular Robots.
Proceedings of the Algorithms and Computation, 18th International Symposium, 2007

Vertex Pops and Popturns.
Proceedings of the 19th Annual Canadian Conference on Computational Geometry, 2007

2006
Algorithms for Computing Geometric Measures of Melodic Similarity.
Comput. Music. J., 2006

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

2005
A lower bound for computing Oja depth.
Inf. Process. Lett., 2005

2004
Reconfiguring Triangulations with Edge Flips and Point Moves.
Proceedings of the Graph Drawing, 12th International Symposium, 2004

Unfolding polyhedral bands.
Proceedings of the 16th Canadian Conference on Computational Geometry, 2004

2003
Geometric measures of data depth.
Proceedings of the Data Depth: Robust Multivariate Analysis, 2003

Computing the Similarity of two Melodies.
Proceedings of the 15th Canadian Conference on Computational Geometry, 2003

2002
Flat-State Connectivity of Linkages under Dihedral Motions.
Proceedings of the Algorithms and Computation, 13th International Symposium, 2002

On flat-state connectivity of chains with fixed acute angles.
Proceedings of the 14th Canadian Conference on Computational Geometry, 2002

Computing signed permutations of polygons.
Proceedings of the 14th Canadian Conference on Computational Geometry, 2002

2001
Algorithms for bivariate medians and a fermat-torricelli problem for lines.
Proceedings of the 13th Canadian Conference on Computational Geometry, 2001


  Loading...