Volume 44, Number 1, January 2011

• 
  Prosenjit Bose, Otfried Cheong, Vida Dujmovic: A note on the perimeter of fat objects. 1-8
• 
  Sadish Sadasivam, Huaming Zhang: Closed rectangle-of-influence drawings for irreducible triangulations. 9-19
• 
  Menelaos I. Karavelas: Guarding curvilinear art galleries with edge or mobile guards via 2-dominance of triangulation graphs. 20-51
• 
  Gennaro Cordasco, Rosario De Chiara, Andrew Fish: Efficient on-line algorithms for Euler diagram region computation. 52-68

Volume 44, Number 2, February 2011

• 
  William Evans: Guest Editor's foreword. 69
• 
  Yves Brise, Bernd Gärtner: Clarkson's algorithm for violator spaces. 70-81
• 
  Erik D. Demaine, Sándor P. Fekete, Günter Rote, Nils Schweer, Daria Schymura, Mariano Zelke: Integer point sets minimizing average pairwise L₁ distance: What is the optimal shape of a town? 82-94
• 
  Christian A. Duncan: On graph thickness, geometric thickness, and separator theorems. 95-99
• 
  Minghui Jiang: An inequality on the edge lengths of triangular meshes. 100-103
• 
  Shiliang Cui, Iyad A. Kanj, Ge Xia: On the stretch factor of Delaunay triangulations of points in convex position. 104-109
• 
  Anil Maheshwari, Jörg-Rüdiger Sack, Kaveh Shahbaz, Hamid Zarrabi-Zadeh: Fréchet distance with speed limits. 110-120
• 
  Prosenjit Bose, Luc Devroye, Maarten Löffler, Jack Snoeyink, Vishal Verma: Almost all Delaunay triangulations have stretch factor greater than pi/2. 121-127

Volume 44, Number 3, April 2011

• 
  Khaled M. Elbassioni, Hans Raj Tiwary: On a cone covering problem. 129-134
• 
  José Miguel Díaz-Báñez, M. A. López, Mercè Mora, Carlos Seara, Inmaculada Ventura: Fitting a two-joint orthogonal chain to a point set. 135-147
• 
  Chih-Chiang Yu, Wing-Kai Hon, Biing-Feng Wang: Improved data structures for the orthogonal range successor problem. 148-159
• 
  Olivier Devillers, Monique Teillaud: Perturbations for Delaunay and weighted Delaunay 3D triangulations. 160-168
• 
  Olivier Devillers: Vertex removal in two-dimensional Delaunay triangulation: Speed-up by low degrees optimization. 169-177
• 
  Hee-Kap Ahn, Sang Won Bae, Erik D. Demaine, Martin L. Demaine, Sang-Sub Kim, Matias Korman, Iris Reinbacher, Wanbin Son: Covering points by disjoint boxes with outliers. 178-190

Volume 44, Number 4, May 2011

• 
  Haim Kaplan, Natan Rubin, Micha Sharir: A kinetic triangulation scheme for moving points in the plane. 191-205
• 
  Abhishek Kashyap, Samir Khuller, Mark A. Shayman: Relay placement for fault tolerance in wireless networks in higher dimensions. 206-215
• 
  Bernardo M. Ábrego, Ruy Fabila Monroy, Silvia Fernández-Merchant, David Flores-Peñaloza, Ferran Hurtado, Vera Sacristan, Maria Saumell: On crossing numbers of geometric proximity graphs. 216-233
• 
  Otfried Cheong, Hazel Everett, Marc Glisse, Joachim Gudmundsson, Samuel Hornus, Sylvain Lazard, Mira Lee, Hyeon-Suk Na: Farthest-polygon Voronoi diagrams. 234-247

Volume 44, Number 5, July 2011

• 
  Burkay Genç, Cem Evrendilek, Brahim Hnich: Covering points with orthogonally convex polygons. 249-264
• 
  Eli Packer: Controlled Perturbation of sets of line segments in ℝ² with smart processing order. 265-285
• 
  Stephane Durocher, Krishnam Raju Jampani, Anna Lubiw, Lata Narayanan: Modelling gateway placement in wireless networks: Geometric k-centres of unit disc graphs. 286-302
• 
  Mercè Claverol, Delia Garijo, Clara I. Grima, Alberto Márquez, Carlos Seara: Stabbers of line segments in the plane. 303-318

Volume 44, Numbers 6-7, August 2011

• 
  Prosenjit Bose, Paz Carmi, Mathieu Couture, Michiel H. M. Smid, Daming Xu: On a family of strong geometric spanners that admit local routing strategies. 319-328
• 
  Boris Aronov, Muriel Dulieu, Ferran Hurtado: Witness (Delaunay) graphs. 329-344
• 
  Radoslav Fulek, János Pach: A computational approach to Conway's thrackle conjecture. 345-355
• 
  Reuven Bar-Yehuda, Danny Hermelin, Dror Rawitz: Minimum vertex cover in rectangle graphs. 356-364

Volume 44, Number 8, October 2011

• 
  Laurent Alonso, Edward M. Reingold: Improved bounds for cops-and-robber pursuit. 365-369
• 
  Esther M. Arkin, Michael A. Bender, Joseph S. B. Mitchell, Valentin Polishchuk: The snowblower problem. 370-384
• 
  J. Joseph Fowler, Michael Jünger, Stephen G. Kobourov, Michael Schulz: Characterizations of restricted pairs of planar graphs allowing simultaneous embedding with fixed edges. 385-398
• 
  Therese C. Biedl, Masud Hasan, Alejandro López-Ortiz: Efficient view point selection for silhouettes of convex polyhedra. 399-408
• 
  Therese C. Biedl, Burkay Genç: Reconstructing orthogonal polyhedra from putative vertex sets. 409-417
• 
  Yann Disser, Matús Mihalák, Peter Widmayer: A polygon is determined by its angles. 418-426
• 
  Shawn Martin, Jean-Paul Watson: Non-manifold surface reconstruction from high-dimensional point cloud data. 427-441
• 
  Atlas F. Cook, Carola Wenk: Link distance and shortest path problems in the plane. 442-455
• 
  Stefan Hougardy: On packing squares into a rectangle. 456-463

Volume 44, Number 9, November 2011

• 
  Kevin Buchin, Maike Buchin, Marc J. van Kreveld, Jun Luo: Finding long and similar parts of trajectories. 465-476
• 
  Paz Carmi, Matthew J. Katz, Zvi Lotker, Adi Rosén: Connectivity guarantees for wireless networks with directional antennas. 477-485
• 
  Prosenjit Bose, Anil Maheshwari, Chang Shu, Stefanie Wuhrer: A survey of geodesic paths on 3D surfaces. 486-498
• 
  Marc J. van Kreveld: Bold graph drawings. 499-506
• 
  Kurt Mehlhorn, Ralf Osbild, Michael Sagraloff: A general approach to the analysis of controlled perturbation algorithms. 507-528
• 
  Fabrizio Frati, Michael Kaufmann: Polynomial area bounds for MST embeddings of trees. 529-543

last updated on Sat May 25 05:57:15 2013 by the dblp team
data released under the ODC-BY 1.0 license
see also our legal information page