History

Please fill in your query. A complete syntax description you will find on the General Help page.

Result 21 to 40 of 93 total

Mergeable dictionaries (English)
ICALP (1), 164-175 (2010).
21
Oja medians and centers of gravity (English)
CCCG, 147-150 (2010).
22
Common unfoldings of polyominoes and polycubes (English)
CGGA, 44-54 (2010).
23
Coverage with $k$-transmitters in the presence of obstacles (English)
COCOA (2), 1-15 (2010).
24
Unit-time predecessor queries on massive data sets (English)
ISAAC (1), 133-144 (2010).
25
Minimum feature size preserving decompositions. (English)
Comput. Res. Repos. 2009, Article No. 0908.2493 (2009).
26
Detecting all regular polygons in a point set. (English)
Comput. Res. Repos. 2009, Article No. 0908.2442 (2009).
27
Continuous blooming of convex polyhedra. (English)
Comput. Res. Repos. 2009, Article No. 0906.2461 (2009).
28
Minimal locked trees. (English)
Dehne, Frank (ed.) et al., Algorithms and data structures. 11th international symposium, WADS 2009, Banff, Canada, August 21‒23, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-03366-7/pbk). Lecture Notes in Computer Science 5664, 61-73 (2009).
29
Entropy, triangulation, and point location in planar subdivisions. (English)
Comput. Res. Repos. 2009, Article No. 0901.1908 (2009).
30
The geometry of binary search trees (English)
SODA, 496-505 (2009).
31
Packing $2\times 2$ unit squares into grid polygons is NP-complete (English)
CCCG, 33-36 (2009).
32
Efficient reconfiguration of lattice-based modular robots (English)
ECMR, 81-86 (2009).
33
Minimal locked trees (English)
34
Distribution-sensitive point location in convex subdivisions. (English)
Proceedings of the nineteenth annual ACM-SIAM symposium on discrete algorithms, San Francisco, CA, January 20‒22, 2008. New York, NY: Association for Computing Machinery (ACM); Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM) (ISBN 978-0-898716-47-4). 912-921 (2008).
35
Output-sensitive algorithms for tukey depth and related problems (English)
Statistics and Computing 18, No. 3, 259-266 (2008).
36
Distribution-sensitive point location in convex subdivisions (English)
SODA, 912-921 (2008).
37
Partitioning a polygon into two mirror congruent pieces (English)
CCCG (2008).
38
Dynamic optimality ‒ almost. (English)
SIAM J. Comput. 37, No. 1, 240-251 (2007).
39
A unified access bound on comparison-based dynamic dictionaries. (English)
Theor. Comput. Sci. 382, No. 2, 86-96 (2007).
40

Result 21 to 40 of 93 total