## JOURNALS (SCI/SCI-E)

**[J38]**M.Detlaff,__D.Gözüpek__, J.Raczek, "Paired domination versus domination and packing number in graphs", accepted to*Journal of Combinatorial Optimization*, 2022.**[J37]**H.Alizadeh,__D.Gözüpek__, "Upper paired domination versus upper domination", accepted to*Discrete Mathematics and Theoretical Computer Science*, 2021.**[J36]**Y.Büyükçolak,__D.Gözüpek__, S.Özkan, "Triangle-free equimatchable graphs", accepted to*Journal of Graph Theory*, 2021.**[J35]**S.Bahadır,__D.Gözüpek__, O.Doğan, "On graphs all of whose total dominating sequences have the same length", accepted to*Discrete Mathematics*, 2021.**[J34]**S.Bahadır, T.Ekim,__D.Gözüpek__, "Well-totally-dominated graphs", accepted to*Ars Mathematica Contemporanea*, 2021.**[J33]**J.Baste,__D.Gözüpek__, M.Shalom, D.M.Thilikos, "Minimum reload cost graph factors", accepted to*Theory of Computing Systems*, 2020.**[J32]**Y.Büyükçolak,__D.Gözüpek__,S.Özkan, "Equimatchable bipartite graphs", accepted to*Discussiones Mathematicae Graph Theory*, 2020.**[J31]**H.Alizadeh,__D.Gözüpek__, "Signaling cost-aware routing for green networks", accepted to*IET Communications*, 2020.**[J30]**H.Alizadeh, G.Boruzanlı-Ekinci,__D.Gözüpek__, "(C_{3}, C_{4}, C_{5}, C_{7})-free almost well-dominated graphs", accepted to*Discussiones Mathematicae Graph Theory*, 2020.**[J29]**H.Alizadeh__D.Gözüpek__, "Almost well-dominated bipartite graphs with minimum degree at least two", accepted to*RAIRO-Operations Research*, 2020.**[J28]**T.Ekim__D.Gözüpek__, A.Hujdurovic, M.Milanic, "Mind the independence gap", accepted to*Discrete Mathematics*, 2020.**[J27]**J.Baste__D.Gözüpek__, C.Paul, I.Sau, M.Shalom, D.M.Thilikos, "Parameterized complexity of finding a spanning tree with minimum reload cost diameter", accepted to*Networks*, 2019.**[J26]**S.Demirci,__D.Gözüpek__, "Switching cost-aware joint frequency assignment and scheduling for industrial cognitive radio networks", accepted to*IEEE Transactions on Industrial Informatics*, 2019.**[J25]**U.Odabaşı, H.Alizadeh,__D.Gözüpek__, "Energy-fair and flexible bandwidth-based routing in multi-domain green networks", accepted to*IET Communications*, 2019.**[J24]**Y.Büyükçolak,__D.Gözüpek__, S.Özkan, "Minimum reload cost cycle cover in complete graphs", accepted to*Networks*, 2019.**[J23]**M.H.Dahir, H.Alizadeh,__D.Gözüpek__, "Energy efficient virtual network embedding for federated software defined networks", accepted to*International Journal of Communication Systems*, 2018. (pdf)**[J22]**T.Ekim,__D.Gözüpek__, A.Hujdurovic, M.Milanic, "On almost well-covered graphs of girth at least 6",*Discrete Mathematics and Theoretical Computer Science*, vol.20, no.2, 2018. (pdf)**[J21]**__D.Gözüpek__, M.Shalom, "Complexity of edge coloring with minimum reload/changeover costs", accepted to*Networks*, 2018. (pdf)**[J20]**S.Akbari, H.Alizadeh, T.Ekim,__D.Gözüpek__, M.Shalom, "Equimatchable claw-free graphs",*Discrete Mathematics*, vol.341, no.10, pp.2859-2871, 2018. (pdf)**[J19]**S.Bahadır,__D.Gözüpek__, "On a class of graphs with large total domination number",*Discrete Mathematics and Theoretical Computer Science*, vol.20, no.1, 2018. (pdf)**[J18]**__D.Gözüpek__, A.Hujdurovic, M.Milanic, "Characterizations of minimal dominating sets and the well-dominated property in lexicographic product graphs",*Discrete Mathematics and Theoretical Computer Science*, vol.19, no.1, 2017. (pdf)**[J17]**Ş.Batı,__D.Gözüpek__, "Joint optimization of cash management and routing for new-generation automated teller machine networks", accepted to*IEEE Transactions on Systems, Man, and Cybernetics: Systems*, 2017. (pdf)**[J16]**__D.Gözüpek__, S.Özkan, C.Paul, I.Sau, M.Shalom, "Parameterized complexity of the MINCCA problem on graphs of bounded decomposability",*Theoretical Computer Science*, vol.690, pp.91-103, 2017. (pdf)**[J15]**Y.Büyükçolak,__D.Gözüpek__, S.Özkan, M.Shalom, "On one extension of Dirac's theorem on Hamiltonicity", accepted to*Discrete Applied Mathematics*, 2017. (pdf)**[J14]**N.Chiarelli, C.Dibek, T.Ekim,__D.Gözüpek__, S.Miklavic, "On matching extendability of lexicographic products",*RAIRO-Operations Research*, vol.51, no.3, pp.857-873, 2017. (pdf)**[J13]**M.F.Tüysüz, Z.K.Ankaralı,__D.Gözüpek__, "A survey on energy efficiency in software defined networks",*Computer Networks*, vol.113, pp.188-204, 2017. (pdf)**[J12]**C.Beşiktaş,__D.Gözüpek__, A.Ulaş, E.Lokman, "Secure virtual network embedding with flexible bandwidth-based revenue maximization",*Computer Networks*, vol.121, pp.89-99, 2017. (pdf)**[J11]**C.Dibek, T.Ekim,__D.Gözüpek__, M.Shalom, "Equimatchable graphs are C_{2k+1}-free for k ≥ 4",*Discrete Mathematics*, vol.339, no.12, pp.2964-2969, 2016. (pdf)**[J10]**__D.Gözüpek__, H.Shachnai, M.Shalom, S.Zaks, "Constructing minimum changeover cost arborescences in bounded treewidth graphs",*Theoretical Computer Science*, vol.621, pp.22-36, 2016. (pdf)**[J9]**F.Ekici,__D.Gözüpek__, "Joint overlay routing and relay assignment for green networks",*Computer Networks*, vol.79, pp.323-344, 2015. (pdf)**[J8]**__D.Gözüpek__, M.Shalom, F.Alagöz, "A graph-theoretic approach to scheduling in cognitive radio networks",*IEEE/ACM Transactions on Networking*, vol.23, no.1, pp.317-328, 2015. (pdf)**[J7]**__D.Gözüpek__, M.Shalom, A.Voloshin, S.Zaks, "On the complexity of constructing minimum changeover cost arborescences",*Theoretical Computer Science*, vol.540-541, pp.40-52, 2014. (pdf)**[J6]**__D.Gözüpek__, S.Buhari, F.Alagöz, "A spectrum switching delay-aware scheduling algorithm for centralized cognitive radio networks",*IEEE Transactions on Mobile Computing*, vol.12, no.7, pp.1270-1280, 2013. (pdf)**[J5]**__D.Gözüpek__, B.Eraslan, F.Alagöz, "Throughput satisfaction-based scheduling for centralized cognitive radio networks",*IEEE Transactions on Vehicular Technology*, vol.61, no.9, pp.4079-4094, 2012. (pdf)**[J4]**B.Eraslan,__D.Gözüpek__, F.Alagöz, "An auction theory based algorithm for throughput maximizing scheduling in centralized cognitive radio networks",*IEEE Communications Letters*, vol.15, no.7, pp.734-736, 2011. (pdf)**[J3]**__D.Gözüpek__, F.Alagöz, "Genetic algorithm-based scheduling in cognitive radio networks under interference temperature constraints",*Wiley's International Journal of Communication Systems (IJCS)*, vol.24, no.2, pp.239-257, 2011. (pdf)**[J2]**__D.Gözüpek__, F.Alagöz, "Throughput and delay optimal scheduling in cognitive radio networks under interference temperature constraints",*Journal of Communications and Networks (JCN)*, vol.11, no.2, pp.147-155, 2009. (pdf)**[J1]**__D.Gözüpek__, S.Papavassiliou, N.Ansari "Enhancing quality of service provisioning in wireless ad hoc networks using service vector paradigm",*Wiley Journal on Wireless Communications and Mobile Computing (WCMC)*, vol.6, no.7, pp.1003-1015, 2006. (pdf)

## INTERNATIONAL CONFERENCES

**[C22]**Y.Büyükçolak,__D.Gözüpek__, S.Özkan, "Edge-critical equimatchable bipartite graphs",*Proceedings of International Conference on Mathematical Aspects of Computer and Information Sciences (MACIS)*, pp.280-287, Gebze, Kocaeli, Turkey, 2019.**[C21]**J.Baste,__D.Gözüpek__, M.Shalom, D.M.Thilikos, "Minimum reload cost graph factors", accepted to*International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM)*, Nový Smokovec, Slovakia, 2019.**[C20]**J.Baste,__D.Gözüpek__, C.Paul, I.Sau, M.Shalom, D.M.Thilikos, "Parameterized complexity of finding a spanning tree with minimum reload cost diameter", accepted to*International Symposium on Parameterized and Exact Computation (IPEC)*, Vienna, Austria, 2017.**[C19]**__D.Gözüpek__, S.Özkan, C.Paul, I.Sau, M.Shalom, "Parameterized complexity of the MINCCA problem on graphs of bounded decomposability",*International Workshop on Graph-Theoretic Concepts in Computer Science (WG)*, vol.9941, pp.195-206, Istanbul, Turkey, 2016. (pdf)**[C18]**C.Beşiktaş,__D.Gözüpek__, A.Ulaş, E.Lokman, Ö.Özyurt, K.Ulusoy, "Flexible bandwidth-based virtual network embedding",*IEEE Network Operations and Management Symposium (NOMS)*, pp.612-617, Istanbul, Turkey, 2016. (pdf)**[C17]**N.T.Altan Akin,__D.Gözüpek__, "Energy-fair routing in multi-domain green networks",*International Conference on Software, Telecommunications and Computer Networks (SoftCOM)*, Split-Bol (Island of Brac), Croatia, 2015. (pdf)**[C16]**H.Alizadeh,__D.Gözüpek__, S.Buhari, A.Yayimli, "Minimizing signaling cost in green routing for software defined networks",*IEEE International Symposium on Computers and Communications (ISCC)*, Cyprus, 2015. (pdf)**[C15]**__D.Gözüpek__, M.Shalom, "Edge coloring with minimum reload/changeover costs",*Algorithmic Graph Theory on the Adriatic Coast (AGTAC)*, Koper, Slovenia, 2015. (pdf)**[C14]**C.Dibek, T.Ekim,__D.Gözüpek__, M.Shalom, "Equimatchable graphs are C_{2k+1}-free for k ≥ 4",*Cologne-Twente Workshop on Graphs and Combinatorial Optimization*, Istanbul, Turkey, 2015. (pdf)**[C13]**__D.Gözüpek__, H.Shachnai, M.Shalom, S.Zaks, "Constructing minimum changeover cost arborescences in bounded treewidth graphs",*Cologne-Twente Workshop on Graphs and Combinatorial Optimization*, Istanbul, Turkey, 2015. (pdf)**[C12]**__D.Gözüpek__, M.Shalom, "Edge coloring with minimum reload/changeover costs",*Cologne-Twente Workshop on Graphs and Combinatorial Optimization*, Istanbul, Turkey, 2015. (pdf)**[C11]**Y.Büyükçolak,__D.Gözüpek__, S.Özkan, "Extension of Dirac theorem on Hamiltonicity",*Cologne-Twente Workshop on Graphs and Combinatorial Optimization*, Istanbul, Turkey, 2015. (pdf)**[C10]**M.Çamurli,__D.Gözüpek__, "Channel switching cost-aware resource allocation for multi-hop cognitive radio networks with a single transceiver",*International Conference on Ad hoc Networks (ADHOCNETS)*, Rhodes, Greece, 2014. (pdf)**[C9]**M.R.Çelenlioğlu,__D.Gözüpek__, H.A.Mantar, "A survey on the energy efficiency of vertical handover mechanisms",*International Conference on Wireless and Mobile Networks (WiMoN)*, Istanbul, Turkey, 2013. (pdf)**[C8]**__D.Gözüpek__, M.Shalom, A.Voloshin, S.Zaks, "On the complexity of constructing minimum reload cost path-trees", short paper in*International Symposium on Combinatorial Optimization (ISCO)*, Athens, Greece, 2012. (pdf, Full Technical Report)**[C7]**__D.Gözüpek__, F.Alagöz, "An interference aware throughput maximizing scheduler for centralized cognitive radio networks",*IEEE International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC)*, Istanbul, Turkey, 2010. (pdf)**[C6]**__D.Gözüpek__,G.Genç, C.Ersoy, "Channel assignment problem in cellular networks: A reactive tabu search approach",*IEEE International Symposium on Computer and Information Sciences (ISCIS)*, Northern Cyprus, 2009. (pdf)**[C5]**__D.Gözüpek__, F.Alagöz, "Scheduling in cognitive radio networks",*Google Anita Borg Meeting*, Zürich, Switzerland, 2009. (pdf)**[C4]**__D.Gözüpek__, S.Bayhan, F.Alagöz, "A novel handover protocol to prevent hidden node problem in satellite assisted cognitive radio networks",*IEEE International Symposium on Wireless Pervasive Computing (ISWPC)*, Santorini, Greece, 2008. (pdf)**[C3]**__D.Gözüpek__, A.Sever, "Service concentration node in IMS",*Lecture Notes in Computer Science (LNCS), International Conference on Next Generation Teletraffic and Wired/Wireless Advanced Networking (NEW2AN)*, vol.5174, pp.169-176, St.Petersburg, Russia, 2008. (pdf)**[C2]**__D.Gözüpek__, S.Papavassiliou, N.Ansari, J.Yang "A power efficient qos provisioning architecture for wireless ad hoc networks",*IEEE International Conference on Communications (ICC)*, Istanbul, Turkey, 2006. (pdf)**[C1]**__D.Gözüpek__, S.Papavassiliou, N.Ansari "A cross-layer architecture for end-to-end qos provisioning in wireless ad hoc networks",*International Symposium on Communication Systems, Networks, and Digital Signal Processing (CSNDSP)*, Patras, Greece, 2006. (pdf)

## BOOK CHAPTER

**[B1]**__D.Gözüpek__, F.Alagöz, "An opportunistic pervasive networking paradigm: Multi-hop cognitive radio networks",*Chapter 7 in Pervasive Computing and Networking*, John Wiley & Sons, Ltd., UK, 2011. (pdf)

## TECHNICAL REPORT

**[T1]**__D.Gözüpek__, F.Alagöz, "A fair scheduling model for centralized cognitive radio networks", arXiv preprint:1309.2233, 2013.