Result 1 to 20 of 167 total
$α$-visibility. (English)
Fomin, Fedor V. (ed.) et al., Algorithm theory ‒ SWAT 2012. 13th Scandinavian symposium and workshops, Helsinki, Finland, July 4‒6, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-31154-3/pbk). Lecture Notes in Computer Science 7357, 1-12 (2012).
1
Succinct and I/O efficient data structures for traversal in trees. (English)
Algorithmica 63, No. 1-2, 201-223 (2012).
2
A survey of geodesic paths on 3D surfaces. (English)
Comput. Geom. 44, No. 9, 486-498 (2011).
3
Improved algorithms for partial curve matching. (English)
Demetrescu, Camil (ed.) et al., Algorithms ‒ ESA 2011. 19th annual European symposium, Saarbrücken, Germany, September 5‒9, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-23718-8/pbk). Lecture Notes in Computer Science 6942, 518-529 (2011).
4
Switching to directional antennas with constant increase in radius and hop distance. (English)
Dehne, Frank (ed.) et al., Algorithms and data structures. 12th international symposium, WADS 2011, New York, NY, USA, August 15‒17, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-22299-3/pbk). Lecture Notes in Computer Science 6844, 134-146 (2011).
5
On the number of shortest descending paths on the surface of a convex terrain. (English)
J. Discrete Algorithms 9, No. 2, 182-189 (2011).
6
An approximation algorithm for computing shortest paths in weighted 3-d domains. (English)
Comput. Res. Repos. 2011, Article No. 1102.3165 (2011).
7
Fréchet distance with speed limits. (English)
Comput. Geom. 44, No. 2, 110-120 (2011).
8
An approximation algorithm for the noah’s ark problem with random feature loss (English)
IEEE/ACM Trans. Comput. Biology Bioinform. 8, No. 2, 551-556 (2011).
9
Improved algorithms for partial curve matching (English)
ESA, 518-529 (2011).
10
Switching to directional antennas with constant increase in radius and hop distance (English)
WADS, 134-146 (2011).
11
Algorithms for approximate shortest path queries on weighted polyhedral surfaces. (English)
Discrete Comput. Geom. 44, No. 4, 762-801 (2010).
12
Computing the greedy spanner in near-quadratic time. (English)
Algorithmica 58, No. 3, 711-729 (2010).
13
Recognizing the largest empty circle and axis-parallel rectangle in a desired location. (English)
Comput. Res. Repos. 2010, Article No. 1004.0558 (2010).
14
Improved methods for generating quasi-Gray codes. (English)
Kaplan, Haim (ed.), Algorithm theory ‒ SWAT 2010. 12th Scandinavian symposium and workshops on algorithm theory, Bergen, Norway, June 21‒23, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-13730-3/pbk). Lecture Notes in Computer Science 6139, 224-235 (2010).
15
Approximation algorithms for shortest descending paths in terrains. (English)
J. Discrete Algorithms 8, No. 2, 214-230 (2010).
16
Sigma-local graphs. (English)
J. Discrete Algorithms 8, No. 1, 15-23 (2010).
17
Algorithms for approximate shortest path queries on weighted polyhedral surfaces (English)
Discrete & Computational Geometry 44, No. 4, 762-801 (2010).
18
HVM performance validation and DFM techniques used in a 32nm CMOS thermal sensor system (English)
CICC, 1-4 (2010).
19
Speed-constrained geodesic Fréchet distance inside a simple polygon (English)
CCCG, 179-182 (2010).
20
Result 1 to 20 of 167 total
Start
Contact
Print
General Help
