Result 1 to 20 of 107 total
Fast local searches and updates in bounded universes. (English)
Comput. Geom. 46, No. 2, 181-189 (2013).
1
On point-sets that support planar graphs. (English)
Comput. Geom. 46, No. 1, 29-50 (2013).
2
Memoryless routing in convex subdivisions: Random walks are optimal. (English)
Comput. Geom. 45, No. 4, 178-185 (2012).
3
Layered working-set trees. (English)
Algorithmica 63, No. 1-2, 476-489 (2012).
4
Biased range trees. (English)
Algorithmica 62, No. 1-2, 21-37 (2012).
5
On point-sets that support planar graphs. (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, 64-74 (2012).
6
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).
7
On the maximum number of cliques in a graph embedded in a surface. (English)
Eur. J. Comb. 32, No. 8, 1244-1252 (2011).
8
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).
9
On graphs supported by line sets. (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, 177-182 (2011).
10
A note on the perimeter of fat objects. (English)
Comput. Geom. 44, No. 1, 1-8 (2011).
11
On the book thickness of k-trees (English)
Discrete Mathematics & Theoretical Computer Science 13, No. 3, 39-44 (2011).
12
On the maximum number of cliques in a graph embedded in a surface (English)
Eur. J. Comb. 32, No. 8, 1244-1252 (2011).
13
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).
14
A center transversal theorem for hyperplanes and applications to graph drawing (English)
Symposium on Computational Geometry, 117-124 (2011).
15
On point-sets that support planar graphs (English)
Graph Drawing, 64-74 (2011).
16
io-port 05834490 Ballinger, Brad;
Benbernou, Nadia;
Bose, Prosenjit;
Damian, Mirela;
Demaine, Erik D.;
Dujmović, Vida;
Flatland, Robin;
Hurtado, Ferran;
Iacono, John;
Lubiw, Anna;
Morin, Pat;
Sacristán, Vera;
Souvaine, Diane;
Uehara, Ryuhei
Coverage with $k$-transmitters in the presence of obstacles. (English)
Wu, Weili (ed.) et al., Combinatorial optimization and applications. 4th international conference, COCOA 2010, Kailua-Kona, HI, USA, December 18‒20, 2010. Proceedings, Part II. Berlin: Springer (ISBN 978-3-642-17460-5/pbk). Lecture Notes in Computer Science 6509, 1-15 (2010).
17
An $O(\log \log n)$-competitive binary search tree with optimal worst-case access times. (English)
Comput. Res. Repos. 2010, Article No. 1003.0139 (2010).
18
Odds-on trees. (English)
Comput. Res. Repos. 2010, Article No. 1002.1092 (2010).
19
Point location in disconnected planar subdivisions. (English)
Comput. Res. Repos. 2010, Article No. 1001.2763 (2010).
20
Result 1 to 20 of 107 total
Start
Contact
Print
General Help
