
Range Minimum Queries in Minimal Space
We consider the problem of computing a sequence of range minimum queries...
read it

Small Longest Tandem Scattered Subsequences
We consider the problem of identifying tandem scattered subsequences wit...
read it

Hardness of Modern Games
We consider the complexity properties of modern puzzle games, Hexiom, Cu...
read it

Sparsifying ParityCheck Matrices
Parity check matrices (PCMs) are used to define linear error correcting ...
read it

Incremental Multiple Longest Common SubSequences
We consider the problem of updating the information about multiple longe...
read it

Approximating Optimal Bidirectional Macro Schemes
LempelZiv is an easytocompute member of a wide family of socalled ma...
read it

On dynamic succinct graph representations
We address the problem of representing dynamic graphs using k^2trees. T...
read it

OrderPreserving Pattern Matching Indeterminate Strings
Given an indeterminate string pattern p and an indeterminate string text...
read it

Linking and Cutting Spanning Trees
We consider the problem of uniformly generating a spanning tree, of a co...
read it

Cartesian trees and Lyndon trees
The article describes the structural and algorithmic relations between C...
read it

Quick HyperVolume
We present a new algorithm to calculate exact hypervolumes. Given a set ...
read it
Luís M. S. Russo
is this you? claim profile