Ömer Eğecioǧlu

2.1k citations
111 papers · 1.1k indexed · h-index 18

Ömer Eğecioǧlu

100 papers receiving 1.0k citations

Peers

Ömer Eğecioǧlu
Comparison fields: 5 of 98
  • Discrete Mathematics and Combinatorics 114
  • Computational Theory and Mathematics 271
  • Computer Graphics and Computer-Aided Design 55
  • Signal Processing 146
  • Hardware and Architecture 85
Replace Lawrence L. Larmore with:
Lawrence L. Larmore United States
Adolfo Piperno Italy
Frank Ruskey Canada
Frank Olaf Wagner France
Arnold Schönhage Germany
Virginia Vassilevska Williams United States
Josep Dı́az Spain
Ravindran Kannan United States
Aviezri S. Fraenkel Israel
Shmuel Zaks Israel
Ömer Eğecioǧlu relative to Lawrence L. Larmore United States Lawrence L. Larmore's profile →
Citations per field
00.5×3.7×
Lawrence L. Larmore · 1×
Citations per year

Countries citing papers authored by Ömer Eğecioǧlu

Since Specialization
Citations

This map shows the geographic impact of Ömer Eğecioǧ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ğecioǧ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ğecioǧlu more than expected).

Fields of papers citing papers by Ömer Eğecioǧlu

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Ömer Eğecioǧ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ğecioǧlu. The network helps show where Ömer Eğecioǧlu may publish in the future.

Co-authorship network

The 25 scholars most cited alongside Ömer Eğecioǧlu, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.

Border = papers with Ömer Eğecioǧlu Line = papers co-authored together Ömer Eğecioǧlu links everyone, so they are left out of the graph.

All Works

20 of 20 papers shown
#Work
1 20240
2 20231
3 20231
4 20213
5 20213
6 20215
7 20202
8 20112
9
Algorithms for the Constrained Longest Common Subsequence Problems.
200420
10 200327
11 200146
12
Experimental Studies on a Compact Storage Scheme for Wavelet-based Multiresolution Subregion Retrieval
19965
13 199612
14 199421
15 19929
16 19911
17 199124
18 19897
19 198930
20
Computable functions and complexity in neural networks
19872

About Ömer Eğecioǧlu

Ömer Eğecioǧlu is a scholar working on Discrete Mathematics and Combinatorics, Computer Graphics and Computer-Aided Design, Computational Theory and Mathematics, Geometry and Topology and Hardware and Architecture, having authored 111 papers that have together received 1.1k indexed citations. Recurring topics across this work include Algorithms and Data Compression (20 papers), Interconnection Networks and Systems (14 papers), Advanced Combinatorial Mathematics (14 papers), Graph theory and applications (12 papers), DNA and Biological Computing (9 papers), Advanced Mathematical Theories and Applications (8 papers), Parallel Computing and Optimization Techniques (8 papers) and Advanced Graph Theory Research (7 papers). The work is most often cited by research in Discrete Mathematics and Combinatorics (114 citations), Computational Theory and Mathematics (271 citations), Computer Graphics and Computer-Aided Design (55 citations), Signal Processing (146 citations) and Hardware and Architecture (85 citations). Ömer Eğecioǧlu has collaborated with scholars based in United States, Türkiye and Hungary. Frequent co-authors include Abdullah N. Arslan, Amr El Abbadi, Çetin Kaya Koç, Jeffrey B. Remmel, Óscar H. Ibarra, Sudipto Das, Hakan Ferhatosmanoğlu, Teofilo F. Gonzalez, Divyakant Agrawal and Mihai Ionescu. Their work appears in journals such as International Journal of Foundations of Computer Science, Discrete Applied Mathematics, Theoretical Computer Science, IEEE Transactions on Knowledge and Data Engineering and The Electronic Journal of Combinatorics.

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

Rankless by CCL
2026