2026 Costas S. Iliopoulos: Mathematics Researcher – H-Index, Publications & Awards

Discipline name	D-Index	World Ranking	Current World Ranking	National Ranking	Current National Ranking	Publications	Citations
Computer Science	42	8368	8132	507	500	478	7655
Mathematics	38	2329	2064	154	136	382	6652

Overview

Costas S. Iliopoulos is affiliated with King's College London in the United Kingdom. Their research spans multiple fields, primarily focusing on Computer Science and Biochemistry, Genetics and Molecular Biology. Within these areas, their work delves into subfields including Molecular Biology, Artificial Intelligence, Computational Theory and Mathematics, Computer Vision and Pattern Recognition, and Signal Processing.

The scientist's main topics of study involve algorithms and data compression, semigroups and automata theory, genomics and phylogenetic studies, DNA and biological computing, natural language processing techniques, RNA and protein synthesis mechanisms, and biometric identification and security.

Recent publications by Costas S. Iliopoulos include:

"GenMap: ultra-fast computation of genome mappability," 2020, Bioinformatics
"Hiding patients' medical reports using an enhanced wavelet steganography algorithm in DICOM images," 2022, Alexandria Engineering Journal
"Comparing Degenerate Strings," 2020, Fundamenta Informaticae
"IUPACpal: efficient identification of inverted repeats in IUPAC-encoded DNA sequences," 2021, BMC Bioinformatics
"Property Suffix Array with Applications in Indexing Weighted Sequences," 2020, ACM Journal of Experimental Algorithmics

Frequent co-authors in their research projects include Mai Alzamel, Solon P. Pissis, Zara Lim, Roberto Grossi, and Lorraine A. K. Ayad.

Costas S. Iliopoulos has published multiple papers in venues such as Theoretical Computer Science, Bioinformatics, Alexandria Engineering Journal, Fundamenta Informaticae, and BMC Bioinformatics. Among these, Theoretical Computer Science stands out with four publications affiliated with their work.

Best Publications

Extracting Powers and Periods in a String from Its Runs Structure

Maxime Crochemore;Costas S. Iliopoulos;Marcin Kubica;Jakub Radoszewski

425
Citations
Finding common motifs with gaps using finite automata

Pavlos Antoniou;Jan Holub;Costas S. Iliopoulos;Bořivoj Melichar

295
Citations
GenMap: ultra-fast computation of genome mappability.

Christopher M. Pockrandt;Mai Alzamel;Mai Alzamel;Costas S. Iliopoulos;Knut Reinert;Knut Reinert

234
Citations
On the maximal number of cubic runs in a string

Maxime Crochemore;Costas Iliopoulos;Marcin Kubica;Jakub Radoszewski

217
Citations
Parallel construction of a suffix tree with applications

A. Apostolico;C. Iliopoulos;G. M. Landau;B. Schieber

210
Citations
Worst-case complexity bounds on algorithms for computing the canonical structure of finite Abelian groups and the Hermite and Smith normal forms of an integer matrix

Costas S. Iliopoulos

190
Citations
Optimal superprimitivity testing for strings

Alberto Apostolico;Alberto Apostolico;Martin Farach;Costas S. Iliopoulos

162
Citations
Order-preserving matching

Jinil Kim;Peter Eades;Rudolf Fleischer;Seok-Hee Hong

138
Citations
SOFSEM 2006: Theory and Practice of Computer Science

Manolis Christodoulakis;Costas Iliopoulos;Y. J. Pinzon Ardila

133
Citations
Algorithms for computing approximate repetitions in musical sequences

Emilios Cambouropoulos;Maxime Crochemore;Costas S. Iliopoulos;Costas S. Iliopoulos;Laurent Mouchard;Laurent Mouchard

129
Citations
Predicting the functional consequences of non-synonymous DNA sequence variants--evaluation of bioinformatics tools and development of a consensus strategy.

Kimon Frousios;Costas S. Iliopoulos;Thomas Schlitt;Michael A. Simpson

126
Citations
Pattern Processing in Melodic Sequences: Challenges, Caveats and Prospects

Emilios Cambouropoulos;Tim Crawford;Costas S. Iliopoulos

122
Citations
Sofsem 2008: Theory and Practice of Computer Science

Costas Iliopoulos;M S Rahman;Geffert;J Karhumaki

121
Citations
A fast and practical bit-vector algorithm for the longest common subsequence problem

Maxime Crochemore;Costas S. Iliopoulos;Costas S. Iliopoulos;Yoan J. Pinzon;James F. Reid;James F. Reid

120
Citations
A New Efficient Algorithm for Computing the Longest Common Subsequence

M. Sohel Rahman;Costas S. Iliopoulos

116
Citations
A characterization of the squares in a Fibonacci string

Costas S. Iliopoulos;Costas S. Iliopoulos;Dennis W. G. Moore;William F. Smyth;William F. Smyth

112
Citations
An algorithm for mapping short reads to a dynamically changing genomic sequence

Tomas Flouri;Jan Holub;Costas Iliopoulos;Solon Pissis

109
Citations
Covering a string

Costas S. Iliopoulos;Costas S. Iliopoulos;Dennis W. G. Moore;Kunsoo Park

108
Citations
A New Efficient Algorithm for Computing the Longest Common Subsequence

Costas S. Iliopoulos;M. Sohel Rahman

59
Citations
Proceedings of the 25th International Symposium on Theoretical Aspects of Computer Science

Max Crochemore;Costas Iliopoulos;Marcin Kubica;Mohammad Sohel Rahman

14
Citations
Computer Science and Information Systems (FedCSIS), 2011 Federated Conference on

Tomas Flouri;Costas Iliopoulos;Jan Janousek;Borivoj Melichar

9
Citations
Symposium on Theoretical Aspects of Computer Science

Max Crochemore;Costas Iliopoulos;Marcin Kubica;Sohel Rahman

6
Citations
The Maximal Number of Cubic Runs in a String

Maxime Crochemore;Costas S. Iliopoulos;Marcin Kubica;Jakub Radoszewski

0
Citations

Frequent Co-Authors

Maxime Crochemore King's College London

William F. Smyth McMaster University

Wojciech Rytter University of Warsaw

Simon J. Puglisi University of Helsinki

Marie-France Sagot Claude Bernard University Lyon 1

Amihood Amir Bar-Ilan University

Wing-Kin Sung Chinese University of Hong Kong

Richard Cole New York University

Gad M. Landau University of Haifa

Knut Reinert Freie Universität Berlin

External Links

Personal website of Costas S. Iliopoulos

If you think any of the details on this page are incorrect, let us know.

Related Online Degrees & Career Pathways

For students pursuing Mathematics in the USA, complementing their degree with relevant online programs can open diverse career opportunities. Many professionals consider advancing their business knowledge through a one year MBA program, which offers an accelerated path to leadership roles without requiring a long-term commitment.

Flexibility is key for many learners, and programs like MBA programs that accept transfer credits provide a smoother transition for those who have previously earned college credits. This option can significantly reduce the time and cost needed to earn a graduate degree.

In the rapidly growing field of data science, combining a Math degree with a specialized advanced qualification is advantageous. Many students explore analytics masters programs to develop expertise in handling complex data sets, enhancing their employability across industries.

For those seeking accessible options, researching MBA programs easy to get into can be a practical first step toward gaining leadership skills while balancing other commitments. These pathways complement mathematical expertise with business acumen, widening professional prospects.