Costas S. Iliopoulos
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
92
Venues
22
Active years
1993–2023
Best venue rank
A*
Where they publish
- BCPM21 papers
- CSPIRE17 papers
- BSOFSEM9 papers
- CEANN5 papers
- BWALCOM5 papers
- CIWOCA5 papers
- CLATA5 papers
- CWABI4 papers
- NationalCOCOON3 papers
- CAAIM3 papers
- BLATIN2 papers
- CFedCSIS2 papers
- BISAAC2 papers
- BAINA1 paper
- CCOCOA1 paper
- NationalCSR1 paper
- CCIAC1 paper
- CDLT1 paper
- ASTACS1 paper
- BMFCS1 paper
- CCIS1 paper
- A*SODA1 paper
Papers
92 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2023 | CPM | MUL-Tree Pruning for Consistency and Compatibility. | Christopher Hampson, Daniel J. Harvey, Costas S. Iliopoulos, Jesper Jansson, Zara Lim, Wing-Kin Sung |
| 2023 | CPM | Linear-Time Computation of Cyclic Roots and Cyclic Covers of a String. | Costas S. Iliopoulos, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen, Wiktor Zuba |
| 2023 | EANN | Advanced Skin Cancer Detection Using Deep Learning. | Mai Alzamel, Seba Alhejaili, Fatimah Alhumaidhi, Joud Alismail, Lama Almubarak, Halah Altammami, Costas S. Iliopoulos, Zara Lim |
| 2023 | WALCOM | Finding the Cyclic Covers of a String. | Roberto Grossi, Costas S. Iliopoulos, Jesper Jansson, Zara Lim, Wing-Kin Sung, Wiktor Zuba |
| 2022 | CPM | Linear-Time Computation of Shortest Covers of All Rotations of a String. | Maxime Crochemore, Costas S. Iliopoulos, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba |
| 2020 | AINA | Efficiently Detecting Web Spambots in a Temporally Annotated Sequence. | Hayam Alamro, Costas S. Iliopoulos, Grigorios Loukides |
| 2020 | CPM | Finding the Anticover of a String. | Mai Alzamel, Alessio Conte, Shuhei Denzumi, Roberto Grossi, Costas S. Iliopoulos, Kazuhiro Kurita, Kunihiro Wasa |
| 2020 | EANN | Detecting Pattern Efficiently with Don't Cares. | Hayam Alamro, Costas S. Iliopoulos |
| 2020 | SPIRE | Internal Quasiperiod Queries. | Maxime Crochemore, Costas S. Iliopoulos, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba |
| 2020 | WALCOM | Shortest Covers of All Cyclic Shifts of a String. | Maxime Crochemore, Costas S. Iliopoulos, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba |
| 2019 | CPM | Computing the Antiperiod(s) of a String. | Hayam Alamro, Golnaz Badkobeh, Djamal Belazzougui, Costas S. Iliopoulos, Simon J. Puglisi |
| 2019 | CPM | Quasi-Linear-Time Algorithm for Longest Common Circular Factor. | Mai Alzamel, Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba |
| 2019 | SPIRE | Online Algorithms on Antipowers and Antiperiods. | Mai Alzamel, Alessio Conte, Daniele Greco, Veronica Guerrini, Costas S. Iliopoulos, Nadia Pisanti, Nicola Prezza, Giulia Punzi, Giovanna Rosone |
| 2018 | CPM | Linear-Time Algorithm for Long LCF with k Mismatches. | Panagiotis Charalampopoulos, Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen |
| 2018 | LATIN | Property Suffix Array with Applications. | Panagiotis Charalampopoulos, Costas S. Iliopoulos, Chang Liu, Solon P. Pissis |
| 2018 | SOFSEM | Longest Common Prefixes with k-Mismatches and Applications. | Hayam Alamro, Lorraine A. K. Ayad, Panagiotis Charalampopoulos, Costas S. Iliopoulos, Solon P. Pissis |
| 2018 | SPIRE | Efficient Computation of Sequence Mappability. | Mai Alzamel, Panagiotis Charalampopoulos, Costas S. Iliopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Juliusz Straszynski |
| 2018 | SPIRE | Longest Common Prefixes with k-Errors and Applications. | Lorraine A. K. Ayad, Carl Barton, Panagiotis Charalampopoulos, Costas S. Iliopoulos, Solon P. Pissis |
| 2018 | SPIRE | Longest Property-Preserved Common Factor. | Lorraine A. K. Ayad, Giulia Bernardini, Roberto Grossi, Costas S. Iliopoulos, Nadia Pisanti, Solon P. Pissis, Giovanna Rosone |
| 2018 | SPIRE | Maximal Motif Discovery in a Sliding Window. | Costas S. Iliopoulos, Manal Mohamed, Solon P. Pissis, Fatima Vayani |
| 2018 | WABI | Degenerate String Comparison and Applications. | Mai Alzamel, Lorraine A. K. Ayad, Giulia Bernardini, Roberto Grossi, Costas S. Iliopoulos, Nadia Pisanti, Solon P. Pissis, Giovanna Rosone |
| 2017 | COCOA | Faster Algorithms for 1-Mappability of a Sequence. | Mai Alzamel, Panagiotis Charalampopoulos, Costas S. Iliopoulos, Solon P. Pissis, Jakub Radoszewski, Wing-Kin Sung |
| 2017 | COCOON | Efficient Enumeration of Non-Equivalent Squares in Partial Words with Few Holes. | Panagiotis Charalampopoulos, Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen |
| 2017 | CPM | On-Line Pattern Matching on Similar Texts. | Roberto Grossi, Costas S. Iliopoulos, Chang Liu, Nadia Pisanti, Solon P. Pissis, Ahmad Retha, Giovanna Rosone, Fatima Vayani, Luca Versari |
| 2017 | CSR | Palindromic Decompositions with Gaps and Errors. | Michal Adamczyk, Mai Alzamel, Panagiotis Charalampopoulos, Costas S. Iliopoulos, Jakub Radoszewski |
| 2017 | EANN | Efficient Identification of k-Closed Strings. | Hayam Alamro, Mai Alzamel, Costas S. Iliopoulos, Solon P. Pissis, Steven Watts, Wing-Kin Sung |
| 2017 | EANN | Efficient Computation of Palindromes in Sequences with Uncertainties. | Mai Alzamel, Jia Gao, Costas S. Iliopoulos, Chang Liu, Solon P. Pissis |
| 2017 | FedCSIS | Identification of Fingerprints using Circular String Approximation for Mobile Devices. | Oluwole I. Ajala, Costas S. Iliopoulos, Mujibur R. Khan |
| 2017 | IWOCA | How to Answer a Small Batch of RMQs or LCA Queries in Practice. | Mai Alzamel, Panagiotis Charalampopoulos, Costas S. Iliopoulos, Solon P. Pissis |
| 2017 | IWOCA | Recent Advances of Palindromic Factorization. | Mai Alzamel, Costas S. Iliopoulos |
| 2017 | LATA | Efficient Pattern Matching in Elastic-Degenerate Texts. | Costas S. Iliopoulos, Ritu Kundu, Solon P. Pissis |
| 2017 | SPIRE | Longest Common Factor After One Edit Operation. | Amihood Amir, Panagiotis Charalampopoulos, Costas S. Iliopoulos, Solon P. Pissis, Jakub Radoszewski |
| 2017 | WABI | Optimal Computation of Overabundant Words. | Yannis Almirantis, Panagiotis Charalampopoulos, Jia Gao, Costas S. Iliopoulos, Manal Mohamed, Solon P. Pissis, Dimitris Polychronopoulos |
| 2016 | CPM | Truly Subquadratic-Time Extension Queries and Periodicity Detection in Strings with Uncertainties. | Costas S. Iliopoulos, Jakub Radoszewski |
| 2016 | SPIRE | Near-Optimal Computation of Runs over General Alphabet via Non-Crossing LCE Queries. | Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Ritu Kundu, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen |
| 2016 | WABI | Optimal Computation of Avoided Words. | Yannis Almirantis, Panagiotis Charalampopoulos, Jia Gao, Costas S. Iliopoulos, Manal Mohamed, Solon P. Pissis, Dimitris Polychronopoulos |
| 2016 | WALCOM | Popping Superbubbles and Discovering Clumps: Recent Developments in Biological Sequence Analysis. | Costas S. Iliopoulos, Ritu Kundu, Manal Mohamed, Fatima Vayani |
| 2015 | LATA | Average-Case Optimal Approximate Circular String Matching. | Carl Barton, Costas S. Iliopoulos, Solon P. Pissis |
| 2015 | WABI | Circular Sequence Comparison with q-grams. | Roberto Grossi, Costas S. Iliopoulos, Robert Mercas, Nadia Pisanti, Solon P. Pissis, Ahmad Retha, Fatima Vayani |
| 2014 | ISAAC | Covering Problems for Partial Words and for Indeterminate Strings. | Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen |
| 2014 | IWOCA | Fast and Simple Computations Using Prefix Tables Under Hamming and Edit Distance. | Carl Barton, Costas S. Iliopoulos, Solon P. Pissis, William F. Smyth |
| 2013 | EANN | Identification of All Exact and Approximate Inverted Repeats in Regular and Weighted Sequences. | Carl Barton, Costas S. Iliopoulos, Nicola J. Mulder, Bruce W. Watson |
| 2013 | IWOCA | Suffix Tree of Alignment: An Efficient Index for Similar Data. | Joong Chae Na, Heejin Park, Maxime Crochemore, Jan Holub, Costas S. Iliopoulos, Laurent Mouchard, Kunsoo Park |
| 2013 | SPIRE | Order-Preserving Incomplete Suffix Trees and Order-Preserving Indexes. | Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Marcin Kubica, Alessio Langiu, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen |
| 2012 | CPM | The Maximum Number of Squares in a Tree. | Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Wojciech Tyczynski, Tomasz Walen |
| 2011 | COCOON | On the Right-Seed Array of a String. | Michalis Christou, Maxime Crochemore, Ondrej Guth, Costas S. Iliopoulos, Solon P. Pissis |
| 2011 | CPM | Efficient Seeds Computation Revisited. | Michalis Christou, Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Bartosz Szreder, Tomasz Walen |
| 2011 | FedCSIS | Tree Indexing by Pushdown Automata and Repeats of Subtrees. | Toms Flouri, Jan Janousek, Borivoj Melichar, Costas S. Iliopoulos, Solon P. Pissis |
| 2011 | SPIRE | Computing All Subtree Repeats in Ordered Ranked Trees. | Michalis Christou, Maxime Crochemore, Toms Flouri, Costas S. Iliopoulos, Jan Janousek, Borivoj Melichar, Solon P. Pissis |
| 2010 | AAIM | Varieties of Regularities in Weighted Sequences. | Hui Zhang, Qing Guo, Costas S. Iliopoulos |
| 2010 | CIAC | An Algorithmic Framework for Motif Discovery Problems in Weighted Sequences. | Hui Zhang, Qing Guo, Costas S. Iliopoulos |
| 2010 | CPM | Algorithms for Three Versions of the Shortest Common Superstring Problem. | Maxime Crochemore, Marek Cygan, Costas S. Iliopoulos, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen |
| 2010 | CPM | Cover Array String Reconstruction. | Maxime Crochemore, Costas S. Iliopoulos, Solon P. Pissis, German Tischler |
| 2010 | LATA | On the Maximal Number of Cubic Runs in a String. | Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen |
| 2010 | SOFSEM | Efficient Algorithms for Two Extensions of LPF Table: The Power of Suffix Arrays. | Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Wojciech Rytter, Tomasz Walen |
| 2010 | SPIRE | Extracting Powers and Periods in a String from Its Runs Structure. | Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen |
| 2009 | IWOCA | LPF Computation Revisited. | Maxime Crochemore, Lucian Ilie, Costas S. Iliopoulos, Marcin Kubica, Wojciech Rytter, Tomasz Walen |
| 2008 | DLT | Bounds on Powers in Strings. | Maxime Crochemore, Szilrd Zsolt Fazekas, Costas S. Iliopoulos, Inuka Jayasekera |
| 2008 | STACS | Improved Algorithms for the Range Next Value Problem and Applications. | Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Mohammad Sohel Rahman, Tomasz Walen |
| 2008 | SOFSEM | A New Model to Solve the Swap Matching Problem and Efficient Algorithms for Short Patterns. | Costas S. Iliopoulos, M. Sohel Rahman |
| 2008 | WALCOM | Indexing Circular Patterns. | Costas S. Iliopoulos, M. Sohel Rahman |
| 2007 | AAIM | A New Efficient Algorithm for Computing the Longest Common Subsequence. | M. Sohel Rahman, Costas S. Iliopoulos |
| 2007 | CPM | Algorithms for Computing the Longest Parameterized Common Subsequence. | Costas S. Iliopoulos, Marcin Kubica, M. Sohel Rahman, Tomasz Walen |
| 2007 | LATA | Application of suffix trees for the acquisition of common motifs with gaps in a set of strings. | Pavlos Antoniou, Maxime Crochemore, Costas S. Iliopoulos, Pierre Peterlongo |
| 2007 | LATA | Weighted Degenerated Approximate Pattern Matching. | Costas S. Iliopoulos, Inuka Jayasekera, Borivoj Melichar, Jan Supol |
| 2007 | MFCS | Finding Patterns in Given Intervals. | Maxime Crochemore, Costas S. Iliopoulos, M. Sohel Rahman |
| 2007 | SOFSEM | Pattern Matching Algorithms with Don't Cares. | M. Sohel Rahman, Costas S. Iliopoulos |
| 2007 | SOFSEM | Indexing Factors with Gaps. | M. Sohel Rahman, Costas S. Iliopoulos |
| 2007 | SPIRE | Local Transpositions in Alignment of Polyphonic Musical Sequences. | Julien Allali, Pascal Ferraro, Pierre Hanna, Costas S. Iliopoulos |
| 2007 | WALCOM | Pattern Matching in Degenerate DNA/RNA Sequences. | M. Sohel Rahman, Costas S. Iliopoulos, Laurent Mouchard |
| 2006 | AAIM | Computing the | Qing Guo, Hui Zhang, Costas S. Iliopoulos |
| 2006 | COCOON | Finding Patterns with Variable Length Gaps or Don't Cares. | M. Sohel Rahman, Costas S. Iliopoulos, Inbok Lee, Manal Mohamed, William F. Smyth |
| 2006 | CPM | Property Matching and Weighted Matching. | Amihood Amir, Eran Chencinski, Costas S. Iliopoulos, Tsvi Kopelowitz, Hui Zhang |
| 2006 | CPM | Approximate Matching in Weighted Sequences. | Amihood Amir, Costas S. Iliopoulos, Oren Kapah, Ely Porat |
| 2006 | ISAAC | Algorithms for Computing Variants of the Longest Common Subsequence Problem. | M. Sohel Rahman, Costas S. Iliopoulos |
| 2006 | SOFSEM | Simple Algorithm for Sorting the Fibonacci String Rotations. | Manolis Christodoulakis, Costas S. Iliopoulos, Yoan Jos Pinzn Ardila |
| 2006 | SPIRE | Computing the Minimum Approximate | Qing Guo, Hui Zhang, Costas S. Iliopoulos |
| 2005 | CPM | Faster Algorithms for delta, gamma-Matching and Related Problems. | Peter Clifford, Raphal Clifford, Costas S. Iliopoulos |
| 2004 | CIS | String Matching with Swaps in a Weighted Sequence. | Hui Zhang, Qing Guo, Costas S. Iliopoulos |
| 2004 | LATIN | Longest Repeats with a Block of Don't Cares. | Maxime Crochemore, Costas S. Iliopoulos, Manal Mohamed, Marie-France Sagot |
| 2004 | SPIRE | Motif Extraction from Weighted Sequences. | Costas S. Iliopoulos, Katerina Perdikuri, Evangelos Theodoridis, Athanasios K. Tsakalidis, Kostas Tsichlas |
| 2004 | SPIRE | Linear Time Algorithm for the Longest Common Repeat Problem. | Inbok Lee, Costas S. Iliopoulos, Kunsoo Park |
| 2003 | SPIRE | A Bit-Parallel Suffix Automation Approach for (delta, gamma)-Matching in Music Retrieval. | Maxime Crochemore, Costas S. Iliopoulos, Gonzalo Navarro, Yoan J. Pinzn |
| 2002 | CPM | Three Heuristics for delta-Matching: delta-BM Algorithms. | Maxime Crochemore, Costas S. Iliopoulos, Thierry Lecroq, Wojciech Plandowski, Wojciech Rytter |
| 2002 | CPM | Identifying Occurrences of Maximal Pairs in Multiple Strings. | Costas S. Iliopoulos, Christos Makris, Spyros Sioutas, Athanasios K. Tsakalidis, Kostas Tsichlas |
| 2002 | SOFSEM | Validation and Decomposition of Partially Occluded Images. | Costas S. Iliopoulos, Manal Mohamed |
| 2001 | SPIRE | Speeding-up Hirschberg and Hunt-Szymanski LCS Algorithms. | Maxime Crochemore, Costas S. Iliopoulos, Yoan J. Pinzn |
| 2000 | SOFSEM | Fast Evolutionary Chains. | Maxime Crochemore, Costas S. Iliopoulos, Yoan J. Pinzn |
| 1999 | CPM | Approximate Periods of Strings. | Jeong Seop Sim, Costas S. Iliopoulos, Kunsoo Park, William F. Smyth |
| 1998 | SOFSEM | Massively Parallel Suffix Array Construction. | Costas S. Iliopoulos, Maureen Korda |
| 1994 | SODA | The Subtree Max Gap Problem with Application to Parallel String Covering. | Amir M. Ben-Amram, Omer Berkman, Costas S. Iliopoulos, Kunsoo Park |
| 1993 | CPM | Covering a String. | Costas S. Iliopoulos, Dennis W. G. Moore, Kunsoo Park |