Augmenting the connectivity of geometric graphs

[1]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

[2]  Robert E. Tarjan,et al.  Augmentation Problems , 1976, SIAM J. Comput..

[3]  David Rappaport,et al.  Computing simple circuits from a set of line segments , 1987, SCG '87.

[4]  Akira Nakamura,et al.  Edge-Connectivity Augmentation Problems , 1987, J. Comput. Syst. Sci..

[5]  Akira Nakamura,et al.  A smallest augmentation to 3-connect a graph , 1990, Discret. Appl. Math..

[6]  Jorge Urrutia,et al.  GALLERIES AND LIGHT MATCHINGS: FAT COOPERATIVE GUARDS , 1991 .

[7]  T. Hsu,et al.  On four-connecting a triconnected graph , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.

[8]  G. Kant.  Algorithms for drawing planar graphs , 1993 .

[9]  Prosenjit Bose,et al.  Every Set of Disjoint Line Segments Admits a Binary Tree , 1994, ISAAC.

[10]  Goos Kant,et al.  Augmenting Outerplanar Graphs , 1996, J. Algorithms.

[11]  Toshihide Ibaraki,et al.  Deterministic Õ(nm) Time Edge-Splitting in Undirected Graphs , 1996, STOC '96.

[12]  Joseph O'Rourke,et al.  Handbook of Discrete and Computational Geometry, Second Edition , 1997 .

[13]  Petra Mutzel,et al.  A new approximation algorithm for the planar augmentation problem , 1998, SODA '98.

[14]  András Frank.  Connectivity augmentation of networks: structures and algorithms , 1999, Math. Program..

[15]  Eddie Cheng,et al.  Successive edge-connectivity augmentation problems , 1999, Math. Program..

[16]  Prosenjit Bose,et al.  Competitive Online Routing in Geometric Graphs , 2004, SIROCCO.

[17]  Bill Jackson,et al.  Independence free graphs and vertex connectivity augmentation , 2001, J. Comb. Theory, Ser. B.

[18]  Béla Bollobás,et al.  Modern Graph Theory , 2002, Graduate Texts in Mathematics.

[19]  Csaba D. Tóth,et al.  Alternating paths through disjoint line segments , 2003, Inf. Process. Lett..

[20]  János Pach.  Geometric Graph Theory , 2004, Handbook of Discrete and Computational Geometry, 2nd Ed..

[21]  Csaba D. Tóth,et al.  Encompassing colored crossing-free geometric graphs , 2004, CCCG.

[22]  Bettina Speckmann,et al.  Pointed Binary Encompassing Trees , 2004, SWAT.

[23]  Csaba D. Tóth,et al.  Pointed and colored binary encompassing trees , 2005, Symposium on Computational Geometry.

[24]  Bill Jackson,et al.  Independence free graphs and vertex connectivity augmentation , 2005, J. Comb. Theory, Ser. B.

[25]  Erik D. Demaine,et al.  Geometric folding algorithms - linkages, origami, polyhedra , 2007 .

[26]  Guy Kortsarz,et al.  Approximating Minimum-Cost Connectivity Problems , 2007, Handbook of Approximation Algorithms and Metaheuristics.

[27]  Marc Noy,et al.  Augmenting the Connectivity of Outerplanar Graphs , 2008, Algorithmica.

[28]  C.J.H. Mann,et al.  Handbook of Approximation: Algorithms and Metaheuristics , 2008 .

[29]  Csaba D. Tóth,et al.  Encompassing colored planar straight line graphs , 2008, Comput. Geom..

[30]  Jakub Marecek,et al.  Handbook of Approximation Algorithms and Metaheuristics , 2010, Comput. J..