Majid Mirzanezhad

According to our database, Majid Mirzanezhad authored at least 10 papers between 2018 and 2025.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2025

Minimum-Complexity Graph Simplification Under the Fréchet-Like Distance.

Omrit Filtser, Majid Mirzanezhad, Carola Wenk

Proceedings of the Combinatorial Algorithms - 36th International Workshop, 2025

Fair-Coverage Facility Location: Optimizing Distance and Diversity.

Majid Mirzanezhad

Proceedings of the 33rd ACM International Conference on Advances in Geographic Information Systems, 2025

Approximate and Exact Geometric Generalized Minimum Spanning Trees.

Majid Mirzanezhad, Arash Rafiey

Proceedings of the 37th Canadian Conference on Computational Geometry (CCCG 2025), 2025

2024

On approximate near-neighbors search under the (continuous) Fréchet distance in higher dimensions.

Majid Mirzanezhad

Inf. Process. Lett., January, 2024

2023

Realizability of Free Spaces of Curves.

Hugo A. Akitaya, Maike Buchin, Majid Mirzanezhad, Leonie Ryvkin, Carola Wenk

Proceedings of the 34th International Symposium on Algorithms and Computation, 2023

2021

Minimum-Complexity Graph Simplification under Fréchet-Like Distances.

Omrit Filtser, Majid Mirzanezhad, Carola Wenk

CoRR, 2021

2020

On the Approximate Nearest Neighbor Queries among Curves under the Fréchet Distance.

Majid Mirzanezhad

CoRR, 2020

2019

Global Curve Simplification.

Mees van de Kerkhof, Irina Kostitsyna, Maarten Löffler, Majid Mirzanezhad, Carola Wenk

Proceedings of the 27th Annual European Symposium on Algorithms, 2019

2018

On Optimal Min-# Curve Simplification Problem.

Mees van de Kerkhof, Irina Kostitsyna, Maarten Löffler, Majid Mirzanezhad, Carola Wenk

CoRR, 2018

Fast fréchet distance between curves with long edges.

Joachim Gudmundsson, Majid Mirzanezhad, Ali Mohades, Carola Wenk

Proceedings of the 3rd International Workshop on Interactive and Spatial Computing, 2018