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

• 2002
• 
  Lyudmil Aleksandrov, Hristo N. Djidjev, Hua Guo, Anil Maheshwari:
  Partitioning Planar Graphs with Costs and Weights. ALENEX 2002: 98-110
• 
  Marcus Poggi de Aragão, Renato Fonseca F. Werneck:
  On the Implementation of MST-Based Heuristics for the Steiner Problem in Graphs. ALENEX 2002: 1-15
• 
  Giuseppe Cattaneo, Pompeo Faruolo, Umberto Ferraro Petrillo, Giuseppe F. Italiano:
  Maintaining Dynamic Minimum Spanning Trees: An Experimental Study. ALENEX 2002: 111-125
• 
  Geeta Chaudhry, Thomas H. Cormen:
  Getting More from Out-of-Core Columnsort. ALENEX 2002: 143-154
• 
  Jingchao Chen:
  An Improvement on Tree Selection Sort. ALENEX 2002: 194-206
• 
  Massimiliano Curcio, Stefano Leonardi, Andrea Vitaletti:
  An Experimental Study of Prefetching and Caching Algorithms for the World Wide Web. ALENEX 2002: 71-85
• 
  Jens Gustedt, Ole A. Mæhle, Jan Arne Telle:
  The Treewidth of Java Programs. ALENEX 2002: 86-97
• 
  DoRon B. Motter, Igor L. Markov:
  A Compressed Breadth-First Search for Satisfiability. ALENEX 2002: 29-42
• 
  Seth Pettie, Vijaya Ramachandran, Srinath Sridhar:
  Experimental Evaluation of a New Shortest Path Algorithm. ALENEX 2002: 126-142
• 
  Vinhthuy T. Phan, Pavel Sumazin, Steven Skiena:
  A Time-Sensitive System for Black-Box Combinatorial Optimization. ALENEX 2002: 16-18
• 
  Steven J. Phillips:
  Acceleration of K-Means and Related Clustering Algorithms. ALENEX 2002: 166-177
• 
  Cecilia Magdalena Procopiuc, Pankaj K. Agarwal, Sariel Har-Peled:
  STAR-Tree: An Efficient Self-Adjusting Index for Moving Objects. ALENEX 2002: 178-193
• 
  Kirk Pruhs, Eric Wiewiora:
  Evaluating the Local Ratio Algorithm for Dynamic Storage Allocation. ALENEX 2002: 60-70
• 
  Eynat Rafalin, Diane L. Souvaine, Ileana Streinu:
  Topological Sweep in Degenerate Cases. ALENEX 2002: 155-165
• 
  Frank Schulz, Dorothea Wagner, Christos D. Zaroliagis:
  Using Multi-level Graphs for Timetable Information in Railway Systems. ALENEX 2002: 43-59
• 
  David M. Mount, Clifford Stein:
  Algorithm Engineering and Experiments, 4th International Workshop, ALENEX 2002, San Francisco, CA, USA, January 4-5, 2002, Revised Papers. Lecture Notes in Computer Science 2409, Springer 2002, ISBN 3-540-43977-3 [contents]