Volgen
Oznur Yasar Diner
Oznur Yasar Diner
Geverifieerd e-mailadres voor khas.edu.tr
Titel
Geciteerd door
Geciteerd door
Jaar
On the fast searching problem
D Dyer, B Yang, Yaşar
International Conference on Algorithmic Applications in Management, 143-154, 2008
342008
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
142015
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
132018
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
122017
Three-fast-searchable graphs
D Dereniowski, Y Diner, D Dyer
Discrete Applied Mathematics 161 (13-14), 1950-1958, 2013
82013
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
52004
Block elimination distance
Y Diner, AC Giannopoulou, G Stamoulis, DM Thilikos
Graphs and Combinatorics 38 (5), 1-28, 2022
42022
On List k-Coloring Convex Bipartite Graphs
J Daz, Y Diner, M Serna, O Serra
Graphs and Combinatorial Optimization: from Theory to Applications, 15-26, 2021
42021
Edge searching weighted graphs
Yaşar, D Dyer, DA Pike, M Kondratieva
Discrete applied mathematics 157 (8), 1913-1923, 2009
32009
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
32005
Discrete tomography: A modern inverse problem reconsidered by optimization
GW Weber, O Yasar
J. Comp. Tech 9, 115-121, 2004
22004
Algorithmic complexity and extremality characterizations for edge searching and its variations
O Yasar
Memorial University of Newfoundland, 2008
12008
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 Daz, 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
Block Elimination Distance
Yaşar Diner, AC Giannopoulou, G Stamoulis, DM Thilikos
arXiv e-prints, arXiv: 2103.01872, 2021
2021
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 Grpınar, C Bisson, Y Diner
New Contributions in Information Systems and Technologies, 533-542, 2015
2015
TURING
OF INFORMAL
2012
Searching circulant graphs
Y Diner, D Dyer
2011
Het systeem kan de bewerking nu niet uitvoeren. Probeer het later opnieuw.
Artikelen 1–20