World's Best Scientists 2026 revealed!
Costas S. Iliopoulos

Costas S. Iliopoulos

D-Index & Metrics

Mathematics

D-Index
38
Citations
6652
World Ranking
2330
National Ranking
154

Computer Science

D-Index
42
Citations
7655
World Ranking
8367
National Ranking
504

Costas S. Iliopoulos publication distribution in Mathematics in 2026

The chart shows the distribution of publications by all Research.com ranked scientists in the field of Mathematics in 2026. The highlighted bar marks where Costas S. Iliopoulos sits on this spectrum.

42–46 publications: 3 scientists 47–51 publications: 5 scientists 52–56 publications: 7 scientists 57–61 publications: 20 scientists 62–66 publications: 14 scientists 67–71 publications: 25 scientists 72–76 publications: 19 scientists 77–81 publications: 35 scientists 82–86 publications: 50 scientists 87–91 publications: 60 scientists 92–96 publications: 86 scientists 97–101 publications: 84 scientists 102–106 publications: 83 scientists 107–111 publications: 90 scientists 112–116 publications: 99 scientists 117–121 publications: 90 scientists 122–126 publications: 91 scientists 127–131 publications: 109 scientists 132–136 publications: 110 scientists 137–141 publications: 98 scientists 142–146 publications: 112 scientists 147–151 publications: 102 scientists 152–156 publications: 88 scientists 157–161 publications: 106 scientists 162–166 publications: 83 scientists 167–171 publications: 102 scientists 172–176 publications: 77 scientists 177–181 publications: 81 scientists 182–186 publications: 78 scientists 187–191 publications: 71 scientists 192–196 publications: 92 scientists 197–201 publications: 64 scientists 202–206 publications: 69 scientists 207–211 publications: 64 scientists 212–216 publications: 62 scientists 217–221 publications: 58 scientists 222–226 publications: 53 scientists 227–231 publications: 50 scientists 232–236 publications: 46 scientists 237–241 publications: 46 scientists 242–246 publications: 46 scientists 247–251 publications: 43 scientists 252–256 publications: 29 scientists 257–261 publications: 45 scientists 262–266 publications: 30 scientists 267–271 publications: 33 scientists 272–276 publications: 34 scientists 277–281 publications: 30 scientists 282–286 publications: 31 scientists 287–291 publications: 21 scientists 292–296 publications: 34 scientists 297–301 publications: 26 scientists 302–306 publications: 10 scientists 307–311 publications: 17 scientists 312–316 publications: 23 scientists 317–321 publications: 13 scientists 322–326 publications: 16 scientists 327–331 publications: 26 scientists 332–336 publications: 13 scientists 337–341 publications: 13 scientists 342–346 publications: 16 scientists 347–351 publications: 17 scientists 352–356 publications: 12 scientists 357–361 publications: 18 scientists 362–366 publications: 18 scientists 367–371 publications: 9 scientists 372–376 publications: 11 scientists 377–381 publications: 8 scientists 382–386 publications: 8 scientists 387–391 publications: 9 scientists 392–396 publications: 9 scientists 397–401 publications: 8 scientists 402–406 publications: 11 scientists 407–411 publications: 6 scientists 412–416 publications: 6 scientists 417–421 publications: 9 scientists 422–426 publications: 8 scientists 427–431 publications: 5 scientists 432–436 publications: 8 scientists 437–441 publications: 8 scientists 442–446 publications: 4 scientists 447–451 publications: 4 scientists 452–456 publications: 4 scientists 457–461 publications: 2 scientists 462–466 publications: 2 scientists 467–471 publications: 4 scientists 472–476 publications: 3 scientists 477–481 publications: 3 scientists 482–486 publications: 6 scientists 487–491 publications: 3 scientists 492–496 publications: 5 scientists 497–501 publications: 5 scientists 502–506 publications: 1 scientists 507–511 publications: 6 scientists 512–516 publications: 4 scientists 517–521 publications: 1 scientists 522–526 publications: 3 scientists 527–531 publications: 1 scientists 532–536 publications: 4 scientists 537+ publications: 100 scientists
42 publications 537+

This scientist: 382 publications — 93rd percentile

93% of scientists in this discipline score the same or lower.

The last bar groups every scientist with 537 publications or more.

Costas S. Iliopoulos D-index placement in Mathematics in 2026

The chart shows the D-index (discipline H-index) distribution of Mathematics scientists ranked by Research.com in 2026. The highlighted bar marks where Costas S. Iliopoulos sits on this spectrum.

30 D-Index: 174 scientists 31 D-Index: 151 scientists 32 D-Index: 174 scientists 33 D-Index: 117 scientists 34 D-Index: 136 scientists 35 D-Index: 127 scientists 36 D-Index: 145 scientists 37 D-Index: 153 scientists 38 D-Index: 150 scientists 39 D-Index: 150 scientists 40 D-Index: 138 scientists 41 D-Index: 136 scientists 42 D-Index: 93 scientists 43 D-Index: 108 scientists 44 D-Index: 115 scientists 45 D-Index: 112 scientists 46 D-Index: 103 scientists 47 D-Index: 75 scientists 48 D-Index: 59 scientists 49 D-Index: 67 scientists 50 D-Index: 60 scientists 51 D-Index: 57 scientists 52 D-Index: 59 scientists 53 D-Index: 62 scientists 54 D-Index: 60 scientists 55 D-Index: 50 scientists 56 D-Index: 42 scientists 57 D-Index: 54 scientists 58 D-Index: 50 scientists 59 D-Index: 42 scientists 60 D-Index: 41 scientists 61 D-Index: 35 scientists 62 D-Index: 40 scientists 63 D-Index: 21 scientists 64 D-Index: 31 scientists 65 D-Index: 27 scientists 66 D-Index: 29 scientists 67 D-Index: 19 scientists 68 D-Index: 25 scientists 69 D-Index: 17 scientists 70 D-Index: 18 scientists 71 D-Index: 12 scientists 72 D-Index: 14 scientists 73 D-Index: 13 scientists 74 D-Index: 18 scientists 75 D-Index: 9 scientists 76 D-Index: 11 scientists 77 D-Index: 10 scientists 78 D-Index: 9 scientists 79 D-Index: 16 scientists 80 D-Index: 12 scientists 81 D-Index: 10 scientists 82 D-Index: 5 scientists 83 D-Index: 5 scientists 84 D-Index: 13 scientists 85 D-Index: 6 scientists 86+ D-Index: 99 scientists
30 D-Index 86+

This scientist: 38 D-Index — 37th percentile

37% of scientists in this discipline score the same or lower.

The last bar groups every scientist with 86 D-Index or more.

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

  • Finding common motifs with gaps using finite automata

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

  • GenMap: ultra-fast computation of genome mappability.

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

  • On the maximal number of cubic runs in a string

    Maxime Crochemore;Costas Iliopoulos;Marcin Kubica;Jakub Radoszewski

  • Parallel construction of a suffix tree with applications

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

  • 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

  • Optimal superprimitivity testing for strings

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

  • Order-preserving matching

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

  • SOFSEM 2006: Theory and Practice of Computer Science

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

  • Algorithms for computing approximate repetitions in musical sequences

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

  • 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

  • Pattern Processing in Melodic Sequences: Challenges, Caveats and Prospects

    Emilios Cambouropoulos;Tim Crawford;Costas S. Iliopoulos

  • Sofsem 2008: Theory and Practice of Computer Science

    Costas Iliopoulos;M S Rahman;Geffert;J Karhumaki

  • 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

  • A New Efficient Algorithm for Computing the Longest Common Subsequence

    M. Sohel Rahman;Costas S. Iliopoulos

  • 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

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

    Tomas Flouri;Jan Holub;Costas Iliopoulos;Solon Pissis

  • Covering a string

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

  • A New Efficient Algorithm for Computing the Longest Common Subsequence

    Costas S. Iliopoulos;M. Sohel Rahman

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

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

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

    Tomas Flouri;Costas Iliopoulos;Jan Janousek;Borivoj Melichar

  • Symposium on Theoretical Aspects of Computer Science

    Max Crochemore;Costas Iliopoulos;Marcin Kubica;Sohel Rahman

  • The Maximal Number of Cubic Runs in a String

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

Frequent Co-Authors

Maxime Crochemore
Maxime Crochemore King's College London
William F. Smyth
William F. Smyth McMaster University
Wojciech Rytter
Wojciech Rytter University of Warsaw
Simon J. Puglisi
Simon J. Puglisi University of Helsinki
Marie-France Sagot
Marie-France Sagot Claude Bernard University Lyon 1
Amihood Amir
Amihood Amir Bar-Ilan University
Wing-Kin Sung
Wing-Kin Sung Chinese University of Hong Kong
Richard Cole
Richard Cole New York University
Gad M. Landau
Gad M. Landau University of Haifa
Knut Reinert
Knut Reinert Freie Universität Berlin

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

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

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.

Best Scientists Citing Costas S. Iliopoulos

Trending Scientists

Recently Published Articles