Costas S. Iliopoulos

4.6k total citations
206 papers, 1.9k citations indexed

About

Costas S. Iliopoulos is a scholar working on Artificial Intelligence, Molecular Biology and Computational Theory and Mathematics. According to data from OpenAlex, Costas S. Iliopoulos has authored 206 papers receiving a total of 1.9k indexed citations (citations by other indexed papers that have themselves been cited), including 135 papers in Artificial Intelligence, 78 papers in Molecular Biology and 61 papers in Computational Theory and Mathematics. Recurrent topics in Costas S. Iliopoulos's work include Algorithms and Data Compression (125 papers), semigroups and automata theory (50 papers) and DNA and Biological Computing (40 papers). Costas S. Iliopoulos is often cited by papers focused on Algorithms and Data Compression (125 papers), semigroups and automata theory (50 papers) and DNA and Biological Computing (40 papers). Costas S. Iliopoulos collaborates with scholars based in United Kingdom, Australia and France. Costas S. Iliopoulos's co-authors include Solon P. Pissis, Maxime Crochemore, M. Sohel Rahman, Tomáš Flouri, W.F. Smyth, Laurent Mouchard, Mai Alzamel, Yoan J. Pinzón, Kunsoo Park and Alberto Apostolico and has published in prestigious journals such as Bioinformatics, Automatica and International Journal of Molecular Sciences.

In The Last Decade

Costas S. Iliopoulos

188 papers receiving 1.8k citations

Peers — A (Enhanced Table)

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

Name	h						Papers	Cites
Costas S. Iliopoulos United Kingdom	22	1.1k	696	559	274	257	206	1.9k
Alberto Apostolico United States	25	1.8k 1.6×	1.1k 1.6×	708 1.3×	165 0.6×	232 0.9×	117	2.2k
Amihood Amir United States	26	1.5k 1.4×	782 1.1×	712 1.3×	138 0.5×	186 0.7×	159	1.9k
Maxime Crochemore France	25	2.0k 1.8×	961 1.4×	1.1k 2.0×	198 0.7×	199 0.8×	147	2.5k
Giovanni Manzini Italy	26	1.9k 1.8×	1.2k 1.7×	611 1.1×	219 0.8×	354 1.4×	86	2.5k
Yanjun Qi United States	27	1.4k 1.3×	1.3k 1.9×	300 0.5×	417 1.5×	451 1.8×	79	3.3k
D. S. Hirschberg United States	14	965 0.9×	477 0.7×	406 0.7×	125 0.5×	170 0.7×	39	1.7k
Douglas L. Maskell Singapore	31	1.3k 1.2×	949 1.4×	151 0.3×	172 0.6×	116 0.5×	160	3.2k
Thomas G. Szymanski United States	18	1.0k 0.9×	388 0.6×	504 0.9×	116 0.4×	174 0.7×	42	1.8k
Gerth Stølting Brodal Denmark	19	571 0.5×	178 0.3×	319 0.6×	250 0.9×	194 0.8×	96	1.2k
Frank Dehne Canada	22	209 0.2×	596 0.9×	338 0.6×	188 0.7×	185 0.7×	119	1.6k

Countries citing papers authored by Costas S. Iliopoulos

Since Specialization

Citations

This map shows the geographic impact of Costas S. Iliopoulos'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 Costas S. Iliopoulos with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Costas S. Iliopoulos more than expected).

Fields of papers citing papers by Costas S. Iliopoulos

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Costas S. Iliopoulos. 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 Costas S. Iliopoulos. The network helps show where Costas S. Iliopoulos may publish in the future.

Co-authorship network of co-authors of Costas S. Iliopoulos

This figure shows the co-authorship network connecting the top 25 collaborators of Costas S. Iliopoulos. A scholar is included among the top collaborators of Costas S. Iliopoulos 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 Costas S. Iliopoulos. Costas S. Iliopoulos 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

Papageorgiou, Louis, Eleni Papakonstantinou, Dimitrios Chaniotis, et al.. (2024). SNP and Structural Study of the Notch Superfamily Provides Insights and Novel Pharmacological Targets against the CADASIL Syndrome and Neurodegenerative Diseases. Genes. 15(5). 529–529. 1 indexed citations

Pockrandt, Christopher, Mai Alzamel, Costas S. Iliopoulos, & Knut Reinert. (2020). GenMap: ultra-fast computation of genome mappability. Bioinformatics. 36(12). 3687–3692. 102 indexed citations

Iliopoulos, Costas S., et al.. (2014). Optimal computation of all tandem repeats in a weighted sequence. Algorithms for Molecular Biology. 9(1). 21–21. 5 indexed citations

Iliopoulos, Costas S., et al.. (2014). Fast algorithms for approximate circular string matching. Algorithms for Molecular Biology. 9(1). 9–9. 16 indexed citations

Christodoulakis, Manolis, et al.. (2014). Abelian borders in binary words. Discrete Applied Mathematics. 171. 141–146. 8 indexed citations

Flouri, Tomáš, et al.. (2013). GapMis: a Tool for Pairwise Sequence Alignment with a Single Gap. PubMed. 7(2). 84–95. 6 indexed citations

Iliopoulos, Costas S., et al.. (2013). Circular string matching revisited. Research Portal (King's College London). 200–205. 1 indexed citations

Iliopoulos, Costas S. & Solon P. Pissis. (2013). Verifying an enhanced cover array in linear time. Research Portal (King's College London). 4 indexed citations

Iliopoulos, Costas S. & W.F. Smyth. (2011). Combinatorial Algorithms: 21st International Workshop, IWOCA 2010, London, UK, July 26-28, 2010, Revised Selected Papers. Murdoch Research Repository (Murdoch University).

10.

Iliopoulos, Costas S. & Md. Saidur Rahman. (2008). Algorithms for Two Versions of LCS Problem for Indeterminate Strings ⋆. 4 indexed citations

11.

Antoniou, Pavlos, et al.. (2008). Conservative String Covering of Indeterminate Strings.. Research Portal (King's College London). 108–115. 6 indexed citations

12.

Cole, Richard, et al.. (2003). Computing the minimum k-Cover of a string. Murdoch Research Repository (Murdoch University). 51–64. 7 indexed citations

13.

Crochemore, Maxime, Costas S. Iliopoulos, Thierry Lecroq, Wojciech Plandowski, & Wojciech Rytter. (2002). Three Heuristics for delta-Matching: delta-BM Algorithms. Research Portal (King's College London). 3 indexed citations

14.

Iliopoulos, Costas S., Thierry Lecroq, Laurent Mouchard, & Yoan J. Pinzón. (2000). Computing Approximate Repetitions in Musical Sequences.. 49–59. 10 indexed citations

15.

Crochemore, Maxime, Costas S. Iliopoulos, & Yoan J. Pinzón. (2000). Computing Evolutionary Chains in Musical Sequences. The Electronic Journal of Combinatorics. 8(2). 6 indexed citations

16.

Cambouropoulos, Emilios, et al.. (1999). Algorithms for Computing Approximate Repetitions in Musical Sequences. HAL (Le Centre pour la Communication Scientifique Directe). 6 indexed citations

17.

Iliopoulos, Costas S., et al.. (1998). The covers of a circular Fibonacci string. Journal of Combinatorial Mathematics and Combinatorial Computing. 6 indexed citations

18.

Ben-Amram, Amir M., Omer Berkman, Costas S. Iliopoulos, & Kunsoo Park. (1994). The subtree max gap problem with application to parallel string covering. Symposium on Discrete Algorithms. 501–510. 10 indexed citations

19.

Iliopoulos, Costas S., et al.. (1994). Parallel RAM algorithms for factorizing words. Theoretical Computer Science. 127(1). 53–67. 11 indexed citations

20.

Iliopoulos, Costas S. & Laurent Mouchard. (1968). Quasiperiodicity: From Detection to Normal Forms.. Automatica. 34(3). 213–224. 6 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