• 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

• 2022
• 
  Aditya Acharya, David M. Mount:
  Optimally Tracking Labels on an Evolving Tree. CCCG 2022: 1-8
• 
  Elena Arseneva, Erik D. Demaine, Tonan Kamata, Ryuhei Uehara:
  Discretization to Prove the Nonexistence of "Small" Common Unfoldings Between Polyhedra. CCCG 2022: 9-23
• 
  Gill Barequet, Shion Fukuzawa, Michael T. Goodrich, David M. Mount, Martha C. Osegueda, Evrim Ozel:
  Optimally Confining Lattice Polymers. CCCG 2022: 24-15
• 
  Robert D. Barish, Tetsuo Shibuya:
  Diamonds are Forever in the Blockchain: Geometric Polyhedral Point-Set Pattern Matching. CCCG 2022: 16-31
• 
  Aya Bernstine, Yehonatan Mizrahi:
  Efficiently Enumerating Scaled Copies of Point Set Patterns. CCCG 2022: 32-39
• 
  Binay Bhattacharya, Tsunehiko Kameda, Amirhossein Mozafari:
  A Sub-quadratic Time Algorithm for the Proximity Connected k-center Problem on Paths via Modular Arithmetic. CCCG 2022: 40-47
• 
  Therese Biedl:
  Drawing complete outer-1-planar graphs in linear area. CCCG 2022: 48-54
• 
  Ahmad Biniaz, Prosenjit Bose, Patrick Devaney:
  A 13/9-approximation of the average-2π/3-MST. CCCG 2022: 55-59
• 
  Prosenjit Bose, Guillermo Esteban, Anil Maheshwari:
  Weighted shortest path in equilateral triangular meshes. CCCG 2022: 60-67
• 
  Oliver A. Chubet:
  Maximum Subbarcode Matching and Subbarcode Distance. CCCG 2022: 68-74
• 
  Jaehoon Chung, Sang Won Bae, Chan-Su Shin, Sang Duk Yoon, Hee-Kap Ahn:
  Approximating Convex Polygons by Histogons. CCCG 2022: 75-82
• 
  Ovidiu Daescu, Ka Yaw Teo:
  Fast Deterministic Approximation of Medoid in R^d. CCCG 2022: 83-90
• 
  Ovidiu Daescu, Ka Yaw Teo:
  The Median Line Segment Problem: Computational Complexity and Constrained Variants. CCCG 2022: 91-97
• 
  Erik D. Demaine, Hiro Ito, Jayson Lynch, Ryuhei Uehara:
  Computational Complexity of Flattening Fixed-Angle Orthogonal Chains. CCCG 2022: 98-104
• 
  Loïc Dubois:
  A bound for Delaunay flip algorithms on flat tori (Best Student Paper Award). CCCG 2022: 105-112
• 
  Stephane Durocher, Alexandre Leblanc, Sachini Rajapakse:
  Computing Batched Depth Queries and the Depth of a Set of Points. CCCG 2022: 113-120
• 
  Stephane Durocher, Spencer Szabados:
  Curve Stabbing Depth: Data Depth for Plane Curves. CCCG 2022: 121-128
• 
  David Eppstein:
  Reflections in an Octagonal Mirror Maze. CCCG 2022: 129-134
• 
  David Eppstein:
  Locked and Unlocked Smooth Embeddings of Surfaces. CCCG 2022: 135-142
• 
  David Eppstein:
  Orthogonal Dissection into Few Rectangles. CCCG 2022: 143-150
• 
  Mohammad Javad Eslamibidgoli, Hamid Zarrabi-Zadeh:
  Minimum Enclosing Spherical/Cylindrical Shells in High-Dimensional Streams. CCCG 2022: 151-155
• 
  James Freitag, Neshat Mohammadi, Aditya Potukuchi, Lev Reyzin:
  On the Geometry of Stable Steiner Tree Instances. CCCG 2022: 156-161
• 
  Dániel Garamvölgyi, Tibor Jordán:
  Globally linked pairs in braced maximal outerplanar graphs. CCCG 2022: 162-168
• 
  Kirby Gordon, Jacob Lezberg, Aaron Williams:
  Unstacking Slabs Safely in Megalit is NP-Hard. CCCG 2022: 169-176
• 
  Junnosuke Hoshido, Tonan Kamata, Tsutomu Ansai, Ryuhei Uehara:
  Computational Complexity of One-Dimensional Origami and Its Application to Digital Signature. CCCG 2022: 177-183
• 
  Attila Jung:
  Quantitative Helly-type Hypergraph Chains. CCCG 2022: 184-188
• 
  Shahin Kamali, Pooya Nikbakht:
  Online Square Packing with Rotation. CCCG 2022: 189-197
• 
  Shahin Kamali, Pooya Nikbakht, Arezoo Sajadpour:
  A Randomized Algorithm for Non-crossing Matching of Online Points. CCCG 2022: 198-204
• 
  J. Mark Keil, Debajyoti Mondal, Ehsan Moradi:
  Burning Number for the Points in the Plane. CCCG 2022: 205-211
• 
  Hwi Kim, Jaegun Lee, Hee-Kap Ahn:
  Uniformly Monotone Partitioning of Polygons Revisited. CCCG 2022: 212-218

skipping 16 more matches