Didem Gözüpek

According to our database1, Didem Gözüpek authored at least 49 papers between 2006 and 2020.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2020
Switching Cost-Aware 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

Signalling cost-aware routing for green networks.
IET Commun., 2020

Mind the independence gap.
Discret. Math., 2020

2019
Joint Optimization of Cash Management and Routing for New-Generation Automated Teller Machine Networks.
IEEE Trans. Syst. Man Cybern. Syst., 2019

Complexity of edge coloring with minimum reload/changeover costs.
Networks, 2019

Minimum reload cost cycle cover in complete graphs.
Networks, 2019

Energy efficient virtual network embedding for federated software-defined networks.
Int. J. Commun. Syst., 2019

Energy-fair and flexible bandwidth-based routing in multi-domain green networks.
IET Commun., 2019

On one extension of Dirac's theorem on Hamiltonicity.
Discret. Appl. Math., 2019

Paired Domination versus Domination and Packing Number in Graphs.
CoRR, 2019

Minimum Reload Cost Graph Factors.
Proceedings of the SOFSEM 2019: Theory and Practice of Computer Science, 2019

Edge-Critical Equimatchable Bipartite Graphs.
Proceedings of the Mathematical Aspects of Computer and Information Sciences, 2019

2018
On Almost Well-Covered Graphs of Girth at Least 6.
Discret. Math. Theor. Comput. Sci., 2018

On a Class of Graphs with Large Total Domination Number.
Discret. Math. Theor. Comput. Sci., 2018

Equimatchable claw-free graphs.
Discret. Math., 2018

Triangle-Free Equimatchable Graphs.
CoRR, 2018

2017
Parameterized complexity of the MINCCA problem on graphs of bounded decomposability.
Theor. Comput. Sci., 2017

On matching extendability of lexicographic products.
RAIRO Oper. Res., 2017

Characterizations of minimal dominating sets and the well-dominated property in lexicographic product graphs.
Discret. Math. Theor. Comput. Sci., 2017

Almost Well-Covered Graphs Without Short Cycles.
CoRR, 2017

Minimal dominating sets in lexicographic product graphs.
CoRR, 2017

A survey on energy efficiency in software defined networks.
Comput. Networks, 2017

Secure virtual network embedding with flexible bandwidth-based revenue maximization.
Comput. Networks, 2017

2016
Constructing minimum changeover cost arborescenses in bounded treewidth graphs.
Theor. Comput. Sci., 2016

Equimatchable graphs are C<sub>2k+1</sub>-free for k≥4.
Discret. Math., 2016

A Simple Extension of Dirac's Theorem on Hamiltonicity.
CoRR, 2016

Flexible bandwidth-based virtual network embedding.
Proceedings of the 2016 IEEE/IFIP Network Operations and Management Symposium, 2016

2015
A Graph-Theoretic Approach to Scheduling in Cognitive Radio Networks.
IEEE/ACM Trans. Netw., 2015

Joint overlay routing and relay assignment for green networks.
Comput. Networks, 2015

Energy-fair routing in multi-domain green networks.
Proceedings of the 23rd International Conference on Software, 2015

Minimizing signaling cost in green routing for software defined networks.
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+1-free 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
On the complexity of constructing minimum changeover cost arborescences.
Theor. Comput. Sci., 2014

Channel Switching Cost-Aware Resource Allocation for Multi-hop Cognitive Radio Networks with a Single Transceiver.
Proceedings of the Ad Hoc Networks - 6th International ICST Conference, 2014

2013
A Spectrum Switching Delay-Aware Scheduling Algorithm for Centralized Cognitive Radio Networks.
IEEE Trans. Mob. Comput., 2013

A Fair Scheduling Model for Centralized Cognitive Radio Networks.
CoRR, 2013

2012
Throughput Satisfaction-Based Scheduling for Cognitive Radio Networks.
IEEE Trans. Veh. Technol., 2012

2011
Genetic algorithm-based 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

Channel assignment problem in cellular networks: A reactive tabu search approach.
Proceedings of the 24th International Symposium on Computer and Information Sciences, 2009

2008
Service Concentration Node in Internet Multimedia Subsystem (IMS).
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

A Power Efficient QoS Provisioning Architecture for Wireless Ad Hoc Networks.
Proceedings of IEEE International Conference on Communications, 2006


  Loading...