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

• 2021
• 
  Elena Barcucci, Antonio Bernini, Renzo Pinzani:
  Exhaustive generation of some lattice paths and their prefixes. Theor. Comput. Sci. 878-879: 47-52 (2021)
• 
  Huimin Bi, Xin Zhang:
  Incidence coloring of Mycielskians with fast algorithm. Theor. Comput. Sci. 878-879: 1-10 (2021)
• 
  Andreas Brandstädt, Raffaele Mosca:
  Maximum weight independent sets for (S_{1, 2, 4}, triangle)-free graphs in polynomial time. Theor. Comput. Sci. 878-879: 11-25 (2021)
• 
  Yu-Han Chen, Shyue-Ming Tang, Kung-Jui Pai, Jou-Ming Chang:
  Constructing dual-CISTs with short diameters using a generic adjustment scheme on bicubes. Theor. Comput. Sci. 878-879: 102-112 (2021)
• 
  Éric Duchêne, Stéphane Gonzalez, Aline Parreau, Eric Rémila, Philippe Solal:
  influence: A partizan scoring game on graphs. Theor. Comput. Sci. 878-879: 26-46 (2021)
• 
  Oded Goldreich, Tom Gur:
  Universal locally verifiable codes and 3-round interactive proofs of proximity for CSP. Theor. Comput. Sci. 878-879: 83-101 (2021)
• 
  Erez Kantor, Zvi Lotker, Merav Parter, David Peleg:
  Nonuniform SINR+Voronoi diagrams are effectively uniform. Theor. Comput. Sci. 878-879: 53-66 (2021)
• 
  Zhen Zhang, Yutian Guo, Junyu Huang, Jianxin Wang, Feng Shi:
  Improved approximation for prize-collecting red-blue median. Theor. Comput. Sci. 878-879: 67-82 (2021)