Result 81 to 100 of 121 total
Pseudotriangulations from surfaces and a novel type of edge flip. (English)
SIAM J. Comput. 32, No. 6, 1621-1653 (2003).
81
Towards compatible triangulations. (English)
Theor. Comput. Sci. 296, No. 1, 3-13 (2003).
82
Long proteins with unique optimal foldings in the H-P model. (English)
Comput. Geom. 25, No.1-2, 139-159 (2003).
83
Spatial embedding of pseudo-triangulations (English)
Symposium on Computational Geometry, 144-153 (2003).
84
On the number of pseudo-triangulations of certain point sets (English)
CCCG, 141-144 (2003).
85
Degree bounds for constrained pseudo-triangulations (English)
CCCG, 155-158 (2003).
86
The zigzag path of a pseudo-triangulation (English)
WADS, 377-388 (2003).
87
Adapting (Pseudo)-triangulations with a near-linear number of edge flips (English)
WADS, 12-24 (2003).
88
Long proteins with unique optimal foldings in the H-P model. (English)
Comput. Res. Repos. 2002, Article No. 0201018 (2002).
89
On flips in polyhedral surfaces. (English)
Int. J. Found. Comput. Sci. 13, No. 2, 303-311 (2002).
90
io-port 01883410 Aichholzer, Oswin;
Cortés, Carmen;
Demaine, Erik D.;
Dujmovic, Vida;
Erickson, Jeff;
Meijer, Henk;
Overmars, Mark;
Palop, Belén;
Ramaswami, Suneeta;
Toussaint, Godfried T.
Flipturning Polygons. (English)
Discrete Comput. Geom. 28, No.2, 231-253 (2002).
91
Enumerating order types for small point sets with applications. (English)
Order 19, No.3, 265-281 (2002).
92
Sequences of spanning trees and a fixed tree theorem. (English)
Comput. Geom. 21, No.1-2, 3-20 (2002).
93
Enumerating order types for small point sets with applications (English)
Order 19, No. 3, 265-281 (2002).
94
On the crossing number of complete graphs (English)
Symposium on Computational Geometry, 19-24 (2002).
95
Quickest paths, straight skeletons, and the city Voronoi diagram (English)
Symposium on Computational Geometry, 151-159 (2002).
96
Convexity minimizes pseudo-triangulations (English)
CCCG, 158-161 (2002).
97
Towards compatible triangulations. (English)
Wang, Jie (ed.), Computing and combinatorics. 7th annual international conference, COCOON 2001, Guilin, China, August 20-23, 2001. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 2108, 101-110 (2001).
99
Reconfiguring convex polygons. (English)
Comput. Geom. 20, No.1-2, 85-95 (2001).
100
Result 81 to 100 of 121 total
Start
Contact
Print
General Help
