Morteza Saghafian

Orcid: 0000-0002-4201-5775

According to our database1, Morteza Saghafian authored at least 15 papers between 2011 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
The Euclidean MST-ratio for Bi-colored Lattices.
CoRR, 2024

Approximating Simplet Frequency Distribution for Simplicial Complexes.
CoRR, 2024

Grid Peeling of Parabolas.
CoRR, 2024

2023
Order-2 Delaunay Triangulations Optimize Angles.
CoRR, 2023

Decomposition of Geometric Graphs into Star-Forests.
Proceedings of the Graph Drawing and Network Visualization - 31st International Symposium, 2023

2022
Continuous and Discrete Radius Functions on Voronoi Tessellations and Delaunay Mosaics.
Discret. Comput. Geom., 2022

Persistent Homology of Chromatic Alpha Complexes.
CoRR, 2022

On the Size of Chromatic Delaunay Mosaics.
CoRR, 2022

Brillouin Zones of Integer Lattices and Their Perturbations.
CoRR, 2022

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

Preclustering Algorithms for Imprecise Points.
Algorithmica, 2022

2021
Counting Cells of Order-k Voronoi Tessellations in ℝ³ with Morse Theory.
Proceedings of the 37th International Symposium on Computational Geometry, 2021

2017
Is there any polynomial upper bound for the universal labeling of graphs?
J. Comb. Optim., 2017

2015
A Bounded Budget Network Creation Game.
ACM Trans. Algorithms, 2015

2011
White Space Regions.
Proceedings of the SOFSEM 2011: Theory and Practice of Computer Science, 2011


  Loading...