Browsing Araştırma Çıktıları | WoS | Scopus | TR-Dizin | PubMed by Author "Diner, Öznur Yaşar"
Now showing items 1-7 of 7
-
Bayesian and Graph Theory Approaches to Develop Strategic Early Warning Systems for the Milk Market
Gürpınar, Furkan; Bisson, Christophe; Diner, Öznur Yaşar (Springer-Verlag Berlin, 2015)This paper presents frameworks for developing a Strategic Early Warning System allowing the estimatation of the future state of the milk market. Thus this research is in line with the recent call from the EU commission for ... -
Contraction and deletion blockers for perfect graphs and H-free graphs
Diner, Öznur Yaşar; Paulusma, Daniel; Picouleau, Christophe; Ries, Bernard (Elsevier Science, 2018)We study the following problem: for given integers d k and graph G can we reduce some fixed graph parameter pi of G by at least d via at most k graph operations from some fixed set S? As parameters we take the chromatic ... -
Contraction Blockers for Graphs with Forbidden Induced Paths
Diner, Öznur Yaşar; Paulusma, Daniel; Picouleau, Christophe; Ries, Bernard (Springer-Verlag Berlin, 2015)We consider the following problem: can a certain graph parameter of some given graph be reduced by at least d for some integer d via at most k edge contractions for some given integer k? We examine three graph parameters: ... -
On list k-coloring convex bipartite graphs
Diaz, Josep; Diner, Öznur Yaşar; Serna, Maria; Oriol, Serra (Springer Nature, 2021)List k-Coloring (Lik-Col) is the decision problem asking if a given graph admits a proper coloring compatible with a given list assignment to its vertices with colors in {1, 2, …, k}. The problem is known to be NP-hard ... -
Strategic Early Warning System for the French milk market: A graph theoretical approach to foresee volatility
Bisson, Christophe; Diner, Öznur Yaşar (Elsevier, 2017)This paper presents a new approach for developing a Strategic Early Warning System aiming to better detect and interpret weak signals. We chose the milk market as a case study in line with the recent call from the EU ... -
Three-fast-searchable graphs
Dereniowski, Dariusz; Diner, Öznur Yaşar; Dyer, Danny (Elsevier Science Bv, 2013)In the edge searching problem searchers move from vertex to vertex in a graph to capture an invisible fast intruder that may occupy either vertices or edges. Fast searching is a monotonic internal model in which at every ...