default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDidem Gözüpek
Person information
- affiliation: Gebze Technical University, Turkey
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j39]Yasemin Büyükçolak, Didem Gözüpek, Sibel Özkan:
Well-indumatched Pseudoforests. Discret. Appl. Math. 361: 85-102 (2025)- 2023
- [j38]Yasemin Büyükçolak, Didem Gözüpek, Sibel Özkan:
Equimatchable bipartite graphs. Discuss. Math. Graph Theory 43(1): 77-94 (2023) - 2022
- [j37]Hadi Alizadeh
, Didem Gözüpek, Gülnaz Boruzanli Ekinci:
(C3, C4, C5, C7)-free almost well-dominated graphs. Discuss. Math. Graph Theory 42(4): 1099-1117 (2022) - [j36]Magda Dettlaff, Didem Gözüpek, Joanna Raczek:
Paired domination versus domination and packing number in graphs. J. Comb. Optim. 44(2): 921-933 (2022) - [j35]Yasemin Büyükçolak, Sibel Özkan, Didem Gözüpek:
Triangle-free equimatchable graphs. J. Graph Theory 99(3): 461-484 (2022) - 2021
- [j34]Selim Bahadir, Tínaz Ekim, Didem Gözüpek:
Well-totally-dominated graphs. Ars Math. Contemp. 20(1): 209-222 (2021) - [j33]Selim Bahadir, Didem Gözüpek, Oguz Dogan:
On graphs all of whose total dominating sequences have the same length. Discret. Math. 344(9): 112492 (2021) - [j32]Hadi Alizadeh, Didem Gözüpek:
Upper paired domination versus upper domination. Discret. Math. Theor. Comput. Sci. 23(3) (2021) - [j31]Julien Baste, Didem Gözüpek, Mordechai Shalom, Dimitrios M. Thilikos:
Minimum Reload Cost Graph Factors. Theory Comput. Syst. 65(5): 815-838 (2021) - [j30]Hadi Alizadeh, Didem Gözüpek:
Almost well-dominated bipartite graphs with minimum degree at least two. RAIRO Oper. Res. 55(Supplement): S1633-S1646 (2021) - [i18]Hadi Alizadeh, Didem Gözüpek:
Upper paired domination versus upper domination. CoRR abs/2104.02446 (2021) - 2020
- [j29]Tínaz Ekim, Didem Gözüpek, Ademir Hujdurovic, Martin Milanic:
Mind the independence gap. Discret. Math. 343(9): 111943 (2020) - [j28]Hadi Alizadeh, Didem Gözüpek:
Signalling cost-aware routing for green networks. IET Commun. 14(14): 2350-2359 (2020) - [j27]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): 259-277 (2020) - [j26]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): 4365-4377 (2020)
2010 – 2019
- 2019
- [j25]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: 10-16 (2019) - [j24]Ugur Odabasi, Hadi Alizadeh, Didem Gözüpek:
Energy-fair and flexible bandwidth-based routing in multi-domain green networks. IET Commun. 13(18): 3052-3058 (2019) - [j23]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) - [j22]Didem Gözüpek, Mordechai Shalom:
Complexity of edge coloring with minimum reload/changeover costs. Networks 73(3): 344-357 (2019) - [j21]Yasemin Büyükçolak, Didem Gözüpek, Sibel Özkan:
Minimum reload cost cycle cover in complete graphs. Networks 74(3): 274-286 (2019) - [j20]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): 2724-2738 (2019) - [c14]Yasemin Büyükçolak, Didem Gözüpek, Sibel Özkan:
Edge-Critical Equimatchable Bipartite Graphs. MACIS 2019: 280-287 - [c13]Julien Baste, Didem Gözüpek, Mordechai Shalom, Dimitrios M. Thilikos:
Minimum Reload Cost Graph Factors. SOFSEM 2019: 67-80 - [i17]Magda Dettlaff, Didem Gözüpek, Joanna Raczek:
Paired Domination versus Domination and Packing Number in Graphs. CoRR abs/1911.04098 (2019) - 2018
- [j19]Saieed Akbari, Hadi Alizadeh, Tínaz Ekim, Didem Gözüpek, Mordechai Shalom:
Equimatchable claw-free graphs. Discret. Math. 341(10): 2859-2871 (2018) - [j18]Selim Bahadir, Didem Gözüpek:
On a Class of Graphs with Large Total Domination Number. Discret. Math. Theor. Comput. Sci. 20(1) (2018) - [j17]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) - [i16]Yasemin Büyükçolak, Didem Gözüpek, Sibel Özkan:
Triangle-Free Equimatchable Graphs. CoRR abs/1807.09520 (2018) - [i15]Julien Baste, Didem Gözüpek, Mordechai Shalom, Dimitrios M. Thilikos:
Minimum Reload Cost Graph Factors. CoRR abs/1810.11700 (2018) - [i14]Tínaz Ekim, Didem Gözüpek, Ademir Hujdurovic, Martin Milanic:
Mind the Independence Gap. CoRR abs/1812.05316 (2018) - 2017
- [j16]Mehmet Fatih Tüysüz, Zekiye Kubra Ankarali, Didem Gözüpek:
A survey on energy efficiency in software defined networks. Comput. Networks 113: 188-204 (2017) - [j15]Cihangir Besiktas, Didem Gözüpek, Aydin Ulas, Erhan Lokman:
Secure virtual network embedding with flexible bandwidth-based revenue maximization. Comput. Networks 121: 89-99 (2017) - [j14]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) - [j13]Nina Chiarelli, Cemil Dibek, Tínaz Ekim, Didem Gözüpek, Stefko Miklavic:
On matching extendability of lexicographic products. RAIRO Oper. Res. 51(3): 857-873 (2017) - [j12]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: 91-103 (2017) - [c12]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: 3:1-3:12 - [c11]Mohamed Haji Dahir, Hadi Alizadeh, Didem Gözüpek:
Energy efficient virtual network embedding in federated software defined networks. SIU 2017: 1-4 - [i13]Didem Gözüpek, Ademir Hujdurovic, Martin Milanic:
Minimal dominating sets in lexicographic product graphs. CoRR abs/1701.05886 (2017) - [i12]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 abs/1703.01686 (2017) - [i11]Yasemin Büyükçolak, Didem Gözüpek, Sibel Özkan:
Minimum Reload Cost Cycle Cover in Complete Graphs. CoRR abs/1706.05225 (2017) - [i10]Tínaz Ekim, Didem Gözüpek, Ademir Hujdurovic, Martin Milanic:
Almost Well-Covered Graphs Without Short Cycles. CoRR abs/1708.04632 (2017) - 2016
- [j11]Cemil Dibek, Tínaz Ekim, Didem Gözüpek, Mordechai Shalom:
Equimatchable graphs are C2k+1-free for k≥4. Discret. Math. 339(12): 2964-2969 (2016) - [j10]Didem Gözüpek, Hadas Shachnai, Mordechai Shalom, Shmuel Zaks:
Constructing minimum changeover cost arborescenses in bounded treewidth graphs. Theor. Comput. Sci. 621: 22-36 (2016) - [c10]Cihangir Besiktas, Didem Gözüpek, Aydin Ulas, Erhan Lokman, Özcan Özyurt, Kazim Ulusoy:
Flexible bandwidth-based virtual network embedding. NOMS 2016: 612-617 - [c9]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: 195-206 - [i9]Didem Gözüpek, Sibel Özkan, Christophe Paul, Ignasi Sau, Mordechai Shalom:
Parameterized complexity of the MINCCA problem on graphs of bounded decomposability. CoRR abs/1605.00532 (2016) - [i8]Yasemin Büyükçolak, Didem Gözüpek, Sibel Özkan, Mordechai Shalom:
A Simple Extension of Dirac's Theorem on Hamiltonicity. CoRR abs/1606.03687 (2016) - [i7]Saieed Akbari, Hadi Alizadeh, Tínaz Ekim, Didem Gözüpek, Mordechai Shalom:
Equimatchable Claw-Free Graphs. CoRR abs/1607.00476 (2016) - [i6]Didem Gözüpek, Mordechai Shalom:
Edge Coloring with Minimum Reload/Changeover Costs. CoRR abs/1607.06751 (2016) - 2015
- [j9]Fatma Ekici, Didem Gözüpek:
Joint overlay routing and relay assignment for green networks. Comput. Networks 79: 323-344 (2015) - [j8]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): 317-328 (2015) - [c8]Hadi Alizadeh, Didem Gözüpek, Seyed M. Buhari, Aysegül Yayimli:
Minimizing signaling cost in green routing for software defined networks. ISCC 2015: 391-396 - [c7]N. Tugbagül Altan Akin, Didem Gözüpek:
Energy-fair routing in multi-domain green networks. SoftCOM 2015: 6-10 - [i5]Cemil Dibek, Tínaz Ekim, Didem Gözüpek, Mordechai Shalom:
Equimatchable Graphs are C_2k+1-free for k ≥ 4. CTW 2015: 125-128 - [i4]Yasemin Büyükçolak, Didem Gözüpek, Sibel Özkan:
An Extension of Dirac's Theorem on Hamiltonicity. CTW 2015: 149-152 - [i3]Didem Gözüpek, Hadas Shachnai, Mordechai Shalom, Shmuel Zaks:
Constructing Minimum Changeover Cost Arborescenses in Bounded Treewidth Graphs. CTW 2015: 201-204 - [i2]Didem Gözüpek, Mordechai Shalom:
Edge Coloring with Minimum Reload/Changeover Costs. CTW 2015: 205-208 - 2014
- [j7]Didem Gözüpek, Mordechai Shalom, Ariella Voloshin, Shmuel Zaks:
On the complexity of constructing minimum changeover cost arborescences. Theor. Comput. Sci. 540: 40-52 (2014) - [c6]Mustafa Çamurli, Didem Gözüpek:
Channel Switching Cost-Aware Resource Allocation for Multi-hop Cognitive Radio Networks with a Single Transceiver. ADHOCNETS 2014: 158-168 - 2013
- [j6]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): 1270-1280 (2013) - [i1]Didem Gözüpek, Fatih Alagöz:
A Fair Scheduling Model for Centralized Cognitive Radio Networks. CoRR abs/1309.2233 (2013) - 2012
- [b1]Didem Gözüpek:
A scheduling model for centralized cognitive radio networks (Merkezi bilişsel radyo ağları için bir çizelgeleme modeli). Boğaziçi University, Turkey, 2012 - [j5]Didem Gözüpek, Bapak Eraslan, Fatih Alagöz:
Throughput Satisfaction-Based Scheduling for Cognitive Radio Networks. IEEE Trans. Veh. Technol. 61(9): 4079-4094 (2012) - 2011
- [j4]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): 734-736 (2011) - [j3]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): 239-257 (2011) - 2010
- [c5]Didem Gözüpek, Fatih Alagöz:
An interference aware throughput maximizing scheduler for centralized cognitive radio networks. PIMRC 2010: 1527-1532
2000 – 2009
- 2009
- [j2]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): 148-156 (2009) - [c4]Didem Gözüpek, Gaye Genç, Cem Ersoy:
Channel assignment problem in cellular networks: A reactive tabu search approach. ISCIS 2009: 298-303 - 2008
- [c3]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: 693-696 - [c2]Didem Gözüpek, Aziz Sever:
Service Concentration Node in Internet Multimedia Subsystem (IMS). NEW2AN 2008: 169-176 - 2006
- [j1]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: 1003-1015 (2006) - [c1]Didem Gözüpek, Symeon Papavassiliou, Nirwan Ansari, Jie Yang:
A Power Efficient QoS Provisioning Architecture for Wireless Ad Hoc Networks. ICC 2006: 3873-3878
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-04 21:39 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
