Yayınlar & Eserler

Yayın Ağı
Makaleler 59
Tümü (59)
SCI-E, SSCI, AHCI (49)
SCI-E, SSCI, AHCI, ESCI (54)
ESCI (3)
Scopus (59)

1. SPARSE SETS IN TRIANGLE-FREE GRAPHS

EKİM T., Erdem B. N., Gimbel J.
Mathematica Bohemica , cilt.151, sa.3, ss.385-405, 2026 (ESCI, Scopus)

2. Maximum size of a triangle-free graph with bounded maximum degree and matching number

Ahanjideh M., EKİM T., Yıldız M. A.
Journal of Combinatorial Optimization , cilt.47, sa.4, 2024 (SCI-Expanded, Scopus)

3. Critical equimatchable graphs

Deniz Z., EKİM T.
Australasian Journal of Combinatorics , cilt.88, ss.171-193, 2024 (ESCI, Scopus)

4. Constructing extremal triangle-free graphs using integer programming

Banak A. E., EKİM T., TAŞKIN Z. C.
Discrete Optimization , cilt.50, 2023 (SCI-Expanded, Scopus)

5. Defensive domination in proper interval graphs

EKİM T., Farley A., Proskurowski A., Shalom M.
Discrete Applied Mathematics , cilt.331, ss.59-69, 2023 (SCI-Expanded, Scopus)

6. Well-indumatched trees and graphs of bounded girth

Akbari S., EKİM T., Ghodrati A., Zare S.
Australasian Journal of Combinatorics , cilt.85, ss.61-81, 2023 (ESCI, Scopus)

7. Defective Ramsey Numbers and Defective Cocolorings in Some Subclasses of Perfect Graphs

Demirci Y. E., EKİM T., Yıldız M. A.
Graphs and Combinatorics , cilt.39, sa.1, 2023 (SCI-Expanded, Scopus)

8. Generation of random chordal graphs using subtrees of a tree

Seker O., Heggernes P., EKİM T., TAŞKIN Z. C.
RAIRO - Operations Research , cilt.56, sa.2, ss.565-582, 2022 (Scopus) Creative Commons License

9. On the maximum cardinality cut problem in proper interval graphs and related graph classes

Boyacı A., EKİM T., Shalom M.
Theoretical Computer Science , cilt.898, ss.20-29, 2022 (SCI-Expanded, Scopus)

10. Exact values of defective Ramsey numbers in graph classes

Demirci Y. E., EKİM T., Gimbel J., Yıldız M. A.
Discrete Optimization , cilt.42, 2021 (SCI-Expanded, Scopus) Sürdürülebilir Kalkınma

11. An exact cutting plane algorithm to solve the selective graph coloring problem in perfect graphs

Şeker O., EKİM T., TAŞKIN Z. C.
European Journal of Operational Research , cilt.291, sa.1, ss.67-83, 2021 (SCI-Expanded, Scopus) Creative Commons License

12. The complexity of subtree intersection representation of chordal graphs and linear time chordal graph generation

EKİM T., Shalom M., Şeker O.
Journal of Combinatorial Optimization , cilt.41, sa.3, ss.710-735, 2021 (SCI-Expanded, Scopus)

13. Well-totally-dominated graphs

BAHADIR S., EKİM T., Gözüpek D.
Ars Mathematica Contemporanea , cilt.20, sa.2, ss.209-222, 2021 (SCI-Expanded, Scopus) Creative Commons License

14. Mind the independence gap

EKİM T., Gözüpek D., Hujdurović A., Milanič M.
Discrete Mathematics , cilt.343, sa.9, 2020 (SCI-Expanded, Scopus)

15. The complexity of the defensive domination problem in special graph classes

EKİM T., Farley A. M., Proskurowski A.
Discrete Mathematics , cilt.343, sa.2, 2020 (SCI-Expanded, Scopus)

16. Small 1-defective Ramsey numbers in perfect graphs

EKİM T., Gimbel J., Şeker O.
Discrete Optimization , cilt.34, 2019 (SCI-Expanded, Scopus)

17. Edge-stable equimatchable graphs

Deniz Z., EKİM T.
Discrete Applied Mathematics , cilt.261, ss.136-147, 2019 (SCI-Expanded, Scopus) Creative Commons License

18. A decomposition approach to solve the selective graph coloring problem in some perfect graph families

Şeker O., EKİM T., TAŞKIN Z. C.
Networks , cilt.73, sa.2, ss.145-169, 2019 (SCI-Expanded, Scopus)

19. Integer programming formulations and benders decomposition for the maximum induced matching problem

Ahat B., EKİM T., TAŞKIN Z. C.
INFORMS Journal on Computing , cilt.30, sa.1, ss.43-56, 2018 (SCI-Expanded, Scopus)

20. Equimatchable claw-free graphs

Akbari S., Alizadeh H., EKİM T., Gözüpek D., Shalom M.
Discrete Mathematics , cilt.341, sa.10, ss.2859-2871, 2018 (SCI-Expanded, Scopus) Creative Commons License

21. The maximum cardinality cut problem in co-bipartite chain graphs

Boyacı A., EKİM T., Shalom M.
Journal of Combinatorial Optimization , cilt.35, sa.1, ss.250-265, 2018 (SCI-Expanded, Scopus)

22. Graphs of edge-intersecting non-splitting paths in a tree: Representations of holes-part II

Boyacı A., EKİM T., Shalom M., Zaks S.
Discrete Mathematics and Theoretical Computer Science , cilt.20, sa.1, 2018 (SCI-Expanded, Scopus)

23. On two extensions of equimatchable graphs

DENİZ Z., EKİM T., Hartinger T. R., Milanič M., Shalom M.
Discrete Optimization , cilt.26, ss.112-130, 2017 (SCI-Expanded, Scopus)

24. On matching extendability of lexicographic products

Chiarelli N., Dibek C., EKİM T., Gözüpek D., Miklavič Š.
RAIRO - Operations Research , cilt.51, sa.3, ss.857-873, 2017 (Scopus) Creative Commons License

25. Complexity of the Improper Twin Edge Coloring of Graphs

Abedin P., Akbari S., Demange M., EKİM T.
Graphs and Combinatorics , cilt.33, sa.4, ss.595-615, 2017 (SCI-Expanded, Scopus)

26. Maximum number of edges in claw-free graphs whose maximum degree and matching number are bounded

Dibek C., EKİM T., Heggernes P.
Discrete Mathematics , cilt.340, sa.5, ss.927-934, 2017 (SCI-Expanded, Scopus)

27. A polynomial-time algorithm for the maximum cardinality cut problem in proper interval graphs

Boyacı A., EKİM T., Shalom M.
Information Processing Letters , cilt.121, ss.29-33, 2017 (SCI-Expanded, Scopus)

28. Graphs of edge-intersecting and non-splitting one bend paths in a grid*

Boyacı A., EKİM T., Shalom M., Zaks S.
Discrete Mathematics and Theoretical Computer Science , cilt.19, sa.1, 2017 (SCI-Expanded, Scopus)

29. Graphs of edge-intersecting non-splitting paths in a tree: Representations of holes—Part I

Boyacı A., EKİM T., Shalom M., Zaks S.
Discrete Applied Mathematics , cilt.215, ss.47-60, 2016 (SCI-Expanded, Scopus)

30. Equimatchable graphs are C2k+1-free for k≥4

Dibek C., EKİM T., Gözüpek D., Shalom M.
Discrete Mathematics , cilt.339, sa.12, ss.2964-2969, 2016 (SCI-Expanded, Scopus)

31. On Three Extensions of Equimatchable Graphs

DENİZ Z., EKİM T., Hartinger T. R., Milanič M., Shalom M.
Electronic Notes in Discrete Mathematics , cilt.55, ss.177-180, 2016 (Scopus)

32. Graphs of edge-intersecting and non-splitting paths

Boyaci A., EKİM T., Shalom M., Zaks S.
Theoretical Computer Science , cilt.629, ss.40-50, 2016 (SCI-Expanded, Scopus)

33. On the minimum and maximum selective graph coloring problems in some graph classes

Demange M., EKİM T., Ries B.
Discrete Applied Mathematics , cilt.204, ss.77-89, 2016 (SCI-Expanded, Scopus)

34. Advances on defective parameters in graphs

Akdemir A., EKİM T.
Discrete Optimization , cilt.16, ss.62-69, 2015 (SCI-Expanded, Scopus)

35. On some applications of the selective graph coloring problem

Demange M., EKİM T., Ries B., Tanasescu C.
European Journal of Operational Research , cilt.240, sa.2, ss.307-314, 2015 (SCI-Expanded, Scopus)

36. Hardness and approximation of minimum maximal matchings

Demange M., EKİM T., Tanasescu C.
International Journal of Computer Mathematics , cilt.91, sa.8, ss.1635-1654, 2014 (SCI-Expanded, Scopus)

37. Efficient recognition of equimatchable graphs

Demange M., EKİM T.
Information Processing Letters , cilt.114, sa.1-2, ss.66-71, 2014 (SCI-Expanded, Scopus)

38. Block decomposition approach to compute a minimum geodetic

EKİM T., Erey A.
RAIRO - Operations Research , cilt.48, sa.4, ss.497-507, 2014 (SCI-Expanded, Scopus) Creative Commons License

39. Decomposition algorithms for solving the minimum weight maximal matching problem

Bodur M., EKİM T., TAŞKIN Z. C.
Networks , cilt.62, sa.4, ss.273-287, 2013 (SCI-Expanded, Scopus)

40. Perfectness of clustered graphs

Bonomo F., Cornaz D., EKİM T., Ries B.
Discrete Optimization , cilt.10, sa.4, ss.296-303, 2013 (SCI-Expanded, Scopus)

41. A note on the NP-hardness of two matching problems in induced subgridsy

Demange M., EKİM T.
Discrete Mathematics and Theoretical Computer Science , cilt.15, sa.2, ss.233-242, 2013 (SCI-Expanded, Scopus)

42. Polar permutation graphs are polynomial-time recognisable

EKİM T., Heggernes P., Meister D.
European Journal of Combinatorics , cilt.34, sa.3, ss.576-592, 2013 (SCI-Expanded, Scopus)

43. Some Defective Parameters in Graphs

EKİM T., Gimbel J.
Graphs and Combinatorics , cilt.29, sa.2, ss.213-224, 2013 (SCI-Expanded, Scopus)

44. Integer programming formulations for the minimum weighted maximal matching problem

TAŞKIN Z. C., EKİM T.
Optimization Letters , cilt.6, sa.6, ss.1161-1171, 2012 (SCI-Expanded, Scopus)

45. Split-critical and uniquely split-colorable graphs

EKİM T., Ries B., De Werra D.
Discrete Mathematics and Theoretical Computer Science , cilt.12, sa.5, ss.1-24, 2010 (SCI-Expanded, Scopus)

46. Recognizing line-polar bipartite graphs in time O(n)

EKİM T., Huang J.
Discrete Applied Mathematics , cilt.158, sa.15, ss.1593-1598, 2010 (SCI-Expanded, Scopus)

47. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics): Preface

Patt-Shamir B., EKİM T.
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) , cilt.6058 LNCS, 2010 (Scopus)

48. Partitioning graphs into complete and empty graphs

EKİM T., Gimbel J.
Discrete Mathematics , cilt.309, sa.19, ss.5849-5856, 2009 (SCI-Expanded, Scopus)

49. A tutorial on the use of graph coloring for some problems in robotics

Demange M., EKİM T., de Werra D.
European Journal of Operational Research , cilt.192, sa.1, ss.41-55, 2009 (SCI-Expanded, Scopus)

50. Polarity of chordal graphs

EKİM T., Hell P., Stacho J., de Werra D.
Discrete Applied Mathematics , cilt.156, sa.13, ss.2469-2479, 2008 (SCI-Expanded, Scopus)

51. Polar cographs

EKİM T., Mahadev N., de Werra D.
Discrete Applied Mathematics , cilt.156, sa.10, ss.1652-1660, 2008 (SCI-Expanded, Scopus)

52. Construction of balanced sports schedules using partitions into subleagues

Geinoz A., EKİM T., de Werra D.
Operations Research Letters , cilt.36, sa.3, ss.279-282, 2008 (SCI-Expanded, Scopus)

53. Polar cographs

EKİM T., Mahadev N., de Werra D.
Electronic Notes in Discrete Mathematics , cilt.28, ss.317-323, 2007 (Scopus)

54. Construction of sports schedules with multiple venues

De Werra D., EKİM T., Raess C.
Discrete Applied Mathematics , cilt.154, sa.1, ss.47-58, 2006 (SCI-Expanded, Scopus)

55. On the approximation of Min Split-coloring and Min Cocoloring

Demange M., EKİM T., De Werra D.
Journal of Graph Algorithms and Applications , cilt.10, sa.2, ss.297-315, 2006 (Scopus)

56. (p, k)-coloring problems in line graphs

Demange M., EKİM T., De Werra D.
Theoretical Computer Science , cilt.349, sa.3, ss.462-474, 2005 (SCI-Expanded, Scopus)

57. On split-coloring problems

EKİM T., De Werra D.
Journal of Combinatorial Optimization , cilt.10, sa.3, ss.211-225, 2005 (SCI-Expanded, Scopus)

58. Partitioning cographs into cliques and stable sets

Demange M., EKİM T., De Werra D.
Discrete Optimization , cilt.2, sa.2, ss.145-153, 2005 (Scopus)

59. Approximation preserving reductions for set covering, vertex covering and independent set hierarchies under differential approximation

EKİM T., Paschos V. T.
International Journal of Computer Mathematics , cilt.81, sa.5, ss.569-582, 2004 (SCI-Expanded, Scopus)
Hakemli Bilimsel Toplantılarda Yayımlanmış Bildiriler 19

1. Maximum number of edges in triangle-tree graphs with bounded degree and matching number

Ahanjideh M., EKİM AŞICI T., YILDIZ M. A.
ICGT 2022, Montpellier, Fransa, 04 Temmuz 2022, cilt.1, ss.1-4, (Tam Metin Bildiri)

2. The Nobel Prize in Economic Sciences 2012 and Matching Theory

EKİM T.
9th International Conference on Operations Research and Enterprise Systems, ICORES 2020, Valletta, Malta, 22 - 24 Şubat 2020, ss.5-16, (Tam Metin Bildiri)

3. The Nobel Prize in economic sciences 2012 and matching theory

EKİM T.
9th International Conference on Operations Research and Enterprise Systems, ICORES 2020, Valletta, Malta, 22 - 24 Şubat 2020, ss.5-16, (Tam Metin Bildiri)

4. The Complexity of Subtree Intersection Representation of Chordal Graphs and Linear Time Chordal Graph Generation

EKİM T., Shalom M., Şeker O.
Special Event on Analysis of Experimental Algorithms, SEA² 2019, Kalamata, Yunanistan, 24 - 29 Haziran 2019, cilt.11544 LNCS, ss.21-34, (Tam Metin Bildiri)

5. The Selective Coloring Problem

EKİM AŞICI T.
SIAM Conference on Discrete Mathematics, 4 - 08 Haziran 2018, (Özet Bildiri)

6. Recent Results on Equimatchable Graphs

EKİM AŞICI T.
Combinatorial Potlatch, 18 Kasım 2017, (Özet Bildiri)

7. An empirical study on online frequency assignment problem (FAP)

Bayramoğlu S., Arici B. T., Çetinok A. Ö., EKİM AŞICI T.
International Conference on Operations Research, OR2017, 6 - 08 Eylül 2017, (Özet Bildiri)

8. A Decomposition Approach to Solve the Selective Graph Coloring Problem in Certain Perfect Graph Families

ŞEKER O., EKİM AŞICI T., TAŞKIN Z. C.
7th PhD Summer School in Discrete Mathematics, 23 - 29 Temmuz 2017, (Özet Bildiri)

9. Linear-time generation of random chordal graphs

Sëker O., Heggernes P., EKİM T., TAŞKIN Z. C.
10th International Conference on Algorithms and Complexity, CIAC 2017, Athens, Yunanistan, 24 - 26 Mayıs 2017, cilt.10236 LNCS, ss.442-453, (Tam Metin Bildiri)

10. Characterization of Stable Equimatchable Graphs

DENİZ Z., EKİM AŞICI T.
Bordeaux Graph Workshop, 6 - 10 Kasım 2016, (Tam Metin Bildiri)

11. Integer Programming Formulations and DecompositionAlgorithms for Maximum Induced Matching Problem

TAŞKIN Z. C., AHAT B., EKİM AŞICI T.
International Conference on Operations Research - Analytical Thinking, 30 Ağustos - 02 Eylül 2016, (Özet Bildiri)

12. Minimum Maximal Matching and Equimatchable Graphs

EKİM AŞICI T., Duran A. O.
GTÜ Matematik Seminerleri, Türkiye, 11 - 13 Aralık 2015

13. On the Minimum and Maximum Selective GraphColoring Problems

Demange M., EKİM AŞICI T., Ries B.
CTW, 24 - 26 Mayıs 2015, (Özet Bildiri)

14. The Max Cut Problem In Co bipartite Chain Graphs

Boyacı A., EKİM AŞICI T., Shalom M.
WCGO, 22 - 25 Şubat 2015, (Özet Bildiri)

15. Graphs of edge-intersecting and non-splitting paths

Boyaci A., EKİM T., Shalom M., Zaks S.
15th Italian Conference on Theoretical Computer Science, ICTCS 2014, Perugia, İtalya, 17 - 19 Eylül 2014, cilt.1231, ss.45-58, (Tam Metin Bildiri)

16. Graphs of edge-intersecting non-splitting paths in a tree: Towards hole representations (extended abstract)

Boyaci A., EKİM T., Shalom M., Zaks S.
39th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2013, Lübeck, Almanya, 19 - 21 Haziran 2013, cilt.8165 LNCS, ss.115-126, (Tam Metin Bildiri)

17. Computing minimum geodetic sets of proper interval graphs

EKİM T., Erey A., Heggernes P., Van 'T Hof P., Meister D.
10th Latin American Symposiumon Theoretical Informatics, LATIN 2012, Arequipa, Peru, 16 - 20 Nisan 2012, cilt.7256 LNCS, ss.279-290, (Tam Metin Bildiri)

18. Polar permutation graphs

EKİM T., Heggernes P., Meister D.
20th International Workshop on Combinatorial Algorithms, IWOCA 2009, Hradec nad Moravici, Çek Cumhuriyeti, 28 Haziran - 02 Temmuz 2009, cilt.5874 LNCS, ss.218-229, (Tam Metin Bildiri)

19. Minimum maximal matching is np-hard in regular bipartite graphs

Demange M., EKİM T.
5th International Conference on Theory and Applications of Models of Computation, TAMC 2008, Xian, Çin, 25 - 29 Nisan 2008, cilt.4978 LNCS, ss.364-374, (Tam Metin Bildiri)
Kitaplar 1

1. Minimum maximal matching is NP-hard in regular bipartite graphs

Demange M., EKİM AŞICI T.
Lecture Notes in Computer Science Theory and Applications of Models of Computation, Manindra Agrawal, Dingzhu Du, Zhenhua Duan, Angsheng Li , Editör, Springer, ss.364-374, 2008
Metrikler

Yayın

79

Yayın (Scopus)

68

Atıf (Scopus)

504

H-İndeks (Scopus)

12

Proje

2

Tez Danışmanlığı

19

Açık Erişim

25
BM Sürdürülebilir Kalkınma Amaçları
SDG 15: AMAÇ 15: KARASAL YAŞAM