Result 1 to 20 of 36 total
Some properties of $k$-Delaunay and $k$-Gabriel graphs. (English)
Comput. Geom. 46, No. 2, 131-139 (2013).
1
Minimizing interference in ad hoc networks with bounded communication radius. (English)
Inf. Process. Lett. 112, No. 19, 748-752 (2012).
2
Geodesic order types. (English)
Gudmundsson, Joachim (ed.) et al., Computing and combinatorics. 18th annual international conference, COCOON 2012, Sydney, Australia, August 20‒22, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-32240-2/pbk). Lecture Notes in Computer Science 7434, 216-227 (2012).
3
Coloring planar homothets and three-dimensional hypergraphs. (English)
Fernández-Baca, David (ed.), LATIN 2012: Theoretical informatics. 10th Latin American symposium, Arequipa, Peru, April 16‒20, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-29343-6/pbk). Lecture Notes in Computer Science 7256, 121-132 (2012).
4
Colorful strips. (English)
Graphs Comb. 27, No. 3, 327-339 (2011).
5
Minimizing interference in ad-hoc networks with bounded communication radius. (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, 80-89 (2011).
6
Computing the visibility polygon using few variables. (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, 70-79 (2011).
7
Locating a service facility and a rapid transit line. (English)
Comput. Res. Repos. 2011, Article No. 1104.0753 (2011).
8
Yet another paper on minimizing interference on ad-hoc networks. (English)
Comput. Res. Repos. 2011, Article No. 1102.2785 (2011).
9
Coloring planar homothets and three-dimensional hypergraphs. (English)
Comput. Res. Repos. 2011, Article No. 1101.0565 (2011).
10
Covering points by disjoint boxes with outliers. (English)
Comput. Geom. 44, No. 3, 178-190 (2011).
11
Colorful strips (English)
Graphs and Combinatorics 27, No. 3, 327-339 (2011).
12
Minimizing interference in ad-hoc networks with bounded communication radius (English)
ISAAC, 80-89 (2011).
13
Computing the visibility polygon using few variables (English)
ISAAC, 70-79 (2011).
14
Effect of corner information in simultaneous placement of $k$ rectangles and tableaux. (English)
Discrete Math. Algorithms Appl. 2, No. 4, 527-537 (2010).
15
The geodesic diameter of polygonal domains. (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, 500-511 (2010).
16
Effect of corner information in simultaneous placement of $K$ rectangles and tableaux. (English)
Thai, My T. (ed.) et al., Computing and combinatorics. 16th annual international conference, COCOON 2010, Nha Trang, Vietnam, July 19‒21, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-14030-3/pbk). Lecture Notes in Computer Science 6196, 235-243 (2010).
17
The geodesic diameter of polygonal domains. (English)
Comput. Res. Repos. 2010, Article No. 1001.0695 (2010).
18
Colorful strips. (English)
López-Ortiz, Alejandro (ed.), LATIN 2010: Theoretical informatics. 9th Latin American symposium, Oaxaca, Mexico, April 19‒23, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-12199-9/pbk). Lecture Notes in Computer Science 6034, 2-13 (2010).
19
The geodesic diameter of polygonal domains (English)
ESA (1), 500-511 (2010).
20
Result 1 to 20 of 36 total
Start
Contact
Print
General Help
