On the Fast Searching Problem. - Danny Dyer; Boting Yang; Öznur Yasar (AAIM, 2008)

Edge searching weighted graphs. - Öznur Yasar; Danny Dyer; David A. Pike; Margo Kondratieva (Discret. Appl. Math., 2009)

Searching Circulant Graphs. - Öznur Yasar Diner; Danny Dyer (CTW, 2011)

Three-fast-searchable graphs. - Dariusz Dereniowski; Öznur Yasar Diner; Danny Dyer (Discret. Appl. Math., 2013)

Contraction Blockers for Graphs with Forbidden Induced Paths. - Öznur Yasar Diner; Daniël Paulusma; Christophe Picouleau; Bernard Ries (CIAC, 2015)

Bayesian and Graph Theory Approaches to Develop Strategic Early Warning Systems for the Milk Market. - Furkan Gürpinar; Christophe Bisson; Öznur Yasar Diner (WorldCIST (1), 2015)

Contraction and Deletion Blockers for Perfect Graphs and $H$-free Graphs. - Öznur Yasar Diner; Daniël Paulusma; Christophe Picouleau; Bernard Ries (CoRR, 2017)

Contraction and deletion blockers for perfect graphs and H-free graphs. - Öznur Yasar Diner; Daniël Paulusma; Christophe Picouleau; Bernard Ries (Theor. Comput. Sci., 2018)

On List k-Coloring Convex Bipartite Graphs. - Josep Díaz; Öznur Yasar Diner; Maria J. Serna; Oriol Serra (CoRR, 2020)

Block Elimination Distance. - Öznur Yasar Diner; Archontia C. Giannopoulou; Giannos Stamoulis; Dimitrios M. Thilikos (WG, 2021)

On Vertex Bisection Width of Random d-Regular Graphs. - Josep Díaz; Öznur Yasar Diner; Maria J. Serna; Oriol Serra (CoRR, 2022)

Four-searchable biconnected outerplanar graphs. - Öznur Yasar Diner; Danny Dyer; Boting Yang (Discret. Appl. Math., 2022)

List 3-Coloring on Comb-Convex and Caterpillar-Convex Bipartite Graphs. - Banu Baklan Sen; Öznur Yasar Diner; Thomas Erlebach (COCOON (1), 2023)

The multicolored graph realization problem. - Josep Díaz; Öznur Yasar Diner; Maria J. Serna; Oriol Serra (Discret. Appl. Math., 2024)

On minimum vertex bisection of random d-regular graphs. - Josep Díaz; Öznur Yasar Diner; Maria J. Serna; Oriol Serra (J. Comput. Syst. Sci., 2024)