A Power Efficient QoS Provisioning Architecture for Wireless Ad Hoc Networks. - Didem Gözüpek; Symeon Papavassiliou; Nirwan Ansari; Jie Yang 008 (ICC, 2006)

Enhancing quality of service provisioning in wireless ad hoc networks using service vector paradigm. - Didem Gözüpek; Symeon Papavassiliou; Nirwan Ansari (Wirel. Commun. Mob. Comput., 2006)

A novel handover protocol to prevent hidden node problem in satellite assisted cognitive radio networks. - Didem Gözüpek; Suzan Bayhan; Fatih Alagöz (ISWPC, 2008)

Service Concentration Node in Internet Multimedia Subsystem (IMS). - Didem Gözüpek; Aziz Sever (NEW2AN, 2008)

Channel assignment problem in cellular networks: A reactive tabu search approach. - Didem Gözüpek; Gaye Genç; Cem Ersoy (ISCIS, 2009)

Throughput and delay optimal scheduling in cognitive radio networks under interference temperature constraints. - Didem Gözüpek; Fatih Alagöz (J. Commun. Networks, 2009)

An interference aware throughput maximizing scheduler for centralized cognitive radio networks. - Didem Gözüpek; Fatih Alagöz (PIMRC, 2010)

An Auction Theory Based Algorithm for Throughput Maximizing Scheduling in Centralized Cognitive Radio Networks. - Bapak Eraslan; Didem Gözüpek; Fatih Alagöz (IEEE Commun. Lett., 2011)

Genetic algorithm-based scheduling in cognitive radio networks under interference temperature constraints. - Didem Gözüpek; Fatih Alagöz (Int. J. Commun. Syst., 2011)

Throughput Satisfaction-Based Scheduling for Cognitive Radio Networks. - Didem Gözüpek; Bapak Eraslan; Fatih Alagöz (IEEE Trans. Veh. Technol., 2012)

A scheduling model for centralized cognitive radio networks (Merkezi bilişsel radyo ağları için bir çizelgeleme modeli) - Didem Gözüpek (2012)

A Fair Scheduling Model for Centralized Cognitive Radio Networks. - Didem Gözüpek; Fatih Alagöz (CoRR, 2013)

A Spectrum Switching Delay-Aware Scheduling Algorithm for Centralized Cognitive Radio Networks. - Didem Gözüpek; Seyed M. Buhari; Fatih Alagöz (IEEE Trans. Mob. Comput., 2013)

Channel Switching Cost-Aware Resource Allocation for Multi-hop Cognitive Radio Networks with a Single Transceiver. - Mustafa Çamurli; Didem Gözüpek (ADHOCNETS, 2014)

On the complexity of constructing minimum changeover cost arborescences. - Didem Gözüpek; Mordechai Shalom; Ariella Voloshin; Shmuel Zaks (Theor. Comput. Sci., 2014)

An Extension of Dirac's Theorem on Hamiltonicity. - Yasemin Büyükçolak; Didem Gözüpek; Sibel Özkan (CTW, 2015)

Equimatchable Graphs are C_2k+1-free for k ≥ 4. - Cemil Dibek; Tínaz Ekim; Didem Gözüpek; Mordechai Shalom (CTW, 2015)

Edge Coloring with Minimum Reload/Changeover Costs. - Didem Gözüpek; Mordechai Shalom (CTW, 2015)

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

Energy-fair routing in multi-domain green networks. - N. Tugbagül Altan Akin; Didem Gözüpek (SoftCOM, 2015)

Joint overlay routing and relay assignment for green networks. - Fatma Ekici; Didem Gözüpek (Comput. Networks, 2015)

A Graph-Theoretic Approach to Scheduling in Cognitive Radio Networks. - Didem Gözüpek; Mordechai Shalom; Fatih Alagöz (IEEE/ACM Trans. Netw., 2015)

Flexible bandwidth-based virtual network embedding. - Cihangir Besiktas; Didem Gözüpek; Aydin Ulas; Erhan Lokman; Özcan Özyurt; Kazim Ulusoy (NOMS, 2016)

A Simple Extension of Dirac's Theorem on Hamiltonicity. - Yasemin Büyükçolak; Didem Gözüpek; Sibel Özkan; Mordechai Shalom (CoRR, 2016)

Equimatchable graphs are C2k+1-free for k≥4. - Cemil Dibek; Tínaz Ekim; Didem Gözüpek; Mordechai Shalom (Discret. Math., 2016)

Constructing minimum changeover cost arborescenses in bounded treewidth graphs. - Didem Gözüpek; Hadas Shachnai; Mordechai Shalom; Shmuel Zaks (Theor. Comput. Sci., 2016)

Secure virtual network embedding with flexible bandwidth-based revenue maximization. - Cihangir Besiktas; Didem Gözüpek; Aydin Ulas; Erhan Lokman (Comput. Networks, 2017)

A survey on energy efficiency in software defined networks. - Mehmet Fatih Tüysüz; Zekiye Kubra Ankarali; Didem Gözüpek (Comput. Networks, 2017)

Minimal dominating sets in lexicographic product graphs. - Didem Gözüpek; Ademir Hujdurovic; Martin Milanic (CoRR, 2017)

Almost Well-Covered Graphs Without Short Cycles. - Tínaz Ekim; Didem Gözüpek; Ademir Hujdurovic; Martin Milanic (CoRR, 2017)

Characterizations of minimal dominating sets and the well-dominated property in lexicographic product graphs. - Didem Gözüpek; Ademir Hujdurovic; Martin Milanic (Discret. Math. Theor. Comput. Sci., 2017)

On matching extendability of lexicographic products. - Nina Chiarelli; Cemil Dibek; Tínaz Ekim; Didem Gözüpek; Stefko Miklavic (RAIRO Oper. Res., 2017)

Parameterized complexity of the MINCCA problem on graphs of bounded decomposability. - Didem Gözüpek; Sibel Özkan; Christophe Paul; Ignasi Sau; Mordechai Shalom (Theor. Comput. Sci., 2017)

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

On a Class of Graphs with Large Total Domination Number. - Selim Bahadir; Didem Gözüpek (Discret. Math. Theor. Comput. Sci., 2018)

On Almost Well-Covered Graphs of Girth at Least 6. - Tínaz Ekim; Didem Gözüpek; Ademir Hujdurovic; Martin Milanic (Discret. Math. Theor. Comput. Sci., 2018)

Edge-Critical Equimatchable Bipartite Graphs. - Yasemin Büyükçolak; Didem Gözüpek; Sibel Özkan (MACIS, 2019)

On one extension of Dirac's theorem on Hamiltonicity. - Yasemin Büyükçolak; Didem Gözüpek; Sibel Özkan; Mordechai Shalom (Discret. Appl. Math., 2019)

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)

Minimum reload cost cycle cover in complete graphs. - Yasemin Büyükçolak; Didem Gözüpek; Sibel Özkan (Networks, 2019)

Complexity of edge coloring with minimum reload/changeover costs. - Didem Gözüpek; Mordechai Shalom (Networks, 2019)

Joint Optimization of Cash Management and Routing for New-Generation Automated Teller Machine Networks. - Seyma Bati; Didem Gözüpek (IEEE Trans. Syst. Man Cybern. Syst., 2019)

Mind the independence gap. - Tínaz Ekim; Didem Gözüpek; Ademir Hujdurovic; Martin Milanic (Discret. Math., 2020)

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

Parameterized complexity of finding a spanning tree with minimum reload cost diameter. - Julien Baste; Didem Gözüpek; Christophe Paul; Ignasi Sau; Mordechai Shalom; Dimitrios M. Thilikos (Networks, 2020)

Switching Cost-Aware Joint Frequency Assignment and Scheduling for Industrial Cognitive Radio Networks. - Sercan Demirci; Didem Gözüpek (IEEE Trans. Ind. Informatics, 2020)

Well-totally-dominated graphs. - Selim Bahadir; Tínaz Ekim; Didem Gözüpek (Ars Math. Contemp., 2021)

On graphs all of whose total dominating sequences have the same length. - Selim Bahadir; Didem Gözüpek; Oguz Dogan (Discret. Math., 2021)

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

Minimum Reload Cost Graph Factors. - Julien Baste; Didem Gözüpek; Mordechai Shalom; Dimitrios M. Thilikos (Theory Comput. Syst., 2021)

Almost well-dominated bipartite graphs with minimum degree at least two. - Hadi Alizadeh; Didem Gözüpek (RAIRO Oper. Res., 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)

Paired domination versus domination and packing number in graphs. - Magda Dettlaff; Didem Gözüpek; Joanna Raczek (J. Comb. Optim., 2022)

Triangle-free equimatchable graphs. - Yasemin Büyükçolak; Sibel Özkan; Didem Gözüpek (J. Graph Theory, 2022)

Equimatchable bipartite graphs. - Yasemin Büyükçolak; Didem Gözüpek; Sibel Özkan (Discuss. Math. Graph Theory, 2023)

Well-indumatched Pseudoforests. - Yasemin Büyükçolak; Didem Gözüpek; Sibel Özkan (Discret. Appl. Math., 2025)

Grundy packing coloring of graphs. - Didem Gözüpek; Iztok Peterin (Discret. Appl. Math., 2025)