| 2011 |
| 39 | New complexity results for the k-covers problem. Costas S. Iliopoulos, Manal Mohamed, William F. Smyth. Inf. Sci. (181): 2571-2575 (2011). Web SearchBibTeXDownload |
| 38 | Construction of Antimagic Labeling for the Cartesian Product of Regular Graphs. Oudone Phanalasy, Mirka Miller, Costas S. Iliopoulos, Solon P. Pissis, Elaheh Vaezpour. Mathematics in Computer Science (5): 81-87 (2011). Web SearchBibTeXDownload |
| 2009 |
| 37 | Faster Algorithms for Computing Maximal Multirepeats in Multiple Sequences. Costas S. Iliopoulos, William F. Smyth, Munina Yusufu. Fundam. Inform. (97): 311-320 (2009). Web SearchBibTeXDownload |
| 36 | Parallel Algorithms for Degenerate and Weighted Sequences Derived from High Throughput Sequencing Technologies. Costas S. Iliopoulos, Mirka Miller, Solon P. Pissis. Stringology 2009, 249-262. Web SearchBibTeXDownload |
| 2008 |
| 35 | Identifying Rhythms in Musical Texts. Manolis Christodoulakis, Costas S. Iliopoulos, Mohammad Sohel Rahman, William F. Smyth. Int. J. Found. Comput. Sci. (19): 37-51 (2008). Web SearchBibTeXDownload |
| 34 | Special Issue of the Sixteenth Australasian Workshop on Combinatorial Algorithms (AWOCA 2005) September 18-21, 2005, Ballarat, Australia. Costas S. Iliopoulos, Mirka Miller. J. Discrete Algorithms (6): 1-2 (2008). Web SearchBibTeXDownload |
| 33 | Conservative String Covering of Indeterminate Strings. Pavlos Antoniou, Maxime Crochemore, Costas S. Iliopoulos, Inuka Jayasekera, Gad M. Landau. Stringology 2008, 108-115. Web SearchBibTeXDownload |
| 32 | Property matching and weighted matching. Amihood Amir, Eran Chencinski, Costas S. Iliopoulos, Tsvi Kopelowitz, Hui Zhang. Theor. Comput. Sci. (395): 298-310 (2008). Web SearchBibTeXDownload |
| 2007 |
| 31 | Locating Maximal Multirepeats in Multiple Strings Under Various Constraints. A. Bakalis, Costas S. Iliopoulos, Christos Makris, Spyros Sioutas, Evangelos Theodoridis, Athanasios K. Tsakalidis, Kostas Tsichlas. Comput. J. (50): 178-185 (2007). Web SearchBibTeXDownload |
| 30 | Algorithms for extracting motifs from biological weighted sequences. Costas S. Iliopoulos, Katerina Perdikuri, Evangelos Theodoridis, Athanasios K. Tsakalidis, Kostas Tsichlas. J. Discrete Algorithms (5): 229-242 (2007). Web SearchBibTeXDownload |
| 29 | Efficient Algorithms for Counting and Reporting Segregating Sites in Genomic Sequences. Manolis Christodoulakis, G. Brian Golding, Costas S. Iliopoulos, Yoan José Pinzón Ardila, William F. Smyth. Journal of Computational Biology (14): 1001-1010 (2007). Web SearchBibTeXDownload |
| 2006 |
| 28 | Finding Patterns with Variable Length Gaps or Don't Cares. M. Sohel Rahman, Costas S. Iliopoulos, Inbok Lee, Manal Mohamed, William F. Smyth. COCOON 2006, 146-155. Web SearchBibTeXDownload |
| 27 | Property Matching and Weighted Matching. Amihood Amir, Eran Chencinski, Costas S. Iliopoulos, Tsvi Kopelowitz, Hui Zhang. CPM 2006, 188-199. Web SearchBibTeXDownload |
| 26 | Approximate Matching in Weighted Sequences. Amihood Amir, Costas S. Iliopoulos, Oren Kapah, Ely Porat. CPM 2006, 365-376. Web SearchBibTeXDownload |
| 25 | The Weighted Suffix Tree: An Efficient Data Structure for Handling Molecular Weighted Sequences and its Applications. Costas S. Iliopoulos, Christos Makris, Yannis Panagis, Katerina Perdikuri, Evangelos Theodoridis, Athanasios K. Tsakalidis. Fundam. Inform. (71): 259-277 (2006). Web SearchBibTeXDownload |
| 24 | Computation of Repetitions and Regularities of Biologically Weighted Sequences. Manolis Christodoulakis, Costas S. Iliopoulos, Laurent Mouchard, Katerina Perdikuri, Athanasios K. Tsakalidis, Kostas Tsichlas. Journal of Computational Biology (13): 1214-1231 (2006). Web SearchBibTeXDownload |
| 23 | Song classifications for dancing. Manolis Christodoulakis, Costas S. Iliopoulos, Mohammad Sohel Rahman, William F. Smyth. Stringology 2006, 41-48. Web SearchBibTeXDownload |
| 2005 |
| 22 | Bit-parallel (delta, gamma)-matching and suffix automata. Maxime Crochemore, Costas S. Iliopoulos, Gonzalo Navarro, Yoan J. Pinzon, Alejandro Salinger. J. Discrete Algorithms (3): 198-214 (2005). Web SearchBibTeXDownload |
| 21 | Computing the Repetitions in a Biological Weighted Sequence. Costas S. Iliopoulos, Laurent Mouchard, Katerina Perdikuri, Athanasios K. Tsakalidis. Journal of Automata, Languages and Combinatorics (10): 687-696 (2005). Web SearchBibTeX |
| 20 | The Complexity of the Minimum k-Cover Problem. Richard Cole, Costas S. Iliopoulos, Manal Mohamed, William F. Smyth, L. Yang. Journal of Automata, Languages and Combinatorics (10): 641-653 (2005). Web SearchBibTeX |
| 19 | Approximation algorithm for the cyclic swap problem. Yoan José Pinzón Ardila, Costas S. Iliopoulos, Gad M. Landau, Manal Mohamed. Stringology 2005, 190-200. Web SearchBibTeX |
| 2004 |
| 18 | Efficient Algorithms for Handling Molecular Weighted Sequences. Costas S. Iliopoulos, Christos Makris, Yannis Panagis, Katerina Perdikuri, Evangelos Theodoridis, Athanasios K. Tsakalidis. IFIP TCS 2004, 265-278. Web SearchBibTeX |
| 17 | Motif Extraction from Weighted Sequences. Costas S. Iliopoulos, Katerina Perdikuri, Evangelos Theodoridis, Athanasios K. Tsakalidis, Kostas Tsichlas. SPIRE 2004, 286-297. Web SearchBibTeXDownload |
| 2003 |
| 16 | On special families of morphisms related to [delta]-matching and don't care symbols. Richard Cole, Costas S. Iliopoulos, Thierry Lecroq, Wojciech Plandowski, Wojciech Rytter. Inf. Process. Lett. (85): 227-233 (2003). Web SearchBibTeXDownload |
| 15 | String Regularities with Don't Cares. Costas S. Iliopoulos, Manal Mohamed, Laurent Mouchard, Katerina Perdikuri, William F. Smyth, Athanasios K. Tsakalidis. Nord. J. Comput. (10): 40-51 (2003). Web SearchBibTeX |
| 14 | A Bit-Parallel Suffix Automation Approach for (delta, gamma)-Matching in Music Retrieval. Maxime Crochemore, Costas S. Iliopoulos, Gonzalo Navarro, Yoan J. Pinzon. SPIRE 2003, 211-223. Web SearchBibTeXDownload |
| 13 | Truncated suffix trees and their application to data compression. Joong Chae Na, Alberto Apostolico, Costas S. Iliopoulos, Kunsoo Park. Theor. Comput. Sci. (1-3): 87-101 (2003). Web SearchBibTeXDownload |
| 2002 |
| 12 | Identifying Occurrences of Maximal Pairs in Multiple Strings. Costas S. Iliopoulos, Christos Makris, Spyros Sioutas, Athanasios K. Tsakalidis, Kostas Tsichlas. CPM 2002, 133-143. Web SearchBibTeXDownload |
| 11 | Approximate String Matching with Gaps. Maxime Crochemore, Costas S. Iliopoulos, Christos Makris, Wojciech Rytter, Athanasios K. Tsakalidis, T. Tsichlas. Nord. J. Comput. (9): 54-65 (2002). Web SearchBibTeX |
| 2001 |
| 10 | Approximate Musical Evolution. Tim Crawford, Costas S. Iliopoulos, Russel L. Winder, Haifeng Yu. Computers and the Humanities (35): 55-64 (2001). Web SearchBibTeXDownload |
| 9 | Approximate periods of strings. Jeong Seop Sim, Costas S. Iliopoulos, Kunsoo Park, William F. Smyth. Theor. Comput. Sci. (262): 557-568 (2001). Web SearchBibTeXDownload |
| 1999 |
| 8 | Approximate Periods of Strings. Jeong Seop Sim, Costas S. Iliopoulos, Kunsoo Park, William F. Smyth. CPM 1999, 123-133. Web SearchBibTeXDownload |
| 1997 |
| 7 | A Characterization of the Squares in a Fibonacci String. Costas S. Iliopoulos, Dennis Moore, William F. Smyth. Theor. Comput. Sci. (172): 281-291 (1997). Web SearchBibTeXDownload |
| 1994 |
| 6 | Parallel RAM Algorithms for Factorizing Words. Jacqueline W. Daykin, Costas S. Iliopoulos, William F. Smyth. Theor. Comput. Sci. (127): 53-67 (1994). Web SearchBibTeXDownload |
| 1992 |
| 5 | Optimal Algorithms for Computing the canonical form of a circular string. Costas S. Iliopoulos, William F. Smyth. Theor. Comput. Sci. (92): 87-105 (1992). Web SearchBibTeXDownload |
| 1991 |
| 4 | Optimal Superprimitivity Testing for Strings. Alberto Apostolico, Martin Farach, Costas S. Iliopoulos. Inf. Process. Lett. (39): 17-20 (1991). Web SearchBibTeXDownload |
| 1989 |
| 3 | PRAM Algorithms for Identifying Polygon Similarity. Costas S. Iliopoulos, William F. Smyth. Optimal Algorithms 1989, 25-32. Web SearchBibTeXDownload |
| 1988 |
| 2 | Parallel Construction of a Suffix Tree with Applications. Alberto Apostolico, Costas S. Iliopoulos, Gad M. Landau, Baruch Schieber, Uzi Vishkin. Algorithmica (3): 347-365 (1988). Web SearchBibTeXDownload |
| 1987 |
| 1 | On O(n log n) Cost Parallel Algorithm for the Single Function Coarsest Partition Problem. Alberto Apostolico, Costas S. Iliopoulos, Robert Paige. Parallel Algorithms and Architectures 1987, 70-76. Web SearchBibTeXDownload |