The union of congruent cubes in three dimensions
SCG '01 Proceedings of the seventeenth annual symposium on Computational geometry
On the Complexity of the Union of Geometric Objects
JCDCG '00 Revised Papers from the Japanese Conference on Discrete and Computational Geometry
Local polyhedra and geometric graphs
Computational Geometry: Theory and Applications - Special issue on the 19th annual symposium on computational geometry - SoCG 2003
Local polyhedra and geometric graphs
Computational Geometry: Theory and Applications - Special issue on the 19th annual symposium on computational geometry - SoCG 2003
Hi-index | 0.00 |
For any positive integers r and n, let H(r,n) denote the family of graphs on n vertices with maximum degree r, and let H(r,n,n) denote the family of bipartite graphs H on 2n vertices with n vertices in each vertex class, and with maximum degree r. On ...