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

• 1997
• 
  Bruno Adam, Pierre Kauffmann, Dominique Schmitt, Jean-Claude Spehner:
  An increasing-circle sweep-algorithm to construct the delaunay diagram in the plane. CCCG 1997
• 
  Pankaj K. Agarwal, Marc J. van Kreveld, Subhash Suri:
  Label placement by maximum independent set in rectangles. CCCG 1997
• 
  Francois Anton, Christopher M. Gold:
  An iterative algorithm for the determination of voronoi vertices in polygonal and non-polygonal domains. CCCG 1997
• 
  Mikhail J. Atallah, Danny Z. Chen, Kevin S. Klenk:
  Parallel algorithms for longest increasing chains in the plane and related problems. CCCG 1997
• 
  Cavit Aydin, Doug Ierardi:
  Partitioning algorithms for transportation graphs and their applications to routing. CCCG 1997
• 
  Mark Babikov, Diane L. Souvaine, Rephael Wenger:
  Constructing piecewise linear homeomorphisms of polygons with holes. CCCG 1997
• 
  Fausto Bernardini, Chandrajit L. Bajaj:
  Sampling and reconstructing manifolds using alpha-shapes. CCCG 1997
• 
  Sergei Bespamyatnikh, Michael Segal:
  Covering a set of points by two axis-parallel boxes. CCCG 1997
• 
  Binay K. Bhattacharya:
  Biased search and k-point clustering. CCCG 1997
• 
  Francisco Javier Cobos, Juan Carlos Dana, Clara I. Grima, Alberto Márquez:
  The width of a convex set on the sphere. CCCG 1997
• 
  Francisco Javier Cobos, Juan Carlos Dana, Clara I. Grima, Alberto Márquez:
  Diameter of a set on the cylinder. CCCG 1997
• 
  Jurek Czyzowicz, Evangelos Kranakis, Jorge Urrutia:
  Domino tilings and two-by-two squares. CCCG 1997
• 
  Gautam Das:
  The visibility graph contains a bounded-degree spanner. CCCG 1997
• 
  Markus Denny, Christian Sohler:
  Encoding a triangulation as a permutation of its point set. CCCG 1997
• 
  Carsten Dorgerloh, Jens Lüssem, Morakot Pilouk, Juergen Wirtgen:
  Some tools for modeling and analysis of surfaces. CCCG 1997
• 
  Frédo Durand, George Drettakis, Claude Puech:
  The 3d visibility complex: a unified data-structure for global visibility of scenes of polygons and smooth objects. CCCG 1997
• 
  Hazel Everett, Chính T. Hoàng, Kyriakos Kilakos, Marc Noy:
  Planar segment visibility graphs. CCCG 1997
• 
  Artur Fuhrmann:
  Testing roundness of a polytope and related problems. CCCG 1997
• 
  Laxmi P. Gewali, Jay S. Bagga, S. Dey, J. Emert, J. McGrew:
  Contracted visibility graphs of line segments. CCCG 1997
• 
  Subir Kumar Ghosh, Joel W. Burdick:
  An on-line algorithm for exploring an unknown polygonal environment by a point robot. CCCG 1997
• 
  Subir Kumar Ghosh, Joel W. Burdick:
  Understanding discrete visibility and related approximation algorithms. CCCG 1997
• 
  Kiyoshi Hosono, Katsumi Matsuda:
  Geometric matching problem of disjoint compact convex sets by line segments. CCCG 1997
• 
  Toshiyuki Imai:
  Some methods to determine the sign of a long integer from its remainders. CCCG 1997
• 
  Fabrice Jaillet, Behzad Shariat, Denis Vorpe:
  Periodic b-spline surface skinning of anatomic shapes. CCCG 1997
• 
  Atsushi Kaneko:
  A balanced partition of points in the plane and tree embedding problems. CCCG 1997
• 
  Mikio Kano:
  A straight-line embedding of two or more rooted trees in the plane. CCCG 1997
• 
  Evangelos Kranakis, Anthony Spatharis:
  Almost optimal on-line search in unknown streets. CCCG 1997
• 
  Michael G. Lamoureux, Joseph Douglas Horton, Bradford G. Nickerson:
  Dynamizing domination queries in 2-dimensions: The paper stabbing problem revisited. CCCG 1997
• 
  Ngoc-Minh Lê:
  Jin akiyama. CCCG 1997
• 
  Christophe Lemaire, Jean-Michel Moreau:
  Analysis of a class of k-dimensional merge procedures, with an application to 2d delaunay triangulation in expected linear time after two-directional sorting. CCCG 1997

skipping 16 more matches