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

• 2002
• 
  Oswin Aichholzer, Franz Aurenhammer, Hannes Krasser, Bettina Speckmann:
  Convexity minimizes pseudo-triangulations. CCCG 2002: 158-161
• 
  Greg Aloupis, Prosenjit Bose, Erik D. Demaine, Stefan Langerman, Henk Meijer, Mark H. Overmars, Godfried T. Toussaint:
  Computing signed permutations of polygons. CCCG 2002: 68-71
• 
  Greg Aloupis, Erik D. Demaine, Henk Meijer, Joseph O'Rourke, Ileana Streinu, Godfried T. Toussaint:
  On flat-state connectivity of chains with fixed acute angles. CCCG 2002: 27-30
• 
  Francois Anton, David G. Kirkpatrick, Darka Mioc:
  An exact algebraic predicate for maintaining the topology of the voronoi diagram for circles. CCCG 2002: 72-76
• 
  Sergei Bespamyatnikh:
  Computing closest points for segments. CCCG 2002: 118-122
• 
  Sergei Bespamyatnikh:
  Enumerating pseudo-triangulations in the plane. CCCG 2002: 162-166
• 
  Therese Biedl, Timothy M. Chan, Erik D. Demaine, Martin L. Demaine, Paul Nijjar, Ryuhei Uehara, Ming-wei Wang:
  Tighter bounds on the genus of nonorthogonal polyhedra built from rectangles. CCCG 2002: 105-108
• 
  Therese Biedl, Timothy M. Chan, Alejandro López-Ortiz:
  Drawing k₂, n: A lower bound. CCCG 2002: 146-148
• 
  Therese Biedl, Masud Hasan, Joseph Douglas Horton, Alejandro López-Ortiz, Tomás Vinar:
  Searching for the center of a circle. CCCG 2002: 137-141
• 
  Imma Boada, Narcís Coll, Joan Antoni Sellarès:
  Hierarchical planar voronoi diagram approximations. CCCG 2002: 40-44
• 
  Prosenjit Bose, Joachim Gudmundsson, Pat Morin:
  Ordered theta graphs. CCCG 2002: 17-21
• 
  Prosenjit Bose, Michiel H. M. Smid, David R. Wood:
  Light edges in degree-constrained graphs. CCCG 2002: 142-145
• 
  Hervé Brönnimann, Olivier Devillers, Vida Dujmovic, Hazel Everett, Marc Glisse, Xavier Goaoc, Sylvain Lazard, Hyeon-Suk Na, Sue Whitesides:
  On the number of lines tangent to four convex polyhedra. CCCG 2002: 113-117
• 
  Hervé Brönnimann, Marc Glisse, David R. Wood:
  Cost-optimal quadtrees for ray shooting. CCCG 2002: 109-112
• 
  Frederick Crimins, Diane L. Souvaine:
  Constructing differentiable homeomorphisms between isomorphic triangulations. CCCG 2002: 170-173
• 
  Valentina Damerow, Lukas Finschi, Martin Ziegler:
  Point location algorithms of minimum size. CCCG 2002: 5-9
• 
  Mirela Damian-Iordache:
  Exact and approximation algorithms for computing a-fat decompositions. CCCG 2002: 93-96
• 
  Erik D. Demaine, Robert A. Hearn, Michael Hoffmann:
  Push-2-f is pspace-complete. CCCG 2002: 31-35
• 
  Erik D. Demaine, John Iacono, Stefan Langerman:
  Proximate point searching. CCCG 2002: 1-4
• 
  Erik D. Demaine, Joseph O'Rourke:
  Open problems from cccg 2001. CCCG 2002
• 
  Luc Devroye:
  Paul Erdös memorial lecture. CCCG 2002
• 
  João Dinis, Margarida Mamede:
  A sweep line algorithm for nearest neighbour queries. CCCG 2002: 123-127
• 
  Melody Donoso, Joseph O'Rourke:
  Nonorthogonal polyhedra built from rectangles. CCCG 2002: 101-104
• 
  Stephane Durocher, David G. Kirkpatrick:
  On the hardness of turn-angle-restricted rectilinear cycle cover problems. CCCG 2002: 13-16
• 
  Khaled M. Elbassioni, Amr Elmasry, Ibrahim Kamel:
  Efficient answering of polyhedral queries in r^d using bbs-trees. CCCG 2002: 54-57
• 
  Marina L. Gavrilova:
  A reliable algorithm for computing the generalized voronoi diagram for a set of spheres in the euclidean d-dimensional space. CCCG 2002: 82-87
• 
  Emilio Di Giacomo, Giuseppe Liotta, Stephen K. Wismath:
  Drawing series-parallel graphs on a box. CCCG 2002: 149-153
• 
  Joachim Giesen, Matthias John:
  The complexity of flow diagrams in the plane. CCCG 2002: 45-48
• 
  Meenakshisundaram Gopi:
  On sampling and reconstructing surfaces with boundaries. CCCG 2002: 49-53
• 
  Leonard Hagger, Ian D. Sanders:
  Partitioning a deformed urban grid. CCCG 2002: 88-92

skipping 14 more matches