Didem Gözüpek
According to our database^{1},
Didem Gözüpek
authored at least 49 papers
between 2006 and 2020.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis OtherLinks
Homepages:

at orcid.org
On csauthors.net:
Bibliography
2020
Switching CostAware Joint Frequency Assignment and Scheduling for Industrial Cognitive Radio Networks.
IEEE Trans. Ind. Informatics, 2020
Parameterized complexity of finding a spanning tree with minimum reload cost diameter.
Networks, 2020
IET Commun., 2020
Discret. Math., 2020
2019
Joint Optimization of Cash Management and Routing for NewGeneration Automated Teller Machine Networks.
IEEE Trans. Syst. Man Cybern. Syst., 2019
Networks, 2019
Networks, 2019
Energy efficient virtual network embedding for federated softwaredefined networks.
Int. J. Commun. Syst., 2019
IET Commun., 2019
Discret. Appl. Math., 2019
CoRR, 2019
Proceedings of the SOFSEM 2019: Theory and Practice of Computer Science, 2019
Proceedings of the Mathematical Aspects of Computer and Information Sciences, 2019
2018
Discret. Math. Theor. Comput. Sci., 2018
Discret. Math. Theor. Comput. Sci., 2018
Discret. Math., 2018
CoRR, 2018
2017
Parameterized complexity of the MINCCA problem on graphs of bounded decomposability.
Theor. Comput. Sci., 2017
RAIRO Oper. Res., 2017
Characterizations of minimal dominating sets and the welldominated property in lexicographic product graphs.
Discret. Math. Theor. Comput. Sci., 2017
CoRR, 2017
CoRR, 2017
Comput. Networks, 2017
Secure virtual network embedding with flexible bandwidthbased revenue maximization.
Comput. Networks, 2017
2016
Theor. Comput. Sci., 2016
Discret. Math., 2016
CoRR, 2016
Proceedings of the 2016 IEEE/IFIP Network Operations and Management Symposium, 2016
2015
IEEE/ACM Trans. Netw., 2015
Comput. Networks, 2015
Proceedings of the 23rd International Conference on Software, 2015
Proceedings of the 2015 IEEE Symposium on Computers and Communication, 2015
Edge Coloring with Minimum Reload/Changeover Costs.
Proceedings of the 13th Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2015
Equimatchable Graphs are C_2k+1free for k ≥ 4.
Proceedings of the 13th Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2015
An Extension of Dirac's Theorem on Hamiltonicity.
Proceedings of the 13th Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2015
2014
Theor. Comput. Sci., 2014
Channel Switching CostAware Resource Allocation for Multihop Cognitive Radio Networks with a Single Transceiver.
Proceedings of the Ad Hoc Networks  6th International ICST Conference, 2014
2013
A Spectrum Switching DelayAware Scheduling Algorithm for Centralized Cognitive Radio Networks.
IEEE Trans. Mob. Comput., 2013
CoRR, 2013
2012
IEEE Trans. Veh. Technol., 2012
2011
Genetic algorithmbased scheduling in cognitive radio networks under interference temperature constraints.
Int. J. Commun. Syst., 2011
An Auction Theory Based Algorithm for Throughput Maximizing Scheduling in Centralized Cognitive Radio Networks.
IEEE Commun. Lett., 2011
2010
An interference aware throughput maximizing scheduler for centralized cognitive radio networks.
Proceedings of the IEEE 21st International Symposium on Personal, 2010
2009
Throughput and delay optimal scheduling in cognitive radio networks under interference temperature constraints.
J. Commun. Networks, 2009
Proceedings of the 24th International Symposium on Computer and Information Sciences, 2009
2008
Proceedings of the Next Generation Teletraffic and Wired/Wireless Advanced Networking, 2008
A novel handover protocol to prevent hidden node problem in satellite assisted cognitive radio networks.
Proceedings of the Third International Symposium on Wireless Pervasive Computing, 2008
2006
Enhancing quality of service provisioning in wireless ad hoc networks using service vector paradigm.
Wirel. Commun. Mob. Comput., 2006
Proceedings of IEEE International Conference on Communications, 2006