Diner, Öznur Yaşar
38  Ergebnisse:
Personensuche X
?
1

On minimum vertex bisection of random d-regular graphs:

Díaz, Josep ; Diner, Öznur Yaşar ; Serna, Maria.
Journal of Computer and System Sciences.  144 (2024)  - p. 103550 , 2024
 
?
2

The multicolored graph realization problem:

Díaz, Josep ; Diner, Öznur Yaşar ; Serna, Maria.
Discrete Applied Mathematics.  354 (2024)  - p. 146-159 , 2024
 
?
4

Four-searchable biconnected outerplanar graphs:

Diner, Öznur Yaşar ; Dyer, Danny ; Yang, Boting
Discrete Applied Mathematics.  306 (2022)  - p. 70-82 , 2022
 
?
5

Block Elimination Distance:

, In: Graph-Theoretic Concepts in Computer Science; Lecture Notes in Computer Science,
 
?
6

On List k-Coloring Convex Bipartite Graphs:

, In: AIRO Springer Series; Graphs and Combinatorial Optimization: from Theory to Applications,
 
?
9

Three-fast-searchable graphs:

Dereniowski, Dariusz ; Diner, Öznur Yaşar ; Dyer, Danny
Discrete Applied Mathematics.  161 (2013)  13-14 - p. 1950-1958 , 2013
 
?
10

List 3-Coloring on Comb-Convex and Caterpillar-Convex Bipar..:

, In: Lecture Notes in Computer Science; Computing and Combinatorics,
 
?
13

Block Elimination Distance:

Diner, Öznur Yaşar ; Giannopoulou, Archontia ; Stamoulis, Giannos.
info:eu-repo/semantics/altIdentifier/arxiv/2103.01872.  , 2022
 
?
15

Block Elimination Distance:

Diner, Öznur Yaşar ; Giannopoulou, Archontia ; Stamoulis, Giannos.
info:eu-repo/semantics/altIdentifier/arxiv/2103.01872.  , 2022
 
1-15