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

• 2003
• 
  Oswin Aichholzer, Michael Hoffmann, Bettina Speckmann, Csaba D. Tóth:
  Degree Bounds for Constrained Pseudo-Triangulations. CCCG 2003: 155-158
• 
  Oswin Aichholzer, David Orden, Francisco Santos, Bettina Speckmann:
  On the Number of Pseudo-Triangulations of Certain Point Sets. CCCG 2003: 141-144
• 
  Greg Aloupis, Thomas Fevens, Stefan Langerman, Tomomi Matsui, Antonio Mesa, Yurai Núñez Rodríguez, David Rappaport, Godfried T. Toussaint:
  Computing the Similarity of two Melodies. CCCG 2003: 81-84
• 
  Helmut Alt, Marc Glisse, Xavier Goaoc:
  On the worst-case complexity of the silhouette of a polytope. CCCG 2003: 51-55
• 
  Tetsuo Asano, David G. Kirkpatrick, Chee-Keng Yap:
  Minimizing the trace length of a rod endpoint in the presence of polygonal obstacles is NP-hard. CCCG 2003: 10-13
• 
  Therese Biedl, Anna Lubiw, Michael J. Spriggs:
  Parallel morphing of trees and cycles. CCCG 2003: 29-34
• 
  Hervé Brönnimann, Hazel Everett, Sylvain Lazard, Frank Sottile, Sue Whitesides:
  Transversals to line segments in R³. CCCG 2003: 174-177
• 
  Lingke Bu, Bradford G. Nickerson:
  Multidimensional Orthogonal Range Search Using Tries. CCCG 2003: 161-165
• 
  Timothy M. Chan, Alexander Golynski, Alejandro López-Ortiz, Claude-Guy Quimper:
  Curves of width one and the river shore problem. CCCG 2003: 73-75
• 
  Eric Y. Chen, Timothy M. Chan:
  A Space-Efficient Algorithm for Segment Intersection. CCCG 2003: 68-71
• 
  Jaeil Choi, Andrzej Szymczak:
  On Coherent Rotation Angles for As-Rigid-As-Possible Shape Interpolation. CCCG 2003: 111-114
• 
  Mirela Damian-Iordache, Joseph O'Rourke:
  Partitioning Regular Polygons into Circular Pieces I: Convex Partitions. CCCG 2003: 43-46
• 
  Karen Daniels, Arti Mathur, Roger Grinde:
  A combinatorial maximum cover approach to 2D translational geometric covering. CCCG 2003: 2-5
• 
  Erik D. Demaine, Jeff Erickson, Stefan Langerman:
  On the Complexity of Halfspace Volume Queries. CCCG 2003: 159-160
• 
  Stephane Durocher, David G. Kirkpatrick:
  The Gaussian Centre of a Set of Mobile Points. CCCG 2003: 123-127
• 
  Henning Fernau, Torben Hagerup, Naomi Nishimura, Prabhakar Ragde, Klaus Reinhardt:
  On the parameterized complexity of the generalized rush hour puzzle. CCCG 2003: 6-9
• 
  Suzanne Gallagher, Joseph O'Rourke:
  Coloring Objects Built From Bricks. CCCG 2003: 56-59
• 
  Marina L. Gavrilova, Sergei Bespamyatnikh:
  On exact solution of a point-location problem in a system of d-dimensional hyperbolic surfaces. CCCG 2003: 136-139
• 
  Laxmi P. Gewali, Joy Bhadury, Ramaswamy Chandrasekaran:
  Network Design Subject to Facility Location. CCCG 2003: 128-131
• 
  Alexander Golynski, David Bremner:
  Sufficiently Fat Polyhedra are Not 2-Castable. CCCG 2003: 120-122
• 
  Nicolas Grislain, Jonathan Richard Shewchuk:
  The Strange Complexity of Constrained Delaunay Triangulation. CCCG 2003: 89-93
• 
  David Hart:
  Shortest Paths in Two Intersecting Pencils of Lines. CCCG 2003: 166-169
• 
  Masud Hasan, Anna Lubiw:
  Equiprojective Polyhedra. CCCG 2003: 47-50
• 
  Robert A. Hearn, Erik D. Demaine, Greg N. Frederickson:
  Hinged Dissection of Polygons is Hard. CCCG 2003: 98-102
• 
  Ian Hsieh, Kiat-Choong Chen, Cao An Wang:
  A Genetic Algorithm for the Minimum Tetrahedralization of a Convex Polyhedron. CCCG 2003: 115-119
• 
  Shiyan Hu:
  A Constant Approximation Algorithm for Maximum Weight Triangulation. CCCG 2003: 150-154
• 
  Ferran Hurtado, Godfried T. Toussaint, Joan Trias:
  On Polyhedra Induced by Point Sets in Space. CCCG 2003: 107-110
• 
  Telikepalli Kavitha, Kasturi R. Varadarajan:
  On shortest paths in line arrangements. CCCG 2003: 170-173
• 
  J. Mark Keil, Tzvetalin S. Vassilev:
  An algorithm for the MaxMin area triangulation of a convex polygon. CCCG 2003: 145-149
• 
  Ali Asghar Khanban, Abbas Edalat:
  Computing Delaunay Triangulation with Imprecise Input Data. CCCG 2003: 94-97

skipping 12 more matches