• 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

• 2014
• 
  Eric Angel, Evripidis Bampis, Gerasimos G. Pollatos, Vassilis Zissimopoulos:
  Optimal data placement on networks with a constant number of clients. Theor. Comput. Sci. 540: 82-88 (2014)
• 
  Spyros Angelopoulos, Alejandro López-Ortiz, Konstantinos Panagiotou:
  Multi-target ray searching problems. Theor. Comput. Sci. 540: 2-12 (2014)
• 
  Péter Biró, Matthijs Bomhoff, Petr A. Golovach, Walter Kern, Daniël Paulusma:
  Solutions for the stable roommates problem with payments. Theor. Comput. Sci. 540: 53-61 (2014)
• 
  Nicolas Boria, Federico Della Croce:
  Reoptimization in machine scheduling. Theor. Comput. Sci. 540: 13-26 (2014)
• 
  Zhigang Cao, Xiaoguang Yang:
  The fashion game: Network extension of Matching Pennies. Theor. Comput. Sci. 540: 169-181 (2014)
• 
  Marc Demange, Jérôme Monnot, Petrica C. Pop, Bernard Ries:
  On the complexity of the selective graph coloring problem in some special classes of graphs. Theor. Comput. Sci. 540: 89-102 (2014)
• 
  Cristina G. Fernandes, Rafael Crivellari Saliba Schouery:
  Second-Price Ad Auctions with Binary Bids and markets with good competition. Theor. Comput. Sci. 540: 103-114 (2014)
• 
  Guilherme Dias da Fonseca, Celina M. H. de Figueiredo, Vinícius Gusmão Pereira de Sá, Raphael C. S. Machado:
  Efficient sub-5 approximations for minimum dominating sets in unit disk graphs. Theor. Comput. Sci. 540: 70-81 (2014)
• 
  Dimitris Fotakis, Paraschos Koutris:
  Online Sum-Radii Clustering. Theor. Comput. Sci. 540: 27-39 (2014)
• 
  Didem Gözüpek, Mordechai Shalom, Ariella Voloshin, Shmuel Zaks:
  On the complexity of constructing minimum changeover cost arborescences. Theor. Comput. Sci. 540: 40-52 (2014)
• 
  Xin Han, Yasushi Kawase, Kazuhisa Makino, He Guo:
  Online removable knapsack problem under convex function. Theor. Comput. Sci. 540: 62-69 (2014)
• 
  Vangelis Markakis, Ioannis Milis, Vangelis Th. Paschos:
  Special Issue: "Combinatorial Optimization: Theory of Algorithms and Complexity". Theor. Comput. Sci. 540: 1 (2014)
• 
  Monaldo Mastrolilli, Georgios Stamoulis:
  Bi-criteria and approximation algorithms for restricted matchings. Theor. Comput. Sci. 540: 115-132 (2014)
• 
  T. Van Du Tran, Philippe Chassignet, Jean-Marc Steyaert:
  On permuted super-secondary structures of transmembrane β-barrel proteins. Theor. Comput. Sci. 540: 133-142 (2014)
• 
  Rémi Watrigant, Marin Bougeret, Rodolphe Giroudeau, Jean-Claude König:
  On the sum-max graph partitioning problem. Theor. Comput. Sci. 540: 143-155 (2014)
• 
  Dennis Weyland:
  On the computational complexity of the Probabilistic Traveling Salesman Problem with Deadlines. Theor. Comput. Sci. 540: 156-168 (2014)