6 sonucu aktar:
Yazar [ Başlık(Desc)] Tür Yıl
Süzgeçler: First Letter Of Title: M and Yazar is Ekim, Tinaz  [Clear All Filters]
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z 
M
Chiarelli, N., C. Dibek, T. Ekim, D. Gözüpek, and S. Miklavic, "On matching extendability of lexicographic products", RAIRO-Oper. Res., vol. 51, pp. 857-873, 2017.
Ekim, T., A. Boyacı, and M. Shalom, "The maximum cardinality cut problem in co-bipartite chain graphs", Journal of Combinatorial Optimization, vol. 35, pp. 250–265, Jan, 2018.
Dibek, C., T. Ekim, and P. Heggernes, "Maximum number of edges in claw-free graphs whose maximum degree and matching number are bounded", Discrete Mathematics, vol. 340, pp. 927 - 934, 2017.
Ekim, T., D. Gözüpek, A. Hujdurović, and M. Milanič, "Mind the independence gap", Discrete Mathematics, vol. 343, pp. 111943, 2020.
Demange, M., T. Ekim, and B. Ries, "On the minimum and maximum selective graph coloring problems in some graph classes", Discrete Applied Mathematics, vol. 204, pp. 77–89, 2016.
Demange, M., and T. Ekim, "Minimum maximal matching is NP-hard in regular bipartite graphs", Theory and Applications of Models of Computation: Springer, pp. 364–374, 2008.