• 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

• 2020
• 
  Ankush Acharyya, Minati De, Subhas C. Nandy, Bodhayan Roy:
  Range assignment of base-stations maximizing coverage area without interference. Theor. Comput. Sci. 804: 81-97 (2020)
• 
  Bijo S. Anand, S. V. Ullas Chandran, Manoj Changat, Mitre Costa Dourado, Ferdoos Hossein Nezhad, Prasanth G. Narasimha-Shenoi:
  On the Carathéodory and exchange numbers of geodetic convexity in graphs. Theor. Comput. Sci. 804: 46-57 (2020)
• 
  Mélodie Andrieu, Anna E. Frid:
  Morphic words and equidistributed sequences. Theor. Comput. Sci. 804: 171-185 (2020)
• 
  Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Ignaz Rutter:
  Beyond level planarity: Cyclic, torus, and simultaneous level planarity. Theor. Comput. Sci. 804: 161-170 (2020)
• 
  Paul C. Bell, Daniel Reidenbach, Jeffrey O. Shallit:
  Unique decipherability in formal languages. Theor. Comput. Sci. 804: 149-160 (2020)
• 
  Maximilian Fürst, Dieter Rautenbach:
  On the equality of the induced matching number and the uniquely restricted matching number for subcubic graphs. Theor. Comput. Sci. 804: 126-138 (2020)
• 
  Marc Goerigk, Adam Kasperski, Pawel Zielinski:
  Two-stage combinatorial optimization problems under risk. Theor. Comput. Sci. 804: 29-45 (2020)
• 
  Michael A. Henning, Dinabandhu Pradhan:
  Algorithmic aspects of upper paired-domination in graphs. Theor. Comput. Sci. 804: 98-114 (2020)
• 
  Meng Ji, Xueliang Li, Xiaoyu Zhu:
  (Strong) conflict-free connectivity: Algorithm and complexity. Theor. Comput. Sci. 804: 72-80 (2020)
• 
  Minh Ha Le, Vinh Duc Tran, Van Anh Trinh, Viet Cuong Trinh:
  Compacting ciphertext in multi-channel broadcast encryption and attribute-based encryption. Theor. Comput. Sci. 804: 219-235 (2020)
• 
  Zhicong Lin:
  Patterns of relation triples in inversion and ascent sequences. Theor. Comput. Sci. 804: 115-125 (2020)
• 
  Mohsen Alambardar Meybodi, Fedor V. Fomin, Amer E. Mouawad, Fahad Panolan:
  On the parameterized complexity of [1, j]-domination problems. Theor. Comput. Sci. 804: 207-218 (2020)
• 
  Marina Moscarini:
  Computing a metric basis of a 2-connected bipartite distance-hereditary graph. Theor. Comput. Sci. 804: 186-206 (2020)
• 
  Marco Aurelio Stefanes, Diego P. Rubert, José Soares:
  Scalable parallel algorithms for maximum matching and Hamiltonian circuit in convex bipartite graphs. Theor. Comput. Sci. 804: 58-71 (2020)
• 
  Zhao Wang, Yaping Mao, Sun-Yuan Hsieh, Jichang Wu:
  On the g-good-neighbor connectivity of graphs. Theor. Comput. Sci. 804: 139-148 (2020)
• 
  Yanwei Zhou, Bo Yang, Tao Wang, Yi Mu:
  Novel updatable identity-based hash proof system and its applications. Theor. Comput. Sci. 804: 1-28 (2020)