Abolfazl Poureidi

dblp:177/0490 · DBLP profile ↗
← Back
9ranked-venue papers
8as first author
7since 2021 · last 2024
0000-0002-2506-0590ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 7 · 7 first-author · 6 since 2021Databases, data management, data science and information retrieval · 2 · 2 first-author · 2 since 2021Graphics, computer vision, multimedia, augmented reality and games · 2 · 1 first-author · 1 since 2021
YearPublicationVenuePosition
2024 On algorithmic complexity of imprecise spanners
Abolfazl Poureidi, Mohammad Farshi
Comput. Geom.1
2023 Counting independent sets in tricyclic graphs
Abolfazl Poureidi
Discret. Appl. Math.1
2023 Algorithmic results on locating-total domination in graphs
Abolfazl Poureidi, Mohammad Farshi
Discret. Appl. Math.1
2023 Algorithmic results in Roman dominating functions on graphs
Abolfazl Poureidi, Jafar Fathali
Inf. Process. Lett.1
2022 On computing the number of (BC-)subtrees, eccentric subtree number, and global and local means of trees
Abolfazl Poureidi
Inf. Process. Lett.1
2022 Algorithm and hardness results in double Roman domination of graphs
Abolfazl Poureidi
Theor. Comput. Sci.1
2022 Algorithmic results in secure total dominating sets on graphs
Abolfazl Poureidi
Theor. Comput. Sci.1
2020 On algorithmic complexity of double Roman domination
Abolfazl Poureidi, Nader Jafari Rad
Discret. Appl. Math.1
2016 A lower bound for computing geometric spanners
Mohammad Farshi, Abolfazl Poureidi
Comput. Geom.2