Result 1 to 20 of 31 total
Approximate one-to-one point pattern matching. (English)
J. Discrete Algorithms 15, 1-15 (2012).
1
Finding popular places. (English)
Int. J. Comput. Geom. Appl. 20, No. 1, 19-42 (2010).
2
Algorithms for multi-criteria boundary labeling. (English)
J. Graph Algorithms Appl. 13, No. 3, 289-317 (2009).
3
A polynomial-time approximation algorithm for a geometric dispersion problem. (English)
Int. J. Comput. Geom. Appl. 19, No. 3, 267-288 (2009).
4
Morphing polylines: A step towards continuous generalization. (English)
Comput. Environ Urban Syst. 32, No. 4, 248-260 (2008).
5
Reporting flock patterns. (English)
Comput. Geom. 41, No. 3, 111-125 (2008).
6
Constructing minimum-interference networks. (English)
Comput. Geom. 40, No. 3, 179-194 (2008).
7
Delineating boundaries for imprecise regions. (English)
Algorithmica 50, No. 3, 386-414 (2008).
8
Algorithms for multi-criteria one-sided boundary labeling. (English)
Hong, Seok-Hee (ed.) et al., Graph drawing. 15th international symposium, GD 2007, Sydney, Australia, September 24‒26, 2007. Revised papers. Berlin: Springer (ISBN 978-3-540-77536-2/pbk). Lecture Notes in Computer Science 4875, 243-254 (2008).
9
Finding popular places. (English)
Tokuyama, Takeshi (ed.), Algorithms and computation. 18th international symposium, ISAAC 2007, Sendai, Japan, December 17‒19, 2007. Proceedings. Berlin: Springer (ISBN 978-3-540-77118-0/pbk). Lecture Notes in Computer Science 4835, 776-787 (2007).
10
Minimizing intra-edge crossings in wiring diagrams and public transportation maps. (English)
Kaufmann, Michael (ed.) et al., Graph drawing. 14th international symposium, GD 2006, Karlsruhe, Germany, September 18‒20, 2006. Revised papers. Berlin: Springer (ISBN 978-3-540-70903-9/pbk). Lecture Notes in Computer Science 4372, 270-281 (2007).
11
Finding popular places (English)
ISAAC, 776-787 (2007).
12
Algorithms for multi-criteria one-sided boundary labeling (English)
Graph Drawing, 243-254 (2007).
13
Reporting flock patterns. (English)
Azar, Yossi (ed.) et al., Algorithms ‒ ESA 2006. 14th annual European symposium, Zurich, Switzerland, September 11‒13, 2006. Proceedings. Berlin: Springer (ISBN 978-3-540-38875-3/pbk). Lecture Notes in Computer Science 4168, 660-671 (2006).
14
A polynomial-time approximation algorithm for a geometric dispersion problem. (English)
Chen, Danny Z. (ed.) et al., Computing and combinatorics. 12th annual international conference, COCOON 2006, Taipei, Taiwan, August 15‒18, 2006. Proceedings. Berlin: Springer (ISBN 3-540-36925-2/pbk). Lecture Notes in Computer Science 4112, 166-175 (2006).
15
Constructing interference-minimal networks. (English)
Wiedermann, Jiří (ed.) et al., SOFSEM 2006: Theory and practice of computer science. 32nd conference on current trends in theory and practice of computer science, Měřín, Czech Republic, January 21‒27, 2006. Proceedings. Berlin: Springer (ISBN 3-540-31198-X/pbk). Lecture Notes in Computer Science 3831, 166-176 (2006).
16
The minimum Manhattan network problem: Approximations and exact solutions. (English)
Comput. Geom. 35, No. 3, 188-208 (2006).
17
Reporting flock patterns (English)
ESA, 660-671 (2006).
18
A polynomial-time approximation algorithm for a geometric dispersion problem (English)
COCOON, 166-175 (2006).
19
Constructing interference-minimal networks (English)
SOFSEM, 166-176 (2006).
20
Result 1 to 20 of 31 total
Start
Contact
Print
General Help
