
Funding for GRANET mainly comes from both national and international TUBITAK projects. We frequently have openings for postdoctoral researchers and graduate students. In addition to computer engineering, researchers from different background such as mathematics and industrial engineering are also welcome to apply. The available financial package includes salary and conference travel support as well as opportunities for research visits to our collaborators in Europe through our bilateral research projects. Interested candidates should contact Prof. Didem Gözüpek via email by sending their CV and a list of academic references.






G. Boruzanlı Ekinci, C. Bujtás, D. Gözüpek, S. Klavžar, "S-packing chromatic critical graphs", Discrete Applied Mathematics, vol. 385, pp. 77-85, 2026.
D. Gözüpek, I. Peterin, "Grundy packing coloring of graphs", Discrete Applied Mathematics, vol. 371, pp. 17-30, 2025.
Y. Büyükçolak, D. Gözüpek, S. Özkan, "Well-indumatched pseudoforests", Discrete Applied Mathematics, vol. 361, pp. 85-102, 2025.
Y. Büyükçolak, D. Gözüpek, S. Özkan, "Equimatchable bipartite graphs", Discussiones Mathematicae Graph Theory, vol. 43, no. 1, 2023.
M. Detlaff, D. Gözüpek, J. Raczek, "Paired domination versus domination and packing number in graphs", Journal of Combinatorial Optimization, vol. 44, no. 2, pp. 921-033, 2022.
Y. Büyükçolak, D. Gözüpek, S. Özkan, "Triangle-free equimatchable graphs", Journal of Graph Theory, vol. 99, no. 3, pp. 461-484, 2022.
H. Alizadeh, G. Boruzanlı-Ekinci, D. Gözüpek, "(C3, C4, C5, C7)-free almost well-dominated graphs", Discussiones Mathematicae Graph Theory, vol. 42, no. 4, pp. 1099-1117, 2022.
H. Alizadeh, D. Gözüpek, "Upper paired domination versus upper domination", Discrete Mathematics and Theoretical Computer Science, vol. 23, 2021.
S. Bahadır, D. Gözüpek, O. Doğan, "On graphs all of whose total dominating sequences have the same length", Discrete Mathematics, vol. 344, no. 9, 2021.
S. Bahadır, T. Ekim, D. Gözüpek, "Well-totally-dominated graphs", Ars Mathematica Contemporanea, vol. 20, no. 2, 2021.
J. Baste, D. Gözüpek, M. Shalom, D. M. Thilikos, "Minimum reload cost graph factors", Theory of Computing Systems, vol. 65, no. 5, pp. 815-838, 2021.
H. Alizadeh, D. Gözüpek, "Almost well-dominated bipartite graphs with minimum degree at least two", RAIRO-Operations Research, vol. 55, pp. 1633-1646, 2021.
H. Alizadeh, D. Gözüpek, "Signaling cost-aware routing for green networks", IET Communications, vol. 14, no. 4, 2020.
T. Ekim, D. Gözüpek, A. Hujdurovic, M. Milanic, "Mind the independence gap", Discrete Mathematics, vol. 343, no. 9, 2020.
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", Networks, vol. 75, no. 3, pp. 259-277, 2020.
S. Demirci, D. Gözüpek, "Switching cost-aware joint frequency assignment and scheduling for industrial cognitive radio networks", IEEE Transactions on Industrial Informatics, vol. 16, no. 7, pp. 4365-4377, 2019.
U. Odabaşı, H. Alizadeh, D. Gözüpek, "Energy-fair and flexible bandwidth-based routing in multi-domain green networks", IET Communications, vol. 13, no. 18, pp. 3052-3058, 2019.
Y. Büyükçolak, D. Gözüpek, S. Özkan, "Minimum reload cost cycle cover in complete graphs", Networks, vol. 74, no. 3, pp. 274-286, 2019.
M. H. Dahir, H. Alizadeh, D. Gözüpek, "Energy efficient virtual network embedding for federated software defined networks", International Journal of Communication Systems, vol. 32, no. 6, 2019.
D. Gözüpek, M. Shalom, "Complexity of edge coloring with minimum reload/changeover costs", Networks, vol. 73, no. 3, pp. 344-357, 2019.
Y. Büyükçolak, D. Gözüpek, S. Özkan, M. Shalom, "On one extension of Dirac's theorem on Hamiltonicity", Discrete Applied Mathematics, vol. 252, pp. 10-16, 2019.
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.
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.
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.
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.
Ş. Batı, D. Gözüpek, "Joint optimization of cash management and routing for new-generation automated teller machine networks", IEEE Transactions on Systems, Man, and Cybernetics: Systems, vol. 49, no. 12, pp. 2724-2738, 2017.
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.
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.
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.
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.
C. Dibek, T. Ekim, D. Gözüpek, M. Shalom, "Equimatchable graphs are C2k+1-free for k ≥ 4", Discrete Mathematics, vol. 339, no. 12, pp. 2964-2969, 2016.
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.
F. Ekici, D. Gözüpek, "Joint overlay routing and relay assignment for green networks", Computer Networks, vol. 79, pp. 323-344, 2015.
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.
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.
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.
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.
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.
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.
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.
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.
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.
J. Baste, D. Gözüpek, M. Shalom, D. M. Thilikos, "Minimum reload cost graph factors", International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM), Nový Smokovec, Slovakia, 2019.
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", International Symposium on Parameterized and Exact Computation (IPEC), Vienna, Austria, 2017.
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.
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.
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.
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.
D. Gözüpek, M. Shalom, "Edge coloring with minimum reload/changeover costs", Algorithmic Graph Theory on the Adriatic Coast (AGTAC), Koper, Slovenia, 2015.
C. Dibek, T. Ekim, D. Gözüpek, M. Shalom, "Equimatchable graphs are C2k+1-free for k ≥ 4", Cologne-Twente Workshop on Graphs and Combinatorial Optimization, Istanbul, Turkey, 2015.
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.
D. Gözüpek, M. Shalom, "Edge coloring with minimum reload/changeover costs", Cologne-Twente Workshop on Graphs and Combinatorial Optimization, Istanbul, Turkey, 2015.
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.
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.
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.
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.
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.
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.
D. Gözüpek, F. Alagöz, "Scheduling in cognitive radio networks", Google Anita Borg Meeting, Zürich, Switzerland, 2009.
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.
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.
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.
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.
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.
D. Gözüpek, F. Alagöz, "A fair scheduling model for centralized cognitive radio networks", arXiv preprint:1309.2233, 2013.
D. Gözüpek, G. Genç, "Hücresel ağlarda kanal planlama problemine tabu araması yaklaşımı (A tabu search approach to the channel assignment problem in cellular networks)", Conference on Academic Informatics (Akademik Bilişim), Şanlıurfa, Turkey, 2009.