• 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

• 2012
• 
  Amihood Amir, Haim Parienty:
  Towards a theory of patches. J. Discrete Algorithms 12: 61-73 (2012)
• 
  Paul S. Bonsma:
  Max-leaves spanning tree is APX-hard for cubic graphs. J. Discrete Algorithms 12: 14-23 (2012)
• 
  David Gamarnik, Dmitriy Katz:
  Correlation decay and deterministic FPTAS for counting colorings of a graph. J. Discrete Algorithms 12: 29-47 (2012)
• 
  Paul S. Haynes, Lyuba Alboul, Jacques Penders:
  Dynamic graph-based search in unknown environments. J. Discrete Algorithms 12: 2-13 (2012)
• 
  Martin Senft, Tomás Dvorák:
  On-line suffix tree construction with reduced branching. J. Discrete Algorithms 12: 48-60 (2012)
• 
  Iain A. Stewart, Daniël Paulusma, Matthew Johnson:
  Editorial. J. Discrete Algorithms 12: 1 (2012)
• 
  Alexei Vernitski, Artem V. Pyatkin:
  Astral graphs (threshold graphs), scale-free graphs and related algorithmic questions. J. Discrete Algorithms 12: 24-28 (2012)