Let n be the size of a parametrized problem and k the parameter. We
pres...
Assume that an N-bit sequence S of k self-delimiting numbers is given
as...
Time-evolving or temporal graphs gain more and more popularity when stud...
Time-evolving or temporal graphs gain more and more popularity when stud...
Practical applications that use treewidth algorithms have graphs with
tr...
Many succinct data structures on the word RAM require precomputed tables...
Many succinct data structures on a word RAM require precomputed tables t...
We present an in-place depth first search (DFS) and an in-place breadth ...