Greg Aloupis

From MaRDI portal
Person:390137


List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
The complexity of order type isomorphism
Discrete \& Computational Geometry
2024-10-25Paper
Computing colourful simplicial depth and Median in \(\mathbb{R}_2\)
Theory of Computing Systems
2022-05-09Paper
The Complexity of Order Type Isomorphism
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms
2019-06-20Paper
Decomposition of multiple coverings into more parts
 
2019-05-06Paper
Bottleneck detour tree of points on a path
Computational Geometry
2019-03-20Paper
Recognizing weakly simple polygons
 
2018-01-30Paper
Recognizing weakly simple polygons
Discrete \& Computational Geometry
2018-01-11Paper
Compatible connectivity-augmentation of planar disconnected graphs
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms
2017-10-05Paper
Compatible connectivity augmentation of planar disconnected graphs
Discrete \& Computational Geometry
2015-12-02Paper
Bichromatic compatible matchings
Computational Geometry
2015-07-27Paper
Classic Nintendo games are (computationally) hard
Theoretical Computer Science
2015-05-26Paper
Isoperimetric enclosures
Graphs and Combinatorics
2015-05-22Paper
Bichromatic compatible matchings
Proceedings of the twenty-ninth annual symposium on Computational geometry
2015-02-17Paper
Triangulating and guarding realistic polygons
Computational Geometry
2014-01-22Paper
Draining a polygon-or-rolling a ball out of a polygon
Computational Geometry
2014-01-22Paper
Fitting Voronoi diagrams to planar tesselations
Lecture Notes in Computer Science
2014-01-17Paper
Thirty essays on geometric graph theory
Thirty Essays on Geometric Graph Theory
2013-09-25Paper
Efficient reconfiguration of lattice-based modular robots
Computational Geometry
2013-07-31Paper
Establishing strong connectivity using optimal radius half-disk antennas
Computational Geometry
2013-01-25Paper
Meshes preserving minimum feature size
Lecture Notes in Computer Science
2013-01-07Paper
Non-crossing matchings of points with geometric objects
Computational Geometry
2012-10-12Paper
Colorful strips
Graphs and Combinatorics
2012-01-24Paper
Common unfoldings of polyominoes and polycubes
Lecture Notes in Computer Science
2011-11-11Paper
Computing signed permutations of polygons
International Journal of Computational Geometry & Applications
2011-06-17Paper
Realistic reconfiguration of crystalline (and telecube) robots
Springer Tracts in Advanced Robotics
2011-03-02Paper
Decomposition of multiple coverings into more parts
Discrete \& Computational Geometry
2010-11-08Paper
Matching points with things
LATIN 2010: Theoretical Informatics
2010-04-27Paper
Colorful strips
LATIN 2010: Theoretical Informatics
2010-04-27Paper
A lower bound for computing Oja depth
Information Processing Letters
2009-12-18Paper
Highway hull revisited
Computational Geometry
2009-11-16Paper
Linear reconfiguration of cube-style modular robots
Computational Geometry
2009-07-27Paper
Coloring geometric range spaces
Discrete \& Computational Geometry
2009-05-13Paper
Reconfiguration of Cube-Style Modular Robots Using O(logn) Parallel Moves
Algorithms and Computation
2009-01-29Paper
Linear Reconfiguration of Cube-Style Modular Robots
Algorithms and Computation
2008-05-27Paper
Coloring Geometric Range Spaces
Lecture Notes in Computer Science
2008-04-15Paper
Edge-unfolding nested polyhedral bands
Computational Geometry
2007-10-19Paper
Reconfiguring triangulations with edge flips and point moves
Algorithmica
2007-05-10Paper
Graph Drawing
Lecture Notes in Computer Science
2005-12-07Paper
More classes of stuck unknotted hexagons
Beiträge zur Algebra und Geometrie
2004-09-10Paper
scientific article; zbMATH DE number 1979514 (Why is no real title available?)
 
2003-09-14Paper
Algorithms for bivariate medians and a Fermat-Torricelli problem for lines.
Computational Geometry
2003-07-01Paper
Lower bounds for computing statistical depth.
Computational Statistics and Data Analysis
2002-08-13Paper


Research outcomes over time


This page was built for person: Greg Aloupis