Grow & fold: compression of tetrahedral meshes
Proceedings of the fifth ACM symposium on Solid modeling and applications
SCG '99 Proceedings of the fifteenth annual symposium on Computational geometry
An O-tree representation of non-slicing floorplan and its applications
Proceedings of the 36th annual ACM/IEEE Design Automation Conference
Face fixer: compressing polygon meshes with properties
Proceedings of the 27th annual conference on Computer graphics and interactive techniques
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
Near-optimal connectivity encoding of 2-manifold polygon meshes
Graphical Models - Special issue: Processing on large polygonal meshes
Compact representations of separable graphs
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Compact Routing Tables for Graphs of Bounded Genus
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
An Information-Theoretic Upper Bound of Planar Graphs Using Triangulation
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
A Fast General Methodology for Information - Theoretically Optimal Encodings of Graphs
ESA '99 Proceedings of the 7th Annual European Symposium on Algorithms
Compressing the Graph Structure of the Web
DCC '01 Proceedings of the Data Compression Conference
Dictionaries using variable-length keys and data, with applications
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Optimizing markov models with applications to triangular connectivity coding
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Optimal succinct representations of planar maps
Proceedings of the twenty-second annual symposium on Computational geometry
Selective decompression of vector maps
Proceedings of the 15th annual ACM international symposium on Advances in geographic information systems
Compact dictionaries for variable-length keys and data with applications
ACM Transactions on Algorithms (TALG)
Schnyder woods for higher genus triangulated surfaces
Proceedings of the twenty-fourth annual symposium on Computational geometry
Quick encoding of plane graphs in log 214 bits per edge
Information Processing Letters
A Compact Encoding of Rectangular Drawings with Efficient Query Supports
AAIM '07 Proceedings of the 3rd international conference on Algorithmic Aspects in Information and Management
Succinct Representations of Arbitrary Graphs
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Succinct representations of planar maps
Theoretical Computer Science
Seamless Handoff Support for Real-Time Multimedia Applications in Nested Mobile Networks
PCM '08 Proceedings of the 9th Pacific Rim Conference on Multimedia: Advances in Multimedia Information Processing
A Compact Encoding of Rectangular Drawings with Efficient Query Supports
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
A fast and compact web graph representation
SPIRE'07 Proceedings of the 14th international conference on String processing and information retrieval
A compact encoding of plane triangulations with efficient query supports
WALCOM'08 Proceedings of the 2nd international conference on Algorithms and computation
A compact encoding of plane triangulations with efficient query supports
Information Processing Letters
Succinct representations of separable graphs
CPM'10 Proceedings of the 21st annual conference on Combinatorial pattern matching
On design of a route-optimised and seamless HCoP-B scheme for nested mobile networks
International Journal of High Performance Computing and Networking
Planar graphs, via well-orderly maps and trees
WG'04 Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science
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
Bounding the number of reduced trees, cographs, and series-parallel graphs by compression
WALCOM'12 Proceedings of the 6th international conference on Algorithms and computation
A hierarchical care-of prefix with BUT scheme for nested mobile networks
ISPA'07 Proceedings of the 5th international conference on Parallel and Distributed Processing and Applications
Triangle mesh compression along the Hamiltonian cycle
The Visual Computer: International Journal of Computer Graphics
Succinct encoding of arbitrary graphs
Theoretical Computer Science
| Hi-index | 0.05 |