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

• 2005
• 
  Jin Akiyama, Mikio Kano, Xuehou Tan:
  Discrete and Computational Geometry, Japanese Conference, JCDCG 2004, Tokyo, Japan, October 8-11, 2004, Revised Selected Papers. Lecture Notes in Computer Science 3742, Springer 2005, ISBN 3-540-30467-3 [contents]
• 2004
• 
  Bernardo M. Ábrego, Esther M. Arkin, Silvia Fernández-Merchant, Ferran Hurtado, Mikio Kano, Joseph S. B. Mitchell, Jorge Urrutia:
  Matching Points with Circles and Squares. JCDCG 2004: 1-15
• 
  Marc Benkert, Alexander Wolff, Florian Widmann:
  The Minimum Manhattan Network Problem: A Fast Factor-3 Approximation. JCDCG 2004: 16-28
• 
  Sergey Bereg:
  Algorithms for the d-Dimensional Rigidity Matroid of Sparse Graphs. JCDCG 2004: 29-36
• 
  Sergey Bereg, Adrian Dumitrescu, János Pach:
  Sliding Disks in the Plane. JCDCG 2004: 37-47
• 
  Prosenjit Bose, Stefan Langerman:
  Weighted Ham-Sandwich Cuts. JCDCG 2004: 48-53
• 
  Hervé Brönnimann:
  Towards Faster Linear-Sized Nets for Axis-Aligned Boxes in the Plane. JCDCG 2004: 54-61
• 
  Ovidiu Daescu, Ningfang Mi, Chan-Su Shin, Alexander Wolff:
  Farthest-Point Queries with Geometric and Combinatorial Constraints. JCDCG 2004: 62-75
• 
  Erik D. Demaine, John Iacono, Stefan Langerman:
  Grid Vertex-Unfolding Orthostacks. JCDCG 2004: 76-82
• 
  Magdalene Grantson, Christos Levcopoulos:
  A Fixed Parameter Algorithm for the Minimum Number Convex Partition Problem. JCDCG 2004: 83-94
• 
  Magdalene Grantson, Christos Levcopoulos:
  Tight Time Bounds for the Minimum Local Convex Partition Problem. JCDCG 2004: 95-105
• 
  Joachim Gudmundsson, Jan Vahrenhold:
  I/O-Efficiently Pruning Dense Spanners. JCDCG 2004: 106-116
• 
  Kiyoshi Hosono, Masatsugu Urabe:
  On the Minimum Size of a Point Set Containing Two Non-intersecting Empty Convex Polygons. JCDCG 2004: 117-122
• 
  Hiro Ito:
  Three Equivalent Partial Orders on Graphs with Real Edge-Weights Drawn on a Convex Polygon. JCDCG 2004: 123-130
• 
  Jonathan Lenchner:
  Wedges in Euclidean Arrangements. JCDCG 2004: 131-142
• 
  Yoichi Maeda:
  Visual Pascal Configuration and Quartic Surface. JCDCG 2004: 143-150
• 
  Jirí Matousek:
  Nonexistence of 2-Reptile Simplices. JCDCG 2004: 151-160
• 
  Ileana Streinu, Walter Whiteley:
  Single-Vertex Origami and Spherical Expansive Motions. JCDCG 2004: 161-173
• 
  Xuehou Tan:
  An Optimal Algorithm for the 1-Searchability of Polygonal Rooms. JCDCG 2004: 174-183
• 
  Gábor Tardos, Géza Tóth:
  Crossing Stars in Topological Graphs. JCDCG 2004: 184-197
• 
  Godfried T. Toussaint:
  The Geometry of Musical Rhythm. JCDCG 2004: 198-212