• 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 18 matches

• 1999
• 
  Sunil Arya, David M. Mount, Michiel H. M. Smid:
  Dynamic algorithms for geometric spanners of small diameter: Randomized solutions. Comput. Geom. 13(2): 91-107 (1999)
• 
  Jean-Daniel Boissonnat, Jurek Czyzowicz, Olivier Devillers, Jean-Marc Robert, Mariette Yvinec:
  Convex tours of bounded curvature. Comput. Geom. 13(3): 149-159 (1999)
• 
  Timothy M. Chan:
  More planar two-center algorithms. Comput. Geom. 13(3): 189-198 (1999)
• 
  Amitava Datta, Christian Icking:
  Competitive searching in a generalized street. Comput. Geom. 13(2): 109-120 (1999)
• 
  Olivier Devillers, Franco P. Preparata:
  Further results on arithmetic filters for geometric predicates. Comput. Geom. 13(2): 141-148 (1999)
• 
  Dorit Dor, Uri Zwick:
  SOKOBAN and other motion planning problems. Comput. Geom. 13(4): 215-228 (1999)
• 
  James D. Fix, Richard E. Ladner:
  Multiresolution banded refinement to accelerate surface reconstruction from polygons. Comput. Geom. 13(1): 49-64 (1999)
• 
  Bernd Gärtner:
  Exact arithmetic at low cost - A case study in linear programming. Comput. Geom. 13(2): 121-139 (1999)
• 
  John D. Hobby:
  Practical segment intersection with finite precision output. Comput. Geom. 13(4): 199-214 (1999)
• 
  Ferran Hurtado, Marc Noy:
  Graph of triangulations of a convex polygon and tree of triangulations. Comput. Geom. 13(3): 179-188 (1999)
• 
  Joan P. Hutchinson, Thomas C. Shermer, Andrew Vince:
  On representations of some thickness-two graphs. Comput. Geom. 13(3): 161-171 (1999)
• 
  Atsushi Kaneko, Mikio Kano:
  Balanced partitions of two sets of points in the plane. Comput. Geom. 13(4): 253-261 (1999)
• 
  Lutz Kettner:
  Using generic programming for designing a data structure for polyhedral surfaces. Comput. Geom. 13(1): 65-90 (1999)
• 
  Marc J. van Kreveld, Tycho Strijk, Alexander Wolff:
  Point labeling with sliding labels. Comput. Geom. 13(1): 21-47 (1999)
• 
  Jayanth Majhi, Prosenjit Gupta, Ravi Janardan:
  Computing a flattest, undercut-free parting line for a convex polyhedron, with application to mold design. Comput. Geom. 13(4): 229-252 (1999)
• 
  Victor Milenkovic:
  Rotational polygon containment and minimum enclosure using only robust 2D constructions. Comput. Geom. 13(1): 3-19 (1999)
• 
  Jarek Rossignac:
  Editorial. Comput. Geom. 13(1): 1 (1999)
• 
  Masatsugu Urabe:
  Partitioning point sets in space into disjoint convex polytopes. Comput. Geom. 13(3): 173-178 (1999)