2 citations · 6 across the 8 of their papers we have counts for
19 papers
Internal Shortest Absent Word Queries in Constant Time and Linear Space
Golnaz Badkobeh, Panagiotis Charalampopoulos, Dmitry Kosolobov +1
Given a string of length over an alphabet of size , we are to preprocess so that given a range , we can return a representa…
An Almost Optimal Edit Distance Oracle
Panagiotis Charalampopoulos, Paweł Gawrychowski, Shay Mozes +1
We consider the problem of preprocessing two strings and , of lengths and , respectively, in order to be able to efficiently answer the following queries: Given posit…
Fault-Tolerant Distance Labeling for Planar Graphs
Aviv Bar-Natan, Panagiotis Charalampopoulos, Paweł Gawrychowski +2
In fault-tolerant distance labeling we wish to assign short labels to the vertices of a graph such that from the labels of any three vertices we can infer the -to-$v…
The Number of Repetitions in 2D-Strings
Panagiotis Charalampopoulos, Jakub Radoszewski, Wojciech Rytter +2
The notions of periodicity and repetitions in strings, and hence these of runs and squares, naturally extend to two-dimensional strings. We consider two types of repetitions in 2D-…
Counting Distinct Patterns in Internal Dictionary Matching
Panagiotis Charalampopoulos, Tomasz Kociumaka, Manal Mohamed +5
We consider the problem of preprocessing a text of length and a dictionary in order to be able to efficiently answer queries , that is, gi…
Faster Approximate Pattern Matching: A Unified Approach
Panagiotis Charalampopoulos, Tomasz Kociumaka, Philip Wellnitz
Approximate pattern matching is a natural and well-studied problem on strings: Given a text , a pattern , and a threshold , find (the starting positions of) all substrings…