The lexicographic depth-first search (Lex-DFS) is one of the first basic graph problems
studied in the context of space-efficient algorithms. It is shown independently by Asano et …

In the limited workspace model, we consider algorithms whose input resides in read-only
memory and that use only a constant or sublinear amount of writable memory to accomplish …

Given a sequence of integers, we want to find a longest increasing subsequence of the
sequence. It is known that this problem can be solved in O (n log n) time and space. Our …

In the limited-workspace model, we assume that the input of size n lies in a random access
read-only memory. The output has to be reported sequentially, and it cannot be accessed or …

In the limited workspace model, we consider algorithms whose input resides in read-only
memory and that use only a constant or sublinear amount of writable memory to accomplish …

Continuing the recent trend, in this article we design several space-efficient algorithms for
two well-known graph search methods. Both these search methods share the same name …

Given a sequence of integers, we want to find a longest increasing subsequence of the
sequence. It is known that this problem can be solved in O n log n O\left(n\logn\right) time …

A Complete Bibliography of Publications in the Journal of Computational Geometry Page 1
A Complete Bibliography of Publications in the Journal of Computational Geometry Nelson …