| Characterizing Universal Reconfigurability of Modular Pivoting Robots | 0 | 0.34 | 2021 |
| Reconfiguration of Connected Graph Partitions via Recombination | 0 | 0.34 | 2021 |
| Rectilinear link diameter and radius in a rectilinear polygonal domain | 0 | 0.34 | 2021 |
| New Results in Sona Drawing: Hardness and TSP Separation | 0 | 0.34 | 2020 |
| Routing In Histograms | 0 | 0.34 | 2020 |
| Distance bounds for high dimensional consistent digital rays and 2-D partially-consistent digital rays | 0 | 0.34 | 2020 |
| Routing in polygonal domains | 0 | 0.34 | 2020 |
| Kinetic Geodesic Voronoi Diagrams in a Simple Polygon | 0 | 0.34 | 2020 |
| Routing in Histograms. | 0 | 0.34 | 2019 |
| Circumscribing Polygons and Polygonizations for Disjoint Line Segments. | 0 | 0.34 | 2019 |
| Universal Reconfiguration of Facet-Connected Modular Robots by Pivots - The O(1) Musketeers. | 0 | 0.34 | 2019 |
| Reconfiguration of Connected Graph Partitions. | 0 | 0.34 | 2019 |
| Packing Plane Spanning Graphs with Short Edges in Complete Geometric Graphs | 0 | 0.34 | 2019 |
| Special Issue on the 34th European Workshop on Computational Geometry, Guest Editors' Foreword. | 0 | 0.34 | 2019 |
| Efficient segment folding is hard | 0 | 0.34 | 2019 |
| Rectilinear Link Diameter and Radius in a Rectilinear Polygonal Domain. | 0 | 0.34 | 2018 |
| Group evolution patterns in running races. | 0 | 0.34 | 2018 |
| Routing on the visibility graph | 0 | 0.34 | 2018 |
| Convex Hulls in Polygonal Domains. | 0 | 0.34 | 2018 |
| Geometric Algorithms with Limited Workspace: A Survey. | 0 | 0.34 | 2018 |
| Experimental Study of Compressed Stack Algorithms in Limited Memory Environments. | 0 | 0.34 | 2018 |
| Routing On The Visibility Graph | 0 | 0.34 | 2018 |
| On the complexity of barrier resilience for fat regions and bounded ply. | 0 | 0.34 | 2018 |
| Constrained Routing Between Non-Visible Vertices | 1 | 0.37 | 2017 |
| Rectilinear Link Diameter and Radius in a Rectilinear Polygonal Domain. | 0 | 0.34 | 2017 |
| Packing Short Plane Spanning Graphs in Complete Geometric Graphs. | 0 | 0.34 | 2017 |
| High Dimensional Consistent Digital Segments. | 1 | 0.38 | 2017 |
| Computing the L1 Geodesic Diameter and Center of a Polygonal Domain. | 0 | 0.34 | 2017 |
| Dynamic Graph Coloring. | 1 | 0.63 | 2017 |
| Balanced Line Separators of Unit Disk Graphs. | 0 | 0.34 | 2017 |
| Line Segment Covering of Cells in Arrangements. | 1 | 0.40 | 2017 |
| Faster Algorithms for Growing Prioritized Disks and Rectangles. | 0 | 0.34 | 2017 |
| Routing in Polygons with Holes. | 0 | 0.34 | 2017 |
| Gap-planar Graphs. | 0 | 0.34 | 2017 |
| Geometric Biplane Graphs II: Graph Augmentation | 1 | 0.36 | 2017 |
| Stabbing Segments with Rectilinear Objects | 0 | 0.34 | 2017 |
| Symmetric assembly puzzles are hard, beyond a few pieces | 0 | 0.34 | 2017 |
| On Interference Among Moving Sensors And Related Problems | 0 | 0.34 | 2017 |
| Snipperclips: Cutting Tools into Desired Polygons using Themselves. | 0 | 0.34 | 2017 |
| Improved Time-Space Trade-Offs for Computing Voronoi Diagrams. | 0 | 0.34 | 2017 |
| Hanabi is NP-complete, Even for Cheaters who Look at Their Cards. | 3 | 0.46 | 2016 |
| Packing Short Plane Spanning Trees in Complete Geometric Graphs. | 0 | 0.34 | 2016 |
| The 1-Center and 1-Highway problem revisited | 0 | 0.34 | 2016 |
| Geometric Biplane Graphs I: Maximal Graphs. | 2 | 0.39 | 2015 |
| Computing the $L_1$ Geodesic Diameter and Center of a Polygonal Domain | 1 | 0.38 | 2015 |
| Stabbing Segments with Rectilinear Objects | 0 | 0.34 | 2015 |
| On Kinetic Range Spaces and their Applications | 1 | 0.40 | 2015 |
| Balanced partitions of 3-colored geometric sets in the plane. | 1 | 0.39 | 2015 |
| Time-Space Trade-offs for Triangulating a Simple Polygon | 3 | 0.40 | 2015 |
| Time-Space Trade-offs for Triangulations and Voronoi Diagrams | 1 | 0.36 | 2015 |
