Morteza Saghafian

According to our database, Morteza Saghafian authored at least 25 papers between 2011 and 2026.

Collaborative distances:

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

2026

Flips in two-dimensional hypertriangulations.

Herbert Edelsbrunner, Alexey Garber, Mohadese Ghafari, Teresa Heiss, Morteza Saghafian

Eur. J. Comb., 2026

2025

Expected Length of the Euclidean Minimum Spanning Tree and 1-norms of Chromatic Persistence Diagrams in the Plane.

Ondrej Draganov, Herbert Edelsbrunner, Sophie Rosenmeier, Morteza Saghafian

CoRR, October, 2025

Covering Complete Geometric Graphs by Monotone Paths.

Adrian Dumitrescu, János Pach, Morteza Saghafian

CoRR, July, 2025

Simplet-based signatures and approximation in simplicial complexes: Frequency, degree, and centrality.

Mohammad Mahini, Hamid Beigy, Salman Qadami, Morteza Saghafian

Inf. Sci., 2025

On Spheres with k Points Inside.

Herbert Edelsbrunner, Alexey Garber, Morteza Saghafian

Proceedings of the 41st International Symposium on Computational Geometry, 2025

2024

Geometric characterization of the persistence of 1D maps.

Ranita Biswas, Sebastiano Cultrera di Montesano, Herbert Edelsbrunner, Morteza Saghafian

J. Appl. Comput. Topol., October, 2024

Depth in arrangements: Dehn-Sommerville-Euler relations with applications.

Ranita Biswas, Sebastiano Cultrera di Montesano, Herbert Edelsbrunner, Morteza Saghafian

J. Appl. Comput. Topol., September, 2024

On Angles in Higher Order Brillouin Tessellations and Related Tilings in the Plane.

Herbert Edelsbrunner, Alexey Garber, Mohadese Ghafari, Teresa Heiss, Morteza Saghafian

Discret. Comput. Geom., July, 2024

Brillouin Zones of Integer Lattices and Their Perturbations.

Herbert Edelsbrunner, Alexey Garber, Mohadese Ghafari, Teresa Heiss, Morteza Saghafian, Mathijs Wintraecken

SIAM J. Discret. Math., 2024

On Spheres with <i>k</i> Points Inside.

Herbert Edelsbrunner, Alexey Garber, Morteza Saghafian

CoRR, 2024

The Complexity of Maximizing the MST-ratio.

Afrouz Jabal Ameli, Faezeh Motiei, Morteza Saghafian

CoRR, 2024

Chromatic Topological Data Analysis.

Sebastiano Cultrera di Montesano, Ondrej Draganov, Herbert Edelsbrunner, Morteza Saghafian

CoRR, 2024

Approximating Simplet Frequency Distribution for Simplicial Complexes.

Hamid Beigy, Mohammad Mahini, Salman Qadami, Morteza Saghafian

CoRR, 2024

The Euclidean MST-Ratio for Bi-Colored Lattices.

Sebastiano Cultrera di Montesano, Ondrej Draganov, Herbert Edelsbrunner, Morteza Saghafian

Proceedings of the 32nd International Symposium on Graph Drawing and Network Visualization, 2024

Grid Peeling of Parabolas.

Günter Rote, Moritz Rüber, Morteza Saghafian

Proceedings of the 40th International Symposium on Computational Geometry, 2024

2023

Order-2 Delaunay Triangulations Optimize Angles.

Herbert Edelsbrunner, Alexey Garber, Morteza Saghafian

CoRR, 2023

Decomposition of Geometric Graphs into Star-Forests.

János Pach, Morteza Saghafian, Patrick Schnider

Proceedings of the Graph Drawing and Network Visualization - 31st International Symposium, 2023

2022

Continuous and Discrete Radius Functions on Voronoi Tessellations and Delaunay Mosaics.

Ranita Biswas, Sebastiano Cultrera di Montesano, Herbert Edelsbrunner, Morteza Saghafian

Discret. Comput. Geom., 2022

Persistent Homology of Chromatic Alpha Complexes.

Sebastiano Cultrera di Montesano, Ondrej Draganov, Herbert Edelsbrunner, Morteza Saghafian

CoRR, 2022

On the Size of Chromatic Delaunay Mosaics.

Ranita Biswas, Sebastiano Cultrera di Montesano, Ondrej Draganov, Herbert Edelsbrunner, Morteza Saghafian

CoRR, 2022

2021

Counting Cells of Order-k Voronoi Tessellations in ℝ³ with Morse Theory.

Ranita Biswas, Sebastiano Cultrera di Montesano, Herbert Edelsbrunner, Morteza Saghafian

Proceedings of the 37th International Symposium on Computational Geometry, 2021

2020

Preclustering Algorithms for Imprecise Points.

Mohammad Ali Abam, Mark de Berg, Sina Farahzad, Mir Omid Haji Mirsadeghi, Morteza Saghafian

Proceedings of the 17th Scandinavian Symposium and Workshops on Algorithm Theory, 2020

2017

Is there any polynomial upper bound for the universal labeling of graphs?

Arash Ahadi, Ali Dehghan, Morteza Saghafian

J. Comb. Optim., 2017

2011

On a bounded budget network creation game.

Shayan Ehsani, MohammadAmin Fazli, Abbas Mehrabian, Sina Sadeghian Sadeghabad, MohammadAli Safari, Morteza Saghafian, Saber ShokatFadaee

Proceedings of the SPAA 2011: Proceedings of the 23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2011

White Space Regions.

Shayan Ehsani, MohammadAmin Fazli, Mohammad Ghodsi, MohammadAli Safari, Morteza Saghafian, Mohammad Tavakkoli

Proceedings of the SOFSEM 2011: Theory and Practice of Computer Science, 2011