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

• 2016
• 
  Johannes Fischer, Daniel Peters:
  GLOUDS: Representing tree-like graphs. J. Discrete Algorithms 36: 39-49 (2016)
• 
  Jérémy Barbay, Ankur Gupta, Srinivasa Rao Satti, Jonathan Sorenson:
  Near-optimal online multiselection in internal and external memory. J. Discrete Algorithms 36: 3-17 (2016)
• 
  Mark de Berg, Ali D. Mehrabi:
  Straight-path queries in trajectory data. J. Discrete Algorithms 36: 27-38 (2016)
• 
  Subhash Bhagat, Sruti Gan Chaudhuri, Krishnendu Mukhopadhyaya:
  Fault-tolerant gathering of asynchronous oblivious mobile robots under one-axis agreement. J. Discrete Algorithms 36: 50-62 (2016)
• 
  Erik D. Demaine, David Eppstein, Adam Hesterberg, Hiro Ito, Anna Lubiw, Ryuhei Uehara, Yushi Uno:
  Folding a paper strip to minimize thickness. J. Discrete Algorithms 36: 18-26 (2016)
• 
  Varunkumar Jayapaul, Seungbum Jo, Rajeev Raman, Venkatesh Raman, Srinivasa Rao Satti:
  Space efficient data structures for nearest larger neighbor. J. Discrete Algorithms 36: 63-75 (2016)
• 
  M. Sohel Rahman, Etsuji Tomita:
  Special issue on WALCOM 2015. J. Discrete Algorithms 36: 1-2 (2016)