D-Index & Metrics Best Publications

Costas S. Iliopoulos

King's College London
United Kingdom

D-Index & Metrics D-index (Discipline H-index) only includes papers and citation values for an examined discipline in contrast to General H-index which accounts for publications across all disciplines.

Discipline name Citations Publications World Ranking National Ranking

Mathematics D-index 33 Citations 5,712 359 World Ranking 2173 National Ranking 153

Computer Science D-index 34 Citations 6,058 436 World Ranking 8020 National Ranking 473

Overview

What is he best known for?

The fields of study Costas S. Iliopoulos is best known for:

Time complexity
Vertex cover
Parameterized complexity

His Combinatorics study frequently draws connections between related disciplines such as Topology (electrical circuits). His research combines Combinatorics and Topology (electrical circuits). Costas S. Iliopoulos performs integrative Programming language and Constant (computer programming) research in his work. His Space (punctuation) study frequently draws connections between adjacent fields such as Operating system. His Operating system study frequently intersects with other fields, such as Space (punctuation). His Algorithm study often links to related topics such as Running time. His research ties Algorithm and Running time together. Binary logarithm is closely attributed to Discrete mathematics in his research. Costas S. Iliopoulos regularly ties together related areas like Binary logarithm in his Discrete mathematics studies.

His most cited work include:

Faster deterministic Feedback Vertex Set (79 citations)
A Fast Branching Algorithm for Cluster Vertex Deletion (41 citations)
Towards a Definitive Measure of Repetitiveness (28 citations)

What are the main themes of his work throughout his whole career to date

His Algorithm study frequently draws parallels with other fields, such as Time complexity, Theory of computation and Computation. His Discrete mathematics study frequently draws connections between adjacent fields such as Binary logarithm and Time complexity. Many of his studies on Binary logarithm involve topics that are commonly interrelated, such as Discrete mathematics. His Mathematical analysis study has been linked to subjects such as Upper and lower bounds and Bounded function. His research on Bounded function frequently connects to adjacent areas such as Mathematical analysis. His research links Tree (set theory) with Combinatorics. He regularly ties together related areas like Combinatorics in his Tree (set theory) studies. His Programming language study typically links adjacent topics like Substring. His research on Substring often connects related areas such as Data structure.

Costas S. Iliopoulos most often published in these fields:

Combinatorics (82.93%)
Algorithm (65.85%)
Discrete mathematics (48.78%)

What were the highlights of his more recent work (between 2019-2021)?

Combinatorics (100.00%)
Artificial intelligence (50.00%)
Mathematical analysis (50.00%)

In recent works Costas S. Iliopoulos was focusing on the following fields of study:

Costas S. Iliopoulos links adjacent fields of study such as Search engine indexing and Parsing in the subject of Artificial intelligence. His Search engine indexing study frequently draws connections between related disciplines such as Artificial intelligence. Combinatorics is frequently linked to Tree (set theory) in his study. His Tree (set theory) study typically links adjacent topics like Combinatorics. Mathematical analysis and Attractor are frequently intertwined in his study. In most of his Upper and lower bounds studies, his work intersects topics such as Log-log plot. His research ties Upper and lower bounds and Log-log plot together. His work on Operating system expands to the thematically related Space (punctuation). His Space (punctuation) research extends to the thematically linked field of Operating system.

Between 2019 and 2021, his most popular works were:

Towards a Definitive Measure of Repetitiveness (28 citations)
Optimal-Time Dictionary-Compressed Indexes (25 citations)
A Linear-Time Algorithm for Seeds Computation (12 citations)

This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.

Best Publications

Extracting Powers and Periods in a String from Its Runs Structure

Maxime Crochemore;Costas S. Iliopoulos;Marcin Kubica;Jakub Radoszewski.
Lecture Notes in Computer Science (2010)

424 Citations

Finding common motifs with gaps using finite automata

Pavlos Antoniou;Jan Holub;Costas S. Iliopoulos;Bořivoj Melichar.
international conference on implementation and application of automata (2006)

295 Citations

On the maximal number of cubic runs in a string

Maxime Crochemore;Costas Iliopoulos;Marcin Kubica;Jakub Radoszewski.
language and automata theory and applications (2010)

217 Citations

Parallel construction of a suffix tree with applications

A. Apostolico;C. Iliopoulos;G. M. Landau;B. Schieber.
Algorithmica (1988)

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.
SIAM Journal on Computing (1989)

182 Citations

Optimal superprimitivity testing for strings

Alberto Apostolico;Alberto Apostolico;Martin Farach;Costas S. Iliopoulos.
Information Processing Letters (1991)

151 Citations

Algorithms for computing approximate repetitions in musical sequences

Emilios Cambouropoulos;Maxime Crochemore;Costas S. Iliopoulos;Costas S. Iliopoulos;Laurent Mouchard;Laurent Mouchard.
International Journal of Computer Mathematics (2002)

128 Citations

SOFSEM 2006: Theory and Practice of Computer Science

Manolis Christodoulakis;Costas Iliopoulos;Y. J. Pinzon Ardila.
Springer Finance (2006)

123 Citations

Sofsem 2008: Theory and Practice of Computer Science

Costas Iliopoulos;M S Rahman;Geffert;J Karhumaki.
34th Conference on Current Trends in Theory and Practice of Computer Science (2008)

121 Citations

Pattern Processing in Melodic Sequences: Challenges, Caveats and Prospects

Emilios Cambouropoulos;Tim Crawford;Costas S. Iliopoulos.
Computers and The Humanities (2001)

119 Citations

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