120 citations
- Tel Aviv UniversityIL10 papers
- Hebrew University of JerusalemIL4 papers
- Herzliya Medical CenterIL4 papers
- University of HaifaIL4 papers
- Stanford UniversityUS3 papers
- Technion – Israel Institute of TechnologyIL3 papers
- Ariel UniversityIL2 papers
- Ben-Gurion University of the NegevIL2 papers
- Institute of Science and Technology AustriaAT2 papers
- Massachusetts Institute of TechnologyUS2 papers
- Northeastern UniversityUS2 papers
- Weizmann Institute of ScienceIL2 papers
Showing 2018 · cs.DSShow all
2 papers · 2 filters
cs.DS2018
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…
cs.DS2018
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…