• 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
• 
  Kouji Arata, Satoru Iwata, Kazuhisa Makino, Satoru Fujishige:
  Locating Sources to Meet Flow Demands in Undirected Networks. J. Algorithms 42(1): 54-68 (2002)
• 
  Takao Asano, David P. Williamson:
  Improved Approximation Algorithms for MAX SAT. J. Algorithms 42(1): 173-202 (2002)
• 
  Hatem M. Bahig, Ken Nakamula:
  Some Properties of Nonstar Steps in Addition Chains and New Cases Where the Scholz Conjecture Is True. J. Algorithms 42(2): 304-316 (2002)
• 
  Brenda S. Baker, Raffaele Giancarlo:
  Sparse Dynamic Programming for Longest Common Subsequence from Fragments. J. Algorithms 42(2): 231-254 (2002)
• 
  Reuven Bar-Yehuda, Dror Rawitz:
  Approximating Element-Weighted Vertex Deletion Problems for the Complete k-Partite Property. J. Algorithms 42(1): 20-40 (2002)
• 
  Phillip G. Bradford, Mordecai J. Golin, Lawrence L. Larmore, Wojciech Rytter:
  Optimal Prefix-Free Codes for Unequal Letter Costs: Dynamic Programming with the Monge Property. J. Algorithms 42(2): 277-303 (2002)
• 
  Mirela Damian-Iordache, Sriram V. Pemmaraju:
  A (2+epsilon)-Approximation Scheme for Minimum Domination on Circle Graphs. J. Algorithms 42(2): 255-276 (2002)
• 
  Magnús M. Halldórsson, Guy Kortsarz:
  Tools for Multicoloring with Applications to Planar Graphs and Partial k-Trees. J. Algorithms 42(2): 334-366 (2002)
• 
  Dan Halperin, Micha Sharir, Kenneth Y. Goldberg:
  The 2-Center Problem with Obstacles. J. Algorithms 42(1): 109-134 (2002)
• 
  Pangfeng Liu:
  Broadcast Scheduling Optimization for Heterogeneous Cluster Systems. J. Algorithms 42(1): 135-152 (2002)
• 
  Ulrich Meyer, Jop F. Sibeyn:
  Oblivious Gossiping on Tori. J. Algorithms 42(1): 1-19 (2002)
• 
  Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos:
  On Graph Powers for Leaf-Labeled Trees. J. Algorithms 42(1): 69-108 (2002)
• 
  Matti Nykänen, Esko Ukkonen:
  The Exact Path Length Problem. J. Algorithms 42(1): 41-53 (2002)
• 
  Nicholas Pippenger:
  Analysis of Carry Propagation in Addition: An Elementary Approach. J. Algorithms 42(2): 317-333 (2002)
• 
  C. R. Subramanian, C. E. Veni Madhavan:
  General Partitioning on Random Graphs. J. Algorithms 42(1): 153-172 (2002)
• 
  Mikkel Thorup:
  Randomized Sorting in O(n log log n) Time and Linear Space Using Addition, Shift, and Bit-wise Boolean Operations. J. Algorithms 42(2): 205-230 (2002)