Dr. Öğr. Üyesi ÖZNUR YAŞAR DİNER
Dr. Öğr. Üyesi ÖZNUR YAŞAR DİNER
Eğitim
Doktora
MEMORİAL UNIVERSITY OF NEWFOUNDLAND
Matematik
Yüksek Lisans
UNIVERSITY OF GÖTTİNGEN
Matematik
Lisans
ORTA DOĞU TEKNİK ÜNİVERSİTESİ
Matematik
Araştırma Alanları
- Çizge Kuramı
- Çizge Algoritmaları
- Hesaplamalı Karmaşıklık Teorisi
İş Deneyimi
2010 /
Devam Eden
Yardımcı Doçent
Kadir Has Üniversitesi
2004 /
2009
Öğretim Görevlisi, Araştırma Görevlisi
Memorial University of Newfoundland
2003 /
2004
Araştırma Görevlisi
ODTÜ, Uygulamalı Matematik Enstitüsü
2002 /
2003
Araştırma Görevlisi
Zürih Yüksek Teknoloji Enstitüsü
Yayınlar
- Diaz, Josep; Diner, Öznur Yaşar; Serna, Maria; Serra, Oriol (2024), "On minimum vertex bisection of random d-regular graphs", Journal of Computer and System Sciences, Vol.103550, DOI: 10.1016/j.jcss.2024.103550
- Díaz, Josep; Diner, Öznur Yaşar; Serna, Maria; Serra, Oriol (2024), "On minimum vertex bisection of random d-regular graphs", Journal of Computer and System Sciences, Vol.144, DOI: 10.1016/j.jcss.2024.103550
- Baklan Şen, Banu; Yaşar Diner, Öznur; Erlebach, Thomas (2024), "List 3-Coloring on Comb-Convex and Caterpillar-Convex Bipartite Graphs", Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Vol.14422 LNCS, 168-181 DOI: 10.1007/978-3-031-49190-0_12
- Şen, Banu Baklan; Diner, Öznur Yaşar (2024), "List coloring based algorithm for the Futoshiki puzzle", International Journal of Optimization and Control: Theories and Applications, Vol.14, No.4, 294-307 DOI: 10.11121/ijocta.1432
- Diner, Öznur Yaşar; Giannopoulou, Archontia C.; Stamoulis, Giannos; Thilikos, Dimitrios M. (2022), "Block Elimination Distance", Graphs and Combinatorics, Vol.38, No.5, DOI: 10.1007/s00373-022-02513-y
- Diner, Öznur Yaşar; Dyer, Danny; Yang, Boting (2022), "Four-searchable biconnected outerplanar graphs", Discrete Applied Mathematics, Vol.306, 70-82 DOI: 10.1016/j.dam.2021.09.011
- Díaz, Josep; Diner, Öznur Yaşar; Serna, Maria; Serra, Oriol (2022), "The multicolored graph realization problem", Discrete Applied Mathematics, DOI: 10.1016/j.dam.2022.06.031
- Diner, Öznur Yaşar; Giannopoulou, Archontia C.; Stamoulis, Giannos; Thilikos, Dimitrios M. (2021), "Block Elimination Distance", Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Vol.12911 LNCS, 28-38 DOI: 10.1007/978-3-030-86838-3_3
- Díaz, Josep; Diner, Öznur Yaşar; Serna, Maria; Serra, Oriol (2021), "On list k-coloring convex bipartite graphs", AIRO Springer Series, Springer Nature Switzerland AG
- Diner, Öznur Yaşar; Paulusma, Daniël; Picouleau, Christophe; Ries, Bernard (2018), "Contraction and deletion blockers for perfect graphs and H-free graphs", Theoretical Computer Science, Vol.746, 49-72 DOI: 10.1016/j.tcs.2018.06.023
- Bisson, Christophe; Diner, Öznur Yaşar (2017), "Strategic Early Warning System for the French milk market: A graph theoretical approach to foresee volatility", Futures, Vol.87, 10-23 DOI: 10.1016/j.futures.2017.01.004
- Diner, Öznur Yaşar; Paulusma, Daniël; Picouleau, Christophe; Ries, Bernard (2015), "Contraction blockers for graphs with forbidden induced paths", Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Vol.9079, 194-207 DOI: 10.1007/978-3-319-18173-8_14
- Gürpınar, Furkan; Bisson, Christophe; Diner, Öznur Yaşar (2015), "Bayesian and graph theory approaches to develop strategic early warning systems for the milk market", Advances in Intelligent Systems and Computing, Vol.353, 533-542 DOI: 10.1007/978-3-319-16486-1_52
- Dereniowski, Dariusz; Diner, Öznur Yaşar; Dyer, Danny (2013), "Three-fast-searchable graphs", Discrete Applied Mathematics, Vol.161, No.13-14, 1950-1958 DOI: 10.1016/j.dam.2013.03.004
- Diner, Öznur Yaşar; Dyer, Danny (2011), "Searching circulant graphs", 10th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, CTW 2011 - Proceedings of the Conference, 275-278
- Yaşar, Öznur; Dyer, Danny; Pike, David A.; Kondratieva, Margo (2009), "Edge searching weighted graphs", Discrete Applied Mathematics, Vol.157, No.8, 1913-1923 DOI: 10.1016/j.dam.2008.11.011
- Dyer, Danny; Yang, Boting; Yaşar, Öznur (2008), "On the fast searching problem", Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Vol.5034 LNCS, 143-154 DOI: 10.1007/978-3-540-68880-8_15
Verilen Dersler
Ders Adı | Ders Kodu | Dönem |
---|---|---|
Çizge Algoritmaları | CE608*1 | 2023/24 Bahar |
Sayısal Sistemler | FENS300 | 2023/24 Bahar |
Çizge Kuramı | CMPE304 | 2023/24 Bahar |
Hesaplama Kuramı | CE516*1 | 2023/24 Güz |