Panagiotis Charalampopoulos

Publication Activity (10 Years)

Years Active: 2016-2024
Publications (10 Years): 96

Top Topics

Pattern Matching

Top Venues

Publications

Gabriel Bathie, Panagiotis Charalampopoulos, Tatiana Starikovskaya
Internal Pattern Matching in Small Space and Applications. CPM (2024)
Gabriel Bathie, Panagiotis Charalampopoulos, Tatiana Starikovskaya
Pattern Matching with Mismatches and Wildcards. CoRR (2024)
Hideo Bannai, Panagiotis Charalampopoulos, Jakub Radoszewski
Maintaining the Size of LZ77 on Semi-Dynamic Strings. CPM (2024)
Panagiotis Charalampopoulos, Pawel Gawrychowski, Samah Ghazawi
Optimal Bounds for Distinct Quartics. CoRR (2024)
Panagiotis Charalampopoulos, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen, Wiktor Zuba
Approximate Circular Pattern Matching under Edit Distance. CoRR (2024)
Panagiotis Charalampopoulos, Pawel Gawrychowski, Samah Ghazawi
Optimal Bounds for Distinct Quartics. ICALP (2024)
Panagiotis Charalampopoulos, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen, Wiktor Zuba
Approximate Circular Pattern Matching Under Edit Distance. STACS (2024)
Gabriel Bathie, Panagiotis Charalampopoulos, Tatiana Starikovskaya
Internal Pattern Matching in Small Space and Applications. CoRR (2024)
Panagiotis Charalampopoulos, Huiping Chen, Peter Christen, Grigorios Loukides, Nadia Pisanti, Solon P. Pissis, Jakub Radoszewski
Pattern Masking for Dictionary Matching: Theory and Practice. Algorithmica 86 (6) (2024)
Panagiotis Charalampopoulos, Bartlomiej Dudek, Pawel Gawrychowski, Karol Pokorski
Optimal Near-Linear Space Heaviest Induced Ancestors. CPM (2023)
Panagiotis Charalampopoulos, Pawel Gawrychowski, Yaowei Long, Shay Mozes, Seth Pettie, Oren Weimann, Christian Wulff-Nilsen
Almost Optimal Exact Distance Oracles for Planar Graphs. J. ACM 70 (2) (2023)
Panagiotis Charalampopoulos, Bartlomiej Dudek, Pawel Gawrychowski, Karol Pokorski
Optimal Heaviest Induced Ancestors. CoRR (2023)
Panagiotis Charalampopoulos, Tomasz Kociumaka, Philip Wellnitz
Faster Pattern Matching under Edit Distance. CoRR (2022)
Panagiotis Charalampopoulos, Tomasz Kociumaka, Philip Wellnitz
Faster Pattern Matching under Edit Distance : A Reduction to Dynamic Puzzle Matching and the Seaweed Monoid of Permutation Matrices. FOCS (2022)
Panagiotis Charalampopoulos, Solon P. Pissis, Jakub Radoszewski
Longest Palindromic Substring in Sublinear Time. CPM (2022)
Panagiotis Charalampopoulos, Costas S. Iliopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Juliusz Straszynski
Efficient Computation of Sequence Mappability. Algorithmica 84 (5) (2022)
Panagiotis Charalampopoulos, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen, Wiktor Zuba
Subsequence Covers of Words. SPIRE (2022)
Panagiotis Charalampopoulos, Adam Karczmarz
Single-source shortest paths and strong connectivity in dynamic planar graphs. J. Comput. Syst. Sci. 124 (2022)
Panagiotis Charalampopoulos, Pawel Gawrychowski, Shay Mozes, Oren Weimann
On the Hardness of Computing the Edit Distance of Shallow Trees. SPIRE (2022)
Panagiotis Charalampopoulos, Tomasz Kociumaka, Jakub Radoszewski, Solon P. Pissis, Wojciech Rytter, Tomasz Walen, Wiktor Zuba
Approximate Circular Pattern Matching. ESA (2022)
Aviv Bar-Natan, Panagiotis Charalampopoulos, Pawel Gawrychowski, Shay Mozes, Oren Weimann
Fault-tolerant distance labeling for planar graphs. Theor. Comput. Sci. 918 (2022)
Golnaz Badkobeh, Panagiotis Charalampopoulos, Dmitry Kosolobov, Solon P. Pissis
Internal shortest absent word queries in constant time and linear space. Theor. Comput. Sci. 922 (2022)
Panagiotis Charalampopoulos, Shay Mozes, Benjamin Tebeka
Exact Distance Oracles for Planar Graphs with Failing Vertices. ACM Trans. Algorithms 18 (2) (2022)
Panagiotis Charalampopoulos, Tomasz Kociumaka, Jakub Radoszewski, Solon P. Pissis, Wojciech Rytter, Tomasz Walen, Wiktor Zuba
Approximate Circular Pattern Matching. CoRR (2022)
Golnaz Badkobeh, Panagiotis Charalampopoulos, Dmitry Kosolobov, Solon P. Pissis
Internal Shortest Absent Word Queries in Constant Time and Linear Space. CoRR (2021)
Aviv Bar-Natan, Panagiotis Charalampopoulos, Pawel Gawrychowski, Shay Mozes, Oren Weimann
Fault-Tolerant Distance Labeling for Planar Graphs. CoRR (2021)
Panagiotis Charalampopoulos, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen, Wiktor Zuba
Computing Covers of 2D-Strings. CPM (2021)
Panagiotis Charalampopoulos, Huiping Chen, Peter Christen, Grigorios Loukides, Nadia Pisanti, Solon P. Pissis, Jakub Radoszewski
Pattern Masking for Dictionary Matching. ISAAC (2021)
Panagiotis Charalampopoulos, Pawel Gawrychowski, Shay Mozes, Oren Weimann
An Almost Optimal Edit Distance Oracle. CoRR (2021)
Panagiotis Charalampopoulos, Tomasz Kociumaka, Manal Mohamed, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
Internal Dictionary Matching. Algorithmica 83 (7) (2021)
Panagiotis Charalampopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba
mismatches. J. Comput. Syst. Sci. 115 (2021)
Aviv Bar-Natan, Panagiotis Charalampopoulos, Pawel Gawrychowski, Shay Mozes, Oren Weimann
Fault-Tolerant Distance Labeling for Planar Graphs. SIROCCO (2021)
Golnaz Badkobeh, Panagiotis Charalampopoulos, Solon P. Pissis
Internal Shortest Absent Word Queries. CPM (2021)
Panagiotis Charalampopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski
Faster Algorithms for Longest Common Substring. CoRR (2021)
Panagiotis Charalampopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski
Faster Algorithms for Longest Common Substring. ESA (2021)
Panagiotis Charalampopoulos, Pawel Gawrychowski, Shay Mozes, Oren Weimann
An Almost Optimal Edit Distance Oracle. ICALP (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)
Panagiotis Charalampopoulos, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen, Wiktor Zuba
The Number of Repetitions in 2D-Strings. CoRR (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)
Lorraine A. K. Ayad, Panagiotis Charalampopoulos, Solon P. Pissis
SMART: SuperMaximal approximate repeats tool. Bioinform. 36 (8) (2020)
Amihood Amir, Panagiotis Charalampopoulos, Solon P. Pissis, Jakub Radoszewski
Dynamic and Internal Longest Common Substring. Algorithmica 82 (12) (2020)
Panagiotis Charalampopoulos, Solon P. Pissis, Jakub Radoszewski, Tomasz Walen, Wiktor Zuba
Unary Words Have the Smallest Levenshtein k-Neighbourhoods. CPM (2020)
Panagiotis Charalampopoulos, Huiping Chen, Peter Christen, Grigorios Loukides, Nadia Pisanti, Solon P. Pissis, Jakub Radoszewski
Pattern Masking for Dictionary Matching. CoRR (2020)
Panagiotis Charalampopoulos, Tomasz Kociumaka, Philip Wellnitz
Faster Approximate Pattern Matching: A Unified Approach. CoRR (2020)
Panagiotis Charalampopoulos, Tomasz Kociumaka, Manal Mohamed, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba
Counting Distinct Patterns in Internal Dictionary Matching. CPM (2020)
Panagiotis Charalampopoulos, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen, Wiktor Zuba
The Number of Repetitions in 2D-Strings. ESA (2020)
Panagiotis Charalampopoulos, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen, Wiktor Zuba
Efficient Enumeration of Distinct Factors Using Package Representations. SPIRE (2020)
Panagiotis Charalampopoulos, Tomasz Kociumaka, Philip Wellnitz
Faster Approximate Pattern Matching: A Unified Approach. FOCS (2020)
Panagiotis Charalampopoulos, Tomasz Kociumaka, Manal Mohamed, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba
Counting Distinct Patterns in Internal Dictionary Matching. CoRR (2020)
Panagiotis Charalampopoulos, Tomasz Kociumaka, Shay Mozes
Dynamic String Alignment. CPM (2020)
Lorraine A. K. Ayad, Panagiotis Charalampopoulos, Solon P. Pissis
SMART: SuperMaximal approximate repeats tool. BCB (2020)
Panagiotis Charalampopoulos, Pawel Gawrychowski, Karol Pokorski
Dynamic Longest Common Substring in Polylogarithmic Time. ICALP (2020)
Panagiotis Charalampopoulos, Pawel Gawrychowski, Karol Pokorski
Dynamic Longest Common Substring in Polylogarithmic Time. CoRR (2020)
Panagiotis Charalampopoulos, Adam Karczmarz
Single-Source Shortest Paths and Strong Connectivity in Dynamic Planar Graphs. ESA (2020)
Panagiotis Charalampopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba
Weighted Shortest Common Supersequence Problem Revisited. SPIRE (2019)
Panagiotis Charalampopoulos, Shay Mozes, Benjamin Tebeka
Exact Distance Oracles for Planar Graphs with Failing Vertices. SODA (2019)
Panagiotis Charalampopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba
Circular Pattern Matching with k Mismatches. 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)
Amihood Amir, Panagiotis Charalampopoulos, Solon P. Pissis, Jakub Radoszewski
Longest Common Substring Made Fully Dynamic. ESA (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)
Amihood Amir, Itai Boneh, Panagiotis Charalampopoulos, Eitan Kondratovsky
Repetition Detection in a Dynamic String. ESA (2019)
Panagiotis Charalampopoulos, Costas S. Iliopoulos, Solon P. Pissis, Jakub Radoszewski
On-line weighted pattern matching. Inf. Comput. 266 (2019)
Panagiotis Charalampopoulos, Tomasz Kociumaka, Manal Mohamed, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
Internal Dictionary Matching. CoRR (2019)
Panagiotis Charalampopoulos, Tomasz Kociumaka, Manal Mohamed, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
Internal Dictionary Matching. ISAAC (2019)
Panagiotis Charalampopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba
Circular Pattern Matching with k Mismatches. FCT (2019)
Panagiotis Charalampopoulos, Pawel Gawrychowski, Shay Mozes, Oren Weimann
Almost optimal distance oracles for planar graphs. STOC (2019)
Panagiotis Charalampopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba
Weighted Shortest Common Supersequence Problem Revisited. CoRR (2019)
Panagiotis Charalampopoulos, Maxime Crochemore, Gabriele Fici, Robert Mercas, Solon P. Pissis
Alignment-free sequence comparison using absent words. CoRR (2018)
Panagiotis Charalampopoulos, Pawel Gawrychowski, Shay Mozes, Oren Weimann
Almost Optimal Distance Oracles for Planar Graphs. CoRR (2018)
Michal Adamczyk, Mai Alzamel, Panagiotis Charalampopoulos, Jakub Radoszewski
Palindromic Decompositions with Gaps and Errors. Int. J. Found. Comput. Sci. 29 (8) (2018)
Lorraine A. K. Ayad, Panagiotis Charalampopoulos, Costas S. Iliopoulos, Solon P. Pissis
Longest Common Prefixes with k-Errors and Applications. CoRR (2018)
Panagiotis Charalampopoulos, Shay Mozes, Benjamin Tebeka
Exact Distance Oracles for Planar Graphs with Failing Vertices. CoRR (2018)
Panagiotis Charalampopoulos, Costas S. Iliopoulos, Chang Liu, Solon P. Pissis
Property Suffix Array with Applications. LATIN (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)
Amihood Amir, Panagiotis Charalampopoulos, Solon P. Pissis, Jakub Radoszewski
Longest Common Factor Made Fully Dynamic. CoRR (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)
Panagiotis Charalampopoulos, Maxime Crochemore, Gabriele Fici, Robert Mercas, Solon P. Pissis
Alignment-free sequence comparison using absent words. Inf. Comput. 262 (2018)
Panagiotis Charalampopoulos, Maxime Crochemore, Solon P. Pissis
On Extended Special Factors of a Word. SPIRE (2018)
Mai Alzamel, Panagiotis Charalampopoulos, Costas S. Iliopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Juliusz Straszynski
Efficient Computation of Sequence Mappability. CoRR (2018)
Panagiotis Charalampopoulos, Maxime Crochemore, Solon P. Pissis
Preface. Fundam. Informaticae 163 (3) (2018)
Yannis Almirantis, Panagiotis Charalampopoulos, Jia Gao, Costas S. Iliopoulos, Manal Mohamed, Solon P. Pissis, Dimitris Polychronopoulos
Optimal Computation of Overabundant Words. WABI (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, 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)
Michal Adamczyk, Mai Alzamel, Panagiotis Charalampopoulos, Costas S. Iliopoulos, Jakub Radoszewski
Palindromic Decompositions with Gaps and Errors. CSR (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)
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)
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)
Yannis Almirantis, Panagiotis Charalampopoulos, Jia Gao, Costas S. Iliopoulos, Manal Mohamed, Solon P. Pissis, Dimitris Polychronopoulos
Optimal Computation of Avoided Words. WABI (2016)
Yannis Almirantis, Panagiotis Charalampopoulos, Jia Gao, Costas S. Iliopoulos, Manal Mohamed, Solon P. Pissis, Dimitris Polychronopoulos
Optimal Computation of Avoided Words. CoRR (2016)