Costas S. Iliopoulos

ORCID

Publication Activity (10 Years)

Years Active: 1982-2024
Publications (10 Years): 102

Top Venues

Publications

David Hurst, Costas S. Iliopoulos, Zara Lim, Ionut Moraru
IRfold: An RNA Secondary Structure Prediction Approach. AIAI (1) (2024)
Mai Alzamel, Costas S. Iliopoulos, Zara Lim, Marie Moser-Schwaiger
Pattern Matching in Polyphonic Musical Sequences. AIAI (4) (2024)
Costas S. Iliopoulos, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen, Wiktor Zuba
Linear-Time Computation of Cyclic Roots and Cyclic Covers of a String. CPM (2023)
Mai Alzamel, Christopher Hampson, Costas S. Iliopoulos, Zara Lim, Solon P. Pissis, Dimitrios Vlachakis, Steven Watts
Maximal degenerate palindromes with gaps and mismatches. Theor. Comput. Sci. 978 (2023)
Mai Alzamel, Jacqueline W. Daykin, Christopher Hampson, Costas S. Iliopoulos, Zara Lim, W. F. Smyth
Local Maximal Equality-Free Periodicities. AIAI Workshops (2023)
Mai Alzamel, Seba Alhejaili, Fatimah Alhumaidhi, Joud Alismail, Lama Almubarak, Halah Altammami, Costas S. Iliopoulos, Zara Lim
Advanced Skin Cancer Detection Using Deep Learning. EANN (2023)
Mai Alzamel, Christopher Hampson, Costas S. Iliopoulos, Fatima Vayani
Preface: MatBio 2021 Special Section. J. Comput. Biol. 30 (2) (2023)
Roberto Grossi, Costas S. Iliopoulos, Jesper Jansson, Zara Lim, Wing-Kin Sung, Wiktor Zuba
Finding the Cyclic Covers of a String. WALCOM (2023)
Christopher Hampson, Daniel J. Harvey, Costas S. Iliopoulos, Jesper Jansson, Zara Lim, Wing-Kin Sung
MUL-Tree Pruning for Consistency and Compatibility. CPM (2023)
Panagiotis Charalampopoulos, Costas S. Iliopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Juliusz Straszynski
Efficient Computation of Sequence Mappability. Algorithmica 84 (5) (2022)
Mai Alzamel, Costas S. Iliopoulos, Dimitrios Letsios, Nicola Prezza
Special Issue of Algorithmica for the 28th London Stringology Days & London Algorithmic Workshop (LSD & LAW). Algorithmica 84 (3) (2022)
Maxime Crochemore, Costas S. Iliopoulos, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba
Linear-Time Computation of Shortest Covers of All Rotations of a String. CPM (2022)
Costas S. Iliopoulos, Ritu Kundu, Solon P. Pissis
Efficient pattern matching in elastic-degenerate strings. Inf. Comput. 279 (2021)
Maxime Crochemore, Costas S. Iliopoulos, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba
Shortest covers of all cyclic shifts of a string. Theor. Comput. Sci. 866 (2021)
Hayam Alamro, Mai Alzamel, Costas S. Iliopoulos, Solon P. Pissis, Steven Watts
IUPACpal: efficient identification of inverted repeats in IUPAC-encoded DNA sequences. BMC Bioinform. 22 (1) (2021)
Panagiotis Charalampopoulos, Costas S. Iliopoulos, Chang Liu, Solon P. Pissis
Property Suffix Array with Applications in Indexing Weighted Sequences. ACM J. Exp. Algorithmics 25 (2020)
Mai Alzamel, Panagiotis Charalampopoulos, Costas S. Iliopoulos, Solon P. Pissis, Jakub Radoszewski, Wing-Kin Sung
Faster algorithms for 1-mappability of a sequence. Theor. Comput. Sci. 812 (2020)
Hayam Alamro, Costas S. Iliopoulos
Detecting Pattern Efficiently with Don't Cares. EANN (2020)
Maxime Crochemore, Costas S. Iliopoulos, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba
Internal Quasiperiod Queries. SPIRE (2020)
Mai Alzamel, Costas S. Iliopoulos
Preface. Inf. Comput. 270 (2020)
Maxime Crochemore, Costas S. Iliopoulos, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba
Internal Quasiperiod Queries. CoRR (2020)
Hayam Alamro, Mai Alzamel, Costas S. Iliopoulos, Solon P. Pissis, Wing-Kin Sung, Steven Watts
Efficient Identification of k-Closed Strings. Int. J. Found. Comput. Sci. 31 (5) (2020)
Hayam Alamro, Costas S. Iliopoulos, Grigorios Loukides
Efficiently Detecting Web Spambots in a Temporally Annotated Sequence. AINA (2020)
Christopher Pockrandt, Mai Alzamel, Costas S. Iliopoulos, Knut Reinert
GenMap: ultra-fast computation of genome mappability. Bioinform. 36 (12) (2020)
Miznah H. Alshammary, Costas S. Iliopoulos, Mujibur R. Khan
Fingerprints Recognition System-Based on Mobile Device Identification Using Circular String Pattern Matching Techniques. AIAI Workshops (2020)
Maxime Crochemore, Costas S. Iliopoulos, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba
Shortest Covers of All Cyclic Shifts of a String. WALCOM (2020)
Mai Alzamel, Lorraine A. K. Ayad, Giulia Bernardini, Roberto Grossi, Costas S. Iliopoulos, Nadia Pisanti, Solon P. Pissis, Giovanna Rosone
Comparing Degenerate Strings. Fundam. Informaticae 175 (1-4) (2020)
Lorraine A. K. Ayad, Giulia Bernardini, Roberto Grossi, Costas S. Iliopoulos, Nadia Pisanti, Solon P. Pissis, Giovanna Rosone
Longest property-preserved common factor: A new string-processing framework. Theor. Comput. Sci. 812 (2020)
Miznah H. Alshammary, Costas S. Iliopoulos, Manal Mohamed, Fatima Vayani
Application and Algorithm: Maximal Motif Discovery for Biological Data in a Sliding Window. AIAI Workshops (2020)
Mai Alzamel, Alessio Conte, Shuhei Denzumi, Roberto Grossi, Costas S. Iliopoulos, Kazuhiro Kurita, Kunihiro Wasa
Finding the Anticover of a String. CPM (2020)
Hayam Alamro, Golnaz Badkobeh, Djamal Belazzougui, Costas S. Iliopoulos, Simon J. Puglisi
Computing the Antiperiod(s) of a String. CPM (2019)
Mai Alzamel, Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba
Quasi-Linear-Time Algorithm for Longest Common Circular Factor. CoRR (2019)
Mai Alzamel, Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba
Quasi-Linear-Time Algorithm for Longest Common Circular Factor. CPM (2019)
Oluwole I. Ajala, Miznah Alshammary, Mai Alzamel, Jia Gao, Costas S. Iliopoulos, Jakub Radoszewski, Wojciech Rytter, Bruce W. Watson
On the cyclic regularities of strings. CoRR (2019)
Panagiotis Charalampopoulos, Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
Efficient enumeration of non-equivalent squares in partial words with few holes. J. Comb. Optim. 37 (2) (2019)
Yannis Almirantis, Panagiotis Charalampopoulos, Jia Gao, Costas S. Iliopoulos, Manal Mohamed, Solon P. Pissis, Dimitris Polychronopoulos
On overabundant words and their application to biological sequence analysis. Theor. Comput. Sci. 792 (2019)
Panagiotis Charalampopoulos, Costas S. Iliopoulos, Solon P. Pissis, Jakub Radoszewski
On-line weighted pattern matching. Inf. Comput. 266 (2019)
Mai Alzamel, Costas S. Iliopoulos, W. F. Smyth, Wing-Kin Sung
Off-line and on-line algorithms for closed string factorization. Theor. Comput. Sci. 792 (2019)
Oluwole I. Ajala, Miznah Alshammary, Mai Alzamel, Jia Gao, Costas S. Iliopoulos, Jakub Radoszewski, Wojciech Rytter, Bruce W. Watson
On the Cyclic Regularities of Strings. AIAI (Workshops) (2019)
Miznah Alshammary, Mai Alzamel, Costas S. Iliopoulos, Richard E. Watson, Bruce W. Watson
A Brief Overview of Dead-Zone Pattern Matching Algorithms. AIAI (Workshops) (2019)
Mai Alzamel, Alessio Conte, Daniele Greco, Veronica Guerrini, Costas S. Iliopoulos, Nadia Pisanti, Nicola Prezza, Giulia Punzi, Giovanna Rosone
Online Algorithms on Antipowers and Antiperiods. SPIRE (2019)
Mai Alzamel, Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Ritu Kundu, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
How Much Different Are Two Words with Different Shortest Periods. AIAI (Workshops) (2018)
Lorraine A. K. Ayad, Giulia Bernardini, Roberto Grossi, Costas S. Iliopoulos, Nadia Pisanti, Solon P. Pissis, Giovanna Rosone
Longest Property-Preserved Common Factor. CoRR (2018)
Mai Alzamel, Lorraine A. K. Ayad, Giulia Bernardini, Roberto Grossi, Costas S. Iliopoulos, Nadia Pisanti, Solon P. Pissis, Giovanna Rosone
Degenerate String Comparison and Applications. WABI (2018)
Lorraine A. K. Ayad, Panagiotis Charalampopoulos, Costas S. Iliopoulos, Solon P. Pissis
Longest Common Prefixes with k-Errors and Applications. CoRR (2018)
Oluwole I. Ajala, Hayam Alamro, Costas S. Iliopoulos, Grigorios Loukides
Towards String Sanitization. AIAI (Workshops) (2018)
Panagiotis Charalampopoulos, Costas S. Iliopoulos, Chang Liu, Solon P. Pissis
Property Suffix Array with Applications. LATIN (2018)
Costas S. Iliopoulos, Manal Mohamed, Solon P. Pissis, Fatima Vayani
Maximal Motif Discovery in a Sliding Window. SPIRE (2018)
Mai Alzamel, Panagiotis Charalampopoulos, Costas S. Iliopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Juliusz Straszynski
Efficient Computation of Sequence Mappability. SPIRE (2018)
Hayam Alamro, Lorraine A. K. Ayad, Panagiotis Charalampopoulos, Costas S. Iliopoulos, Solon P. Pissis
Longest Common Prefixes with k-Mismatches and Applications. SOFSEM (2018)
Costas S. Iliopoulos, Fatima Vayani
Preface. Int. J. Found. Comput. Sci. 29 (8) (2018)
Costas S. Iliopoulos, Steven Watts
Efficient Recognition of Abelian Palindromic Factors and Associated Results. AIAI (Workshops) (2018)
Panagiotis Charalampopoulos, Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
Linear-Time Algorithm for Long LCF with k Mismatches. CoRR (2018)
Lorraine A. K. Ayad, Carl Barton, Panagiotis Charalampopoulos, Costas S. Iliopoulos, Solon P. Pissis
Longest Common Prefixes with k-Errors and Applications. SPIRE (2018)
Panagiotis Charalampopoulos, Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
Linear-Time Algorithm for Long LCF with k Mismatches. CPM (2018)
Mai Alzamel, Panagiotis Charalampopoulos, Costas S. Iliopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Juliusz Straszynski
Efficient Computation of Sequence Mappability. CoRR (2018)
Mai Alzamel, Jia Gao, Costas S. Iliopoulos, Chang Liu
Efficient Computation of Palindromes in Sequences with Uncertainties. Fundam. Informaticae 163 (3) (2018)
Lorraine A. K. Ayad, Giulia Bernardini, Roberto Grossi, Costas S. Iliopoulos, Nadia Pisanti, Solon P. Pissis, Giovanna Rosone
Longest Property-Preserved Common Factor. SPIRE (2018)
Yannis Almirantis, Panagiotis Charalampopoulos, Jia Gao, Costas S. Iliopoulos, Manal Mohamed, Solon P. Pissis, Dimitris Polychronopoulos
Optimal Computation of Overabundant Words. WABI (2017)
Roberto Grossi, Costas S. Iliopoulos, Chang Liu, Nadia Pisanti, Solon P. Pissis, Ahmad Retha, Giovanna Rosone, Fatima Vayani, Luca Versari
On-Line Pattern Matching on Similar Texts. CPM (2017)
Yannis Almirantis, Panagiotis Charalampopoulos, Jia Gao, Costas S. Iliopoulos, Manal Mohamed, Solon P. Pissis, Dimitris Polychronopoulos
Optimal Computation of Overabundant Words. CoRR (2017)
Mai Alzamel, Panagiotis Charalampopoulos, Costas S. Iliopoulos, Solon P. Pissis
How to Answer a Small Batch of RMQs or LCA Queries in Practice. IWOCA (2017)
Mai Alzamel, Costas S. Iliopoulos
Recent Advances of Palindromic Factorization. IWOCA (2017)
Mai Alzamel, Panagiotis Charalampopoulos, Costas S. Iliopoulos, Solon P. Pissis
How to answer a small batch of RMQs or LCA queries in practice. CoRR (2017)
Mai Alzamel, Panagiotis Charalampopoulos, Costas S. Iliopoulos, Solon P. Pissis, Jakub Radoszewski, Wing-Kin Sung
Faster algorithms for 1-mappability of a sequence. CoRR (2017)
Costas S. Iliopoulos, Alessio Langiu
Foreword. Math. Comput. Sci. 11 (2) (2017)
Michal Adamczyk, Mai Alzamel, Panagiotis Charalampopoulos, Costas S. Iliopoulos, Jakub Radoszewski
Palindromic Decompositions with Gaps and Errors. CSR (2017)
Costas S. Iliopoulos, Ritu Kundu, Solon P. Pissis
Efficient Pattern Matching in Elastic-Degenerate Texts. LATA (2017)
Amihood Amir, Panagiotis Charalampopoulos, Costas S. Iliopoulos, Solon P. Pissis, Jakub Radoszewski
Longest Common Factor After One Edit Operation. SPIRE (2017)
Panagiotis Charalampopoulos, Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
Efficient Enumeration of Non-Equivalent Squares in Partial Words with Few Holes. COCOON (2017)
Michal Adamczyk, Mai Alzamel, Panagiotis Charalampopoulos, Costas S. Iliopoulos, Jakub Radoszewski
Palindromic Decompositions with Gaps and Errors. CoRR (2017)
Oluwole I. Ajala, Costas S. Iliopoulos, Mujibur R. Khan
Identification of Fingerprints using Circular String Approximation for Mobile Devices. FedCSIS (Communication Papers) (2017)
Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
Covering problems for partial words and for indeterminate strings. Theor. Comput. Sci. 698 (2017)
Mai Alzamel, Panagiotis Charalampopoulos, Costas S. Iliopoulos, Solon P. Pissis, Jakub Radoszewski, Wing-Kin Sung
Faster Algorithms for 1-Mappability of a Sequence. COCOA (2) (2017)
Mai Alzamel, Jia Gao, Costas S. Iliopoulos, Chang Liu, Solon P. Pissis
Efficient Computation of Palindromes in Sequences with Uncertainties. EANN (2017)
Maxime Crochemore, Costas S. Iliopoulos, Alessio Langiu, Filippo Mignosi
The longest common substring problem. Math. Struct. Comput. Sci. 27 (2) (2017)
Hayam Alamro, Mai Alzamel, Costas S. Iliopoulos, Solon P. Pissis, Steven Watts, Wing-Kin Sung
Efficient Identification of k-Closed Strings. EANN (2017)
Yannis Almirantis, Panagiotis Charalampopoulos, Jia Gao, Costas S. Iliopoulos, Manal Mohamed, Solon P. Pissis, Dimitris Polychronopoulos
On avoided words, absent words, and their application to biological sequence analysis. Algorithms Mol. Biol. 12 (1) (2017)
Tanver Athar, Carl Barton, Widmer Bland, Jia Gao, Costas S. Iliopoulos, Chang Liu, Solon P. Pissis
Fast circular dictionary-matching algorithm. Math. Struct. Comput. Sci. 27 (2) (2017)
Amihood Amir, Costas S. Iliopoulos, Jakub Radoszewski
Two strings at Hamming distance 1 cannot be both quasiperiodic. Inf. Process. Lett. 128 (2017)
Amihood Amir, Costas S. Iliopoulos, Jakub Radoszewski
Two strings at Hamming distance 1 cannot be both quasiperiodic. CoRR (2017)
Moudhi M. Aljamea, Ljiljana Brankovic, Jia Gao, Costas S. Iliopoulos, M. Samiruzzaman
Smart Meter Data Analysis. ICC 2016 (2016)
Yannis Almirantis, Panagiotis Charalampopoulos, Jia Gao, Costas S. Iliopoulos, Manal Mohamed, Solon P. Pissis, Dimitris Polychronopoulos
Optimal Computation of Avoided Words. WABI (2016)
Moudhi M. Aljamea, Costas S. Iliopoulos, M. Samiruzzaman
Detection Of URL In Image Steganography. ICC 2016 (2016)
Ljiljana Brankovic, Costas S. Iliopoulos, Ritu Kundu, Manal Mohamed, Solon P. Pissis, Fatima Vayani
Linear-time superbubble identification algorithm for genome assembly. Theor. Comput. Sci. 609 (2016)
Michalis Christou, Maxime Crochemore, Costas S. Iliopoulos
Quasiperiodicities in Fibonacci strings. Ars Comb. 129 (2016)
Golnaz Badkobeh, Hideo Bannai, Keisuke Goto, Tomohiro I, Costas S. Iliopoulos, Shunsuke Inenaga, Simon J. Puglisi, Shiho Sugimoto
Closed factorization. Discret. Appl. Math. 212 (2016)
Moudhi M. Aljamea, Costas S. Iliopoulos, M. Samiruzzaman
Effective Solutions for Most Common Vulnerabilities in Web Applications. IntelliSys (2) (2016)
Maxime Crochemore, Costas S. Iliopoulos, Ritu Kundu, Manal Mohamed, Fatima Vayani
Linear algorithm for conservative degenerate pattern matching. Eng. Appl. Artif. Intell. 51 (2016)
Roberto Grossi, Costas S. Iliopoulos, Robert Mercas, Nadia Pisanti, Solon P. Pissis, Ahmad Retha, Fatima Vayani
Erratum to: Circular sequence comparison: algorithms and applications. Algorithms Mol. Biol. 11 (2016)
Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Marcin Kubica, Alessio Langiu, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
Order-preserving indexing. Theor. Comput. Sci. 638 (2016)
Oluwole I. Ajala, Moudhi Aljamea, Mai Alzamel, Costas S. Iliopoulos
Fast Fingerprint Rotation Recognition Technique Using Circular Strings in Lexicographical Order. IntelliSys (2) (2016)
Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Ritu Kundu, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
Near-Optimal Computation of Runs over General Alphabet via Non-Crossing LCE Queries. SPIRE (2016)
Costas S. Iliopoulos, Ritu Kundu, Manal Mohamed
Efficient Computation of Clustered-Clumps in Degenerate Strings. AIAI (2016)
Yannis Almirantis, Panagiotis Charalampopoulos, Jia Gao, Costas S. Iliopoulos, Manal Mohamed, Solon P. Pissis, Dimitris Polychronopoulos
Optimal Computation of Avoided Words. CoRR (2016)
Roberto Grossi, Costas S. Iliopoulos, Robert Mercas, Nadia Pisanti, Solon P. Pissis, Ahmad Retha, Fatima Vayani
Circular sequence comparison: algorithms and applications. Algorithms Mol. Biol. 11 (2016)
Costas S. Iliopoulos, Jakub Radoszewski
Truly Subquadratic-Time Extension Queries and Periodicity Detection in Strings with Uncertainties. CPM (2016)
Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Ritu Kundu, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
Near-Optimal Computation of Runs over General Alphabet via Non-Crossing LCE Queries. CoRR (2016)
Costas S. Iliopoulos, Ritu Kundu, Manal Mohamed, Fatima Vayani
Popping Superbubbles and Discovering Clumps: Recent Developments in Biological Sequence Analysis. WALCOM (2016)
Ali Alatabbi, Costas S. Iliopoulos, Alessio Langiu, M. Sohel Rahman
Algorithms for Longest Common Abelian Factors. Int. J. Found. Comput. Sci. 27 (5) (2016)

Costas S. Iliopoulos.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Costas S. Iliopoulos