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)

Palindromic Decompositions with Gaps and Errors. - Michal Adamczyk; Mai Alzamel; Panagiotis Charalampopoulos; Costas S. Iliopoulos; Jakub Radoszewski (CSR, 2017)

How to Answer a Small Batch of RMQs or LCA Queries in Practice. - Mai Alzamel; Panagiotis Charalampopoulos; Costas S. Iliopoulos; Solon P. Pissis (IWOCA, 2017)

Longest Common Factor After One Edit Operation. - Amihood Amir; Panagiotis Charalampopoulos; Costas S. Iliopoulos; Solon P. Pissis; Jakub Radoszewski (SPIRE, 2017)

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)

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 (CPM, 2018)

Property Suffix Array with Applications. - Panagiotis Charalampopoulos; Costas S. Iliopoulos; Chang Liu 035; Solon P. Pissis (LATIN, 2018)

Longest Common Prefixes with k-Mismatches and Applications. - Hayam Alamro; Lorraine A. K. Ayad; Panagiotis Charalampopoulos; Costas S. Iliopoulos; Solon P. Pissis (SOFSEM, 2018)

Efficient Computation of Sequence Mappability. - Mai Alzamel; Panagiotis Charalampopoulos; Costas S. Iliopoulos; Tomasz Kociumaka; Solon P. Pissis; Jakub Radoszewski; Juliusz Straszynski (SPIRE, 2018)

Longest Common Prefixes with k-Errors and Applications. - Lorraine A. K. Ayad; Carl Barton; Panagiotis Charalampopoulos; Costas S. Iliopoulos; Solon P. Pissis (SPIRE, 2018)

On Extended Special Factors of a Word. - Panagiotis Charalampopoulos; Maxime Crochemore; Solon P. Pissis (SPIRE, 2018)

Longest Common Prefixes with k-Errors and Applications. - Lorraine A. K. Ayad; Panagiotis Charalampopoulos; Costas S. Iliopoulos; Solon P. Pissis (CoRR, 2018)

Longest Common Factor Made Fully Dynamic. - Amihood Amir; Panagiotis Charalampopoulos; Solon P. Pissis; Jakub Radoszewski (CoRR, 2018)

Preface. - Panagiotis Charalampopoulos; Maxime Crochemore; Solon P. Pissis (Fundam. Informaticae, 2018)

Alignment-free sequence comparison using absent words. - Panagiotis Charalampopoulos; Maxime Crochemore; Gabriele Fici; Robert Mercas; Solon P. Pissis (Inf. Comput., 2018)

Palindromic Decompositions with Gaps and Errors. - Michal Adamczyk; Mai Alzamel; Panagiotis Charalampopoulos; Jakub Radoszewski (Int. J. Found. Comput. Sci., 2018)

Repetition Detection in a Dynamic String. - Amihood Amir; Itai Boneh; Panagiotis Charalampopoulos; Eitan Kondratovsky (ESA, 2019)

Longest Common Substring Made Fully Dynamic. - Amihood Amir; Panagiotis Charalampopoulos; Solon P. Pissis; Jakub Radoszewski (ESA, 2019)

Circular Pattern Matching with k Mismatches. - Panagiotis Charalampopoulos; Tomasz Kociumaka; Solon P. Pissis; Jakub Radoszewski; Wojciech Rytter; Juliusz Straszynski; Tomasz Walen; Wiktor Zuba (FCT, 2019)

Weighted Shortest Common Supersequence Problem Revisited. - Panagiotis Charalampopoulos; Tomasz Kociumaka; Solon P. Pissis; Jakub Radoszewski; Wojciech Rytter; Juliusz Straszynski; Tomasz Walen; Wiktor Zuba (SPIRE, 2019)

Almost optimal distance oracles for planar graphs. - Panagiotis Charalampopoulos; Pawel Gawrychowski; Shay Mozes; Oren Weimann (STOC, 2019)

On-line weighted pattern matching. - Panagiotis Charalampopoulos; Costas S. Iliopoulos; Solon P. Pissis; Jakub Radoszewski (Inf. Comput., 2019)

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 (J. Comb. Optim., 2019)

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)

Dynamic String Alignment. - Panagiotis Charalampopoulos; Tomasz Kociumaka; Shay Mozes (CPM, 2020)

Unary Words Have the Smallest Levenshtein k-Neighbourhoods. - Panagiotis Charalampopoulos; Solon P. Pissis; Jakub Radoszewski; Tomasz Walen; Wiktor Zuba (CPM, 2020)

The Number of Repetitions in 2D-Strings. - Panagiotis Charalampopoulos; Jakub Radoszewski; Wojciech Rytter; Tomasz Walen; Wiktor Zuba (ESA, 2020)

Faster Approximate Pattern Matching: A Unified Approach. - Panagiotis Charalampopoulos; Tomasz Kociumaka; Philip Wellnitz (FOCS, 2020)

Dynamic Longest Common Substring in Polylogarithmic Time. - Panagiotis Charalampopoulos; Pawel Gawrychowski; Karol Pokorski (ICALP, 2020)

Efficient Enumeration of Distinct Factors Using Package Representations. - Panagiotis Charalampopoulos; Tomasz Kociumaka; Jakub Radoszewski; Wojciech Rytter; Tomasz Walen; Wiktor Zuba (SPIRE, 2020)

Dynamic and Internal Longest Common Substring. - Amihood Amir; Panagiotis Charalampopoulos; Solon P. Pissis; Jakub Radoszewski (Algorithmica, 2020)

SMART: SuperMaximal approximate repeats tool. - Lorraine A. K. Ayad; Panagiotis Charalampopoulos; Solon P. Pissis (Bioinform., 2020)

Property Suffix Array with Applications in Indexing Weighted Sequences. - Panagiotis Charalampopoulos; Costas S. Iliopoulos; Chang Liu 035; Solon P. Pissis (ACM J. Exp. Algorithmics, 2020)

Faster algorithms for 1-mappability of a sequence. - Mai Alzamel; Panagiotis Charalampopoulos; Costas S. Iliopoulos; Solon P. Pissis; Jakub Radoszewski; Wing-Kin Sung (Theor. Comput. Sci., 2020)

Data structures for strings in the internal and dynamic settings - Panagiotis Charalampopoulos (2020)

Internal Shortest Absent Word Queries. - Golnaz Badkobeh; Panagiotis Charalampopoulos; Solon P. Pissis (CPM, 2021)

Computing Covers of 2D-Strings. - Panagiotis Charalampopoulos; Jakub Radoszewski; Wojciech Rytter; Tomasz Walen; Wiktor Zuba (CPM, 2021)

Faster Algorithms for Longest Common Substring. - Panagiotis Charalampopoulos; Tomasz Kociumaka; Solon P. Pissis; Jakub Radoszewski (ESA, 2021)

An Almost Optimal Edit Distance Oracle. - Panagiotis Charalampopoulos; Pawel Gawrychowski; Shay Mozes; Oren Weimann (ICALP, 2021)

Pattern Masking for Dictionary Matching. - Panagiotis Charalampopoulos; Huiping Chen; Peter Christen; Grigorios Loukides; Nadia Pisanti; Solon P. Pissis; Jakub Radoszewski (ISAAC, 2021)

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

Circular pattern matching with k mismatches. - Panagiotis Charalampopoulos; Tomasz Kociumaka; Solon P. Pissis; Jakub Radoszewski; Wojciech Rytter; Juliusz Straszynski; Tomasz Walen; Wiktor Zuba (J. Comput. Syst. Sci., 2021)

Longest Palindromic Substring in Sublinear Time. - Panagiotis Charalampopoulos; Solon P. Pissis; Jakub Radoszewski (CPM, 2022)

Approximate Circular Pattern Matching. - Panagiotis Charalampopoulos; Tomasz Kociumaka; Jakub Radoszewski; Solon P. Pissis; Wojciech Rytter; Tomasz Walen; Wiktor Zuba (ESA, 2022)

Faster Pattern Matching under Edit Distance : A Reduction to Dynamic Puzzle Matching and the Seaweed Monoid of Permutation Matrices. - Panagiotis Charalampopoulos; Tomasz Kociumaka; Philip Wellnitz (FOCS, 2022)

On the Hardness of Computing the Edit Distance of Shallow Trees. - Panagiotis Charalampopoulos; Pawel Gawrychowski; Shay Mozes; Oren Weimann (SPIRE, 2022)

Efficient Computation of Sequence Mappability. - Panagiotis Charalampopoulos; Costas S. Iliopoulos; Tomasz Kociumaka; Solon P. Pissis; Jakub Radoszewski; Juliusz Straszynski (Algorithmica, 2022)

Faster Pattern Matching under Edit Distance. - Panagiotis Charalampopoulos; Tomasz Kociumaka; Philip Wellnitz (CoRR, 2022)

Single-source shortest paths and strong connectivity in dynamic planar graphs. - Panagiotis Charalampopoulos; Adam Karczmarz (J. Comput. Syst. Sci., 2022)

Exact Distance Oracles for Planar Graphs with Failing Vertices. - Panagiotis Charalampopoulos; Shay Mozes; Benjamin Tebeka (ACM Trans. Algorithms, 2022)

Internal shortest absent word queries in constant time and linear space. - Golnaz Badkobeh; Panagiotis Charalampopoulos; Dmitry Kosolobov; Solon P. Pissis (Theor. Comput. Sci., 2022)

Fault-tolerant distance labeling for planar graphs. - Aviv Bar-Natan; Panagiotis Charalampopoulos; Pawel Gawrychowski; Shay Mozes; Oren Weimann (Theor. Comput. Sci., 2022)

Optimal Near-Linear Space Heaviest Induced Ancestors. - Panagiotis Charalampopoulos; Bartlomiej Dudek 001; Pawel Gawrychowski; Karol Pokorski (CPM, 2023)

Optimal Heaviest Induced Ancestors. - Panagiotis Charalampopoulos; Bartlomiej Dudek 001; Pawel Gawrychowski; Karol Pokorski (CoRR, 2023)

Almost Optimal Exact Distance Oracles for Planar Graphs. - Panagiotis Charalampopoulos; Pawel Gawrychowski; Yaowei Long; Shay Mozes; Seth Pettie; Oren Weimann; Christian Wulff-Nilsen (J. ACM, 2023)

Maintaining the Size of LZ77 on Semi-Dynamic Strings. - Hideo Bannai; Panagiotis Charalampopoulos; Jakub Radoszewski (CPM, 2024)

Internal Pattern Matching in Small Space and Applications. - Gabriel Bathie; Panagiotis Charalampopoulos; Tatiana Starikovskaya (CPM, 2024)

Longest Common Extensions with Wildcards: Trade-Off and Applications. - Gabriel Bathie; Panagiotis Charalampopoulos; Tatiana Starikovskaya (ESA, 2024)

Pattern Matching with Mismatches and Wildcards. - Gabriel Bathie; Panagiotis Charalampopoulos; Tatiana Starikovskaya (ESA, 2024)

Optimal Bounds for Distinct Quartics. - Panagiotis Charalampopoulos; Pawel Gawrychowski; Samah Ghazawi (ICALP, 2024)

Approximate Circular Pattern Matching Under Edit Distance. - Panagiotis Charalampopoulos; Solon P. Pissis; Jakub Radoszewski; Wojciech Rytter; Tomasz Walen; Wiktor Zuba (STACS, 2024)

Pattern Masking for Dictionary Matching: Theory and Practice. - Panagiotis Charalampopoulos; Huiping Chen; Peter Christen; Grigorios Loukides; Nadia Pisanti; Solon P. Pissis; Jakub Radoszewski (Algorithmica, 2024)

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

Subsequence covers of words. - Panagiotis Charalampopoulos; Solon P. Pissis; Jakub Radoszewski; Wojciech Rytter; Tomasz Walen; Wiktor Zuba (Theor. Comput. Sci., 2025)

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