• 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

• 2009
• 
  Laurent Alonso, Edward M. Reingold:
  Average-case analysis of some plurality algorithms. ACM Trans. Algorithms 5(2): 17:1-17:36 (2009)
• 
  Matthew Andrews:
  Instability of FIFO in the permanent sessions model at arbitrarily small network loads. ACM Trans. Algorithms 5(3): 33:1-33:29 (2009)
• 
  Amotz Bar-Noy, Sudipto Guha, Yoav Katz, Joseph Naor, Baruch Schieber, Hadas Shachnai:
  Throughput maximization of real-time scheduling with batching. ACM Trans. Algorithms 5(2): 18:1-18:17 (2009)
• 
  Daniel Berend, Vladimir Braverman:
  A linear algorithm for computing convex hulls for random lines. ACM Trans. Algorithms 5(4): 42:1-42:21 (2009)
• 
  Vincent Berry, Christophe Paul, Sylvain Guillemot, François Nicolas:
  Linear time 3-approximation for the MAST problem. ACM Trans. Algorithms 5(2): 23:1-23:18 (2009)
• 
  Glencora Borradaile, Philip N. Klein, Claire Mathieu:
  An O(n log n) approximation scheme for Steiner tree in planar graphs. ACM Trans. Algorithms 5(3): 31:1-31:31 (2009)
• 
  Robert D. Carr, Goran Konjevod, Greg Little, Venkatesh Natarajan, Ojas Parekh:
  Compacting cuts: A new linear formulation for minimum cut. ACM Trans. Algorithms 5(3): 27:1-27:16 (2009)
• 
  Moses Charikar, Konstantin Makarychev, Yury Makarychev:
  Near-optimal algorithms for maximum constraint satisfaction problems. ACM Trans. Algorithms 5(3): 32:1-32:14 (2009)
• 
  Ke Chen, Haim Kaplan, Micha Sharir:
  Online conflict-free coloring for halfplanes, congruent disks, and axis-parallel rectangles. ACM Trans. Algorithms 5(2): 16:1-16:24 (2009)
• 
  Anne Condon, Amol Deshpande, Lisa Hellerstein, Ning Wu:
  Algorithms for distributional and adversarial pipelined filter ordering problems. ACM Trans. Algorithms 5(2): 24:1-24:34 (2009)
• 
  Erik D. Demaine, Mohammad Taghi Hajiaghayi, Hamid Mahini, Amin S. Sayedi-Roshkhar, Shayan Oveis Gharan, Morteza Zadimoghaddam:
  Minimizing movement. ACM Trans. Algorithms 5(3): 30:1-30:30 (2009)
• 
  David Eppstein:
  Testing bipartiteness of geometric intersection graphs. ACM Trans. Algorithms 5(2): 15:1-15:35 (2009)
• 
  David Eppstein:
  Squarepants in a tree: Sum of subtree clustering and hyperbolic pants decomposition. ACM Trans. Algorithms 5(3): 29:1-29:24 (2009)
• 
  David Eppstein:
  All maximal independent sets and dynamic dominance for sparse graphs. ACM Trans. Algorithms 5(4): 38:1-38:14 (2009)
• 
  Guy Even, Jon Feldman, Guy Kortsarz, Zeev Nutov:
  A 1.8 approximation algorithm for augmenting edge-connectivity of a graph from 1 to 2. ACM Trans. Algorithms 5(2): 21:1-21:17 (2009)
• 
  Martin Farach-Colton, Rohan J. Fernandes, Miguel A. Mosteiro:
  Bootstrapping a hop-optimal network in the weak sensor model. ACM Trans. Algorithms 5(4): 37:1-37:30 (2009)
• 
  David Fernández-Baca, Balaji Venkatachalam:
  Parametric analysis for ungapped Markov models of evolution. ACM Trans. Algorithms 5(4): 44:1-44:20 (2009)
• 
  Harold N. Gabow:
  Foreword to special issue on SODA 2007. ACM Trans. Algorithms 5(3): 25:1 (2009)
• 
  Yoav Giyora, Haim Kaplan:
  Optimal dynamic vertical ray shooting in rectilinear planar subdivisions. ACM Trans. Algorithms 5(3): 28:1-28:51 (2009)
• 
  Leana Golubchik, Sanjeev Khanna, Samir Khuller, Ramakrishna Thurimella, An Zhu:
  Approximation algorithms for data placement on parallel disks. ACM Trans. Algorithms 5(4): 34:1-34:26 (2009)
• 
  Sudipto Guha, Andrew McGregor, Suresh Venkatasubramanian:
  Sublinear estimation of entropy and information distances. ACM Trans. Algorithms 5(4): 35:1-35:16 (2009)
• 
  Hiro Ito, Kazuo Iwama:
  Enumeration of isolated cliques and pseudo-cliques. ACM Trans. Algorithms 5(4): 40:1-40:21 (2009)
• 
  Ming-Yang Kao, Manan Sanghi, Robert T. Schweller:
  Randomized fast design of short DNA words. ACM Trans. Algorithms 5(4): 43:1-43:24 (2009)
• 
  George Karakostas:
  A better approximation ratio for the vertex cover problem. ACM Trans. Algorithms 5(4): 41:1-41:8 (2009)
• 
  Asaf Levin:
  A generalized minimum cost k-clustering. ACM Trans. Algorithms 5(4): 36:1-36:10 (2009)
• 
  Guojun Li, Xiaotie Deng, Ying Xu:
  A polynomial-time approximation scheme for embedding hypergraph in a cycle. ACM Trans. Algorithms 5(2): 20:1-20:12 (2009)
• 
  Sharon Marko, Dana Ron:
  Approximating the distance to properties in bounded-degree and general sparse graphs. ACM Trans. Algorithms 5(2): 22:1-22:28 (2009)
• 
  Phong Q. Nguyen, Damien Stehlé:
  Low-dimensional lattice basis reduction revisited. ACM Trans. Algorithms 5(4): 46:1-46:48 (2009)
• 
  Yuval Rabani, Gabriel Scalosub:
  Bicriteria approximation tradeoff for the node-cost budget problem. ACM Trans. Algorithms 5(2): 19:1-19:14 (2009)
• 
  Bruce A. Reed, David R. Wood:
  A linear-time algorithm to find a separator in a graph excluding a minor. ACM Trans. Algorithms 5(4): 39:1-39:16 (2009)