default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDÖznur Yasar Diner
Person information
- unicode name: Öznur Yaşar Diner
- affiliation: Department of Information Technology, Kadir Has University
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j7]Josep Díaz, Öznur Yasar Diner
, Maria J. Serna, Oriol Serra:
The multicolored graph realization problem. Discret. Appl. Math. 354: 146-159 (2024)- [j6]Josep Díaz, Öznur Yasar Diner, Maria J. Serna, Oriol Serra:
On minimum vertex bisection of random d-regular graphs. J. Comput. Syst. Sci. 144: 103550 (2024) - 2023
- [c6]Banu Baklan Sen, Öznur Yasar Diner, Thomas Erlebach:
List 3-Coloring on Comb-Convex and Caterpillar-Convex Bipartite Graphs. COCOON (1) 2023: 168-181 - [i6]Banu Baklan Sen, Öznur Yasar Diner, Thomas Erlebach:
List 3-Coloring on Comb-Convex and Caterpillar-Convex Bipartite Graphs. CoRR abs/2305.10108 (2023) - 2022
- [j5]Öznur Yasar Diner, Danny Dyer, Boting Yang:
Four-searchable biconnected outerplanar graphs. Discret. Appl. Math. 306: 70-82 (2022) - [j4]Öznur Yasar Diner, Archontia C. Giannopoulou, Giannos Stamoulis, Dimitrios M. Thilikos:
Block Elimination Distance. Graphs Comb. 38(5): 133 (2022) - [i5]Josep Díaz, Öznur Yasar Diner, Maria J. Serna, Oriol Serra:
On Vertex Bisection Width of Random d-Regular Graphs. CoRR abs/2211.03206 (2022) - 2021
- [c5]Öznur Yasar Diner, Archontia C. Giannopoulou, Giannos Stamoulis, Dimitrios M. Thilikos:
Block Elimination Distance. WG 2021: 28-38 - [i4]Öznur Yasar Diner, Archontia C. Giannopoulou, Giannos Stamoulis, Dimitrios M. Thilikos:
Block Elimination Distance. CoRR abs/2103.01872 (2021) - [i3]Josep Díaz, Öznur Yasar Diner, Maria J. Serna, Oriol Serra:
The Multicolored Graph Realization Problem. CoRR abs/2103.12899 (2021) - 2020
- [i2]Josep Díaz, Öznur Yasar Diner, Maria J. Serna, Oriol Serra:
On List k-Coloring Convex Bipartite Graphs. CoRR abs/2002.02729 (2020)
2010 – 2019
- 2018
- [j3]Öznur Yasar Diner, Daniël Paulusma, Christophe Picouleau, Bernard Ries:
Contraction and deletion blockers for perfect graphs and H-free graphs. Theor. Comput. Sci. 746: 49-72 (2018) - 2017
- [i1]Öznur Yasar Diner, Daniël Paulusma, Christophe Picouleau, Bernard Ries:
Contraction and Deletion Blockers for Perfect Graphs and $H$-free Graphs. CoRR abs/1706.09052 (2017) - 2015
- [c4]Öznur Yasar Diner, Daniël Paulusma, Christophe Picouleau, Bernard Ries:
Contraction Blockers for Graphs with Forbidden Induced Paths. CIAC 2015: 194-207 - [c3]Furkan Gürpinar, Christophe Bisson, Öznur Yasar Diner:
Bayesian and Graph Theory Approaches to Develop Strategic Early Warning Systems for the Milk Market. WorldCIST (1) 2015: 533-542 - 2013
- [j2]Dariusz Dereniowski, Öznur Yasar Diner, Danny Dyer:
Three-fast-searchable graphs. Discret. Appl. Math. 161(13-14): 1950-1958 (2013) - 2011
- [c2]Öznur Yasar Diner, Danny Dyer:
Searching Circulant Graphs. CTW 2011: 275-278
2000 – 2009
- 2009
- [j1]Öznur Yasar, Danny Dyer, David A. Pike, Margo Kondratieva:
Edge searching weighted graphs. Discret. Appl. Math. 157(8): 1913-1923 (2009) - 2008
- [c1]Danny Dyer, Boting Yang, Öznur Yasar:
On the Fast Searching Problem. AAIM 2008: 143-154
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:19 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
