No. |
Title |
Author |
Year |
---|

1 |
Distance Bounds for High Dimensional Consistent Digital Rays and 2-D Partially-Consistent Digital Rays |
Chiu, Man-Kwun et al. |
2020 |

2 |
Kinetic Geodesic Voronoi Diagrams in a Simple Polygon |
Korman, Matias et al. |
2020 |

3 |
Circumscribing Polygons and Polygonizations for Disjoint Line Segments |
Akitaya, Hugo A. et al. |
2019 |

4 |
Universal Reconfiguration of Facet-Connected Modular Robots by Pivots: The O(1) Musketeers |
Akitaya, Hugo A. et al. |
2019 |

5 |
Convex Hulls in Polygonal Domains |
Barba, Luis et al. |
2018 |

6 |
Experimental Study of Compressed Stack Algorithms in Limited Memory Environments |
Baffier, Jean-François et al. |
2018 |

7 |
Rectilinear Link Diameter and Radius in a Rectilinear Polygonal Domain |
Arseneva, Elena et al. |
2018 |

8 |
Faster Algorithms for Growing Prioritized Disks and Rectangles |
Ahn, Hee-Kap et al. |
2017 |

9 |
High Dimensional Consistent Digital Segments |
Chiu, Man-Kwun et al. |
2017 |

10 |
Improved Time-Space Trade-Offs for Computing Voronoi Diagrams |
Banyassady, Bahareh et al. |
2017 |

11 |
Routing in Polygonal Domains |
Banyassady, Bahareh et al. |
2017 |

12 |
Routing on the Visibility Graph |
Bose, Prosenjit et al. |
2017 |

13 |
Computing the L1 Geodesic Diameter and Center of a Polygonal Domain |
Won Bae, Sang et al. |
2016 |

14 |
Hanabi is NP-complete, Even for Cheaters who Look at Their Cards |
Baffier, Jean-Francois et al. |
2016 |

15 |
On Interference Among Moving Sensors and Related Problems |
De Carufel, Jean-Lou et al. |
2016 |

16 |
Packing Short Plane Spanning Trees in Complete Geometric Graphs |
Aichholzer, Oswin et al. |
2016 |

17 |
Time-Space Trade-offs for Triangulating a Simple Polygon |
Aronov, Boris et al. |
2016 |

18 |
A Linear-Time Algorithm for the Geodesic Center of a Simple Polygon |
Ahn, Hee Kap et al. |
2015 |

19 |
Space-Time Trade-offs for Stack-Based Algorithms |
Barba, Luis et al. |
2013 |