19 sonucu aktar:
[ Yazar(Asc)] Başlık Tür Yıl
Süzgeçler: Yazar: 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 
E
Ekim, T., P. Hell, J. Stacho, and D. de Werra, "Polarity of chordal graphs", Discrete Applied Mathematics, vol. 156, no. 13: Elsevier, pp. 2469–2479, 2008.
Ekim, T., N. V. R. Mahadev, and D. de Werra, "Polar cographs", Discrete Applied Mathematics, vol. 156, no. 10: North-Holland, pp. 1652–1660, 2008.
Ekim, T., and D. de Werra, "On split-coloring problems", Journal of Combinatorial Optimization, vol. 10, no. 3: Kluwer Academic Publishers, pp. 211–225, 2005.
Ekim, T., and J. Huang, "Recognizing line-polar bipartite graphs in time O (n)", Discrete Applied Mathematics, vol. 158, no. 15: Elsevier, pp. 1593–1598, 2010.
Ekim, T., and J. Gimbel, "Partitioning graphs into complete and empty graphs", Discrete Mathematics, vol. 309, no. 19: Elsevier, pp. 5849–5856, 2009.
Ekim, T., B. Ries, D. de Werra, and , "Split-critical and uniquely split-colorable graphs", Discrete Mathematics and Theoretical Computer Science, vol. 12, no. 5, pp. 1–24, 2010.
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.
Ekim, T., and J. Gimbel, "Some Defective Parameters in Graphs", Graphs and Combinatorics, vol. 29, no. 2: Springer Japan, pp. 213–224, 2013.
Ekim, T., P. Heggernes, and D. Meister, "Polar permutation graphs are polynomial-time recognisable", European Journal of Combinatorics, vol. 34, no. 3: Academic Press, pp. 576–592, 2013.
Ekim, T., and V. Th Paschos, "Approximation preserving reductions for set covering, vertex covering and independent set hierarchies under differential approximationa", International Journal of Computer Mathematics, vol. 81, no. 5: Taylor & Francis Group, pp. 569–582, 2004.
Ekim, T., and D. de Werra, "On split-coloring problems (vol 10, pg 211, 2005)", JOURNAL OF COMBINATORIAL OPTIMIZATION, vol. 11, no. 1: SPRINGER VAN GODEWIJCKSTRAAT 30, 3311 GZ DORDRECHT, NETHERLANDS, pp. 125–125, 2006.
Ekim, T., and A. Erey, "Block decomposition approach to compute a minimum geodetic set", RAIRO-Operations Research, vol. 48, no. 04: EDP Sciences, pp. 497–507, 2014.
Ekim, T., NVR. Mahadev, and D. de Werra, "Polar cographs", Discrete Applied Mathematics, vol. 171, no. EPFL-ARTICLE-199582: Elsevier Science Bv, pp. 158–158, 2014.
Ekim, T., "Edge extremal Graphs Under Degree and Matching Number Restrictions", 17th Haifa Workshop on Interdisciplinary Applications of Graphs – CRI, 2017.
Ekim, T., "Recent results on equimatchable graphs", Combinatorial Potlatch, 2017.
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.
Ekim, T., D. Gözüpek, A. Hujdurović, and M. Milanič, "Mind the independence gap", Discrete Mathematics, vol. 343, pp. 111943, 2020.
Ekim, T., J. Gimbel, and O. Şeker, "Small 1-defective Ramsey numbers in perfect graphs", Discrete Optimization, vol. 34, pp. 100548, 2019.
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.