default search action
Panagiotis Charalampopoulos
Person information
- affiliation: Birkbeck, University of London, Department of Computer Science and Information Systems, UK
- affiliation (former): Interdisciplinary Center Herzliya, School of Computer Science, Israel
- affiliation (former, PhD 2020): King's College London, Department of Informatics, UK
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [j20]Panagiotis Charalampopoulos
, Huiping Chen, Peter Christen, Grigorios Loukides
Pattern Masking for Dictionary Matching: Theory and Practice. Algorithmica 86(6): 1948-1978 (2024) - [c47]Hideo Bannai, Panagiotis Charalampopoulos
Maintaining the Size of LZ77 on Semi-Dynamic Strings. CPM 2024: 3:1-3:20 - [c46]Gabriel Bathie, Panagiotis Charalampopoulos
Internal Pattern Matching in Small Space and Applications. CPM 2024: 4:1-4:20 - [c45]Gabriel Bathie, Panagiotis Charalampopoulos, Tatiana Starikovskaya:
Longest Common Extensions with Wildcards: Trade-Off and Applications. ESA 2024: 19:1-19:17 - [c44]Gabriel Bathie, Panagiotis Charalampopoulos, Tatiana Starikovskaya:
Pattern Matching with Mismatches and Wildcards. ESA 2024: 20:1-20:15 - [c43]Panagiotis Charalampopoulos
Optimal Bounds for Distinct Quartics. ICALP 2024: 39:1-39:17 - [c42]Panagiotis Charalampopoulos
Approximate Circular Pattern Matching Under Edit Distance. STACS 2024: 24:1-24:22 - [i32]Gabriel Bathie, Panagiotis Charalampopoulos
Pattern Matching with Mismatches and Wildcards. CoRR abs/2402.07732 (2024) - [i31]Panagiotis Charalampopoulos
Approximate Circular Pattern Matching under Edit Distance. CoRR abs/2402.14550 (2024) - [i30]Panagiotis Charalampopoulos
Optimal Bounds for Distinct Quartics. CoRR abs/2403.06667 (2024) - [i29]Gabriel Bathie, Panagiotis Charalampopoulos
Internal Pattern Matching in Small Space and Applications. CoRR abs/2404.17502 (2024) - [i28]Gabriel Bathie, Panagiotis Charalampopoulos
Longest Common Extensions with Wildcards: Trade-off and Applications. CoRR abs/2408.03610 (2024) - 2023
- [j19]Panagiotis Charalampopoulos
Almost Optimal Exact Distance Oracles for Planar Graphs. J. ACM 70(2): 12:1-12:50 (2023) - [c41]Panagiotis Charalampopoulos
Optimal Near-Linear Space Heaviest Induced Ancestors. CPM 2023: 8:1-8:18 - [i27]Panagiotis Charalampopoulos
Optimal Heaviest Induced Ancestors. CoRR abs/2302.01373 (2023) - 2022
- [j18]Panagiotis Charalampopoulos
Efficient Computation of Sequence Mappability. Algorithmica 84(5): 1418-1440 (2022) - [j17]Panagiotis Charalampopoulos
Single-source shortest paths and strong connectivity in dynamic planar graphs. J. Comput. Syst. Sci. 124: 97-111 (2022) - [j16]Panagiotis Charalampopoulos
Exact Distance Oracles for Planar Graphs with Failing Vertices. ACM Trans. Algorithms 18(2): 18:1-18:23 (2022) - [j15]Aviv Bar-Natan, Panagiotis Charalampopoulos
Fault-tolerant distance labeling for planar graphs. Theor. Comput. Sci. 918: 48-59 (2022) - [j14]Golnaz Badkobeh, Panagiotis Charalampopoulos
Internal shortest absent word queries in constant time and linear space. Theor. Comput. Sci. 922: 271-282 (2022) - [c40]Panagiotis Charalampopoulos
Longest Palindromic Substring in Sublinear Time. CPM 2022: 20:1-20:9 - [c39]Panagiotis Charalampopoulos
Approximate Circular Pattern Matching. ESA 2022: 35:1-35:19 - [c38]Panagiotis Charalampopoulos
Faster Pattern Matching under Edit Distance : A Reduction to Dynamic Puzzle Matching and the Seaweed Monoid of Permutation Matrices. FOCS 2022: 698-707 - [c37]Panagiotis Charalampopoulos
Subsequence Covers of Words. SPIRE 2022: 3-15 - [c36]Panagiotis Charalampopoulos
On the Hardness of Computing the Edit Distance of Shallow Trees. SPIRE 2022: 290-302 - [i26]Panagiotis Charalampopoulos
Faster Pattern Matching under Edit Distance. CoRR abs/2204.03087 (2022) - [i25]Panagiotis Charalampopoulos
Approximate Circular Pattern Matching. CoRR abs/2208.08915 (2022) - 2021
- [j13]Panagiotis Charalampopoulos
Internal Dictionary Matching. Algorithmica 83(7): 2142-2169 (2021) - [j12]Panagiotis Charalampopoulos
Circular pattern matching with k mismatches. J. Comput. Syst. Sci. 115: 73-85 (2021) - [c35]Golnaz Badkobeh, Panagiotis Charalampopoulos
Internal Shortest Absent Word Queries. CPM 2021: 6:1-6:18 - [c34]Panagiotis Charalampopoulos
Computing Covers of 2D-Strings. CPM 2021: 12:1-12:20 - [c33]Panagiotis Charalampopoulos
Faster Algorithms for Longest Common Substring. ESA 2021: 30:1-30:17 - [c32]Panagiotis Charalampopoulos
An Almost Optimal Edit Distance Oracle. ICALP 2021: 48:1-48:20 - [c31]Panagiotis Charalampopoulos
Pattern Masking for Dictionary Matching. ISAAC 2021: 65:1-65:19 - [c30]Aviv Bar-Natan, Panagiotis Charalampopoulos
Fault-Tolerant Distance Labeling for Planar Graphs. SIROCCO 2021: 315-333 - [i24]Aviv Bar-Natan, Panagiotis Charalampopoulos, Pawel Gawrychowski, Shay Mozes, Oren Weimann:
Fault-Tolerant Distance Labeling for Planar Graphs. CoRR abs/2102.07154 (2021) - [i23]Panagiotis Charalampopoulos, Pawel Gawrychowski, Shay Mozes, Oren Weimann:
An Almost Optimal Edit Distance Oracle. CoRR abs/2103.03294 (2021) - [i22]Panagiotis Charalampopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski:
Faster Algorithms for Longest Common Substring. CoRR abs/2105.03106 (2021) - [i21]Golnaz Badkobeh, Panagiotis Charalampopoulos, Dmitry Kosolobov, Solon P. Pissis:
Internal Shortest Absent Word Queries in Constant Time and Linear Space. CoRR abs/2106.01763 (2021) - 2020
- [b1]Panagiotis Charalampopoulos:
Data structures for strings in the internal and dynamic settings. King's College London (University of London), UK, 2020 - [j11]Amihood Amir, Panagiotis Charalampopoulos
Dynamic and Internal Longest Common Substring. Algorithmica 82(12): 3707-3743 (2020) - [j10]Lorraine A. K. Ayad
SMART: SuperMaximal approximate repeats tool. Bioinform. 36(8): 2589-2591 (2020) - [j9]Panagiotis Charalampopoulos
Property Suffix Array with Applications in Indexing Weighted Sequences. ACM J. Exp. Algorithmics 25: 1-16 (2020) - [j8]Mai Alzamel
Faster algorithms for 1-mappability of a sequence. Theor. Comput. Sci. 812: 2-12 (2020) - [c29]Lorraine A. K. Ayad, Panagiotis Charalampopoulos, Solon P. Pissis:
SMART: SuperMaximal approximate repeats tool. BCB 2020: 17:1 - [c28]Panagiotis Charalampopoulos
Counting Distinct Patterns in Internal Dictionary Matching. CPM 2020: 8:1-8:15 - [c27]Panagiotis Charalampopoulos
Dynamic String Alignment. CPM 2020: 9:1-9:13 - [c26]Panagiotis Charalampopoulos
Unary Words Have the Smallest Levenshtein k-Neighbourhoods. CPM 2020: 10:1-10:12 - [c25]Panagiotis Charalampopoulos
Single-Source Shortest Paths and Strong Connectivity in Dynamic Planar Graphs. ESA 2020: 31:1-31:23 - [c24]Panagiotis Charalampopoulos
The Number of Repetitions in 2D-Strings. ESA 2020: 32:1-32:18 - [c23]Panagiotis Charalampopoulos
Faster Approximate Pattern Matching: A Unified Approach. FOCS 2020: 978-989 - [c22]Panagiotis Charalampopoulos
Dynamic Longest Common Substring in Polylogarithmic Time. ICALP 2020: 27:1-27:19 - [c21]Panagiotis Charalampopoulos
Efficient Enumeration of Distinct Factors Using Package Representations. SPIRE 2020: 247-261 - [i20]Panagiotis Charalampopoulos, Tomasz Kociumaka, Philip Wellnitz:
Faster Approximate Pattern Matching: A Unified Approach. CoRR abs/2004.08350 (2020) - [i19]Panagiotis Charalampopoulos, Tomasz Kociumaka, Manal Mohamed, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba:
Counting Distinct Patterns in Internal Dictionary Matching. CoRR abs/2005.05681 (2020) - [i18]Panagiotis Charalampopoulos, Pawel Gawrychowski, Karol Pokorski:
Dynamic Longest Common Substring in Polylogarithmic Time. CoRR abs/2006.02408 (2020) - [i17]Panagiotis Charalampopoulos, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen, Wiktor Zuba:
The Number of Repetitions in 2D-Strings. CoRR abs/2006.15999 (2020) - [i16]Panagiotis Charalampopoulos, Huiping Chen, Peter Christen, Grigorios Loukides, Nadia Pisanti, Solon P. Pissis, Jakub Radoszewski:
Pattern Masking for Dictionary Matching. CoRR abs/2006.16137 (2020)
2010 – 2019
- 2019
- [j7]Panagiotis Charalampopoulos
On-line weighted pattern matching. Inf. Comput. 266: 49-59 (2019) - [j6]Panagiotis Charalampopoulos
Efficient enumeration of non-equivalent squares in partial words with few holes. J. Comb. Optim. 37(2): 501-522 (2019) - [j5]Yannis Almirantis, Panagiotis Charalampopoulos
On overabundant words and their application to biological sequence analysis. Theor. Comput. Sci. 792: 85-95 (2019) - [c20]Amihood Amir, Itai Boneh, Panagiotis Charalampopoulos
Repetition Detection in a Dynamic String. ESA 2019: 5:1-5:18 - [c19]Amihood Amir, Panagiotis Charalampopoulos
Longest Common Substring Made Fully Dynamic. ESA 2019: 6:1-6:17 - [c18]Panagiotis Charalampopoulos
Circular Pattern Matching with k Mismatches. FCT 2019: 213-228 - [c17]Panagiotis Charalampopoulos
Internal Dictionary Matching. ISAAC 2019: 22:1-22:17 - [c16]Panagiotis Charalampopoulos, Shay Mozes
Exact Distance Oracles for Planar Graphs with Failing Vertices. SODA 2019: 2110-2123 - [c15]Panagiotis Charalampopoulos
Weighted Shortest Common Supersequence Problem Revisited. SPIRE 2019: 221-238 - [c14]Panagiotis Charalampopoulos
Almost optimal distance oracles for planar graphs. STOC 2019: 138-151 - [i15]Panagiotis Charalampopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba:
Circular Pattern Matching with k Mismatches. CoRR abs/1907.01815 (2019) - [i14]Panagiotis Charalampopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba:
Weighted Shortest Common Supersequence Problem Revisited. CoRR abs/1909.11433 (2019) - [i13]Panagiotis Charalampopoulos, Tomasz Kociumaka, Manal Mohamed, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
Internal Dictionary Matching. CoRR abs/1909.11577 (2019) - 2018
- [j4]Panagiotis Charalampopoulos
Preface. Fundam. Informaticae 163(3): i (2018) - [j3]Panagiotis Charalampopoulos
Alignment-free sequence comparison using absent words. Inf. Comput. 262: 57-68 (2018) - [j2]Michal Adamczyk, Mai Alzamel
Palindromic Decompositions with Gaps and Errors. Int. J. Found. Comput. Sci. 29(8): 1311-1329 (2018) - [c13]Panagiotis Charalampopoulos
Linear-Time Algorithm for Long LCF with k Mismatches. CPM 2018: 23:1-23:16 - [c12]Panagiotis Charalampopoulos
Property Suffix Array with Applications. LATIN 2018: 290-302 - [c11]Hayam Alamro
Longest Common Prefixes with k-Mismatches and Applications. SOFSEM 2018: 636-649 - [c10]Mai Alzamel
Efficient Computation of Sequence Mappability. SPIRE 2018: 12-26 - [c9]Lorraine A. K. Ayad
Longest Common Prefixes with k-Errors and Applications. SPIRE 2018: 27-41 - [c8]Panagiotis Charalampopoulos
On Extended Special Factors of a Word. SPIRE 2018: 131-138 - [i12]Lorraine A. K. Ayad, Panagiotis Charalampopoulos, Costas S. Iliopoulos, Solon P. Pissis:
Longest Common Prefixes with k-Errors and Applications. CoRR abs/1801.04425 (2018) - [i11]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 abs/1802.06369 (2018) - [i10]Amihood Amir, Panagiotis Charalampopoulos, Solon P. Pissis, Jakub Radoszewski:
Longest Common Factor Made Fully Dynamic. CoRR abs/1804.08731 (2018) - [i9]Panagiotis Charalampopoulos, Maxime Crochemore, Gabriele Fici, Robert Mercas, Solon P. Pissis:
Alignment-free sequence comparison using absent words. CoRR abs/1806.02718 (2018) - [i8]Panagiotis Charalampopoulos, Shay Mozes, Benjamin Tebeka:
Exact Distance Oracles for Planar Graphs with Failing Vertices. CoRR abs/1807.05968 (2018) - [i7]Mai Alzamel, Panagiotis Charalampopoulos, Costas S. Iliopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Juliusz Straszynski:
Efficient Computation of Sequence Mappability. CoRR abs/1807.11702 (2018) - [i6]Panagiotis Charalampopoulos, Pawel Gawrychowski, Shay Mozes, Oren Weimann:
Almost Optimal Distance Oracles for Planar Graphs. CoRR abs/1811.01551 (2018) - 2017
- [j1]Yannis Almirantis, Panagiotis Charalampopoulos
On avoided words, absent words, and their application to biological sequence analysis. Algorithms Mol. Biol. 12(1): 5:1-5:12 (2017) - [c7]Mai Alzamel, Panagiotis Charalampopoulos
Faster Algorithms for 1-Mappability of a Sequence. COCOA (2) 2017: 109-121 - [c6]Panagiotis Charalampopoulos
Efficient Enumeration of Non-Equivalent Squares in Partial Words with Few Holes. COCOON 2017: 99-111 - [c5]Michal Adamczyk, Mai Alzamel, Panagiotis Charalampopoulos
Palindromic Decompositions with Gaps and Errors. CSR 2017: 48-61 - [c4]Mai Alzamel, Panagiotis Charalampopoulos
How to Answer a Small Batch of RMQs or LCA Queries in Practice. IWOCA 2017: 343-355 - [c3]Amihood Amir, Panagiotis Charalampopoulos
Longest Common Factor After One Edit Operation. SPIRE 2017: 14-26 - [c2]Yannis Almirantis, Panagiotis Charalampopoulos
Optimal Computation of Overabundant Words. WABI 2017: 4:1-4:14 - [i5]Michal Adamczyk, Mai Alzamel, Panagiotis Charalampopoulos, Costas S. Iliopoulos, Jakub Radoszewski:
Palindromic Decompositions with Gaps and Errors. CoRR abs/1703.08931 (2017) - [i4]Yannis Almirantis, Panagiotis Charalampopoulos, Jia Gao, Costas S. Iliopoulos, Manal Mohamed, Solon P. Pissis, Dimitris Polychronopoulos:
Optimal Computation of Overabundant Words. CoRR abs/1705.03385 (2017) - [i3]Mai Alzamel, Panagiotis Charalampopoulos, Costas S. Iliopoulos, Solon P. Pissis, Jakub Radoszewski, Wing-Kin Sung:
Faster algorithms for 1-mappability of a sequence. CoRR abs/1705.04022 (2017) - [i2]Mai Alzamel, Panagiotis Charalampopoulos, Costas S. Iliopoulos, Solon P. Pissis:
How to answer a small batch of RMQs or LCA queries in practice. CoRR abs/1705.04589 (2017) - 2016
- [c1]Yannis Almirantis, Panagiotis Charalampopoulos
Optimal Computation of Avoided Words. WABI 2016: 1-13 - [i1]Yannis Almirantis, Panagiotis Charalampopoulos, Jia Gao, Costas S. Iliopoulos, Manal Mohamed, Solon P. Pissis, Dimitris Polychronopoulos:
Optimal Computation of Avoided Words. CoRR abs/1604.08760 (2016)
Coauthor Index
[j20] [c42] [i31] [j18] [j14] [c40] [c39] [c37] [i25] [j12] [c35] [c33] [c31] [i22] [i21] [j11] [j10] [j9] [j8] [c29] [c26] [i16] [j7] [j6] [j5] [c19] [c18] [c15] [i15] [i14] [j4] [j3] [c13] [c12] [c11] [c10] [c9] [c8] [i12] [i11] [i10] [i9] [i7] [j1] [c7] [c6] [c4] [c3] [c2] [i4] [i3] [i2] [c1] [i1]
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-20 23:01 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: