Yaşar Diner, Öznur

Profile Picture
Name Variants
Yaşar Diner, Öznur
Yaşar Diner,Ö.
Oznur, Yasar Diner
O. Yaşar Diner
Yasar Diner, Oznur
Y., Öznur
Oznur Yaşar Diner
Yasar Diner,Ö.
Yaşar Diner, Ö.
YAŞAR DINER, ÖZNUR
YAŞAR DINER, Öznur
Y.,Oznur
Yasar Diner,O.
Öznur Yaşar Diner
Yaşar Diner, ÖZNUR
Yaşar Diner, O.
Y., Oznur
Ö. Yaşar Diner
ÖZNUR YAŞAR DINER
Yaşar Diner, Oznur
Yasar Diner,Oznur
Öznur YAŞAR DINER
Diner, Öznur Yaşar
Diner, Oznur Yasar
Diner, Ö.Y.
Job Title
Dr. Öğr. Üyesi
Email Address
oznur.yasar@khas.edu.tr
Main Affiliation
Computer Engineering
Status
Website
ORCID ID
0000-0002-9271-2691
Scopus Author ID
58777832500
Turkish CoHE Profile ID
Google Scholar ID
WoS Researcher ID
AAT-7443-2020
Scholarly Output

17

Articles

9

Citation Count

0

Supervised Theses

1

Filters

20241
Reset filters

Settings

Has files: falseSubject: [No Keyword Available]

Scholarly Output Search Results

Now showing 1 - 1 of 1
  • Thumbnail Image
    Conference Object
    Citation - Scopus: 0
    List 3-Coloring on Comb-Convex and Caterpillar-Convex Bipartite Graphs
    (Springer Science and Business Media Deutschland GmbH, 2024) Baklan Şen,B.; Yaşar Diner, Öznur; Yaşar Diner,Ö.; Erlebach,T.
    Given a graph G= (V, E) and a list of available colors L(v) for each vertex v∈ V, where L(v) ⊆ { 1, 2, …, k}, List k -Coloring refers to the problem of assigning colors to the vertices of G so that each vertex receives a color from its own list and no two neighboring vertices receive the same color. The decision version of the problem List 3-Coloring is NP-complete even for bipartite graphs, and its complexity on comb-convex bipartite graphs has been an open problem. We give a polynomial-time algorithm to solve List 3-Coloring for caterpillar-convex bipartite graphs, a superclass of comb-convex bipartite graphs. We also give a polynomial-time recognition algorithm for the class of caterpillar-convex bipartite graphs. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2024.