default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMorteza Saghafian
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
2020 – today
- 2026
[j12]Ranita Biswas
, Sebastiano Cultrera di Montesano, Ondrej Draganov, Herbert Edelsbrunner, Morteza Saghafian:
On the Size of Chromatic Delaunay Mosaics. Discret. Comput. Geom. 75(1): 24-47 (2026)- [j11]Herbert Edelsbrunner, Alexey Garber, Mohadese Ghafari, Teresa Heiss, Morteza Saghafian:
Flips in two-dimensional hypertriangulations. Eur. J. Comb. 132: 104248 (2026) - [c10]Todor Antic, Aleksa Dzuklevski, Jirí Fiala, Jan Kratochvíl, Giuseppe Liotta, Morteza Saghafian, Maria Saumell, Johannes Zink:
Edge-Constrained Hamiltonian Paths on a Point Set. SOFSEM 2026: 532-546 - [c9]Afrouz Jabal Ameli, Faezeh Motiei, Morteza Saghafian:
On the MST-Ratio: Theoretical Bounds and Complexity of Finding the Maximum. WALCOM 2026: 386-401 - [i19]Todor Antic, Morteza Saghafian, Maria Saumell, Felix Schröder, Josef Tkadlec, Pavel Valtr:
How many times can two minimum spanning trees cross? CoRR abs/2601.20060 (2026) - [i18]Amirreza Mohseni, Mona Mohammadi, Morteza Saghafian, Naser Talebizadeh Sardari:
CurveBench: A Benchmark for Exact Topological Reasoning over Nested Jordan Curves. CoRR abs/2605.14068 (2026) - 2025
- [j10]János Pach, Morteza Saghafian, Patrick Schnider:
Decomposition of geometric graphs into star-forests. Comput. Geom. 129: 102186 (2025) - [j9]Mohammad Mahini, Hamid Beigy, Salman Qadami, Morteza Saghafian:
Simplet-based signatures and approximation in simplicial complexes: Frequency, degree, and centrality. Inf. Sci. 719: 122425 (2025) - [c8]Herbert Edelsbrunner, Alexey Garber, Morteza Saghafian:
On Spheres with k Points Inside. SoCG 2025: 43:1-43:12 - [i17]Adrian Dumitrescu, János Pach, Morteza Saghafian:
Covering Complete Geometric Graphs by Monotone Paths. CoRR abs/2507.10840 (2025) - [i16]Ondrej Draganov, Herbert Edelsbrunner, Sophie Rosenmeier, Morteza Saghafian:
Expected Length of the Euclidean Minimum Spanning Tree and 1-norms of Chromatic Persistence Diagrams in the Plane. CoRR abs/2510.23373 (2025) - [i15]Todor Antic, Aleksa Dzuklevski, Jirí Fiala, Jan Kratochvíl, Giuseppe Liotta, Morteza Saghafian, Maria Saumell, Johannes Zink:
Edge-Constrained Hamiltonian Paths on a Point Set. CoRR abs/2511.22526 (2025) - 2024
- [j8]Herbert Edelsbrunner, Alexey Garber, Mohadese Ghafari, Teresa Heiss, Morteza Saghafian:
On Angles in Higher Order Brillouin Tessellations and Related Tilings in the Plane. Discret. Comput. Geom. 72(1): 29-48 (2024) - [j7]Ranita Biswas, Sebastiano Cultrera di Montesano, Herbert Edelsbrunner, Morteza Saghafian:
Depth in arrangements: Dehn-Sommerville-Euler relations with applications. J. Appl. Comput. Topol. 8(3): 557-578 (2024) - [j6]Ranita Biswas, Sebastiano Cultrera di Montesano, Herbert Edelsbrunner, Morteza Saghafian:
Geometric characterization of the persistence of 1D maps. J. Appl. Comput. Topol. 8(5): 1101-1119 (2024) - [j5]Herbert Edelsbrunner, Alexey Garber, Mohadese Ghafari, Teresa Heiss, Morteza Saghafian, Mathijs Wintraecken:
Brillouin Zones of Integer Lattices and Their Perturbations. SIAM J. Discret. Math. 38(2): 1784-1807 (2024) - [c7]Günter Rote, Moritz Rüber, Morteza Saghafian:
Grid Peeling of Parabolas. SoCG 2024: 76:1-76:18 - [c6]Sebastiano Cultrera di Montesano, Ondrej Draganov, Herbert Edelsbrunner, Morteza Saghafian:
The Euclidean MST-Ratio for Bi-Colored Lattices. GD 2024: 3:1-3:23 - [i14]Günter Rote, Moritz Rüber, Morteza Saghafian:
Grid Peeling of Parabolas. CoRR abs/2402.15787 (2024) - [i13]Hamid Beigy, Mohammad Mahini, Salman Qadami, Morteza Saghafian:
Approximating Simplet Frequency Distribution for Simplicial Complexes. CoRR abs/2402.16777 (2024) - [i12]Sebastiano Cultrera di Montesano, Ondrej Draganov, Herbert Edelsbrunner, Morteza Saghafian:
The Euclidean MST-ratio for Bi-colored Lattices. CoRR abs/2403.10204 (2024) - [i11]Sebastiano Cultrera di Montesano, Ondrej Draganov, Herbert Edelsbrunner, Morteza Saghafian:
Chromatic Topological Data Analysis. CoRR abs/2406.04102 (2024) - [i10]Afrouz Jabal Ameli, Faezeh Motiei, Morteza Saghafian:
The Complexity of Maximizing the MST-ratio. CoRR abs/2409.11079 (2024) - [i9]Herbert Edelsbrunner, Alexey Garber, Morteza Saghafian:
On Spheres with k Points Inside. CoRR abs/2410.21204 (2024) - 2023
- [c5]János Pach, Morteza Saghafian, Patrick Schnider:
Decomposition of Geometric Graphs into Star-Forests. GD (1) 2023: 339-346 - [i8]János Pach, Morteza Saghafian, Patrick Schnider:
Decomposition of Geometric Graphs into Star Forests. CoRR abs/2306.13201 (2023) - [i7]Herbert Edelsbrunner, Alexey Garber, Morteza Saghafian:
Order-2 Delaunay Triangulations Optimize Angles. CoRR abs/2310.18238 (2023) - 2022
- [j4]Mohammad Ali Abam, Mark de Berg, Sina Farahzad, Mir Omid Haji Mirsadeghi, Morteza Saghafian:
Preclustering Algorithms for Imprecise Points. Algorithmica 84(6): 1467-1489 (2022) - [j3]Ranita Biswas, Sebastiano Cultrera di Montesano, Herbert Edelsbrunner, Morteza Saghafian:
Continuous and Discrete Radius Functions on Voronoi Tessellations and Delaunay Mosaics. Discret. Comput. Geom. 67(3): 811-842 (2022) - [i6]Herbert Edelsbrunner, Alexey Garber, Mohadese Ghafari, Teresa Heiss, Morteza Saghafian:
On Angles in Higher Order Brillouin Tessellations and Related Tilings in the Plane. CoRR abs/2204.01076 (2022) - [i5]Herbert Edelsbrunner, Alexey Garber, Mohadese Ghafari, Teresa Heiss, Morteza Saghafian, Mathijs Wintraecken:
Brillouin Zones of Integer Lattices and Their Perturbations. CoRR abs/2204.01077 (2022) - [i4]Ranita Biswas, Sebastiano Cultrera di Montesano, Ondrej Draganov, Herbert Edelsbrunner, Morteza Saghafian:
On the Size of Chromatic Delaunay Mosaics. CoRR abs/2212.03121 (2022) - [i3]Sebastiano Cultrera di Montesano, Ondrej Draganov, Herbert Edelsbrunner, Morteza Saghafian:
Persistent Homology of Chromatic Alpha Complexes. CoRR abs/2212.03128 (2022) - 2021
- [c4]Ranita Biswas, Sebastiano Cultrera di Montesano, Herbert Edelsbrunner, Morteza Saghafian:
Counting Cells of Order-k Voronoi Tessellations in ℝ³ with Morse Theory. SoCG 2021: 16:1-16:15 - 2020
- [c3]Mohammad Ali Abam, Mark de Berg, Sina Farahzad, Mir Omid Haji Mirsadeghi, Morteza Saghafian:
Preclustering Algorithms for Imprecise Points. SWAT 2020: 3:1-3:12
2010 – 2019
- 2017
- [j2]Arash Ahadi, Ali Dehghan, Morteza Saghafian:
Is there any polynomial upper bound for the universal labeling of graphs? J. Comb. Optim. 34(3): 760-770 (2017) - [i2]Arash Ahadi, Ali Dehghan, Morteza Saghafian:
Is there any polynomial upper bound for the universal labeling of graphs? CoRR abs/1701.06685 (2017) - 2015
- [j1]Shayan Ehsani, Saber Shokat Fadaee, MohammadAmin Fazli, Abbas Mehrabian, Sina Sadeghian Sadeghabad, Mohammad Ali Safari, Morteza Saghafian:
A Bounded Budget Network Creation Game. ACM Trans. Algorithms 11(4): 34:1-34:25 (2015) - 2011
- [c2]Shayan Ehsani, MohammadAmin Fazli, Mohammad Ghodsi, MohammadAli Safari, Morteza Saghafian, Mohammad Tavakkoli:
White Space Regions. SOFSEM 2011: 226-237 - [c1]Shayan Ehsani, MohammadAmin Fazli, Abbas Mehrabian, Sina Sadeghian Sadeghabad, MohammadAli Safari, Morteza Saghafian, Saber ShokatFadaee:
On a bounded budget network creation game. SPAA 2011: 207-214 - [i1]Shayan Ehsani, MohammadAmin Fazli, Abbas Mehrabian, Sina Sadeghian Sadeghabad, MohammadAli Safari, Morteza Saghafian, Saber ShokatFadaee:
On a Bounded Budget Network Creation Game. CoRR abs/1111.0554 (2011)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2026-06-12 22:49 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
