Minimizing signaling cost in green routing for software defined networks. - Hadi Alizadeh; Didem Gözüpek; Seyed M. Buhari; Aysegül Yayimli (ISCC, 2015)

Equimatchable claw-free graphs. - Saieed Akbari; Hadi Alizadeh; Tínaz Ekim; Didem Gözüpek; Mordechai Shalom (Discret. Math., 2018)

Energy-fair and flexible bandwidth-based routing in multi-domain green networks. - Ugur Odabasi; Hadi Alizadeh; Didem Gözüpek (IET Commun., 2019)

Energy efficient virtual network embedding for federated software-defined networks. - Mohamed Haji Dahir; Hadi Alizadeh; Didem Gözüpek (Int. J. Commun. Syst., 2019)

Signalling cost-aware routing for green networks. - Hadi Alizadeh; Didem Gözüpek (IET Commun., 2020)

Upper paired domination versus upper domination. - Hadi Alizadeh; Didem Gözüpek (Discret. Math. Theor. Comput. Sci., 2021)

Almost well-dominated bipartite graphs with minimum degree at least two. - Hadi Alizadeh; Didem Gözüpek (RAIRO Oper. Res., 2021)

New structural aspects of domination and independence in graph theory (Çizge kuramında baskınlık ve bağımsızlığın yeni yapısal yönleri) - Hadi Alizadeh (2021)

(C3, C4, C5, C7)-free almost well-dominated graphs. - Hadi Alizadeh; Didem Gözüpek; Gülnaz Boruzanli Ekinci (Discuss. Math. Graph Theory, 2022)

Sharif-STR at SemEval-2024 Task 1: Transformer as a Regression Model for Fine-Grained Scoring of Textual Semantic Relations. - Seyedeh Fatemeh Ebrahimi; Karim Akhavan Azari; Amirmasoud Iravani; Hadi Alizadeh; Zeinab Taghavi 001; Hossein Sameti (SemEval@NAACL, 2024)