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

• 2014
• 
  F. Abbes, M. Hbaib, M. Merkhi:
  β-expansion and transcendence in F_q((x^-1)). Theor. Comput. Sci. 516: 71-77 (2014)
• 
  Gianlorenzo D'Angelo, Mattia D'Emidio, Daniele Frigioni:
  A loop-free shortest-path routing algorithm for dynamic networks. Theor. Comput. Sci. 516: 1-19 (2014)
• 
  Alberto Dennunzio, Enrico Formenti, Michael Weiss:
  Multidimensional cellular automata: closing property, quasi-expansivity, and (un)decidability issues. Theor. Comput. Sci. 516: 40-59 (2014)
• 
  Éric Duchêne, Gabriel Renault:
  Vertex Nim played on graphs. Theor. Comput. Sci. 516: 20-27 (2014)
• 
  Dyi-Rong Duh, Tzu-Lung Chen, Yue-Li Wang:
  (n-3)-edge-fault-tolerant weak-pancyclicity of (n, k)-star graphs. Theor. Comput. Sci. 516: 28-39 (2014)
• 
  Mikael Gast, Mathias Hauptmann:
  Approximability of the vertex cover problem in power-law graphs. Theor. Comput. Sci. 516: 60-70 (2014)
• 
  T. Karthick:
  On atomic structure of P₅-free subclasses and Maximum Weight Independent Set problem. Theor. Comput. Sci. 516: 78-85 (2014)
• 
  Lukasz Kowalik, Marcin Mucha:
  A 9k kernel for nonseparating independent set in planar graphs. Theor. Comput. Sci. 516: 86-95 (2014)
• 
  Asaf Levin, Aleksander Vainer:
  Adaptivity in the stochastic blackjack knapsack problem. Theor. Comput. Sci. 516: 121-126 (2014)
• 
  Frédéric Maffray:
  Fast recognition of doubled graphs. Theor. Comput. Sci. 516: 96-100 (2014)
• 
  Alexander Meduna, Petr Zemek:
  One-sided random context grammars with a limited number of right random context rules. Theor. Comput. Sci. 516: 127-132 (2014)
• 
  Wei-Ping Ni, Jian-Liang Wu:
  Edge coloring of planar graphs which any two short cycles are adjacent at most once. Theor. Comput. Sci. 516: 133-138 (2014)
• 
  Alexander Okhotin:
  Parsing by matrix multiplication generalized to Boolean grammars. Theor. Comput. Sci. 516: 101-120 (2014)