| On the fast searching problem D Dyer, B Yang, Ö Yaşar Algorithmic Aspects in Information and Management: 4th International …, 2008 | 39 | 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 | 22 | 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 | 12 | 2013 |
| Block elimination distance ÖY Diner, AC Giannopoulou, G Stamoulis, DM Thilikos Graphs and Combinatorics 38 (5), 133, 2022 | 11 | 2022 |
| 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 | 9 | 2021 |
| Discrete tomography: A modern inverse problem reconsidered by optimization GW Weber, O Yasar J. Comp. Tech 9, 115-121, 2004 | 5 | 2004 |
| 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 |
| 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 Ö Yaşar, GW Weber CASYS. International Journal of Computing Anticipatory Systems, 3-26, 2006 | 3 | 2006 |
| On minimum vertex bisection of random d-regular graphs J Díaz, ÖY Diner, M Serna, O Serra Journal of Computer and System Sciences 144, 103550, 2024 | 1 | 2024 |
| Algorithmic complexity and extremality characterizations for edge searching and its variations O Yasar Memorial University of Newfoundland, 2008 | 1 | 2008 |
| List coloring based algorithm for the Futoshiki puzzle BB Şen, OY Diner An International Journal of Optimization and Control: Theories …, 2024 | | 2024 |
| The multicolored graph realization problem J Díaz, ÖY Diner, M Serna, O Serra Discrete Applied Mathematics 354, 146-159, 2024 | | 2024 |
| Rainbow connectivity of multilayered random geometric graphs J Díaz, ÖY Diner, M Serna, O Serra arXiv preprint arXiv:2407.12323, 2024 | | 2024 |
| List 3-Coloring on Comb-Convex and Caterpillar-Convex Bipartite Graphs B Baklan Şen, Ö Yaşar Diner, T Erlebach International Computing and Combinatorics Conference, 168-181, 2023 | | 2023 |
| 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 |
| Four-searchable biconnected outerplanar graphs ÖY Diner, D Dyer, B Yang Discrete Applied Mathematics 306, 70-82, 2022 | | 2022 |
Danny DyerMemorial University of NewfoundlandVerified email at mun.ca
