Didem Gözüpek

Discret. Appl. Math., 2025

2023

Equimatchable bipartite graphs.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2023

2022

Triangle-free equimatchable graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2022

Paired domination versus domination and packing number in graphs.

[BibT_eX]

[DOI]

Magda Dettlaff

Joanna Raczek

J. Comb. Optim., 2022

(C3, C4, C5, C7)-free almost well-dominated graphs.

[BibT_eX]

[DOI]

Gülnaz Boruzanli Ekinci

Discuss. Math. Graph Theory, 2022

2021

Almost well-dominated bipartite graphs with minimum degree at least two.

[BibT_eX]

[DOI]

RAIRO Oper. Res., 2021

Minimum Reload Cost Graph Factors.

[BibT_eX]

[DOI]

Julien Baste

Dimitrios M. Thilikos

Theory Comput. Syst., 2021

Upper paired domination versus upper domination.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2021

On graphs all of whose total dominating sequences have the same length.

[BibT_eX]

[DOI]

Selim Bahadir

Oguz Dogan

Discret. Math., 2021

Well-totally-dominated graphs.

[BibT_eX]

[DOI]

Selim Bahadir

Tínaz Ekim

Ars Math. Contemp., 2021

2020

Switching Cost-Aware Joint Frequency Assignment and Scheduling for Industrial Cognitive Radio Networks.

[BibT_eX]

[DOI]

Sercan Demirci

IEEE Trans. Ind. Informatics, 2020

Parameterized complexity of finding a spanning tree with minimum reload cost diameter.

[BibT_eX]

[DOI]

Dimitrios M. Thilikos

Networks, 2020

Signalling cost-aware routing for green networks.

[BibT_eX]

[DOI]

IET Commun., 2020

Mind the independence gap.

[BibT_eX]

[DOI]

Discret. Math., 2020

2019

Joint Optimization of Cash Management and Routing for New-Generation Automated Teller Machine Networks.

[BibT_eX]

[DOI]

Seyma Bati

IEEE Trans. Syst. Man Cybern. Syst., 2019

Complexity of edge coloring with minimum reload/changeover costs.

[BibT_eX]

[DOI]

Networks, 2019

Minimum reload cost cycle cover in complete graphs.

[BibT_eX]

[DOI]

Networks, 2019

Energy efficient virtual network embedding for federated software-defined networks.

[BibT_eX]

[DOI]

Mohamed Haji Dahir

Int. J. Commun. Syst., 2019

Energy-fair and flexible bandwidth-based routing in multi-domain green networks.

[BibT_eX]

[DOI]

Ugur Odabasi

IET Commun., 2019

On one extension of Dirac's theorem on Hamiltonicity.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2019

Edge-Critical Equimatchable Bipartite Graphs.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Aspects of Computer and Information Sciences, 2019

2018

On Almost Well-Covered Graphs of Girth at Least 6.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2018

On a Class of Graphs with Large Total Domination Number.

[BibT_eX]

[DOI]

Selim Bahadir

Discret. Math. Theor. Comput. Sci., 2018

Equimatchable claw-free graphs.

[BibT_eX]

[DOI]

Discret. Math., 2018

2017

Parameterized complexity of the MINCCA problem on graphs of bounded decomposability.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2017

On matching extendability of lexicographic products.

[BibT_eX]

[DOI]

RAIRO Oper. Res., 2017

Characterizations of minimal dominating sets and the well-dominated property in lexicographic product graphs.

[BibT_eX]

[DOI]

Ademir Hujdurovic

Martin Milanic

Discret. Math. Theor. Comput. Sci., 2017

Almost Well-Covered Graphs Without Short Cycles.

[BibT_eX]

[DOI]

CoRR, 2017

Minimal dominating sets in lexicographic product graphs.

[BibT_eX]

[DOI]

Ademir Hujdurovic

Martin Milanic

CoRR, 2017

A survey on energy efficiency in software defined networks.

[BibT_eX]

[DOI]

Mehmet Fatih Tüysüz

Zekiye Kubra Ankarali

Comput. Networks, 2017

Secure virtual network embedding with flexible bandwidth-based revenue maximization.

[BibT_eX]

[DOI]

Comput. Networks, 2017

2016

Constructing minimum changeover cost arborescenses in bounded treewidth graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2016

Equimatchable graphs are C2k+1-free for k≥4.

[BibT_eX]

[DOI]

Discret. Math., 2016

A Simple Extension of Dirac's Theorem on Hamiltonicity.

[BibT_eX]

[DOI]

CoRR, 2016

Flexible bandwidth-based virtual network embedding.

[BibT_eX]

[DOI]

Proceedings of the 2016 IEEE/IFIP Network Operations and Management Symposium, 2016

2015

A Graph-Theoretic Approach to Scheduling in Cognitive Radio Networks.

[BibT_eX]

[DOI]

IEEE/ACM Trans. Netw., 2015

Joint overlay routing and relay assignment for green networks.

[BibT_eX]

[DOI]

Fatma Ekici

Comput. Networks, 2015

Energy-fair routing in multi-domain green networks.

[BibT_eX]

[DOI]

N. Tugbagül Altan Akin

Proceedings of the 23rd International Conference on Software, 2015

Minimizing signaling cost in green routing for software defined networks.

[BibT_eX]

[DOI]

Proceedings of the 2015 IEEE Symposium on Computers and Communication, 2015

Edge Coloring with Minimum Reload/Changeover Costs.

[BibT_eX]

Proceedings of the 13th Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2015

Equimatchable Graphs are C_2k+1-free for k ≥ 4.

[BibT_eX]

Proceedings of the 13th Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2015

An Extension of Dirac's Theorem on Hamiltonicity.

[BibT_eX]

Proceedings of the 13th Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2015

2014

On the complexity of constructing minimum changeover cost arborescences.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2014

Channel Switching Cost-Aware Resource Allocation for Multi-hop Cognitive Radio Networks with a Single Transceiver.

[BibT_eX]

[DOI]

Mustafa Çamurli

Proceedings of the Ad Hoc Networks - 6th International ICST Conference, 2014

2013

A Spectrum Switching Delay-Aware Scheduling Algorithm for Centralized Cognitive Radio Networks.

[BibT_eX]

[DOI]

Seyed M. Buhari

IEEE Trans. Mob. Comput., 2013

A Fair Scheduling Model for Centralized Cognitive Radio Networks.

[BibT_eX]

[DOI]

CoRR, 2013

2012

A scheduling model for centralized cognitive radio networks (Merkezi bilişsel radyo ağları için bir çizelgeleme modeli)

[BibT_eX]

[DOI]

PhD thesis, 2012

Throughput Satisfaction-Based Scheduling for Cognitive Radio Networks.

[BibT_eX]

[DOI]

Bapak Eraslan

IEEE Trans. Veh. Technol., 2012

2011

Genetic algorithm-based scheduling in cognitive radio networks under interference temperature constraints.

[BibT_eX]

[DOI]

Int. J. Commun. Syst., 2011

An Auction Theory Based Algorithm for Throughput Maximizing Scheduling in Centralized Cognitive Radio Networks.

[BibT_eX]

[DOI]

Bapak Eraslan

IEEE Commun. Lett., 2011

2010

An interference aware throughput maximizing scheduler for centralized cognitive radio networks.

[BibT_eX]

[DOI]

Proceedings of the IEEE 21st International Symposium on Personal, 2010

2009

Throughput and delay optimal scheduling in cognitive radio networks under interference temperature constraints.

[BibT_eX]

[DOI]

J. Commun. Networks, 2009

Channel assignment problem in cellular networks: A reactive tabu search approach.

[BibT_eX]

[DOI]

Gaye Genç

Cem Ersoy

Proceedings of the 24th International Symposium on Computer and Information Sciences, 2009

2008

Service Concentration Node in Internet Multimedia Subsystem (IMS).

[BibT_eX]

[DOI]

Aziz Sever

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.

[BibT_eX]

[DOI]

Suzan Bayhan

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.

[BibT_eX]

[DOI]