Panagiotis Charalampopoulos

From MaRDI portal
Person:1642717

Available identifiers

zbMath Open charalampopoulos.panagiotisDBLP184/0588WikidataQ89498729 ScholiaQ89498729MaRDI QIDQ1642717

List of research outcomes

PublicationDate of PublicationType
Longest palindromic substring in sublinear time2024-05-06Paper
https://portal.mardi4nfdi.de/entity/Q61878332024-01-15Paper
Exact Distance Oracles for Planar Graphs with Failing Vertices2023-10-31Paper
https://portal.mardi4nfdi.de/entity/Q60759182023-09-20Paper
On the hardness of computing the edit distance of shallow trees2023-08-04Paper
Subsequence covers of words2023-08-04Paper
Efficient computation of sequence mappability2023-07-28Paper
Longest common prefixes with \(k\)-errors and applications2023-07-28Paper
On extended special factors of a word2023-07-28Paper
https://portal.mardi4nfdi.de/entity/Q60987762023-06-14Paper
https://portal.mardi4nfdi.de/entity/Q60987822023-06-14Paper
Property Suffix Array with Applications in Indexing Weighted Sequences2023-05-23Paper
https://portal.mardi4nfdi.de/entity/Q58744342023-02-07Paper
Dynamic String Alignment.2023-02-07Paper
Unary Words Have the Smallest Levenshtein k-Neighbourhoods2023-02-07Paper
Single-Source Shortest Paths and Strong Connectivity in Dynamic Planar Graphs.2023-02-07Paper
https://portal.mardi4nfdi.de/entity/Q58745002023-02-07Paper
https://portal.mardi4nfdi.de/entity/Q58755832023-02-03Paper
Efficient Enumeration of Distinct Factors Using Package Representations2022-12-22Paper
Internal shortest absent word queries in constant time and linear space2022-06-13Paper
Repetition Detection in a Dynamic String2022-05-11Paper
Longest common substring made fully dynamic2022-05-11Paper
Fault-tolerant distance labeling for planar graphs2022-05-10Paper
Efficient computation of sequence mappability2022-05-03Paper
Fault-tolerant distance labeling for planar graphs2022-03-22Paper
Single-source shortest paths and strong connectivity in dynamic planar graphs2021-11-25Paper
Internal dictionary matching2021-06-30Paper
Longest Common Factor After One Edit Operation2021-02-16Paper
Linear-Time Algorithm for Long LCF with k Mismatches2020-12-16Paper
Dynamic and internal longest common substring2020-11-11Paper
Circular pattern matching with \(k\) mismatches2020-10-23Paper
Longest Common Prefixes with k-Mismatches and Applications2020-10-21Paper
Optimal Computation of Overabundant Words2020-05-27Paper
Faster algorithms for 1-mappability of a sequence2020-02-20Paper
Property suffix array with applications2020-02-12Paper
Almost optimal distance oracles for planar graphs2020-01-30Paper
Circular pattern matching with \(k\) mismatches2020-01-30Paper
Exact Distance Oracles for Planar Graphs with Failing Vertices2019-10-15Paper
On overabundant words and their application to biological sequence analysis2019-10-07Paper
Palindromic Decompositions with Gaps and Errors2019-06-24Paper
Efficient enumeration of non-equivalent squares in partial words with few holes2019-06-06Paper
On-line weighted pattern matching2019-05-02Paper
Alignment-free sequence comparison using absent words2018-09-27Paper
How to answer a small batch of RMQs or LCA queries in practice2018-06-15Paper
Faster algorithms for 1-mappability of a sequence2018-03-26Paper
Optimal computation of avoided words2018-03-23Paper
Efficient enumeration of non-equivalent squares in partial words with few holes2017-10-23Paper
Palindromic decompositions with gaps and errors2017-08-22Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Panagiotis Charalampopoulos