Panagiotis Charalampopoulos

Conference papers

Pattern Matching with Mismatches and Wildcards [doi] [arxiv] [slides]
G. Bathie, P. Charalampopoulos, T. Starikovskaya
ESA 2024: 20:1-20:15.
Longest Common Extensions with Wildcards: Trade-off and Applications [doi] [arxiv]
G. Bathie, P. Charalampopoulos, T. Starikovskaya
ESA 2024: 19:1-19:17.
Optimal Bounds for Distinct Quartics [doi] [arxiv]
P. Charalampopoulos, P. Gawrychowski, S. Ghazawi
ICALP 2024: 39:1-39:17.
Maintaining the Size of LZ77 on Semi-dynamic Strings [doi]
H. Bannai, P. Charalampopoulos, J. Radoszewski
CPM 2024: 3:1-3:20.
Internal Pattern Matching in Small Space and Applications [doi] [arxiv]
G. Bathie, P. Charalampopoulos, T. Starikovskaya
CPM 2024: 4:1-4:20. Best Paper Award
Approximate Circular Pattern Matching under Edit Distance [doi] [arxiv]
P. Charalampopoulos, S. P. Pissis, J. Radoszewski, W. Rytter, T. Waleń, W. Zuba
STACS 2024: 24:1-24:22.
Optimal Near-Linear Space Heaviest Induced Ancestors [doi] [arxiv]
P. Charalampopoulos, B. Dudek, P. Gawrychowski, K. Pokorski
CPM 2023: 8:1-8:18.
On the Hardness of Computing the Edit Distance of Shallow Trees [doi] [pdf] [slides]
P. Charalampopoulos, P. Gawrychowski, S. Mozes, O. Weimann
SPIRE 2022: 290-302.
Subsequence Covers of Words [doi] [pdf]
P. Charalampopoulos, S. P. Pissis, J. Radoszewski, W. Rytter, T. Waleń, W. Zuba
SPIRE 2022: 3-15. Best Paper Award
Faster Pattern Matching Under Edit Distance: [doi] [arxiv] [slides] [talk at 42:50]
A Reduction to Dynamic Puzzle Matching and the Seaweed Monoid of Permutation Matrices
P. Charalampopoulos, T. Kociumaka, P. Wellnitz
FOCS 2022: 710-719.
Approximate Circular Pattern Matching [doi] [arxiv]
P. Charalampopoulos, T. Kociumaka, J. Radoszewski, S. P. Pissis, W. Rytter, T. Waleń, W. Zuba
ESA 2022: 35:1-35:19.
Longest Palindromic Substring in Sublinear Time [doi]
P. Charalampopoulos, S. P. Pissis, J. Radoszewski
CPM 2022: 20:1-20:9.
Pattern Masking for Dictionary Matching [doi] [arxiv]
P. Charalampopoulos, H. Chen, P. Christen, G. Loukides, N. Pisanti, S. P. Pissis, J. Radoszewski
ISAAC 2021: 65:1-65:19.
Faster Algorithms for Longest Common Substring [doi] [arxiv]
P. Charalampopoulos, T. Kociumaka, S. P. Pissis, J. Radoszewski
ESA 2021: 30:1-30:17.
An Almost Optimal Edit Distance Oracle [doi] [arxiv] [slides] [talk]
P. Charalampopoulos, P. Gawrychowski, S. Mozes, O. Weimann
ICALP 2021: 48:1-48:20.
Internal Shortest Absent Word Queries [doi]
G. Badkobeh, P. Charalampopoulos, S. P. Pissis
CPM 2021: 6:1-6:18.
Computing Covers of 2D-Strings [doi]
P. Charalampopoulos, J. Radoszewski, W. Rytter, T. Waleń, W. Zuba
CPM 2021: 12:1-12:20.
Fault-Tolerant Distance Labeling for Planar Graphs [doi] [arxiv]
A. Bar-Natan, P. Charalampopoulos, P. Gawrychowski, S. Mozes, O. Weimann
SIROCCO 2021: 315-333.
Faster Approximate Pattern Matching: A Unified Approach [doi] [arxiv]
P. Charalampopoulos, T. Kociumaka, P. Wellnitz
FOCS 2020: 978-989.
Efficient Enumeration of Distinct Factors Using Package Representations [doi] [slides]
P. Charalampopoulos, T. Kociumaka, J. Radoszewski, W. Rytter, T. Waleń, W. Zuba
SPIRE 2020: 247-261.
SMART: SuperMaximal Approximate Repeats Tool [doi]
L. A. K. Ayad, P. Charalampopoulos, S. P. Pissis
BCB 2020: 17:1.
The Number of Repetitions in 2D-Strings [doi] [arxiv]
P. Charalampopoulos, J. Radoszewski, W. Rytter, T. Waleń, W. Zuba
ESA 2020: 32:1-32:18.
Single-Source Shortest Paths and Strong Connectivity in Dynamic Planar Graphs [doi] [slides] [talk]
P. Charalampopoulos, A. Karczmarz
ESA 2020: 31:1-31:23.
Dynamic Longest Common Substring in Polylogarithmic Time [doi] [arxiv]
P. Charalampopoulos, P. Gawrychowski, K. Pokorski
ICALP 2020: 27:1-27:19.
Unary Words Have the Smallest Levenshtein k-Neighbourhoods [doi]
P. Charalampopoulos, S. P. Pissis, J. Radoszewski, T. Waleń, W. Zuba
CPM 2020: 10:1-10:12.
Dynamic String Alignment [doi] [slides] [talk]
P. Charalampopoulos, T. Kociumaka, S. Mozes
CPM 2020: 9:1-9:13.
Counting Distinct Patterns in Internal Dictionary Matching [doi] [arxiv]
P. Charalampopoulos, T. Kociumaka, M. Mohamed, J. Radoszewski, W. Rytter, J. Straszyński, T. Waleń, W. Zuba
CPM 2020: 8:1-8:15.
Internal Dictionary Matching [doi] [arxiv] [slides]
P. Charalampopoulos, T. Kociumaka, M. Mohamed, J. Radoszewski, W. Rytter, T. Waleń
ISAAC 2019: 22:1-22:17.
Weighted Shortest Common Supersequence Problem Revisited [doi] [arxiv]
P. Charalampopoulos, T. Kociumaka, S. P. Pissis, J. Radoszewski, W. Rytter, J. Straszyński, T. Waleń, W. Zuba
SPIRE 2019: 221-238.
Longest Common Substring Made Fully Dynamic [doi] [arxiv]
A. Amir, P. Charalampopoulos, S. P. Pissis, J. Radoszewski
ESA 2019: 6:1-6:17.
Repetition Detection in a Dynamic String [doi]
A. Amir, I. Boneh, P. Charalampopoulos, E. Kondratovsky
ESA 2019: 5:1-5:18.
Circular Pattern Matching with k Mismatches [doi] [arxiv]
P. Charalampopoulos, T. Kociumaka, S. P. Pissis, J. Radoszewski, W. Rytter, J. Straszyński, T. Waleń, W. Zuba
FCT 2019: 213-228.
Almost Optimal Distance Oracles for Planar Graphs [doi] [arxiv] [slides]
P. Charalampopoulos, P. Gawrychowski, S. Mozes, O. Weimann
STOC 2019: 138-151.
Exact Distance Oracles for Planar Graphs with Failing Vertices [doi] [arxiv]
P. Charalampopoulos, S. Mozes, B. Tebeka
SODA 2019: 2110-2123.
On Extended Special Factors of a Word [doi] [pdf]
P. Charalampopoulos, M. Crochemore, S. P. Pissis
SPIRE 2018: 131-138.
Longest Common Prefixes with k-Errors and Applications [doi] [arxiv]
L. A. K. Ayad, C. Barton, P. Charalampopoulos, C. S. Iliopoulos, S. P. Pissis
SPIRE 2018: 27-41.
Efficient Computation of Sequence Mappability [doi] [arxiv]
M. Alzamel, P. Charalampopoulos, C. S. Iliopoulos, T. Kociumaka, S. P. Pissis, J. Radoszewski, J. Straszyński
SPIRE 2018: 12-26. Best Paper Award
Linear-Time Algorithm for Long LCF with k Mismatches [doi] [arxiv]
P. Charalampopoulos, M. Crochemore, C. S. Iliopoulos, T. Kociumaka, S. P. Pissis, J. Radoszewski, W. Rytter, T. Waleń
CPM 2018: 23:1-23:16.
Property Suffix Array with Applications [doi]
P. Charalampopoulos, C. S. Iliopoulos, C. Liu, S. P. Pissis
LATIN 2018: 290-302.
Longest Common Prefixes with k-Mismatches and Applications [doi] [pdf]
H. Alamro, L. A. K. Ayad, P. Charalampopoulos, C. S. Iliopoulos, S. P. Pissis
SOFSEM 2018: 636-649.
Faster Algorithms for 1-Mappability of a Sequence [doi] [arxiv]
M. Alzamel, P. Charalampopoulos, C. S. Iliopoulos, S. P. Pissis, J. Radoszewski, W. K. Sung
COCOA (2) 2017: 109-121.
Longest Common Factor After One Edit Operation [doi]
A. Amir, P. Charalampopoulos, C. S. Iliopoulos, S. P. Pissis, J. Radoszewski
SPIRE 2017: 14-26. Best Paper Award
Optimal Computation of Overabundant Words [doi] [arxiv]
Y. Almirantis, P. Charalampopoulos, J. Gao, C. S. Iliopoulos, M. Mohamed, S. P. Pissis, D. Polychronopoulos
WABI 2017: 4:1-4:14.
Efficient Enumeration of Non-Equivalent Squares in Partial Words with Few Holes [doi]
P. Charalampopoulos, M. Crochemore, C. S. Iliopoulos, T. Kociumaka, S. P. Pissis, J. Radoszewski, W. Rytter, T. Waleń
COCOON 2017: 99-111.
How to Answer a Small Batch of RMQs or LCA Queries in Practice [doi] [arxiv]
M. Alzamel, P. Charalampopoulos, C. S. Iliopoulos, S. P. Pissis
IWOCA 2017: 343-355.
Palindromic Decompositions with Gaps and Errors [doi] [arxiv]
M. Adamczyk, M. Alzamel, P. Charalampopoulos, C. S. Iliopoulos, J. Radoszewski
CSR 2017: 48-61.
Optimal Computation of Avoided Words [doi] [arxiv]
Y. Almirantis, P. Charalampopoulos, J. Gao, C. S. Iliopoulos, M. Mohamed, S. P. Pissis, D. Polychronopoulos
WABI 2016: 1-13.

Journal papers

Pattern Masking for Dictionary Matching: Theory and Practice [doi] [arxiv]
P. Charalampopoulos, H. Chen, P Christen, G. Loukides, N. Pisanti, S. P. Pissis, J. Radoszewski
Algorithmica 86: 1948–1978 (2024).
Almost Optimal Exact Distance Oracles for Planar Graphs [doi] [pdf]
P. Charalampopoulos, P. Gawrychowski, Y. Long, S. Mozes, S. Pettie, O. Weimann, C. Wulff-Nilsen
Journal of the ACM 70(2): 12:1–12:50 (2023).
Internal Shortest Absent Word Queries in Constant Time and Linear Space [doi] [arxiv]
G. Badkobeh, P. Charalampopoulos, D. Kosolobov, S. P. Pissis
Theoretical Computer Science 922: 271-282 (2022).
Fault-Tolerant Distance Labeling for Planar Graphs [doi] [arxiv]
A. Bar-Natan, P. Charalampopoulos, P. Gawrychowski, S. Mozes, O. Weimann
Theoretical Computer Science 918: 48-59 (2022).
Efficient Computation of Sequence Mappability [doi] [arxiv]
P. Charalampopoulos, C. S. Iliopoulos, T. Kociumaka, S. P. Pissis, J. Radoszewski, J. Straszyński
Algorithmica 84(5): 1418-1440 (2022).
Exact Distance Oracles for Planar Graphs with Failing Vertices [doi] [arxiv]
P. Charalampopoulos, S. Mozes, B. Tebeka
ACM Transactions on Algorithms 18(2): 18:1-18:23 (2022).
Single-Source Shortest Paths and Strong Connectivity in Dynamic Planar Graphs [doi] [pdf] [slides] [talk]
P. Charalampopoulos, A. Karczmarz
Journal of Computer and System Sciences 124: 97-111 (2022).
Internal Dictionary Matching [doi] [pdf] [arxiv] [slides]
P. Charalampopoulos, T. Kociumaka, M. Mohamed, J. Radoszewski, W. Rytter, T. Waleń
Algorithmica 83(7): 2142-2169 (2021).
Circular Pattern Matching with k Mismatches [doi] [arxiv]
P. Charalampopoulos, T. Kociumaka, S. P. Pissis, J. Radoszewski, W. Rytter, J. Straszyński, T. Waleń, W. Zuba
Journal of Computer and System Sciences 115: 73-85 (2021).
Dynamic and Internal Longest Common Substring [doi] [arxiv]
A. Amir, P. Charalampopoulos, S. P. Pissis, J. Radoszewski
Algorithmica 82(12): 3707-3743 (2020).
Property Suffix Array with Applications in Indexing Weighted Sequences [doi]
P. Charalampopoulos, C. S. Iliopoulos, C. Liu, S. P. Pissis
ACM Journal of Experimental Algorithmics 25: 1-16 (2020).
SMART: SuperMaximal Approximate Repeats Tool [doi]
L. A. K. Ayad, P. Charalampopoulos, S. P. Pissis
Bioinformatics 36(8): 2589-2591 (2020).
Faster Algorithms for 1-Mappability of a Sequence [doi] [arxiv]
M. Alzamel, P. Charalampopoulos, C. S. Iliopoulos, S. P. Pissis, J. Radoszewski, W. K. Sung
Theoretical Computer Science 812: 2-12 (2020).
On-Line Weighted Pattern Matching [doi]
P. Charalampopoulos, C. S. Iliopoulos, S. P. Pissis, J. Radoszewski
Information and Computation 266: 49-59 (2019).
Efficient Enumeration of Non-Equivalent Squares in Partial Words with Few Holes [doi]
P. Charalampopoulos, M. Crochemore, C. S. Iliopoulos, T. Kociumaka, S. P. Pissis, J. Radoszewski, W. Rytter, T. Waleń
Journal of Combinatorial Optimization 37(2): 501-522 (2019).
On overabundant words and their application to biological sequence analysis [doi] [arxiv]
Y. Almirantis, P. Charalampopoulos, J. Gao, C. S. Iliopoulos, M. Mohamed, S. P. Pissis, D. Polychronopoulos
Theoretical Computer Science 792: 85-95 (2019).
Alignment-Free Sequence Comparison Using Absent Words [doi] [arxiv]
P. Charalampopoulos, M. Crochemore, G. Fici, R. Mercaș, S. P. Pissis
Information and Computation 262: 57-68 (2018).
Palindromic Decompositions with Gaps and Errors [doi] [arxiv]
M. Adamczyk, M. Alzamel, P. Charalampopoulos, J. Radoszewski
International Journal of Foundations of Computer Science 29(8): 1311-1329 (2018).
On avoided words, absent words, and their application to biological sequence analysis [doi] [arxiv]
Y. Almirantis, P. Charalampopoulos, J. Gao, C. S. Iliopoulos, M. Mohamed, S. P. Pissis, D. Polychronopoulos
Algorithms for Molecular Biology 12(1): 5:1-5:12 (2017).