5 sonucu aktar:
Yazar [ Başlık(Desc)] Tür Yıl
Süzgeçler: First Letter Of Title: C 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 
C
Ekim, T., A. M. Farley, and A. Proskurowski, "The complexity of the defensive domination problem in special graph classes", Discrete Mathematics, vol. 343, pp. 111665, 2020.
Abedin, P., S. Akbari, M. Demange, and T. Ekim, "Complexity of the Improper Twin Edge Coloring of Graphs", Graphs and Combinatorics, vol. 33, pp. 595–615, 2017.
Ekim, T., A. Erey, P. Heggernes, P. van't Hof, and D. Meister, "Computing minimum geodetic sets of proper interval graphs", LATIN 2012: Theoretical Informatics: Springer Berlin Heidelberg, pp. 279–290, 2012.
Geinoz, A., T. Ekim, and D. de Werra, "Construction of balanced sports schedules using partitions into subleagues", Operations Research Letters, vol. 36, no. 3: North-Holland, pp. 279–282, 2008.
de Werra, D., T. Ekim, and C. Raess, "Construction of sports schedules with multiple venues", Discrete Applied Mathematics, vol. 154, no. 1: North-Holland, pp. 47–58, 2006.