2 citations · 6 across the 19 of their papers we have counts for
7 papers · 1 filter
Almost Optimal Distance Oracles for Planar Graphs
Panagiotis Charalampopoulos, Paweł Gawrychowski, Shay Mozes +1
We present new tradeoffs between space and query-time for exact distance oracles in directed weighted planar graphs. These tradeoffs are almost optimal in the sense that they are w…
Efficient Computation of Sequence Mappability
Panagiotis Charalampopoulos, Costas S. Iliopoulos, Tomasz Kociumaka +3
In the -mappability problem, for a given sequence of length , the goal is to compute a table whose th entry is the number of indices such that the length…
Exact Distance Oracles for Planar Graphs with Failing Vertices
Panagiotis Charalampopoulos, Shay Mozes, Benjamin Tebeka
We consider exact distance oracles for directed weighted planar graphs in the presence of failing vertices. Given a source vertex , a target vertex and a set of fail…
Alignment-free sequence comparison using absent words
Panagiotis Charalampopoulos, Maxime Crochemore, Gabriele Fici +2
Sequence comparison is a prerequisite to virtually all comparative genomic analyses. It is often realised by sequence alignment techniques, which are computationally expensive. Thi…
Longest Common Substring Made Fully Dynamic
Amihood Amir, Panagiotis Charalampopoulos, Solon P. Pissis +1
In the longest common substring (LCS) problem, we are given two strings and , each of length at most , and we are asked to find a longest string occurring as a fragment o…
Linear-Time Algorithm for Long LCF with Mismatches
Panagiotis Charalampopoulos, Maxime Crochemore, Costas S. Iliopoulos +5
In the Longest Common Factor with Mismatches (LCF) problem, we are given two strings and of total length , and we are asked to find a pair of maximal-length fact…