Result 1 to 20 of 70 total
Locally correct Fréchet matchings. (English)
Epstein, Leah (ed.) et al., Algorithms ‒ ESA 2012. 20th annual European symposium, Ljubljana, Slovenia, September 10‒12, 2012. Proceeding. Berlin: Springer (ISBN 978-3-642-33089-6/pbk). Lecture Notes in Computer Science 7501, 229-240 (2012).
1
Drawing (complete) binary tanglegrams. (English)
Algorithmica 62, No. 1-2, 309-332 (2012).
2
Shortest-paths preserving metro maps. (English)
van Kreveld, Marc (ed.) et al., Graph drawing. 19th international symposium, GD 2011, Eindhoven, The Netherlands, September 21‒23, 2011. Revised selected papers. Berlin: Springer (ISBN 978-3-642-25877-0/pbk). Lecture Notes in Computer Science 7034, 445-446 (2012).
3
Finding long and similar parts of trajectories. (English)
Comput. Geom. 44, No. 9, 465-476 (2011).
4
Angle-restricted Steiner arborescences for flow map layout. (English)
Asano, Takao (ed.) et al., Algorithms and computation. 22nd international symposium, ISAAC 2011, Yokohama, Japan, December 5‒8, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-25590-8/pbk). Lecture Notes in Computer Science 7074, 250-259 (2011).
5
Preprocessing imprecise points for Delaunay triangulation: simplified and extended. (English)
Algorithmica 61, No. 3, 674-693 (2011).
6
Detecting commuting patterns by clustering subtrajectories. (English)
Int. J. Comput. Geom. Appl. 21, No. 3, 253-282 (2011).
7
Adjacency-preserving spatial treemaps. (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, 159-170 (2011).
8
Adjacency-preserving spatial treemaps. (English)
Comput. Res. Repos. 2011, Article No. 1105.0398 (2011).
9
Delaunay triangulations in $O(sort(n))$ time and more. (English)
J. ACM 58, No. 2, 6 (2011).
10
Optimizing regular edge labelings. (English)
Brandes, Ulrik (ed.) et al., Graph drawing. 18th international symposium, GD 2010, Konstanz, Germany, September 21‒24, 2010. Revised selected papers. Berlin: Springer (ISBN 978-3-642-18468-0/pbk). Lecture Notes in Computer Science 6502, 117-128 (2011).
11
Flow map layout via spiral trees (English)
IEEE Trans. Vis. Comput. Graph. 17, No. 12, 2536-2544 (2011).
12
Adjacency-preserving spatial treemaps (English)
WADS, 159-170 (2011).
13
Angle-restricted Steiner arborescences for flow map layout (English)
ISAAC, 250-259 (2011).
14
Shortest-paths preserving metro maps (English)
Graph Drawing, 445-446 (2011).
15
Acyclic orientation of drawings. (English)
J. Graph Algorithms Appl. 14, No. 2, 367-384 (2010).
16
Finding the most relevant fragments in networks. (English)
J. Graph Algorithms Appl. 14, No. 2, 307-336 (2010).
17
Voronoi diagram of polygonal chains under the discrete Fréchet distance. (English)
Int. J. Comput. Geom. Appl. 20, No. 4, 471-484 (2010).
18
Median trajectories. (English)
de Berg, Mark (ed.) et al., Algorithms ‒ ESA 2010. 18th annual European symposium, Liverpool, UK, September 6‒8, 2010. Proceedings, Part I. Berlin: Springer (ISBN 978-3-642-15774-5/pbk). Lecture Notes in Computer Science 6346, 463-474 (2010).
19
On the number of spanning trees a planar graph can have. (English)
de Berg, Mark (ed.) et al., Algorithms ‒ ESA 2010. 18th annual European symposium, Liverpool, UK, September 6‒8, 2010. Proceedings, Part I. Berlin: Springer (ISBN 978-3-642-15774-5/pbk). Lecture Notes in Computer Science 6346, 110-121 (2010).
20
Result 1 to 20 of 70 total
Start
Contact
Print
General Help
