Result 1 to 20 of 68 total
Convex partitions with 2-edge connected dual graphs. (English)
J. Comb. Optim. 22, No. 3, 409-425 (2011).
1
Augmenting the edge connectivity of planar straight line graphs to three. (English)
Algorithmica 61, No. 4, 971-999 (2011).
2
Disjoint compatible geometric matchings (English)
Symposium on Computational Geometry, 125-134 (2011).
3
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).
4
Cuttings for disks and axis-aligned rectangles in three-space. (English)
Discrete Comput. Geom. 43, No. 2, 221-241 (2010).
5
Cuttings for disks and axis-aligned rectangles in three-space (English)
Discrete & Computational Geometry 43, No. 2, 221-241 (2010).
6
io-port 70314517 Barequet, Gill;
Benbernou, Nadia;
Charlton, David;
Demaine, Erik D.;
Demaine, Martin L.;
Ishaque, Mashhood;
Lubiw, Anna;
Schulz, André;
Souvaine, Diane L.;
Toussaint, Godfried T.;
Winslow, Andrew
Bounded-degree polyhedronization of point sets (English)
CCCG, 99-102 (2010).
7
io-port 70684377 Ballinger, Brad;
Benbernou, Nadia;
Bose, Prosenjit;
Damian, Mirela;
Demaine, Erik D.;
Dujmovic, Vida;
Flatland, Robin Y.;
Hurtado, Ferran;
Iacono, John;
Lubiw, Anna;
Morin, Pat;
Adinolfi, Vera Sacristán;
Souvaine, Diane L.;
Uehara, Ryuhei
Coverage with $k$-transmitters in the presence of obstacles (English)
COCOA (2), 1-15 (2010).
8
Tri-edge-connectivity augmentation for planar straight line graphs. (English)
Dong, Yingfei (ed.) et al., Algorithms and computation. 20th international symposium, ISAAC 2009, Honolulu, Hawaii, USA, December 16‒18, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-10630-9/pbk). Lecture Notes in Computer Science 5878, 902-912 (2009).
9
io-port 05587034 Aichholzer, Oswin;
Bereg, Sergey;
Dumitrescu, Adrian;
García, Alfredo;
Huemer, Clemens;
Hurtado, Ferran;
Kano, Mikio;
Márquez, Alberto;
Rappaport, David;
Smorodinsky, Shakhar;
Souvaine, Diane;
Urrutia, Jorge;
Wood, David R.
Compatible geometric matchings. (English)
Comput. Geom. 42, No. 6-7, 617-626 (2009).
10
Convex partitions with 2-edge connected dual graphs. (English)
Ngo, Hung Q. (ed.), Computing and combinatorics. 15th annual international conference, COCOON 2009, Niagara Falls, NY, USA, July 13‒15, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-02881-6/pbk). Lecture Notes in Computer Science 5609, 192-204 (2009).
11
A vertex-face assignment for plane graphs. (English)
Comput. Geom. 42, No. 5, 388-394 (2009).
12
Convex partitions with 2-edge connected dual graphs (English)
COCOON, 192-204 (2009).
13
Tri-edge-connectivity augmentation for planar straight line graphs (English)
ISAAC, 902-912 (2009).
14
Topological sweep of the complete graph. (English)
Discrete Appl. Math. 156, No. 17, 3276-3290 (2008).
15
Deflating the pentagon. (English)
Ito, Hiro (ed.) et al., Computational geometry and graph theory. International conference, KyotoCGGT 2007, Kyoto, Japan, June 11‒15, 2007. Revised selected papers. Berlin: Springer (ISBN 978-3-540-89549-7/pbk). Lecture Notes in Computer Science 4535, 56-67 (2008).
16
Staged self-assembly:Nanomanufacture of arbitrary shapes with $O(1)$ glues. (English)
Comput. Res. Repos. 2008, Article No. 0803.0316 (2008).
17
Tight bounds for connecting sites across barriers. (English)
Discrete Comput. Geom. 40, No. 3, 377-394 (2008).
18
Staged self-assembly: nanomanufacture of arbitrary shapes with $O(1)$ glues. (English)
Nat. Comput. 7, No. 3, 347-370 (2008).
19
Staged self-assembly: Nanomanufacture of arbitrary shapes with $O(1)$ glues. (English)
Garzon, Max H. (ed.) et al., DNA computing. 13th international meeting on DNA computing, DNA13, Memphis, TN, USA, June 4‒8, 2007. Revised selected papers. Berlin: Springer (ISBN 978-3-540-77961-2/pbk). Lecture Notes in Computer Science 4848, 1-14 (2008).
20
Result 1 to 20 of 68 total
Start
Contact
Print
General Help
