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 | 64 | 2015 |

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 | 41 | 2006 |

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 | 40 | 2012 |

Polarity of chordal graphs T Ekim, P Hell, J Stacho, D de Werra Discrete Applied Mathematics 156 (13), 2469-2479, 2008 | 40 | 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 | 35 | 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 | 30 | 2009 |

On split-coloring problems T Ekim, D de Werra Journal of Combinatorial Optimization 10, 211-225, 2005 | 20 | 2005 |

Efficient recognition of equimatchable graphs M Demange, T Ekim Information Processing Letters 114 (1-2), 66-71, 2014 | 18 | 2014 |

Polar permutation graphs T Ekim, P Heggernes, D Meister International Workshop on Combinatorial Algorithms, 218-229, 2009 | 17 | 2009 |

Block decomposition approach to compute a minimum geodetic set T Ekim, A Erey RAIRO-Operations Research 48 (4), 497-507, 2014 | 15 | 2014 |

Integer programming formulations for the minimum weighted maximal matching problem ZC Taşkın, T Ekim Optimization Letters 6, 1161-1171, 2012 | 15 | 2012 |

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 | 14 | 2017 |

Recognizing line-polar bipartite graphs in time O (n) T Ekim, J Huang Discrete applied mathematics 158 (15), 1593-1598, 2010 | 13 | 2010 |

An exact cutting plane algorithm to solve the selective graph coloring problem in perfect graphs O Şeker, T Ekim, ZC Taşkın European Journal of Operational Research 291 (1), 67-83, 2021 | 12 | 2021 |

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 |

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 | 11 | 2018 |

The maximum cardinality cut problem in co-bipartite chain graphs A Boyacı, T Ekim, M Shalom Journal of Combinatorial Optimization 35, 250-265, 2018 | 11 | 2018 |

Hardness and approximation of minimum maximal matchings M Demange, T Ekim, C Tanasescu International Journal of Computer Mathematics 91 (8), 1635-1654, 2014 | 11 | 2014 |