Tınaz Ekim

552 total citations
50 papers, 245 citations indexed

About

Tınaz Ekim is a scholar working on Computational Theory and Mathematics, Computer Networks and Communications and Discrete Mathematics and Combinatorics. According to data from OpenAlex, Tınaz Ekim has authored 50 papers receiving a total of 245 indexed citations (citations by other indexed papers that have themselves been cited), including 45 papers in Computational Theory and Mathematics, 17 papers in Computer Networks and Communications and 14 papers in Discrete Mathematics and Combinatorics. Recurrent topics in Tınaz Ekim's work include Advanced Graph Theory Research (42 papers), Graph Labeling and Dimension Problems (23 papers) and Limits and Structures in Graph Theory (14 papers). Tınaz Ekim is often cited by papers focused on Advanced Graph Theory Research (42 papers), Graph Labeling and Dimension Problems (23 papers) and Limits and Structures in Graph Theory (14 papers). Tınaz Ekim collaborates with scholars based in Türkiye, Switzerland and Israel. Tınaz Ekim's co-authors include D. de Werra, Marc Demange, Bernard Ries, Z. Caner Taşkın, Mordechai Shalom, N. V. R. Mahadev, John Gimbel, Pavol Hell, Jing Huang and Pinar Heggernes and has published in prestigious journals such as European Journal of Operational Research, Theoretical Computer Science and Lecture notes in computer science.

In The Last Decade

Tınaz Ekim

42 papers receiving 231 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name	h						Papers	Cites
Tınaz Ekim Türkiye	9	178	69	62	50	49	50	245
Mihály Hujter Hungary	6	194 1.1×	42 0.6×	49 0.8×	83 1.7×	22 0.4×	12	250
N. V. R. Mahadev United States	10	215 1.2×	75 1.1×	44 0.7×	51 1.0×	27 0.6×	30	277
Pim van ’t Hof Norway	12	280 1.6×	122 1.8×	19 0.3×	47 0.9×	16 0.3×	40	327
Uéverton S. Souza Brazil	8	138 0.8×	55 0.8×	19 0.3×	42 0.8×	9 0.2×	68	190
Frank Gurski Germany	9	144 0.8×	72 1.0×	26 0.4×	18 0.4×	5 0.1×	26	186
Bart M. P. Jansen Netherlands	10	216 1.2×	54 0.8×	18 0.3×	37 0.7×	7 0.1×	45	254
Ana Silva Brazil	9	130 0.7×	29 0.4×	9 0.1×	58 1.2×	12 0.2×	50	181
Frederic Dorn Norway	9	178 1.0×	75 1.1×	9 0.1×	25 0.5×	1 0.0×	16	207
Aris Pagourtzis Greece	7	33 0.2×	74 1.1×	12 0.2×	3 0.1×	8 0.2×	36	146
Kent Andersen Belgium	7	94 0.5×	14 0.2×	100 1.6×	1 0.0×	12 0.2×	10	158

Countries citing papers authored by Tınaz Ekim

Since Specialization

Citations

This map shows the geographic impact of Tınaz Ekim's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Tınaz Ekim with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Tınaz Ekim more than expected).

Fields of papers citing papers by Tınaz Ekim

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Tınaz Ekim. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Tınaz Ekim. The network helps show where Tınaz Ekim may publish in the future.

Co-authorship network of co-authors of Tınaz Ekim

This figure shows the co-authorship network connecting the top 25 collaborators of Tınaz Ekim. A scholar is included among the top collaborators of Tınaz Ekim based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Tınaz Ekim. Tınaz Ekim is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

Ekim, Tınaz, et al.. (2024). Maximum size of a triangle-free graph with bounded maximum degree and matching number. Journal of Combinatorial Optimization. 47(4).

Ekim, Tınaz, Arthur M. Farley, Andrzej Proskurowski, & Mordechai Shalom. (2023). Defensive domination in proper interval graphs. Discrete Applied Mathematics. 331. 59–69. 1 indexed citations

Ekim, Tınaz, et al.. (2019). Small 1-defective Ramsey numbers in perfect graphs. Discrete Optimization. 34. 100548–100548. 2 indexed citations

Ekim, Tınaz, Arthur M. Farley, & Andrzej Proskurowski. (2019). The complexity of the defensive domination problem in special graph classes. Discrete Mathematics. 343(2). 111665–111665. 2 indexed citations

Akbari, Saieed, et al.. (2018). Equimatchable claw-free graphs. Discrete Mathematics. 341(10). 2859–2871. 1 indexed citations

Ekim, Tınaz, et al.. (2018). On Almost Well-Covered Graphs of Girth at Least 6. Discrete Mathematics & Theoretical Computer Science. vol. 20 no. 2(Graph Theory).

Ekim, Tınaz, et al.. (2017). Graphs of Edge-Intersecting and Non-Splitting One Bend Paths in a Grid. Discrete Mathematics & Theoretical Computer Science. Vol. 19 no. 1(Graph Theory).

Ekim, Tınaz, et al.. (2017). Maximum number of edges in claw-free graphs whose maximum degree and matching number are bounded. Discrete Mathematics. 340(5). 927–934. 4 indexed citations

Ekim, Tınaz, et al.. (2015). Graphs of edge-intersecting and non-splitting paths. Theoretical Computer Science. 629. 40–50. 1 indexed citations

10.

Ekim, Tınaz, et al.. (2015). Advances on defective parameters in graphs. Discrete Optimization. 16. 62–69. 2 indexed citations

11.

Demange, Marco Kawamura, Tınaz Ekim, & Bernard Ries. (2015). On the minimum and maximum selective graph coloring problems in some graph classes. Discrete Applied Mathematics. 204. 77–89. 7 indexed citations

12.

Demange, Marc & Tınaz Ekim. (2013). A note on the NP-hardness of two matching problems in induced subgrids. Discrete Mathematics & Theoretical Computer Science. Vol. 15 no. 2(Graph Theory). 3 indexed citations

13.

Demange, Marc & Tınaz Ekim. (2013). Efficient recognition of equimatchable graphs. Information Processing Letters. 114(1-2). 66–71. 5 indexed citations

14.

Ekim, Tınaz, Pinar Heggernes, & Daniel Meister. (2012). Polar permutation graphs are polynomial-time recognisable. European Journal of Combinatorics. 34(3). 576–592. 2 indexed citations

15.

Ekim, Tınaz, et al.. (2008). Polarity of chordal graphs. Discrete Applied Mathematics. 156(13). 2469–2479. 17 indexed citations

16.

Ekim, Tınaz & John Gimbel. (2008). Partitioning graphs into complete and empty graphs. Discrete Mathematics. 309(19). 5849–5856. 4 indexed citations

17.

Ekim, Tınaz, N. V. R. Mahadev, & D. de Werra. (2007). Polar cographs. Discrete Applied Mathematics. 156(10). 1652–1660. 15 indexed citations

18.

Werra, D. de, et al.. (2005). Construction of sports schedules with multiple venues. Discrete Applied Mathematics. 154(1). 47–58. 19 indexed citations

19.

Demange, Marc, Tınaz Ekim, & D. de Werra. (2005). (p,k)-coloring problems in line graphs. Theoretical Computer Science. 349(3). 462–474. 5 indexed citations

20.

Demange, Marc, Tınaz Ekim, & D. de Werra. (2005). Partitioning cographs into cliques and stable sets. Discrete Optimization. 2(2). 145–153. 15 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact