Öznur Yasar Diner

Orcid: 0000-0002-9271-2691

Affiliations:
  • Department of Information Technology, Kadir Has University


According to our database1, Öznur Yasar Diner authored at least 14 papers between 2008 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
List 3-Coloring on Comb-Convex and Caterpillar-Convex Bipartite Graphs.
Proceedings of the Computing and Combinatorics - 29th International Conference, 2023

2022
Block Elimination Distance.
Graphs Comb., 2022

Four-searchable biconnected outerplanar graphs.
Discret. Appl. Math., 2022

On Vertex Bisection Width of Random d-Regular Graphs.
CoRR, 2022

2021
The Multicolored Graph Realization Problem.
CoRR, 2021

2020
On List k-Coloring Convex Bipartite Graphs.
CoRR, 2020

2018
Contraction and deletion blockers for perfect graphs and <i>H</i>-free graphs.
Theor. Comput. Sci., 2018

2017
Contraction and Deletion Blockers for Perfect Graphs and $H$-free Graphs.
CoRR, 2017

2015
Bayesian and Graph Theory Approaches to Develop Strategic Early Warning Systems for the Milk Market.
Proceedings of the New Contributions in Information Systems and Technologies, 2015

Contraction Blockers for Graphs with Forbidden Induced Paths.
Proceedings of the Algorithms and Complexity - 9th International Conference, 2015

2013
Three-fast-searchable graphs.
Discret. Appl. Math., 2013

2011
Searching Circulant Graphs.
Proceedings of the 10th Cologne-Twente Workshop on graphs and combinatorial optimization. Extended Abstracts, 2011

2009
Edge searching weighted graphs.
Discret. Appl. Math., 2009

2008
On the Fast Searching Problem.
Proceedings of the Algorithmic Aspects in Information and Management, 2008


  Loading...