| On some applications of the selective graph coloring problem M Demange, T Ekim, B Ries, C Tanasescu European Journal of Operational Research 240 (2), 307-314, 2015 | 69 | 2015 |
| Computing minimum geodetic sets of proper interval graphs T Ekim, A Erey, P Heggernes, P van’t Hof, D Meister Latin American Symposium on Theoretical Informatics, 279-290, 2012 | 46 | 2012 |
| Partitioning cographs into cliques and stable sets M Demange, T Ekim, D De Werra Discrete Optimization 2 (2), 145-153, 2005 | 44 | 2005 |
| Construction of sports schedules with multiple venues D de Werra, T Ekim, C Raess Discrete Applied Mathematics 154 (1), 47-58, 2006 | 40 | 2006 |
| Polarity of chordal graphs T Ekim, P Hell, J Stacho, D de Werra Discrete Applied Mathematics 156 (13), 2469-2479, 2008 | 39 | 2008 |
| Minimum maximal matching is NP-hard in regular bipartite graphs M Demange, T Ekim Theory and Applications of Models of Computation, 364-374, 2008 | 36 | 2008 |
| Polar cographs T Ekim, NVR Mahadev, D de Werra Discrete Applied Mathematics 156 (10), 1652-1660, 2008 | 33 | 2008 |
| A tutorial on the use of graph coloring for some problems in robotics M Demange, T Ekim, D De Werra European Journal of Operational Research 192 (1), 41-55, 2009 | 32 | 2009 |
| On split-coloring problems T Ekim, D de Werra Journal of Combinatorial Optimization 10, 211-225, 2005 | 21 | 2005 |
| Efficient recognition of equimatchable graphs M Demange, T Ekim Information Processing Letters 114 (1-2), 66-71, 2014 | 19 | 2014 |
| Integer programming formulations for the minimum weighted maximal matching problem ZC Taşkın, T Ekim Optimization Letters 6, 1161-1171, 2012 | 17 | 2012 |
| Block decomposition approach to compute a minimum geodetic set T Ekim, A Erey RAIRO-Operations Research 48 (4), 497-507, 2014 | 16 | 2014 |
| Polar permutation graphs T Ekim, P Heggernes, D Meister International Workshop on Combinatorial Algorithms, 218-229, 2009 | 16 | 2009 |
| Recognizing line-polar bipartite graphs in time O (n) T Ekim, J Huang Discrete applied mathematics 158 (15), 1593-1598, 2010 | 14 | 2010 |
| Integer programming formulations and benders decomposition for the maximum induced matching problem B Ahat, T Ekim, ZC Taşkın INFORMS Journal on Computing 30 (1), 43-56, 2018 | 13 | 2018 |
| A polynomial-time algorithm for the maximum cardinality cut problem in proper interval graphs A Boyacı, T Ekim, M Shalom Information Processing Letters 121, 29-33, 2017 | 13 | 2017 |
| The maximum cardinality cut problem in co-bipartite chain graphs A Boyacı, T Ekim, M Shalom Journal of Combinatorial Optimization 35, 250-265, 2018 | 12 | 2018 |
| On the minimum and maximum selective graph coloring problems in some graph classes M Demange, T Ekim, B Ries Discrete Applied Mathematics 204, 77-89, 2016 | 12 | 2016 |
| Polar permutation graphs are polynomial-time recognisable T Ekim, P Heggernes, D Meister European Journal of Combinatorics 34 (3), 576-592, 2013 | 12 | 2013 |
| Some defective parameters in graphs T Ekim, J Gimbel Graphs and Combinatorics 29 (2), 213-224, 2013 | 12 | 2013 |
