Ah, make the most of what we yet may spEnd,
Before we too into the Dust descEnd;
Dust into Dust, and under Dust to lie
Sans Wine, sans Song, sans Singer, and — sans End!
Majid Mirzanezhad, Ph.D.
E: miirza {at} umich {dot} edu
Rm 321, 2901 Baxter Rd, University of Michigan -- Ann Arbor
Google Scholar
movementanalytics.org
I am an aspiring computer scientist and currently a postdoc research fellow at the University of Michigan. I obtained my Ph.D at Tulane University under the supervision of Dr. Carola Wenk. I have successfully conducted research for several corporations including Ford Motors Co., RAND Think Tank Corporation, and the National Science Foundation.
Research Interests: Computational Geometry - Geographic Information Systems (GIS) - Spatial Algorithms and Systems - Transportation
Publications:
T. Fabusuyi, M. Mirzanezhad, Y. Wang, "On-Demand Delivery: Estimation, Routing, and Last-Mile Solutions'', INFORMS, Seattle, WA., 2024.
H. Akitaya, M. Buchin, M. Mirzanezhad, L. Ryvkin, and C. Wenk, "Realizability of Free Spaces of Curves'', In the 34th International Symposium on Algorithms and Computation (ISAAC) 283(5):1--20, 2023. Invited to the special issue of the Journal of Computational Geometry: Theory and Applications (CGTA).
M. Mirzanezhad, "On Approximate Near-Neighbors Search under the (Continuous) Fréchet Distance in Higher Dimensions'', Information Processing Letters, 183(C): 1-10, 2023.
M. Mirzanezhad, Andrea Broaddus, Richard Twumasi-Boakye, Tayo Fabusuyi ``Predicting Demands for Online Package Delivery using Limited Historical Observations'', 102nd Annual Meeting on Transportation Research Board (TRB), Washington D.C., 2023.
H. Akitaya, M. Buchin, M. Mirzanezhad, L. Ryvkin and C. Wenk, "The Complexity of Realizing Free Spaces'', The 30th Annual Fall Workshop on Computational Geometry, Raleigh, North Carolina (2022)
H.A. Akitaya, M. Buchin, M. Mirzanezhad, L. Ryvkin, and C. Wenk, "On Realizability of Free Space Diagrams in 1D'', 38th European Workshop on Computational Geometry, Perugia, Italy (2022)
O. Filtser, M. Mirzanezhad, C. Wenk, "On Minimum-Complexity Graph-Simplification", European Workshop on Computational Geoemetry (EuroCG'21), St. Petersburgh, Russia, April 7-9, 2021.
M. Kerkhof, I. Kostitsyna, M. Löffler, M. Mirzanezhad and C. Wenk. "Global Curve Simplification'', European Symposium on Algorithms (ESA), 144:1–14, Munich, Germany, 2019.
J. Gudmundsson, M . Mirzanezhad, A. Mohades, C. Wenk. "Fast Fréchet Distance Between Curves with Long Edges", Intl. J. Computational Geometry & Applications, 29(2):161–187, 2019.
M. van de Kerkhof, I. Kostitsyna, M. Löffler, M. Mirzanezhad, C. Wenk, "On Optimal Min-# Curve Simplification", 28th Annual Fall Workshop on Computational Geometry, 4 pages, Queens College, Queens, NY, 2018.
J. Gudmundsson, M . Mirzanezhad, A. Mohades, C. Wenk. "Fast Fréchet Distance Between Curves with Long Edges". The Best Paper Award at International Workshop of Interactive and Spatial Computing (IWISC'18) pages 52-28.
Under Review, Pre-Prints, Working Papers:
T. Fabusuyi, M. Mirzanezhad, Y. Wang, "On-Demand Delivery: Estimation, Routing and Last-Mile Solutions'', in submission to Journal of Transportation Research Part A: Policy.
M. Kerkhof, I. Kostitsyna, M. Löffler, M. Mirzanezhad, and C. Wenk, "Global Curve Simplification'' in submission to Journal of ACM Transactions on Algorithms (TALG).
H. Akitaya, M. Buchin, M. Mirzanezhad, L. Ryvkin, and C. Wenk, "Realizability of Free Spaces of Curves'', Under revision in the Journal of Computational Geometry: Theory and Applications (CGTA).
M. Mirzanezhad, R. Twumasi-Boakye, A. Broaddus and T. Fabusuyi, "Generating Online Freight Delivery Demand during COVID-19 using Limited Data'', under revision in Journal of Transportation Research Part B: Methodological.
M. Mirzanezhad, "Optimally Equitable Facility Locations'', In preparation.
T. Fabusuyi, M. Mirzanezhad, R. Twumasi-Boakye, Bumsub Park, John Good, "Characterizing the Changing Landscape of On-Demand Delivery'', in preparation.
M. Mirzanezhad}, T. Fabusuyi, ``Unveiling the Nexus: Exploring the Interplay Between Online Shopping and Travel Behavior During COVID-19'', in submission to the 104th Annual Meeting on Transportation Research Board (TRB 2025)}
H.A. Akitaya, M. Löffler, M. Mirzanezhad, C. Wenk, "Clustering Points with Line Segments under the Hausdorff Distance'', in preparation.
O. Filtser, M. Mirzanezhad and C. Wenk, "Min-Complexity Graph Simplification under Fréchet-Like Distances'', journal version in preparation.
Patents, Technical Reports:
US Patent. Energy Efficient Sampling For Last-Mile Delivery Systems, May 2024. Available on Google Patents.
Services:
ESA 2024 - SWAT 2024 - SoCG 2024 - TRB 2024 - Geoinformatica 2023 - Journal of ACM Transactions on Algorithms (TALG) 2023- ICALP 2023 - SoCG 2023 - IPL 2022 - SoCG'22 - WADS'21 - EuroCG'21 - ISAAC'20 - SODA'20 - IJCGA - ESA'20 - ICALP'20 - Algorithmica - Symposium on Computational Geometry’20 (SoCG) - Journal of Computational Geometry'19 (JoCG) - Canadian Conference on Computational Geometry’19 (CCCG) - European Symposium on Algorithms’19 (ESA) - GeoInformatica Journal - Journal of Spatial Information Science (JOSIS) - Iranian Conference on Computational Geometry (ICCG) - Journal of Information Processing Letters (IPL) - Journal of ACM Transaction on Spatial Algorithms and Systems (TSAS) - Symposium on Computational Geometry’18 (SoCG) - European Symposium on Algorithms’18 (ESA) - European Workshop on Computational Geometry’18 (EWCG) - ACM SIGSPATIAL’18 - ACM SIGSPATIAL’17 - SIAM: Algorithm Engineering and Experiments’17 (ALENEX)