Result 1 to 20 of 195 total
Some properties of $k$-Delaunay and $k$-Gabriel graphs. (English)
Comput. Geom. 46, No. 2, 131-139 (2013).
1
Stable roommates spanner. (English)
Comput. Geom. 46, No. 2, 120-130 (2013).
2
io-port 06093125 Aloupis, Greg;
Cardinal, Jean;
Collette, Sébastien;
Demaine, Erik D.;
Demaine, Martin L.;
Dulieu, Muriel;
Fabila-Monroy, Ruy;
Hart, Vi;
Hurtado, Ferran;
Langerman, Stefan;
Saumell, Maria;
Seara, Carlos;
Taslakian, Perouz
Non-crossing matchings of points with geometric objects. (English)
Comput. Geom. 46, No. 1, 78-92 (2013).
3
The clique problem in ray intersection graphs. (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, 241-252 (2012).
4
Algorithms and complexity of generalized river crossing problems. (English)
Kranakis, Evangelos (ed.) et al., Fun with algorithms. 6th international conference, FUN 2012, Venice, Italy, June 4‒6, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-30346-3/pbk). Lecture Notes in Computer Science 7288, 235-244 (2012).
5
Continuous blooming of convex polyhedra. (English)
Graphs Comb. 27, No. 3, 363-376 (2011).
6
Algorithmic folding complexity. (English)
Graphs Comb. 27, No. 3, 341-351 (2011).
7
Colorful strips. (English)
Graphs Comb. 27, No. 3, 327-339 (2011).
8
io-port 05999816 Abel, Zachary;
Ballinger, Brad;
Bose, Prosenjit;
Collette, Sébastien;
Dujmović, Vida;
Hurtado, Ferran;
Kominers, Scott Duke;
Langerman, Stefan;
Pór, Attila;
Wood, David R.
Every large point set contains many collinear points or an empty pentagon. (English)
Graphs Comb. 27, No. 1, 47-60 (2011).
9
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).
10
io-port 05970669 Aloupis, Greg;
Bose, Prosenjit K.;
Collette, Sébastien;
Demaine, Erik D.;
Demaine, Martin L.;
Douïeb, Karim;
Dujmović, Vida;
Iacono, John;
Langerman, Stefan;
Morin, Pat
Common unfoldings of polyominoes and polycubes. (English)
Akiyama, Jin (ed.) et al., Computational geometry, graphs and applications. 9th international conference, CGGA 2010, Dalian, China, November 3‒6, 2010. Revised selected papers. Berlin: Springer (ISBN 978-3-642-24982-2/pbk). Lecture Notes in Computer Science 7033, 44-54 (2011).
11
Determination of all tessellation polyhedra with regular polygonal faces. (English)
Akiyama, Jin (ed.) et al., Computational geometry, graphs and applications. 9th international conference, CGGA 2010, Dalian, China, November 3‒6, 2010. Revised selected papers. Berlin: Springer (ISBN 978-3-642-24982-2/pbk). Lecture Notes in Computer Science 7033, 1-11 (2011).
12
Confluent persistence revisited. (English)
Comput. Res. Repos. 2011, Article No. 1104.3045 (2011).
13
Computing signed permutations of polygons. (English)
Int. J. Comput. Geom. Appl. 21, No. 1, 87-100 (2011).
14
The Stackelberg minimum spanning tree game. (English)
Algorithmica 59, No. 2, 129-144 (2011).
15
io-port 50045352 Aloupis, Greg;
Collette, Sébastien;
Damian, Mirela;
Demaine, Erik D.;
Flatland, Robin Y.;
Langerman, Stefan;
O’rourke, Joseph;
Pinciu, Val;
Ramaswami, Suneeta;
Sacristan, Vera;
Wuhrer, Stefanie
Efficient constant-velocity reconfiguration of crystalline robots (English)
Robotica 29, No. 1, 59-71 (2011).
16
Algorithmic folding complexity (English)
Graphs and Combinatorics 27, No. 3, 341-351 (2011).
17
io-port 50213851 Abel, Zachary;
Ballinger, Brad;
Bose, Prosenjit;
Collette, Sébastien;
Dujmovic, Vida;
Hurtado, Ferran;
Kominers, Scott Duke;
Langerman, Stefan;
Pór, Attila;
Wood, David R.
Every large point set contains many collinear points or an empty pentagon (English)
Graphs and Combinatorics 27, No. 1, 47-60 (2011).
18
Colorful strips (English)
Graphs and Combinatorics 27, No. 3, 327-339 (2011).
19
Continuous blooming of convex polyhedra (English)
Graphs and Combinatorics 27, No. 3, 363-376 (2011).
20
Result 1 to 20 of 195 total
Start
Contact
Print
General Help
