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

• 2001
• 
  Gill Barequet, Sariel Har-Peled:
  Efficiently Approximating the Minimum-Volume Bounding Box of a Point Set in Three Dimensions. J. Algorithms 38(1): 91-109 (2001)
• 
  Therese C. Biedl, Prosenjit Bose, Erik D. Demaine, Anna Lubiw:
  Efficient Algorithms for Petersen's Matching Theorem. J. Algorithms 38(1): 110-134 (2001)
• 
  David Bryant, Mike A. Steel:
  Constructing Optimal Trees from Quartets. J. Algorithms 38(1): 237-259 (2001)
• 
  Barun Chandra, Magnús M. Halldórsson:
  Approximation Algorithms for Dispersion Problems. J. Algorithms 38(2): 438-465 (2001)
• 
  Edith Cohen, Uri Zwick:
  All-Pairs Small-Stretch Paths. J. Algorithms 38(2): 335-353 (2001)
• 
  Lenore Cowen:
  Compact Routing with Minimum Stretch. J. Algorithms 38(1): 170-183 (2001)
• 
  Christian A. Duncan, Michael T. Goodrich, Stephen G. Kobourov:
  Balanced Aspect Ratio Trees: Combining the Advantages of k-d Trees and Octrees. J. Algorithms 38(1): 303-333 (2001)
• 
  Henning Fernau, Rolf Niedermeier:
  An Efficient Exact Algorithm for Constraint Bipartite Vertex Cover. J. Algorithms 38(2): 374-410 (2001)
• 
  Andrew V. Goldberg, Kostas Tsioutsiouliklis:
  Cut Tree Algorithms: An Experimental Study. J. Algorithms 38(1): 51-83 (2001)
• 
  Piotr Indyk:
  A Small Approximately Min-Wise Independent Family of Hash Functions. J. Algorithms 38(1): 84-90 (2001)
• 
  Bala Kalyanasundaram, Kirk Pruhs:
  Eliminating Migration in Multi-processor Scheduling. J. Algorithms 38(1): 2-24 (2001)
• 
  Jon M. Kleinberg, Amit Kumar:
  Wavelength Conversion in Optical Networks. J. Algorithms 38(1): 25-50 (2001)
• 
  Madhukar R. Korupolu, C. Greg Plaxton, Rajmohan Rajaraman:
  Placement Algorithms for Hierarchical Cooperative Caching. J. Algorithms 38(1): 260-302 (2001)
• 
  Kazuhisa Makino, Yushi Uno, Toshihide Ibaraki:
  On Minimum Edge Ranking Spanning Trees. J. Algorithms 38(2): 411-437 (2001)
• 
  Bernard M. E. Moret:
  Foreword. J. Algorithms 38(1): 1 (2001)
• 
  Hiroshi Nagamochi, Toru Hasunuma:
  An Efficient NC Algorithm for a Sparse k-Edge-Connectivity Certificate. J. Algorithms 38(2): 354-373 (2001)
• 
  Jeffrey D. Oldham:
  Combinatorial Approximation Algorithms for Generalized Flow Problems. J. Algorithms 38(1): 135-169 (2001)
• 
  Alan Siegel:
  Median Bounds and Their Application. J. Algorithms 38(1): 184-236 (2001)