| Approximate shortest paths and distance oracles in weighted unit-disk graphs TM Chan, D Skrepetos Journal of Computational Geometry 10 (2), 3–20-3–20, 2019 | 34 | 2019 |
| All-pairs shortest paths in unit-disk graphs in slightly subquadratic time TM Chan, D Skrepetos 27th International Symposium on Algorithms and Computation (ISAAC 2016), 2016 | 32 | 2016 |
| All-pairs shortest paths in geometric intersection graphs TM Chan, D Skrepetos Workshop on Algorithms and Data Structures, 253-264, 2017 | 20 | 2017 |
| Faster approximate diameter and distance oracles in planar graphs TM Chan, D Skrepetos Algorithmica 81, 3075-3098, 2019 | 19 | 2019 |
| Dynamic data structures for approximate Hausdorff distance in the word RAM TM Chan, D Skrepetos Canadian Conference on Computational Geometry, 2015 | 3 | 2015 |
| 25th Annual European Symposium on Algorithms (ESA 2017) DP Woodruff, P Afshani, I van Duijn, Z Wei, PK Agarwal, N Rubin, ... Schloss Dagstuhl-Leibniz-Zentrum für Informatik GmbH, 2017 | 1 | 2017 |
| Shortest Paths in Geometric Intersection Graphs D Skrepetos University of Waterloo, 2018 | | 2018 |
| 34th International Symposium on Computational Geometry (SoCG 2018) A Abdelkader, CL Bajaj, MS Ebeida, AH Mahmoud, SA Mitchell, ... Schloss Dagstuhl-Leibniz-Zentrum für Informatik GmbH, 2018 | | 2018 |
| 27th International Symposium on Algorithms and Computation (ISAAC 2016) X Lin, K Park, A Abdullah, S Daruki, CD Roy, S Venkatasubramanian, ... Schloss Dagstuhl-Leibniz-Zentrum für Informatik GmbH, 2016 | | 2016 |
| Sentiment Analysis D Skrepetos | | |
| Faster Approximate Diameter and Distance TM Chan, D Skrepetos | | |
