Clique partitions, graph compression and speeding-up algorithms
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Grow & fold: compression of tetrahedral meshes
Proceedings of the fifth ACM symposium on Solid modeling and applications
Orderly spanning trees with applications to graph encoding and graph drawing
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Edgebreaker: Connectivity Compression for Triangle Meshes
IEEE Transactions on Visualization and Computer Graphics
Compact representations of separable graphs
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Graph compression and the zeros of polynomials
Information Processing Letters
Selective decompression of vector maps
Proceedings of the 15th annual ACM international symposium on Advances in geographic information systems
Quick encoding of plane graphs in log 214 bits per edge
Information Processing Letters
Compression of graphical structures
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 1
A fast and compact web graph representation
SPIRE'07 Proceedings of the 14th international conference on String processing and information retrieval
On the OBDD size for graphs of bounded tree- and clique-width
IWPEC'06 Proceedings of the Second international conference on Parameterized and Exact Computation
| Hi-index | 0.04 |