Validation and Decomposition of Partially Occluded Images. - Costas S. Iliopoulos; Manal Mohamed 001 (SOFSEM, 2002)

On-Line Analysis and Validation of Partially Occluded Images: Implementation and Practice. - Aspassia Daskalopulu; Costas S. Iliopoulos; Manal Mohamed 001 (Int. J. Comput. Math., 2002)

Computing the Minimum k-Cover of a String. - Richard Cole 001; Costas S. Iliopoulos; Manal Mohamed 001; William F. Smyth; Lu Yang (Stringology, 2003)

String Regularities with Don't Cares. - Costas S. Iliopoulos; Manal Mohamed 001; Laurent Mouchard; Katerina Perdikuri; William F. Smyth; Athanasios K. Tsakalidis (Nord. J. Comput., 2003)

Longest Repeats with a Block of Don't Cares. - Maxime Crochemore; Costas S. Iliopoulos; Manal Mohamed 001; Marie-France Sagot (LATIN, 2004)

A Pattern Extraction Algorithm for Abstract Melodic Representations that Allow Partial Overlapping of Intervallic Categories. - Emilios Cambouropoulos; Maxime Crochemore; Costas S. Iliopoulos; Manal Mohamed 001; Marie-France Sagot (ISMIR, 2005)

Necklace Swap Problem for Rhythmic Similarity Measures. - Yoan José Pinzón Ardila; Raphaël Clifford; Manal Mohamed 001 (SPIRE, 2005)

Approximation algorithm for the cyclic swap problem. - Yoan José Pinzón Ardila; Costas S. Iliopoulos; Gad M. Landau; Manal Mohamed 001 (Stringology, 2005)

The Complexity of the Minimum k-Cover Problem. - Richard Cole 001; Costas S. Iliopoulos; Manal Mohamed 001; William F. Smyth; Lu Yang (J. Autom. Lang. Comb., 2005)

Algorithmic issues on string regularities. - Manal Abd El-Kadeer Kasem Mohamed (2005)

Finding Patterns with Variable Length Gaps or Don't Cares. - M. Sohel Rahman; Costas S. Iliopoulos; Inbok Lee; Manal Mohamed 001; William F. Smyth (COCOON, 2006)

Longest repeats with a block of k don't cares. - Maxime Crochemore; Costas S. Iliopoulos; Manal Mohamed 001; Marie-France Sagot (Theor. Comput. Sci., 2006)

All maximal-pairs in step-leap representation of melodic sequence. - Emilios Cambouropoulos; Maxime Crochemore; Costas S. Iliopoulos; Manal Mohamed 001; Marie-France Sagot (Inf. Sci., 2007)

Validation and Decomposition of Partially Occluded Images with Holes. - Julien Allali; Pavlos Antoniou; Costas S. Iliopoulos; Pascal Ferraro; Manal Mohamed 001 (Stringology, 2009)

New complexity results for the k-covers problem. - Costas S. Iliopoulos; Manal Mohamed 001; William F. Smyth (Inf. Sci., 2011)

On-line Minimum Closed Covers. - Costas S. Iliopoulos; Manal Mohamed 001 (AIAI (Workshops), 2014)

Linear-Time Superbubble Identification Algorithm. - Ljiljana Brankovic; Costas S. Iliopoulos; Ritu Kundu; Manal Mohamed 001; Solon P. Pissis; Fatima Vayani (CoRR, 2015)

Efficient Computation of Clustered-Clumps in Degenerate Strings. - Costas S. Iliopoulos; Ritu Kundu; Manal Mohamed 001 (AIAI, 2016)

Optimal Computation of Avoided Words. - Yannis Almirantis; Panagiotis Charalampopoulos; Jia Gao 001; Costas S. Iliopoulos; Manal Mohamed 001; Solon P. Pissis; Dimitris Polychronopoulos (WABI, 2016)

Popping Superbubbles and Discovering Clumps: Recent Developments in Biological Sequence Analysis. - Costas S. Iliopoulos; Ritu Kundu; Manal Mohamed 001; Fatima Vayani (WALCOM, 2016)

Linear algorithm for conservative degenerate pattern matching. - Maxime Crochemore; Costas S. Iliopoulos; Ritu Kundu; Manal Mohamed 001; Fatima Vayani (Eng. Appl. Artif. Intell., 2016)

Efficient computation of maximal anti-exponent in palindrome-free strings. - Golnaz Badkobeh; Maxime Crochemore; Manal Mohamed 001; Chalita Toopsuwan (Theor. Comput. Sci., 2016)

Linear-time superbubble identification algorithm for genome assembly. - Ljiljana Brankovic; Costas S. Iliopoulos; Ritu Kundu; Manal Mohamed 001; Solon P. Pissis; Fatima Vayani (Theor. Comput. Sci., 2016)

Optimal Computation of Overabundant Words. - Yannis Almirantis; Panagiotis Charalampopoulos; Jia Gao 001; Costas S. Iliopoulos; Manal Mohamed 001; Solon P. Pissis; Dimitris Polychronopoulos (WABI, 2017)

On avoided words, absent words, and their application to biological sequence analysis. - Yannis Almirantis; Panagiotis Charalampopoulos; Jia Gao 001; Costas S. Iliopoulos; Manal Mohamed 001; Solon P. Pissis; Dimitris Polychronopoulos (Algorithms Mol. Biol., 2017)

Longest Unbordered Factor in Quasilinear Time. - Tomasz Kociumaka; Ritu Kundu; Manal Mohamed 001; Solon P. Pissis (ISAAC, 2018)

Maximal Motif Discovery in a Sliding Window. - Costas S. Iliopoulos; Manal Mohamed 001; Solon P. Pissis; Fatima Vayani (SPIRE, 2018)

Editorial. - Ritu Kundu; Manal Mohamed 001 (J. Discrete Algorithms, 2018)

On overabundant words and their application to biological sequence analysis. - Yannis Almirantis; Panagiotis Charalampopoulos; Jia Gao 001; Costas S. Iliopoulos; Manal Mohamed 001; Solon P. Pissis; Dimitris Polychronopoulos (Theor. Comput. Sci., 2019)

Counting Distinct Patterns in Internal Dictionary Matching. - Panagiotis Charalampopoulos; Tomasz Kociumaka; Manal Mohamed 001; Jakub Radoszewski; Wojciech Rytter; Juliusz Straszynski; Tomasz Walen; Wiktor Zuba (CPM, 2020)

Application and Algorithm: Maximal Motif Discovery for Biological Data in a Sliding Window. - Miznah H. Alshammary; Costas S. Iliopoulos; Manal Mohamed 001; Fatima Vayani (AIAI (Workshops), 2020)

Internal Dictionary Matching. - Panagiotis Charalampopoulos; Tomasz Kociumaka; Manal Mohamed 001; Jakub Radoszewski; Wojciech Rytter; Tomasz Walen (Algorithmica, 2021)

Counting Distinct Square Substrings in Sublinear Time. - Panagiotis Charalampopoulos; Manal Mohamed 001; Jakub Radoszewski; Wojciech Rytter; Tomasz Walen; Wiktor Zuba (MFCS, 2025)

Resilient Pattern Mining. - Pengxin Bian; Panagiotis Charalampopoulos; Lorraine A. K. Ayad; Manal Mohamed 001; Solon P. Pissis; Grigorios Loukides (CoRR, 2025)