Efficient computation of implicit representations of sparse graphs

Linear-time compression of bounded-genus graphs into information-theoretically optimal number of bits

SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms

Dynamic Representation of Sparse Graphs

WADS '99 Proceedings of the 6th International Workshop on Algorithms and Data Structures

Sublogarithmic distributed MIS algorithm for sparse graphs using nash-williams decomposition

Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing

Graph representation functions computable by finite automata

Journal of Automata, Languages and Combinatorics

Approximation scheme for lowest outdegree orientation and graph density measures

ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation