On the fast searching problem D Dyer, B Yang, Ö Yaşar Algorithmic Aspects in Information and Management: 4th International …, 2008 | 37 | 2008 |
Strategic Early Warning System for the French milk market: A graph theoretical approach to foresee volatility C Bisson, ÖY Diner Futures 87, 10-23, 2017 | 20 | 2017 |
Contraction and deletion blockers for perfect graphs and H-free graphs ÖY Diner, D Paulusma, C Picouleau, B Ries Theoretical computer science 746, 49-72, 2018 | 17 | 2018 |
Contraction blockers for graphs with forbidden induced paths ÖY Diner, D Paulusma, C Picouleau, B Ries International Conference on Algorithms and Complexity, 194-207, 2015 | 14 | 2015 |
Three-fast-searchable graphs D Dereniowski, ÖY Diner, D Dyer Discrete Applied Mathematics 161 (13-14), 1950-1958, 2013 | 11 | 2013 |
On List k-Coloring Convex Bipartite Graphs J Díaz, ÖY Diner, M Serna, O Serra Graphs and Combinatorial Optimization: from Theory to Applications: CTW2020 …, 2021 | 8 | 2021 |
Block elimination distance ÖY Diner, AC Giannopoulou, G Stamoulis, DM Thilikos Graphs and Combinatorics 38 (5), 133, 2022 | 7 | 2022 |
On the applied mathematics of discrete tomography Ö Yaşar, C Diner, A Doğan, GW Weber, F Ozbudak, A Tiefenbach Вычислительные технологии 9 (5), 14-32, 2004 | 5 | 2004 |
Discrete tomography: A modern inverse problem reconsidered by optimization GW Weber, O Yasar J. Comp. Tech 9, 115-121, 2004 | 4 | 2004 |
Edge searching weighted graphs Ö Yaşar, D Dyer, DA Pike, M Kondratieva Discrete applied mathematics 157 (8), 1913-1923, 2009 | 3 | 2009 |
Discrete tomography: a joint contribution by optimization, equivariance analysis and learning O Yasar, GW Weber Seventh International Conference on Computing Anticipatory Systems, CASYS 5 …, 2005 | 3 | 2005 |
Algorithmic complexity and extremality characterizations for edge searching and its variations O Yasar Memorial University of Newfoundland, 2008 | 1 | 2008 |
List 3-Coloring on Comb-Convex and Caterpillar-Convex Bipartite Graphs BB Şen, ÖY Diner, T Erlebach arXiv preprint arXiv:2305.10108, 2023 | | 2023 |
On vertex bisection width of random d-regular graphs J Dıaz, OY Diner, M Serna, O Serra Discrete Mathematics Days 2022 263, 116, 2022 | | 2022 |
The multicolored graph realization problem J Díaz, ÖY Diner, M Serna, O Serra Discrete Applied Mathematics, 2022 | | 2022 |
Four-searchable biconnected outerplanar graphs ÖY Diner, D Dyer, B Yang Discrete Applied Mathematics 306, 70-82, 2022 | | 2022 |
Contraction and Deletion Blockers for Perfect Graphs and -free Graphs Ö Yaşar Diner, D Paulusma, C Picouleau, B Ries arXiv e-prints, arXiv: 1706.09052, 2017 | | 2017 |
Bayesian and Graph Theory Approaches to Develop Strategic Early Warning Systems for the Milk Market F Gürpınar, C Bisson, ÖY Diner New Contributions in Information Systems and Technologies: Volume 1, 533-542, 2015 | | 2015 |
TURING OF INFORMAL | | 2012 |
Searching Circulant Graphs. ÖY Diner, D Dyer CTW, 275-278, 2011 | | 2011 |