8 citations · 17 across the 6 of their papers we have counts for
Showing 2017Show all
3 papers · 1 filter
cs.DM2017★ 8 cited
The graph tessellation cover number: extremal bounds, efficient algorithms and hardness
A. Abreu, L. Cunha, T. Fernandes +5
A tessellation of a graph is a partition of its vertices into vertex disjoint cliques. A tessellation cover of a graph is a set of tessellations that covers all of its edges. The $…
cs.DM2017★ 8 cited
The tessellation problem of quantum walks
A. Abreu, L. Cunha, T. Fernandes +5
Quantum walks have received a great deal of attention recently because they can be used to develop new quantum algorithms and to simulate interesting quantum systems. In this work,…
cs.DS2017
Fast and Simple Jumbled Indexing for Binary RLE Strings
Luís Cunha, Simone Dantas, Travis Gagie +3
Important papers have appeared recently on the problem of indexing binary strings for jumbled pattern matching, and further lowering the time bounds in terms of the input size woul…