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