Didem Gözüpek

Publication Activity (10 Years)

Years Active: 2006-2023
Publications (10 Years): 56

Top Topics

Energy Efficiency

Parameterized Complexity

Top Venues

Discret. Math. Theor. Comput. Sci.

Publications

Yasemin Büyükçolak, Didem Gözüpek, Sibel Özkan
Equimatchable bipartite graphs. Discuss. Math. Graph Theory 43 (1) (2023)
Hadi Alizadeh, Didem Gözüpek, Gülnaz Boruzanli Ekinci
)-free almost well-dominated graphs. Discuss. Math. Graph Theory 42 (4) (2022)
Magda Dettlaff, Didem Gözüpek, Joanna Raczek
Paired domination versus domination and packing number in graphs. J. Comb. Optim. 44 (2) (2022)
Yasemin Büyükçolak, Sibel Özkan, Didem Gözüpek
Triangle-free equimatchable graphs. J. Graph Theory 99 (3) (2022)
Selim Bahadir, Tínaz Ekim, Didem Gözüpek
Well-totally-dominated graphs. Ars Math. Contemp. 20 (1) (2021)
Hadi Alizadeh, Didem Gözüpek
Upper paired domination versus upper domination. Discret. Math. Theor. Comput. Sci. 23 (3) (2021)
Selim Bahadir, Didem Gözüpek, Oguz Dogan
On graphs all of whose total dominating sequences have the same length. Discret. Math. 344 (9) (2021)
Hadi Alizadeh, Didem Gözüpek
Almost well-dominated bipartite graphs with minimum degree at least two. RAIRO Oper. Res. 55 (Supplement) (2021)
Hadi Alizadeh, Didem Gözüpek
Upper paired domination versus upper domination. CoRR (2021)
Julien Baste, Didem Gözüpek, Mordechai Shalom, Dimitrios M. Thilikos
Minimum Reload Cost Graph Factors. Theory Comput. Syst. 65 (5) (2021)
Hadi Alizadeh, Didem Gözüpek
Signalling cost-aware routing for green networks. IET Commun. 14 (14) (2020)
Julien Baste, Didem Gözüpek, Christophe Paul, Ignasi Sau, Mordechai Shalom, Dimitrios M. Thilikos
Parameterized complexity of finding a spanning tree with minimum reload cost diameter. Networks 75 (3) (2020)
Tínaz Ekim, Didem Gözüpek, Ademir Hujdurovic, Martin Milanic
Mind the independence gap. Discret. Math. 343 (9) (2020)
Sercan Demirci, Didem Gözüpek
Switching Cost-Aware Joint Frequency Assignment and Scheduling for Industrial Cognitive Radio Networks. IEEE Trans. Ind. Informatics 16 (7) (2020)
Ugur Odabasi, Hadi Alizadeh, Didem Gözüpek
Energy-fair and flexible bandwidth-based routing in multi-domain green networks. IET Commun. 13 (18) (2019)
Mohamed Haji Dahir, Hadi Alizadeh, Didem Gözüpek
Energy efficient virtual network embedding for federated software-defined networks. Int. J. Commun. Syst. 32 (6) (2019)
Seyma Bati, Didem Gözüpek
Joint Optimization of Cash Management and Routing for New-Generation Automated Teller Machine Networks. IEEE Trans. Syst. Man Cybern. Syst. 49 (12) (2019)
Didem Gözüpek, Mordechai Shalom
Complexity of edge coloring with minimum reload/changeover costs. Networks 73 (3) (2019)
Magda Dettlaff, Didem Gözüpek, Joanna Raczek
Paired Domination versus Domination and Packing Number in Graphs. CoRR (2019)
Yasemin Büyükçolak, Didem Gözüpek, Sibel Özkan
Minimum reload cost cycle cover in complete graphs. Networks 74 (3) (2019)
Yasemin Büyükçolak, Didem Gözüpek, Sibel Özkan
Edge-Critical Equimatchable Bipartite Graphs. MACIS (2019)
Julien Baste, Didem Gözüpek, Mordechai Shalom, Dimitrios M. Thilikos
Minimum Reload Cost Graph Factors. SOFSEM (2019)
Yasemin Büyükçolak, Didem Gözüpek, Sibel Özkan, Mordechai Shalom
On one extension of Dirac's theorem on Hamiltonicity. Discret. Appl. Math. 252 (2019)
Saieed Akbari, Hadi Alizadeh, Tínaz Ekim, Didem Gözüpek, Mordechai Shalom
Equimatchable claw-free graphs. Discret. Math. 341 (10) (2018)
Tínaz Ekim, Didem Gözüpek, Ademir Hujdurovic, Martin Milanic
Mind the Independence Gap. CoRR (2018)
Selim Bahadir, Didem Gözüpek
On a Class of Graphs with Large Total Domination Number. Discret. Math. Theor. Comput. Sci. 20 (1) (2018)
Yasemin Büyükçolak, Didem Gözüpek, Sibel Özkan
Triangle-Free Equimatchable Graphs. CoRR (2018)
Tínaz Ekim, Didem Gözüpek, Ademir Hujdurovic, Martin Milanic
On Almost Well-Covered Graphs of Girth at Least 6. Discret. Math. Theor. Comput. Sci. 20 (2) (2018)
Julien Baste, Didem Gözüpek, Mordechai Shalom, Dimitrios M. Thilikos
Minimum Reload Cost Graph Factors. CoRR (2018)
Mehmet Fatih Tüysüz, Zekiye Kubra Ankarali, Didem Gözüpek
A survey on energy efficiency in software defined networks. Comput. Networks 113 (2017)
Yasemin Büyükçolak, Didem Gözüpek, Sibel Özkan
Minimum Reload Cost Cycle Cover in Complete Graphs. CoRR (2017)
Didem Gözüpek, Ademir Hujdurovic, Martin Milanic
Characterizations of minimal dominating sets and the well-dominated property in lexicographic product graphs. Discret. Math. Theor. Comput. Sci. 19 (1) (2017)
Julien Baste, Didem Gözüpek, Christophe Paul, Ignasi Sau, Mordechai Shalom, Dimitrios M. Thilikos
Parameterized Complexity of Finding a Spanning Tree with Minimum Reload Cost Diameter. IPEC (2017)
Didem Gözüpek, Ademir Hujdurovic, Martin Milanic
Minimal dominating sets in lexicographic product graphs. CoRR (2017)
Julien Baste, Didem Gözüpek, Christophe Paul, Ignasi Sau, Mordechai Shalom, Dimitrios M. Thilikos
Parameterized complexity of finding a spanning tree with minimum reload cost diameter. CoRR (2017)
Didem Gözüpek, Sibel Özkan, Christophe Paul, Ignasi Sau, Mordechai Shalom
Parameterized complexity of the MINCCA problem on graphs of bounded decomposability. Theor. Comput. Sci. 690 (2017)
Cihangir Besiktas, Didem Gözüpek, Aydin Ulas, Erhan Lokman
Secure virtual network embedding with flexible bandwidth-based revenue maximization. Comput. Networks 121 (2017)
Mohamed Haji Dahir, Hadi Alizadeh, Didem Gözüpek
Energy efficient virtual network embedding in federated software defined networks. SIU (2017)
Tínaz Ekim, Didem Gözüpek, Ademir Hujdurovic, Martin Milanic
Almost Well-Covered Graphs Without Short Cycles. CoRR (2017)
Nina Chiarelli, Cemil Dibek, Tínaz Ekim, Didem Gözüpek, Stefko Miklavic
On matching extendability of lexicographic products. RAIRO Oper. Res. 51 (3) (2017)
Didem Gözüpek, Hadas Shachnai, Mordechai Shalom, Shmuel Zaks
Constructing minimum changeover cost arborescenses in bounded treewidth graphs. Theor. Comput. Sci. 621 (2016)
Saieed Akbari, Hadi Alizadeh, Tínaz Ekim, Didem Gözüpek, Mordechai Shalom
Equimatchable Claw-Free Graphs. CoRR (2016)
Didem Gözüpek, Mordechai Shalom
Edge Coloring with Minimum Reload/Changeover Costs. CoRR (2016)
Didem Gözüpek, Sibel Özkan, Christophe Paul, Ignasi Sau, Mordechai Shalom
Parameterized Complexity of the MINCCA Problem on Graphs of Bounded Decomposability. WG (2016)
Cihangir Besiktas, Didem Gözüpek, Aydin Ulas, Erhan Lokman, Özcan Özyurt, Kazim Ulusoy
Flexible bandwidth-based virtual network embedding. NOMS (2016)
Didem Gözüpek, Sibel Özkan, Christophe Paul, Ignasi Sau, Mordechai Shalom
Parameterized complexity of the MINCCA problem on graphs of bounded decomposability. CoRR (2016)
Cemil Dibek, Tínaz Ekim, Didem Gözüpek, Mordechai Shalom
-free for k≥4. Discret. Math. 339 (12) (2016)
Yasemin Büyükçolak, Didem Gözüpek, Sibel Özkan, Mordechai Shalom
A Simple Extension of Dirac's Theorem on Hamiltonicity. CoRR (2016)
Didem Gözüpek, Hadas Shachnai, Mordechai Shalom, Shmuel Zaks
Constructing Minimum Changeover Cost Arborescenses in Bounded Treewidth Graphs. CTW (2015)
N. Tugbagul Altan Akin, Didem Gözüpek
Energy-fair routing in multi-domain green networks. SoftCOM (2015)
Didem Gözüpek, Mordechai Shalom
Edge Coloring with Minimum Reload/Changeover Costs. CTW (2015)
Cemil Dibek, Tínaz Ekim, Didem Gözüpek, Mordechai Shalom
Equimatchable Graphs are C_2k+1-free for k ≥ 4. CTW (2015)
Didem Gözüpek, Mordechai Shalom, Fatih Alagöz
A Graph-Theoretic Approach to Scheduling in Cognitive Radio Networks. IEEE/ACM Trans. Netw. 23 (1) (2015)
Fatma Ekici, Didem Gözüpek
Joint overlay routing and relay assignment for green networks. Comput. Networks 79 (2015)
Hadi Alizadeh, Didem Gözüpek, Seyed M. Buhari, Aysegül Yayimli
Minimizing signaling cost in green routing for software defined networks. ISCC (2015)
Yasemin Büyükçolak, Didem Gözüpek, Sibel Özkan
An Extension of Dirac's Theorem on Hamiltonicity. CTW (2015)
Didem Gözüpek, Mordechai Shalom, Ariella Voloshin, Shmuel Zaks
On the complexity of constructing minimum changeover cost arborescences. Theor. Comput. Sci. 540 (2014)
Mustafa Çamurli, Didem Gözüpek
Channel Switching Cost-Aware Resource Allocation for Multi-hop Cognitive Radio Networks with a Single Transceiver. ADHOCNETS (2014)
Didem Gözüpek, Seyed M. Buhari, Fatih Alagöz
A Spectrum Switching Delay-Aware Scheduling Algorithm for Centralized Cognitive Radio Networks. IEEE Trans. Mob. Comput. 12 (7) (2013)
Didem Gözüpek, Fatih Alagöz
A Fair Scheduling Model for Centralized Cognitive Radio Networks. CoRR (2013)
Didem Gözüpek, Bapak Eraslan, Fatih Alagöz
Throughput Satisfaction-Based Scheduling for Cognitive Radio Networks. IEEE Trans. Veh. Technol. 61 (9) (2012)
Didem Gözüpek, Fatih Alagöz
Genetic algorithm-based scheduling in cognitive radio networks under interference temperature constraints. Int. J. Commun. Syst. 24 (2) (2011)
Bapak Eraslan, Didem Gözüpek, Fatih Alagöz
An Auction Theory Based Algorithm for Throughput Maximizing Scheduling in Centralized Cognitive Radio Networks. IEEE Commun. Lett. 15 (7) (2011)
Didem Gözüpek, Fatih Alagöz
An interference aware throughput maximizing scheduler for centralized cognitive radio networks. PIMRC (2010)
Didem Gözüpek, Gaye Genç, Cem Ersoy
Channel assignment problem in cellular networks: A reactive tabu search approach. ISCIS (2009)
Didem Gözüpek, Fatih Alagöz
Throughput and delay optimal scheduling in cognitive radio networks under interference temperature constraints. J. Commun. Networks 11 (2) (2009)
Didem Gözüpek, Suzan Bayhan, Fatih Alagöz
A novel handover protocol to prevent hidden node problem in satellite assisted cognitive radio networks. ISWPC (2008)
Didem Gözüpek, Aziz Sever
Service Concentration Node in Internet Multimedia Subsystem (IMS). NEW2AN (2008)
Didem Gözüpek, Symeon Papavassiliou, Nirwan Ansari, Jie Yang
A Power Efficient QoS Provisioning Architecture for Wireless Ad Hoc Networks. ICC (2006)
Didem Gözüpek, Symeon Papavassiliou, Nirwan Ansari
Enhancing quality of service provisioning in wireless ad hoc networks using service vector paradigm. Wirel. Commun. Mob. Comput. 6 (2006)