Didem Gözüpek

74 papers B 5C 5Misc 1Journal 55Unranked 7

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