Skip to content
akaturk Academic measurement
Sign in Sign up

Academician

TINAZ EKİM

Profesör

Boğaziçi Üniversitesi Mühendislik Fakültesi Endüstri Mühendisliği Bölümü

Research topics OpenAlex
  1. Ana Dal Mühendislik Temel Alanı
  2. Yan Dal Endüstri Mühendisliği
Keywords YÖKSİS
Articles 55 YÖKSİS 55 · OpenAlex 0 Total citations 483 h-index 12 · OpenAlex OpenAlex coverage %91 matched 50 / 55 Q1 articles 22 Scopus · WoS Q1 4 Best field rank #14 / 675 Keyword · top 2.1% Co-authors 53 3 Turkish institutions

Citation impact

Citation counts of the articles matched in OpenAlex, citing publications from Crossref and the Stanford/Elsevier list. Sources are shown separately and never added up.

OpenAlex YÖKSİS articles matched in OpenAlex: 50 + YÖKSİS · co-author record: 1
h-index 12 Percentile in Türkiye: 89 #105 of 576 at their university by h-index
i10-index
14
Total citations
483
Top 12% in Türkiye
Per article
9.5
FWCI
1.10
1.00 = world average
World top 1%
0
World top 10%
8

Most cited articles

  1. On some applications of the selective graph coloring problem 2015 world top 10% 58 citations
  2. Computing Minimum Geodetic Sets of Proper Interval Graphs 2012 world top 10% 32 citations
  3. Polarity of chordal graphs 2008 world top 10% 32 citations
How is this computed?

h-index and citations are computed from the citation counts of this academic’s YÖKSİS articles matched in OpenAlex (not Google Scholar, WoS or Scopus). Unmatched articles are not included. 1 articles (2 citations) tagged with this academic’s YÖK author id in co-authors’ YÖKSİS records count only towards citations, h-index and i10; article counts, percentiles and rankings use their own YÖKSİS list. h-index on the OpenAlex author profile: 12.

Citing publications Crossref 66 publications citing 50 DOI-bearing articles · 14 Türkiye-affiliated
  • 2017 1
  • 2019 8
  • 2020 23
  • 2021 22
  • 2022 10
  • 2025 1
  • 2026 1
  1. DOI 10.1109/tsmc.2025.3629990 2026
  2. DOI 10.1016/j.procs.2025.10.336 2025
  3. On the maximum cardinality cut problem in proper interval graphs and related graph classes TR Arman Boyacı et al. · Theoretical Computer Science · 2022 · cites 2 articles of this academic
  4. Generation of random chordal graphs using subtrees of a tree TR Oylum Şeker et al. · RAIRO - Operations Research · 2022
  5. DOI 10.1287/ijoc.2021.1074 2022
  6. DOI 10.7717/peerj-cs.836 2022
  7. DOI 10.1109/twc.2022.3146624 2022
  8. DOI 10.1016/j.ejor.2022.02.025 2022
  9. DOI 10.1007/s00373-022-02463-5 2022
  10. DOI 10.1109/tcyb.2020.3025819 2022 · cites 3 articles of this academic
  11. DOI 10.1287/ijoc.2022.1164 2022
  12. DOI 10.1007/s00453-022-00953-9 2022
  13. An exact cutting plane algorithm to solve the selective graph coloring problem in perfect graphs TR Oylum Şeker et al. · European Journal of Operational Research · 2021 · cites 2 articles of this academic
  14. Triangle‐free equimatchable graphs TR Yasemin Büyükçolak et al. · Journal of Graph Theory · 2021 · cites 2 articles of this academic
  15. On graphs all of whose total dominating sequences have the same length TR Selim Bahadır et al. · Discrete Mathematics · 2021
  16. The complexity of subtree intersection representation of chordal graphs and linear time chordal graph generation TR Tınaz Ekim et al. · Journal of Combinatorial Optimization · 2021 · cites 4 articles of this academic
  17. Exact values of defective Ramsey numbers in graph classes TR Yunus Emre Demirci et al. · Discrete Optimization · 2021 · cites 3 articles of this academic
  18. A Maximum Cardinality Cut Algorithm for Co-bipartite and Split Graphs Using Bimodular Decomposition TR Arman BOYACI et al. · Turkish Journal of Mathematics and Computer Science · 2021
  19. DOI 10.1109/globecom46510.2021.9685876 2021
  20. DOI 10.5934/kjhe.2021.30.2.277 2021
  21. DOI 10.1016/j.ejc.2020.103208 2021
  22. DOI 10.1016/j.dam.2020.12.023 2021
  23. DOI 10.1007/978-3-030-89543-3_32 2021
  24. DOI 10.1007/s00453-021-00837-4 2021 · cites 3 articles of this academic
  25. DOI 10.1016/j.procs.2021.11.013 2021
  26. DOI 10.1016/j.disc.2021.112407 2021 · cites 3 articles of this academic
  27. DOI 10.1137/19m1280399 2021
  28. DOI 10.1016/j.tcs.2021.05.004 2021
  29. DOI 10.14232/actacyb.289041 2021
  30. DOI 10.1016/j.dam.2021.07.006 2021

Showing the 30 most recent.

Where does this list come from?

Extracted from the reference lists in Crossref’s public March 2026 data file; 20.3% of the file has been processed, so the list may be incomplete. Crossref citations are never added to or compared with the OpenAlex citation counts; the two sources have different coverage.

Field ranking

Position in the main-field, side-field and keyword cohorts by YÖKSİS article score; each card opens that ranking.

YÖKSİS ?
Keyword rankings 2

Works 55

YÖKSİS and OpenAlex records: index distribution, journals published in, a filterable article list and the other output types.

Indexes and citation percentiles

?
TR Index 0 articles
OpenAlex citation percentile
Top 1%0
Top 10%8
Avg · n 51 %62.7
Other counts

Scopus (SJR)

  • YÖKSİS rows 54

WoS (JCR)

  • YÖKSİS rows 53

Articles

Articles with YÖKSİS and OpenAlex source split; narrow by quartile or TR Index.

55articles

Journals with publications

20 journals

Narrow down

Scopus (SJR)
Q122 Q226 Q35 Q40
WoS (JCR)
Q14 Q210 Q320 Q418
TR Index
0articles

Article list

  1. 2024 Maximum size of a triangle-free graph with bounded maximum degree and matching number Journal of Combinatorial Optimization DOI 10.1007/s10878-024-01123-z 2 YÖKSİS records YÖKSİS SJR Q2 JCR Q2 OpenAlex 79.2%
  2. 2024 Critical equimatchable graphs AUSTRALASIAN JOURNAL OF COMBINATORICS DOI https://ajc.maths.uq.edu.au/pdf/88/ajc_v88_p171.pdf YÖKSİS SJR Q2 JCR Q4
  3. 2023 Constructing extremal triangle-free graphs using integer programming Discrete Optimization DOI 10.1016/j.disopt.2023.100802 YÖKSİS SJR Q3 JCR Q3 OpenAlex 72.6%
  4. 2023 Defensive domination in proper interval graphs Discrete Applied Mathematics DOI 10.1016/j.dam.2023.01.016 YÖKSİS SJR Q2 JCR Q3 OpenAlex 42.3%
  5. 2023 Defective Ramsey Numbers and Defective Cocolorings in Some Subclasses of Perfect Graphs Graphs and Combinatorics DOI 10.1007/s00373-023-02612-4 YÖKSİS SJR Q2 JCR Q3 OpenAlex 2.3%
  6. 2023 Well-indumatched trees and graphs of bounded girth AUSTRALASIAN JOURNAL OF COMBINATORICS DOI https://ajc.maths.uq.edu.au/pdf/85/ajc_v85_p061.pdf YÖKSİS SJR Q3 JCR Q4
  7. 2022 Generation of random chordal graphs using subtrees of a tree EDP Sciences RAIRO Operations Research DOI 10.1051/ro/2022027 YÖKSİS SJR Q3 JCR Q3 OpenAlex 0.2%
  8. 2022 On the maximum cardinality cut problem in proper interval graphs and related graph classes Theoretical Computer Science DOI 10.1016/j.tcs.2021.10.014 YÖKSİS SJR Q2 JCR Q4 OpenAlex 45.2%
  9. 2021 Exact values of defective Ramsey numbers in graph classes Discrete Optimization DOI 10.1016/j.disopt.2021.100673 YÖKSİS SJR Q2 JCR Q2 OpenAlex 66.6%
  10. 2021 An exact cutting plane algorithm to solve the selective graph coloring problem in perfect graphs European Journal of Operational Research DOI 10.1016/j.ejor.2020.09.017 YÖKSİS SJR Q1 JCR Q1 OpenAlex 51.7%
  11. 2021 Well-totally-dominated graphs Ars Mathematica Contemporanea DOI 10.26493/1855-3974.2465.571 YÖKSİS SJR Q2 JCR Q3 OpenAlex 3.1%
  12. 2021 The complexity of subtree intersection representation of chordal graphs and linear time chordal graph generation Journal of Combinatorial Optimization DOI 10.1007/s10878-021-00712-6 YÖKSİS SJR Q2 JCR Q3 OpenAlex 55.3%
  13. 2020 Mind the independence gap DISCRETE MATHEMATICS DOI 10.1016/j.disc.2020.111943 YÖKSİS SJR Q1 JCR Q3 OpenAlex 1.6%
  14. 2020 The Complexity of the Defensive Domination Problem in Special Graph Classes DISCRETE MATHEMATICS DOI 10.1016/j.disc.2019.111665 YÖKSİS SJR Q1 JCR Q3 OpenAlex 55.6%
  15. 2019 Small 1-defective Ramsey numbers in perfect graphs Discrete Optimization DOI 10.1016/j.disopt.2019.06.001 YÖKSİS SJR Q2 JCR Q3 OpenAlex 77.8%
  16. 2019 A decomposition approach to solve the selective graph coloring problem in some perfect graph families Networks DOI 10.1002/net.21850 YÖKSİS SJR Q1 JCR Q2 OpenAlex 84.6%
  17. 2019 Edge-stable equimatchable graphs Discrete Applied Mathematics DOI 10.1016/j.dam.2018.09.033 YÖKSİS SJR Q2 JCR Q3 OpenAlex 10.0%
  18. 2018 Integer Programming Formulations and Benders Decomposition for the Maximum Induced Matching Problem INFORMS Journal on Computing DOI 10.1287/ijoc.2017.0764 YÖKSİS SJR Q1 JCR Q2 OpenAlex 19.5%
  19. 2018 The maximum cardinality cut problem in co-bipartite chain graphs Journal of Combinatorial Optimization DOI 10.1007/s10878-015-9963-x YÖKSİS SJR Q2 JCR Q3 OpenAlex 75.7%
  20. 2018 On almost well-covered graphs of girth at least 6 Discrete Mathematics and Theoretical Computer Science YÖKSİS SJR Q1 JCR Q4 OpenAlex 66.7%

Projects 14 See all (14) →

  1. 2022 Rastgele Çizge Üreteçleri -Tübitak 1001 · Tamamlandı 2022-10-01 – 2025-10-01
  2. 2012 Zor Problemleri Çözmek İçin Çizge Yapısının Kullanılması TÜBİTAK PROJESİ · Tamamlandı 2012-10-01 – 2015-04-01
  3. 2020 Artificial Intelligence Based Anti-Money Laundering Softwares TÜBİTAK PROJESİ · Tamamlandı 2020-01-01 – 2021-12-05
  4. 2019 Defective Ramsey Numbers in Graph Classes -Tübitak 1001 · Tamamlandı 2019-03-15 – 2021-09-15
  5. 2019 Domination and Total Domination in Graphs -Tübitak 1001 · Tamamlandı 2019-03-15 – 2021-03-15

Books 3

  1. 2019 Lecture Notes in Computer Science Springer ISBN 978-3-030-34028-5 Kitap Bölümü · Bilimsel Kitap
  2. 2012 Lecture Notes in computer Science Springer Kitap Bölümü · Bilimsel Kitap
  3. 2008 Lecture Notes in Computer Science Theory and Applications of Models of Computation Springer ISBN 978-3-540-79227-7 Kitap Bölümü · Bilimsel Kitap

Proceedings 21 See all (21) →

  1. 2016 Characterization of Stable Equimatchable Graphs Bordeaux Graph Workshop
  2. — Maximum number of edges in triangle-tree graphs with bounded degree and matching number ICGT 2022
  3. — Integer Programming Formulations and Cutting Plane Algorithms for the Maximum Selective Tree Problem 21st International Symposium on Experimental Algorithms (SEA 2023)
  4. 2019 The Complexity of Subtree Intersection Representationof Chordal Graphs and Linear Time Chordal Graph Generation InternationalSymposium on Experimental Algorithms SEA 2019
  5. 2017 Linear-time generation of random chordal graphs CIAC 2017, 10th International Conference onAlgorithms and Complexity

← Back to academicians

Collaboration network

From the author lists of YÖKSİS publication records. Duplicate records of a work count once; institutions are co-authors’ current YÖKSİS affiliations.

Co-authors
53
With an akaturk profile
3
Turkish institutions
3
Co-authored works
%100

Academic co-authors 3

  1. DİDEM GÖZÜPEK KOCAMAN Profesör · Gebze Teknik Üniversitesi 6
  2. ZAKİR DENİZ Doçent · Düzce Üniversitesi 3
  3. SELİM BAHADIR Doçent · Ankara Yıldırım Beyazıt Üniversitesi 1

National collaboration 3 institutions

  1. Gebze Teknik Üniversitesi 6 works · 1 academics
  2. Düzce Üniversitesi 3 works · 1 academics
  3. Ankara Yıldırım Beyazıt Üniversitesi 1 works · 1 academics

Other co-authors (incl. international) 50

Marc Demange 10Mordechai Shalom 10de Werra Dominique 8ZEKİ CANER TAŞKIN 7Arman Boyacı 6OYLUM ŞEKER 5Pinar Heggernes 5John Gimbel 4Bernard Ries 3CEMİL DİBEK 3Daniel Meister 3MEHMET AKİF YILDIZ 3Saieed Akbari 3AYSEL EREY 2Ademir Hujdurovic 2Andrzej Proskurowski 2Arthur Farley 2Cerasela Tanasescu 2Martin Milanic 2Shmuel Zaks 2YUNUS EMRE DEMİRCİ 2A. H. GhodratiAhu AkdemirAli Erdem BanakAlizadeh HadiBELİNAY TAKBERAT ALTAYBETÜL AHAT AKTELBeyzanur KIZILOĞLU AĞGÜLBonomo FlaviaChristophe RaessCornaz DenisGeinoz AlexandreHell PavolJing HuangMORDOHAY ŞALOMMahadev NVRMartin MilaničMerve BodurMilad Ahanjideh

Show all (50)

Nina ChiarelliPaniz AbedinPim Vant HofS. ZareSchmuel ZaksStacho JurajStefko MiklavicTAYLAN ERKULTatiana Romina HartingerÖZGE BIDAN

Authors without an akaturk profile (international researchers, retired or former academics, students, clinicians) are grouped by name spelling; short forms such as “Gulluce M.” join the single full name they match.