受强制性开放获取政策约束的文章 - Didem Gözüpek了解详情
无法在其他位置公开访问的文章：1 篇
On graphs all of whose total dominating sequences have the same length
S Bahadır, D Gözüpek, O Doğan
Discrete Mathematics 344 (9), 112492, 2021
强制性开放获取政策： Scientific and Technological Research Council of Turkey
可在其他位置公开访问的文章：14 篇
Characterizations of minimal dominating sets and the well-dominated property in lexicographic product graphs
D Gözüpek, A Hujdurović, M Milanič
Discrete Mathematics & Theoretical Computer Science 19 (Graph Theory), 2017
强制性开放获取政策： Slovenian Research Agency
On almost well-covered graphs of girth at least 6
T Ekim, D Gözüpek, A Hujdurović, M Milanič
Discrete Mathematics & Theoretical Computer Science 20 (Graph Theory), 2018
强制性开放获取政策： Slovenian Research Agency
Triangle‐free equimatchable graphs
Y Büyükçolak, S Özkan, D Gözüpek
Journal of Graph Theory 99 (3), 461-484, 2022
强制性开放获取政策： Scientific and Technological Research Council of Turkey
Equimatchable Bipartite Graphs.
Y Büyükçolak, D Gözüpek, S Özkan
Discussiones Mathematicae: Graph Theory 43 (1), 2023
强制性开放获取政策： Scientific and Technological Research Council of Turkey
Parameterized complexity of finding a spanning tree with minimum reload cost diameter
J Baste, D Gözüpek, C Paul, I Sau, M Shalom, DM Thilikos
Networks 75 (3), 259-277, 2020
强制性开放获取政策： Agence Nationale de la Recherche, Scientific and Technological Research …
Paired domination versus domination and packing number in graphs
M Dettlaff, D Gözüpek, J Raczek
Journal of Combinatorial Optimization 44 (2), 921-933, 2022
强制性开放获取政策： Scientific and Technological Research Council of Turkey
Minimum reload cost graph factors
J Baste, D Gözüpek, M Shalom, DM Thilikos
Theory of Computing Systems 65 (5), 815-838, 2021
强制性开放获取政策： German Research Foundation, Research Council of Norway, Agence Nationale de …
Upper paired domination versus upper domination
H Alizadeh, D Gözüpek
Discrete Mathematics & Theoretical Computer Science 23 (Graph Theory), 2021
强制性开放获取政策： Scientific and Technological Research Council of Turkey
Almost well-dominated bipartite graphs with minimum degree at least two
H Alizadeh, D Gözüpek
RAIRO-Operations Research 55, S1633-S1646, 2021
强制性开放获取政策： Scientific and Technological Research Council of Turkey
On matching extendability of lexicographic products
N Chiarelli, C Dibek, T Ekim, D Gözüpek, Š Miklavič
RAIRO-Operations Research 51 (3), 857-873, 2017
强制性开放获取政策： Slovenian Research Agency
(C3, C4, C5, C7)-Free Almost Well-Dominated Graphs
H Alizadeh, D Gözüpek, GB Ekinci
Discussiones Mathematicae Graph Theory 42 (4), 1099-1117, 2022
强制性开放获取政策： Scientific and Technological Research Council of Turkey
Mind the independence gap
T Ekim, D Gözüpek, A Hujdurović, M Milanič
Discrete Mathematics 343 (9), 111943, 2020
强制性开放获取政策： Slovenian Research Agency, Scientific and Technological Research Council of …
Signalling cost‐aware routing for green networks
H Alizadeh, D Gözüpek
IET Communications 14 (14), 2350-2359, 2020
强制性开放获取政策： Scientific and Technological Research Council of Turkey
Almost Well-Covered Graphs Without Short Cycles
T Ekim, D Gözüpek, A Hujdurovic, M Milanic
arXiv preprint arXiv:1708.04632, 2017
强制性开放获取政策： Slovenian Research Agency
出版信息和资助信息由计算机程序自动确定