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

• 2019
• 
  S. Banerjee, J. Mark Keil, Dinabandhu Pradhan:
  Perfect Roman domination in graphs. Theor. Comput. Sci. 796: 1-21 (2019)
• 
  Annalisa De Bonis:
  New selectors and locally thin families with applications to multi-access channels supporting simultaneous transmissions. Theor. Comput. Sci. 796: 34-50 (2019)
• 
  Mauro Castelli, Riccardo Dondi, Giancarlo Mauri, Italo Zoppis:
  Comparing incomplete sequences via longest common subsequence. Theor. Comput. Sci. 796: 272-285 (2019)
• 
  Janosch Döcker, Simone Linz, Charles Semple:
  Displaying trees across two phylogenetic networks. Theor. Comput. Sci. 796: 129-146 (2019)
• 
  Yuval Filmus:
  Another look at degree lower bounds for polynomial calculus. Theor. Comput. Sci. 796: 286-293 (2019)
• 
  Tesshu Hanaka, Hans L. Bodlaender, Tom C. van der Zanden, Hirotaka Ono:
  On the maximum weight minimal separator. Theor. Comput. Sci. 796: 294-308 (2019)
• 
  Steve Hanneke, Aryeh Kontorovich:
  Optimality of SVM: Novel proofs and tighter bounds. Theor. Comput. Sci. 796: 99-113 (2019)
• 
  Lars Jaffke, O-joung Kwon, Torstein J. F. Strømme, Jan Arne Telle:
  Mim-width III. Graph powers and generalized distance domination problems. Theor. Comput. Sci. 796: 216-236 (2019)
• 
  Robert Janczewski, Pawel Obszarski, Krzysztof Turowski:
  2-Coloring number revisited. Theor. Comput. Sci. 796: 187-195 (2019)
• 
  Timo Kötzing, Martin S. Krejca:
  First-hitting times under drift. Theor. Comput. Sci. 796: 51-69 (2019)
• 
  Dong Li, Xiaolan Hu, Huiqing Liu:
  Structure connectivity and substructure connectivity of twisted hypercubes. Theor. Comput. Sci. 796: 169-179 (2019)
• 
  Guanqin Lian, Shuming Zhou, Sun-Yuan Hsieh, Jiafei Liu, Gaolin Chen, Yihong Wang:
  Performance evaluation on hybrid fault diagnosability of regular networks. Theor. Comput. Sci. 796: 147-153 (2019)
• 
  Felice De Luca, Md. Iqbal Hossain, Stephen G. Kobourov, Anna Lubiw, Debajyoti Mondal:
  Recognition and drawing of stick graphs. Theor. Comput. Sci. 796: 22-33 (2019)
• 
  Diptapriyo Majumdar, Rian Neogi, Venkatesh Raman, S. Vaishali:
  Tractability of König edge deletion problems. Theor. Comput. Sci. 796: 207-215 (2019)
• 
  Matthew Moore:
  Finite degree clones are undecidable. Theor. Comput. Sci. 796: 237-271 (2019)
• 
  Nader Jafari Rad:
  On the complexity of multiple bondage in graphs. Theor. Comput. Sci. 796: 180-186 (2019)
• 
  Thomas Schweser:
  DP-degree colorable hypergraphs. Theor. Comput. Sci. 796: 196-206 (2019)
• 
  Hafiz Muhammad Afzal Siddiqui, Sakander Hayat, Asad Khan, Muhammad Imran, Ayesha Razzaq, Jia-Bao Liu:
  Resolvability and fault-tolerant resolvability structures of convex polytopes. Theor. Comput. Sci. 796: 114-128 (2019)
• 
  Nour El Houda Tellache, Mourad Boudhar, Farouk Yalaoui:
  Two-machine open shop problem with agreement graph. Theor. Comput. Sci. 796: 154-168 (2019)
• 
  Yucheng Wang, Qi Bao, Zhongzhi Zhang:
  Combinatorial properties of Farey graphs. Theor. Comput. Sci. 796: 70-89 (2019)
• 
  Liya Yang, Xiwen Lu:
  Two-agent scheduling problems with the general position-dependent processing time. Theor. Comput. Sci. 796: 90-98 (2019)