Ömer Eğeci̇oğlu
Impact in
-
- Advanced Combinatorial Mathematics
-
- semigroups and automata theory
- Complexity and Algorithms in Graphs
Papers in
-
- Advanced Combinatorial Mathematics 33
-
- semigroups and automata theory 13
- Complexity and Algorithms in Graphs 12
- Co-authors
- Abdullah N. Arslan (12 shared papers)Óscar H. Ibarra (15 shared papers)Amr El Abbadi (12 shared papers)Çetin Kaya Koç (14 shared papers)Jeffrey B. Remmel (5 shared papers)Sudipto Das (2 shared papers)Hakan Ferhatosmanoğlu (5 shared papers)Matteo Cavaliere (2 shared papers)
- Journals
- International Journal of Foundations of Computer Science (9 papers)Discrete Applied Mathematics (7 papers)Theoretical Computer Science (5 papers)Lecture notes in mathematics (4 papers)Computer Physics Communications (3 papers)
- Partner nations
- United StatesTürkiyeHungary
In The Last Decade
Ömer Eğeci̇oğlu
129 papers receiving 1.5k citations
Peers
Comparison fields: 5 of 66
- Discrete Mathematics and Combinatorics 206
- Computational Theory and Mathematics 270
- Computer Graphics and Computer-Aided Design 56
- Geometry and Topology 104
- Signal Processing 83
Countries citing papers authored by Ömer Eğeci̇oğlu
This map shows the geographic impact of Ömer Eğeci̇oğlu'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 Ömer Eğeci̇oğlu with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Ömer Eğeci̇oğlu more than expected).
Fields of papers citing papers by Ömer Eğeci̇oğlu
This network shows the impact of papers produced by Ömer Eğeci̇oğlu. 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 Ömer Eğeci̇oğlu. The network helps show where Ömer Eğeci̇oğlu may publish in the future.
Co-authors
The 25 scholars most cited alongside Ömer Eğeci̇oğlu, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
Showing the 20 most-cited of 142 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | 2009 | 134 | |
| 2 | 2010 | 77 | |
| 3 | 2001 | 61 | |
| 4 | 2007 | 46 | |
| 5 | 2005 | 45 | |
| 6 | 2009 | 40 | |
| 7 | 1986 | 39 | |
| 8 | 1997 | 38 | |
| 9 | 2003 | 38 | |
| 10 | 2004 | 34 | |
| 11 | Minimum-energy Broadcast in Simple Graphs with Limited Node Power | 2007 | 34 |
| 12 | 1989 | 32 | |
| 13 | Algorithms for the Constrained Longest Common Subsequence Problems. | 2004 | 32 |
| 14 | 1991 | 30 | |
| 15 | 1994 | 27 | |
| 16 | 1989 | 26 | |
| 17 | 2011 | 26 | |
| 18 | 2008 | 24 | |
| 19 | Efficient Algorithms For Normalized Edit Distance | 2000 | 23 |
| 20 | 2000 | 22 |
About Ömer Eğeci̇oğlu
Ömer Eğeci̇oğlu is a scholar working on Discrete Mathematics and Combinatorics, Computational Theory and Mathematics, Geometry and Topology, Hardware and Architecture and Computer Networks and Communications, having authored 142 papers that have together received 1.5k indexed citations. Recurring topics across this work include Advanced Combinatorial Mathematics (33 papers), Graph theory and applications (15 papers), semigroups and automata theory (13 papers), Parallel Computing and Optimization Techniques (13 papers), Algorithms and Data Compression (13 papers), Mathematical functions and polynomials (12 papers), Complexity and Algorithms in Graphs (12 papers) and Interconnection Networks and Systems (10 papers). The work is most often cited by research in Discrete Mathematics and Combinatorics (206 citations), Computational Theory and Mathematics (270 citations), Computer Graphics and Computer-Aided Design (56 citations), Geometry and Topology (104 citations) and Signal Processing (83 citations). Ömer Eğeci̇oğlu has collaborated with scholars based in United States, Türkiye and Hungary. Frequent co-authors include Abdullah N. Arslan, Óscar H. Ibarra, Amr El Abbadi, Çetin Kaya Koç, Jeffrey B. Remmel, Sudipto Das, Hakan Ferhatosmanoğlu, Matteo Cavaliere, Sara Woodworth and Gheorghe Pǎun. Their work appears in journals such as International Journal of Foundations of Computer Science, Discrete Applied Mathematics, Theoretical Computer Science, Lecture notes in mathematics and Computer Physics Communications.
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.