4 citations · 4 across the 2 of their papers we have counts for
3 papers
cs.DS2022
Minimum Path Cover in Parameterized Linear Time
Manuel Caceres, Massimo Cairo, Brendan Mumey +2
A minimum path cover (MPC) of a directed acyclic graph (DAG) is a minimum-size set of paths that together cover all the vertices of the DAG. Computing an MPC is a basic…
cs.DS2020★ 4 cited
Fast Indexes for Gapped Pattern Matching
Manuel Cáceres, Simon J. Puglisi, Bella Zhukova
We describe indexes for searching large data sets for variable-length-gapped (VLG) patterns. VLG patterns are composed of two or more subpatterns, between each adjacent pair of whi…
cs.DS2019
Faster Repetition-Aware Compressed Suffix Trees based on Block Trees
Manuel Cáceres, Gonzalo Navarro
Suffix trees are a fundamental data structure in stringology, but their space usage, though linear, is an important problem for its applications. We design and implement a new comp…