VLDB 2026 Research / reviewers in the wild / expert
Nader Jafari Rad
dblp:86/3038
· DBLP profile ↗
20ranked-venue papers
7as first author
2since 2021 · last 2025
0000-0001-7406-1859ORCID · verified
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 19 · 7 first-author · 1 since 2021Systems, architecture and hardware · 1 · 1 since 2021
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | An alternative proposed single error detection algorithm for the single parity check algorithm
Parviz Gharehbagheri, Hamid Haj Seyyed Javadi, Nader Jafari Rad, Hamidreza Bakhshi |
J. Supercomput. | 3 |
| 2021 | Upper bounds on the global offensive alliances in graphs
Nader Jafari Rad |
Discret. Appl. Math. | 1 |
| 2020 | On algorithmic complexity of double Roman domination
Abolfazl Poureidi, Nader Jafari Rad |
Discret. Appl. Math. | 2 |
| 2019 | A new lower bound on the double domination number of a graph
Majid Hajian, Nader Jafari Rad |
Discret. Appl. Math. | 2 |
| 2019 | A characterization of double Roman trees
Michael A. Henning, Nader Jafari Rad |
Discret. Appl. Math. | 2 |
| 2019 | On the complexity of multiple bondage in graphs
Nader Jafari Rad |
Theor. Comput. Sci. | 1 |
| 2019 | A note on the complexity of locating-total domination in graphs
Hadi Rahbani, Nader Jafari Rad, Mohammad-Reza Sadeghi 0001 |
Theor. Comput. Sci. | 2 |
| 2018 | A note on the global offensive alliances in graphs
Nader Jafari Rad |
Discret. Appl. Math. | 1 |
| 2017 | Bounds on the independence number of a graph in terms of order, size and maximum degree
Nader Jafari Rad, Elahe Sharifi |
Discret. Appl. Math. | 1 |
| 2015 | NP-hardness of multiple bondage in graphs
Nader Jafari Rad |
J. Complex. | 1 |
| 2013 | Bounds on neighborhood total domination in graphs
Michael A. Henning, Nader Jafari Rad |
Discret. Appl. Math. | 2 |
| 2013 | A note on the independent domination number in graphs
Nader Jafari Rad, Lutz Volkmann |
Discret. Appl. Math. | 1 |
| 2012 | On 3-yt-vertex critical graphs of diameter three
Mustapha Chellali, Nader Jafari Rad, Abdollah Khodkar |
Discret. Appl. Math. | 2 |
| 2012 | On α-total domination in graphs
Michael A. Henning, Nader Jafari Rad |
Discret. Appl. Math. | 2 |
| 2012 | Locating-total domination in graphs
Michael A. Henning, Nader Jafari Rad |
Discret. Appl. Math. | 2 |
| 2011 | Total domination dot-critical graphs
Michael A. Henning, Nader Jafari Rad |
Discret. Appl. Math. | 2 |
| 2011 | A note on total reinforcement in graphs
Michael A. Henning, Nader Jafari Rad, Joanna Raczek |
Discret. Appl. Math. | 2 |
| 2011 | Unique response Roman domination in graphs
Ehsan Ebrahimi 0001, Nader Jafari Rad, Lutz Volkmann |
Discret. Appl. Math. | 2 |
| 2009 | On total domination vertex critical graphs of high connectivity
Michael A. Henning, Nader Jafari Rad |
Discret. Appl. Math. | 2 |
| 2009 | On the diameter of a domination dot-critical graph
Nader Jafari Rad |
Discret. Appl. Math. | 1 |