• case-insensitive prefix search: default
  e.g., sig matches "SIGIR" as well as "signal"
• exact word search: append dollar sign ($) to word
  e.g., graph$ matches "graph", but not "graphics"
• boolean and: separate words by space
  e.g., codd model
• boolean or: connect words by pipe symbol (|)
  e.g., graph|network

Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.

found 31 matches

• 2002
• 
  Nina Amenta, Sunghee Choi, Tamal K. Dey, Naveen Leekha:
  A Simple Algorithm for Homeomorphic Surface Reconstruction. Int. J. Comput. Geom. Appl. 12(1-2): 125-141 (2002)
• 
  Mark de Berg, Stefan Schirra:
  Guest Editor's Foreword. Int. J. Comput. Geom. Appl. 12(1-2): 1-2 (2002)
• 
  Sergei Bespamyatnikh:
  An Optimal Morphing Between Polylines. Int. J. Comput. Geom. Appl. 12(3): 217-228 (2002)
• 
  David Binger:
  Polyhedra with Unguarded Interiors. Int. J. Comput. Geom. Appl. 12(3): 173-180 (2002)
• 
  Prosenjit Bose, Andrej Brodnik, Svante Carlsson, Erik D. Demaine, Rudolf Fleischer, Alejandro López-Ortiz, Pat Morin, J. Ian Munro:
  Online Routing in Convex Subdivisions. Int. J. Comput. Geom. Appl. 12(4): 283-296 (2002)
• 
  Prosenjit Bose, Luc Devroye, William S. Evans:
  Diamonds are Not a Minimum Weight Triangulation's Best Friend. Int. J. Comput. Geom. Appl. 12(6): 445-454 (2002)
• 
  Prosenjit Bose, Pat Morin:
  An Improved Algorithm for Subdivision Traversal without Extra Storage. Int. J. Comput. Geom. Appl. 12(4): 297-308 (2002)
• 
  Peter Braß, Christian Knauer:
  Testing the Congruence of d-Dimensional Point Sets. Int. J. Comput. Geom. Appl. 12(1-2): 115-124 (2002)
• 
  Timothy M. Chan:
  Approximating the Diameter, Width, Smallest Enclosing Cylinder, and Minimum-Width Annulus. Int. J. Comput. Geom. Appl. 12(1-2): 67-85 (2002)
• 
  Danny Z. Chen, Xiaobo Hu, Xiaodong Wu:
  Optimal Polygon Cover Problems and Applications. Int. J. Comput. Geom. Appl. 12(4): 309-338 (2002)
• 
  Danny Z. Chen, Jie Wang, Xiaodong Wu:
  Image Segmentation with Asteroidality/Tubularity and Smoothness Constraints. Int. J. Comput. Geom. Appl. 12(5): 413-428 (2002)
• 
  Olivier Devillers:
  On Deletion in Delaunay Triangulations. Int. J. Comput. Geom. Appl. 12(3): 193-206 (2002)
• 
  Olivier Devillers, Pedro A. Ramos:
  Computing Roundness is Easy if the Set is Almost Round. Int. J. Comput. Geom. Appl. 12(3): 229-248 (2002)
• 
  Tamal K. Dey, Rephael Wenger:
  Fast Reconstruction of Curves with Sharp Corners. Int. J. Comput. Geom. Appl. 12(5): 353-400 (2002)
• 
  Srinivas Doddi, Madhav V. Marathe, Bernard M. E. Moret:
  Point Set Labeling with Specified Positions. Int. J. Comput. Geom. Appl. 12(1-2): 29-66 (2002)
• 
  Adrian Dumitrescu, János Pach:
  Partitioning Colored Point Sets into Monochromatic Parts. Int. J. Comput. Geom. Appl. 12(5): 401-412 (2002)
• 
  Jong-Sung Ha, Sung Yong Shin:
  Edge Advancing Rules for Intersecting Spherical Convex Polygons. Int. J. Comput. Geom. Appl. 12(3): 207-216 (2002)
• 
  Hiroshi Imai, Tomonari Masada, Fumihiko Takeuchi, Keiko Imai:
  Enumerating Triangulations in General Dimensions. Int. J. Comput. Geom. Appl. 12(6): 455-480 (2002)
• 
  Naoki Katoh, Hisao Tamaki, Takeshi Tokuyama:
  Parametric Polymatroid Optimization and Its Geometric Applications. Int. J. Comput. Geom. Appl. 12(5): 429-444 (2002)
• 
  J. Mark Keil, Jack Snoeyink:
  On the Time Bound for Convex Decomposition of Simple Polygons. Int. J. Comput. Geom. Appl. 12(3): 181-192 (2002)
• 
  David G. Kirkpatrick, Jack Snoeyink, Bettina Speckmann:
  Kinetic Collision Detection for Simple Polygons. Int. J. Comput. Geom. Appl. 12(1-2): 3-27 (2002)
• 
  Atsushi Koike, Shin-Ichi Nakano, Takao Nishizeki, Takeshi Tokuyama, Shuhei Watanabe:
  Labeling Points with Rectangles of Various Shapes. Int. J. Comput. Geom. Appl. 12(6): 511-528 (2002)
• 
  Steven M. LaValle, Borislav H. Simov, Giora Slutzki:
  An Algorithm for Searching a Polygonal Region with a Flashlight. Int. J. Comput. Geom. Appl. 12(1-2): 87-113 (2002)
• 
  Grégoire Malandain, Jean-Daniel Boissonnat:
  Computing the Diameter of a Point Set. Int. J. Comput. Geom. Appl. 12(6): 489-510 (2002)
• 
  Joseph O'Rourke:
  Computational Geometry Column 43. Int. J. Comput. Geom. Appl. 12(3): 263-266 (2002)
• 
  Sang-Min Park, Jae-Ha Lee, Kyung-Yong Chwa:
  Searching a Room by Two Guards. Int. J. Comput. Geom. Appl. 12(4): 339-352 (2002)
• 
  Xuehou Tan:
  Finding an Optimal Bridge Between Two Polygons. Int. J. Comput. Geom. Appl. 12(3): 249-262 (2002)
• 
  Takeshi Tokuyama:
  Guest Editor's Foreword. Int. J. Comput. Geom. Appl. 12(4): 267-268 (2002)
• 
  Jia Feng Weng:
  Generalized Melzak's Construction in the Steiner Tree Problem. Int. J. Comput. Geom. Appl. 12(6): 481-488 (2002)
• 
  Alexander Wolff, Michael Thon, Yin-Feng Xu:
  A Simple Factor-2/3 Approximation Algorithm for Two-Circle Point Labeling. Int. J. Comput. Geom. Appl. 12(4): 269-282 (2002)

skipping 1 more match