2 citations · 6 across the 23 of their papers we have counts for
4 papers · 1 filter
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…
Faster Algorithms for Longest Common Substring
Panagiotis Charalampopoulos, Tomasz Kociumaka, Jakub Radoszewski +1
In the classic longest common substring (LCS) problem, we are given two strings and , each of length at most , over an alphabet of size , and we are asked to find a lo…
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…