I gave the following talks at conferences and events. Contact me if you need the slides/materials for any presentation.
The 36th Intl. Workshop on Combinatorial Algorithms (IWOCA), Jul. 2025
Minimum-Complexity Graph Simplification under Fréchet-Like Distance
Bozeman, MT, US.
https://www.cs.montana.edu/bhz/iwoca2025/
102nd Annual Meeting on Transportation Research Board (TRB), Jan. 2023
Estimating Demands for Online Delivery using Limited Historical Observations
Washington D.C.
https://www.trb.org/AnnualMeeting/AnnualMeeting.aspx
Michigan Institute for Data Science (MIDAS), Aug. 2022
Estimating Demands for Online Delivery using Limited Historical Observations
University of Michigan - Ann Arbor, MI.
https://midas.umich.edu/
Transportation Research Institute (UMTRI), Aug. 2022
Estimating Demands for Online Delivery using Limited Historical Observations
University of Michigan - Ann Arbor, MI.
https://www.umtri.umich.edu/
European Workshop on Computational Geometry (EuroCG'21), Apr. 2021
On Minimum-Complexity Graph Simplification
St. Petersburg, Russia
http://eurocg21.spbu.ru/program/
Project Air Force, Aug. 2019
Geospatial Predictions under Sparsity and Uncertainty in GIS
RAND Corporation, Santa Monica, CA.
http://www.rand.org
Advanced Topics in GIS, May. 2018
Progressive Simplification of Maps in GIS
Department of Earth & Environmental Science, Tulane University.
https://github.com/arminia/Simplification
28th Annual Fall Workshop on Computational Geometry, Oct. 2018
Min-# Curve Simplification, Revisited
Queens College, NY.
http://eniac.cs.qc.cuny.edu/mgoswami/fwcg-2018.html
3rd International Workshop of Interactive and Spatial Computing, Apr. 2018
Fast Fréchet distance between curves with long edges
University of Texas at Dallas.
http://cs.utdallas.edu/ut-diisc/iwisc2018/
1st Annual Mid-South Theory Day, Dec. 2016
Efficient Data Structures for the Fréchet Distance Queries on x-Monotone Paths
Louisiana State University (LSU), Baton Rouge, LA.
https://sites.google.com/site/midsouththeoryday/
6th Annual Winter School on Computational Geometry, Feb. 2014
Computing the discrete Fréchet distance between monotone paths in O(n log n) time
Amirkabir University of Technology.
http://www.wscg.ir