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

• 2009
• 
  Gernot Veit Batz, Daniel Delling, Peter Sanders, Christian Vetter:
  Time-Dependent Contraction Hierarchies. ALENEX 2009: 97-105
• 
  Djamal Belazzougui, Paolo Boldi, Rasmus Pagh, Sebastiano Vigna:
  Theory and Practise of Monotone Minimal Perfect Hashing. ALENEX 2009: 132-144
• 
  Benjamin Doerr, Tobias Friedrich, Marvin Künnemann, Thomas Sauerwald:
  Quasirandom Rumor Spreading: An Experimental Analysis. ALENEX 2009: 145-153
• 
  Benjamin Doerr, Magnus Wahlström:
  Randomized Rounding in the Presence of a Cardinality Constraint. ALENEX 2009: 162-174
• 
  Branislav Durian, Jan Holub, Hannu Peltola, Jorma Tarhio:
  Tuning BNDM with q-Grams. ALENEX 2009: 29-37
• 
  Taras Galkovsky, Bernd Gärtner, Bogdan Rublev:
  The Domination Heuristic for LP-type Problems. ALENEX 2009: 74-84
• 
  Loukas Georgiadis, Andrew V. Goldberg, Robert Endre Tarjan, Renato Fonseca F. Werneck:
  An Experimental Study of Minimum Mean Cycle Algorithms. ALENEX 2009: 1-13
• 
  Matthias Hagen, Peter Horatschek, Martin Mundhenk:
  Experimental comparison of the two Fredman-Khachiyan-algorithms. ALENEX 2009: 154-161
• 
  Herman J. Haverkort, Freek van Walderveen:
  Four-Dimensional Hilbert Curves for R-Trees. ALENEX 2009: 63-73
• 
  Ulrich Meyer, Vitaly Osipov:
  Design and Implementation of a Practical I/O-efficient Shortest Paths Algorithm. ALENEX 2009: 85-96
• 
  Joseph S. B. Mitchell:
  Algorithmic Problems in Air Traffic Management. ALENEX 2009: 62
• 
  Cosmin Silvestru Negruseri, Mircea Bogdan Pasoi, Barbara Stanley, Clifford Stein, Cristian George Strat:
  Solving Maximum Flow Problems on Real World Bipartite Graphs. ALENEX 2009: 14-28
• 
  Martin Nöllenburg, Markus Völker, Alexander Wolff, Danny Holten:
  Drawing Binary Tanglegrams: An Experimental Evaluation. ALENEX 2009: 106-119
• 
  Vitaly Osipov, Peter Sanders, Johannes Singler:
  The Filter-Kruskal Minimum Spanning Tree Algorithm. ALENEX 2009: 52-61
• 
  Frans Schalekamp, Anke van Zuylen:
  Rank Aggregation: Together We're Strong. ALENEX 2009: 38-51
• 
  Siamak Tazari, Matthias Müller-Hannemann:
  Dealing with Large Hidden Constants: Engineering a Planar Steiner Tree PTAS. ALENEX 2009: 120-131
• 
  Irene Finocchi, John Hershberger:
  Proceedings of the Eleventh Workshop on Algorithm Engineering and Experiments, ALENEX 2009, New York, New York, USA, January 3, 2009. SIAM 2009, ISBN 978-0-898719-30-7 [contents]