1. M. Demange, T. Ekim, D. de Werra, (p; k)-coloring problems in line graphs, Extended Abstract, GRACO 2005, Electronic Notes in Discrete Mathematics volume 19, pages 49-55, 2005.

2. T. Ekim, N.V.R. Mahadev, D. de Werra, Polarcographs, Extended Abstract, Sixth Czech-Slovak International Symposium on Combinatorics, Graph Theory, Algorithms and Applications, Electronic Notes in Discrete Mathematics, volume 28, pages 317- 323, 2007.

3. M. Demange, T.Ekim, Minimum maximal matching is NP-hard in regular bipartite graphs, Proceedings of Theory and Applications of Models of Computation, TAMC 2008, LNCS 4978, 364-374, 2008.

4. T.Ekim, P. Heggernes, D. Meister, Polar permutation graphs, J.Fiala, J.Kratochvil, and M. Miller (eds.): IWOCA 2009, LNCS 5874, pp 218 - 229, 2009.

5. T.Ekim, A. Erey, P. Heggernes, P. Hof, D. Meister, Computing minimum geodetic sets in proper interval graphs, LATIN 2012, LNCS 7256, pp 279-290, 2012.

6. R.M. Yuzsever, T. Ekim, N. Aras, A Branch-and-Price Algorithm for Split-Coloring Problem, Proceedings of the 11th Cologne-Twente Workshop on Graphs and Combinatorial Optimization (CTW 2012), pp. 249-253, May 29-31, 2012, Germany.

7. A.Boyaci, T. Ekim, M. Shalom, S. Zaks, Graphs of edge intersecting and non-splitting paths in a tree: towards hole representations, Proceedings of Workshop on Graphs WG 2013, June 19-21, 2013, Germany, Lecture Notes in Computer Science 8165, 115-126, 2013.

8. B. Basciftci, U. B. Nazlican, F. Alagoz, T.Ekim, Satış Rotalaması için tamsayılı programlama formülasyonları, Üretim Araştırmaları Sempozyumu, 25 - 27 Eylül 2013, Sakarya Üniversitesi, Sayfa 706-712, 2013. (3rd place in the student project contest of UAS)

9. A. Boyaci, T.Ekim, M. Shalom, S. Zaks, Graphs of edge intersecting and non-splitting paths, Proceedings of the 15th Italian Conference on Theoretical Computer Science ICTCS 2014, pp. 45-58, Perugia, Italy, September 17-19, 2014. (available online at http://ceur-ws.org/Vol-1231)

10.  M. Demange, T. Ekim, B. Ries, On the Minimum and Maximum Selective Graph Coloring Problems, Proceedings of the 13th Cologne-Twente Workshop on Graphs and Combinatorial Optimization (CTW 2015), pp 189-192, Eds. AliFuat Alkaya,EkremDuman, May 26-28, 2015, Turkey.

11.  C. Dibek, T. Ekim, D. Gozupek, M. Shalom,Equimatchable Graphs are C2k+1-free for k 4, Proceedings of the 13th Cologne-Twente Workshop on Graphs and Combinatorial Optimization (CTW 2015), pp 125-128, Eds. AliFuatAlkaya, EkremDuman, May 26-28, 2015, Turkey.

12.  Z. Deniz, T. Ekim, T. R. Hartinger, M. Milanic, M. Shalom, On Three Extensions ofEquimatchable Graphs, Electronic Notes in Discrete Mathematics, Volume 55, November 2016, Pages 177-180. doi: 10.1016/j.endm.2016.10.044. Proceedings of the 14th Cologne-Twente Workshop on Graphs and Combinatorial Optimization (CTW 2016), pp 182-185, Eds. A. Ceselli, R.Cordone, G. Righini (Eds.), June 6-8, 2016, Italia.(available online at http://ctw16.di.unimi.it/CTW16_Proceedings.pdf)

13.  Z. Deniz, T. Ekim, Characterization of StableEquimatchable graphs, Proceedings of the Bordeaux Graph Workshop, 2016, Pages 105-108. Available online: http://bgw.labri.fr/2016/bgw2016-booklet.pdf.

14.  O. Seker, P. Heggernes, T.Ekim, Z.C. Taskin, Linear-time generation of random chordal graphs, Proceedings of the 10th International Conference on Algorithms and Complexity, CIAC 2017, LNCS 10236, 442-453, 2017.

15. T. Ekim, M. Shalom, O. Seker, The Complexity of Subtree Intersection Representation of Chordal Graphs and Linear Time Chordal Graph Generation, International Symposium on Experimental Algorithms SEA 2019: Analysis of Experimental Algorithms, LNCS 11544, 21-34, 2019.

16. T. Ekim, The Nobel Prize in Economic Sciences 2012 and Matching Theory, In Proceedings of the 9th International Conference on Operations Research and Enterprise Systems (ICORES 2020), pages 5-16.

17. M. Ahanjidah, T. Ekim, M.A. Yildiz, Maximum number of edges in triangle-tree graphs with bounded degree and matching number, ICGT Proceedings 2022.

18. O.B. Onar, T. Ekim, Z.C. Taskin, Integer Programming Formulations and Cutting Plane Algorithms for the Maximum Selective Tree Problem, 21st International Symposium on Experimental Algorithms (SEA 2023), Editor: Loukas Georgiadis; Volume: 265, Article No. 13; pp. 13:1-13:18, URL: https://drops.dagstuhl.de/opus/volltexte/2023/18363/ , DOI: 10.4230/LIPIcs.SEA.2023.13