• 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

• 2012
• 
  Mohammad Ali Abam, Sariel Har-Peled:
  New constructions of SSPDs and their applications. Comput. Geom. 45(5-6): 200-214 (2012)
• 
  A. Karim Abu-Affash, Rom Aschner, Paz Carmi, Matthew J. Katz:
  The MST of symmetric disk graphs is light. Comput. Geom. 45(1-2): 54-61 (2012)
• 
  Hee-Kap Ahn, Otfried Cheong, Jirí Matousek, Antoine Vigneron:
  Reachability by paths of bounded curvature in a convex polygon. Comput. Geom. 45(1-2): 21-32 (2012)
• 
  Oswin Aichholzer, Franz Aurenhammer, Erik D. Demaine, Ferran Hurtado, Pedro Ramos, Jorge Urrutia:
  On k-convex polygons. Comput. Geom. 45(3): 73-87 (2012)
• 
  Oswin Aichholzer, Günter Rote, André Schulz, Birgit Vogtenhuber:
  Pointed drawings of planar graphs. Comput. Geom. 45(9): 482-494 (2012)
• 
  Javier Alonso, Horst Martini, Margarita Spirova:
  Minimal enclosing discs, circumcircles, and circumcenters in normed planes (Part I). Comput. Geom. 45(5-6): 258-274 (2012)
• 
  Javier Alonso, Horst Martini, Margarita Spirova:
  Minimal enclosing discs, circumcircles, and circumcenters in normed planes (Part II). Comput. Geom. 45(7): 350-369 (2012)
• 
  Karin Arikushi, Radoslav Fulek, Balázs Keszegh, Filip Moric, Csaba D. Tóth:
  Graphs that admit right angle crossing drawings. Comput. Geom. 45(4): 169-177 (2012)
• 
  Sang Won Bae, Yoshio Okamoto:
  Querying two boundary points for shortest paths in a polygonal domain. Comput. Geom. 45(7): 284-293 (2012)
• 
  Imre Bárány, Hiroshi Maehara, Norihide Tokushige:
  Tetrahedra passing through a triangular hole, and tetrahedra fixed by a planar frame. Comput. Geom. 45(1-2): 14-20 (2012)
• 
  Benoit Beckers, Pierre Beckers:
  A general rule for disk and hemisphere partition into equal-area cells. Comput. Geom. 45(7): 275-283 (2012)
• 
  Sergey Bereg, Sergio Cabello, José Miguel Díaz-Báñez, Pablo Pérez-Lantero, Carlos Seara, Inmaculada Ventura:
  The class cover problem with boxes. Comput. Geom. 45(7): 294-304 (2012)
• 
  Mark de Berg, Dirk H. P. Gerrits:
  Approximation algorithms for free-label maximization. Comput. Geom. 45(4): 153-168 (2012)
• 
  Steven Bitner, Ovidiu Daescu:
  Minimum-sum dipolar spanning tree in R³. Comput. Geom. 45(9): 476-481 (2012)
• 
  Prosenjit Bose, Paz Carmi:
  Editorial. Comput. Geom. 45(9): 475 (2012)
• 
  Karl Bringmann:
  An improved algorithm for Kleeʼs measure problem on fat boxes. Comput. Geom. 45(5-6): 225-233 (2012)
• 
  Christophe Brun, Jean-François Dufourd, Nicolas Magaud:
  Designing and proving correct a convex hull algorithm with hypermaps in Coq. Comput. Geom. 45(8): 436-457 (2012)
• 
  Sergio Cabello, Éric Colin de Verdière, Francis Lazarus:
  Algorithms for the edge-width of an embedded graph. Comput. Geom. 45(5-6): 215-224 (2012)
• 
  Frédéric Cazals, David Cohen-Steiner:
  Reconstructing 3D compact sets. Comput. Geom. 45(1-2): 1-13 (2012)
• 
  Dan Chen, Luc Devroye, Vida Dujmovic, Pat Morin:
  Memoryless routing in convex subdivisions: Random walks are optimal. Comput. Geom. 45(4): 178-185 (2012)
• 
  Wei-Mei Chen, Hsien-Kuei Hwang, Tsung-Hsi Tsai:
  Maxima-finding algorithms for multidimensional samples: A two-phase approach. Comput. Geom. 45(1-2): 33-53 (2012)
• 
  Danny Z. Chen, Haitao Wang:
  An improved algorithm for reconstructing a simple polygon from its visibility angles. Comput. Geom. 45(5-6): 254-257 (2012)
• 
  Ching-Shoei Chiang, Christoph M. Hoffmann, Paul Rosen:
  A generalized Malfatti problem. Comput. Geom. 45(8): 425-435 (2012)
• 
  Ernest Davis:
  Preserving geometric properties in reconstructing regions from internal and nearby points. Comput. Geom. 45(5-6): 234-253 (2012)
• 
  José H. Dulá, Francisco J. López:
  Competing output-sensitive frame algorithms. Comput. Geom. 45(4): 186-197 (2012)
• 
  Adrian Dumitrescu:
  Going around in circles. Comput. Geom. 45(7): 370-381 (2012)
• 
  Adrian Dumitrescu, Csaba D. Tóth:
  Watchman tours for polygons with holes. Comput. Geom. 45(7): 326-333 (2012)
• 
  Fabrizio Frati:
  Straight-line drawings of outerplanar graphs in O(dn log n) area. Comput. Geom. 45(9): 524-533 (2012)
• 
  Anka Gajentaan, Mark H. Overmars:
  On a class of O(n²) problems in computational geometry. Comput. Geom. 45(4): 140-152 (2012)
• 
  Xiao-Shan Gao, Robert Joan-Arinyo, Dominique Michelucci:
  Special issue on geometric constraints and reasoning. Comput. Geom. 45(8): 383-384 (2012)

skipping 16 more matches