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

• 2019
• 
  Mohammad Ali Abam, Mahnaz Sadat Qafari:
  Geometric spanner games. Theor. Comput. Sci. 795: 398-407 (2019)
• 
  Muhammad S. Akhtar, Usman Ali, Ghulam Abbas, Mutahira Batool:
  On the game chromatic number of splitting graphs of path and cycle. Theor. Comput. Sci. 795: 50-56 (2019)
• 
  Michael Amir, Alfred M. Bruckstein:
  Probabilistic pursuits on graphs. Theor. Comput. Sci. 795: 459-477 (2019)
• 
  Stephan Dominique Andres, Melissa A. Huggan, Fionn Mc Inerney, Richard J. Nowakowski:
  The orthogonal colouring game. Theor. Comput. Sci. 795: 312-325 (2019)
• 
  Patrizio Angelini, Michael A. Bekos, Walter Didimo, Luca Grilli, Philipp Kindermann, Tamara Mchedlidze, Roman Prutkin, Antonios Symvonis, Alessandra Tappini:
  Greedy rectilinear drawings. Theor. Comput. Sci. 795: 375-397 (2019)
• 
  Jørgen Bang-Jensen, Kristine Vitting Klinkby, Saket Saurabh, Meirav Zehavi:
  The parameterized complexity landscape of finding 2-partitions of digraphs. Theor. Comput. Sci. 795: 108-114 (2019)
• 
  Michael A. Bekos, Felice De Luca, Walter Didimo, Tamara Mchedlidze, Martin Nöllenburg, Antonios Symvonis, Ioannis G. Tollis:
  Planar drawings of fixed-mobile bigraphs. Theor. Comput. Sci. 795: 408-419 (2019)
• 
  Pierre Bergé, Arpad Rimmel, Joanna Tomasik:
  On the parameterized complexity of separating certain sources from the target. Theor. Comput. Sci. 795: 183-193 (2019)
• 
  Boris Brimkov, Joshua Carlson, Illya V. Hicks, Rutvik Patel, Logan A. Smith:
  Power domination throttling. Theor. Comput. Sci. 795: 142-153 (2019)
• 
  Leizhen Cai, Junjie Ye:
  Two edge-disjoint paths with length constraints. Theor. Comput. Sci. 795: 275-284 (2019)
• 
  Gruia Calinescu, Guy Kortsarz, Zeev Nutov:
  Improved approximation algorithms for minimum power covering problems. Theor. Comput. Sci. 795: 285-300 (2019)
• 
  Dongqin Cheng:
  Vertex-disjoint paths joining adjacent vertices in faulty hypercubes. Theor. Comput. Sci. 795: 219-224 (2019)
• 
  Nina Chiarelli, Tatiana Romina Hartinger, Valeria Alejandra Leoni, Maria Inés Lopez Pujato, Martin Milanic:
  New algorithms for weighted k-domination and total k-domination problems in proper interval graphs. Theor. Comput. Sci. 795: 128-141 (2019)
• 
  Jason Crampton, Gregory Z. Gutin, Martin Koutecký, Rémi Watrigant:
  Parameterized resiliency problems. Theor. Comput. Sci. 795: 478-491 (2019)
• 
  Jurek Czyzowicz, Krzysztof Diks, Jean Moussi, Wojciech Rytter:
  Energy-optimal broadcast and exploration in a tree using mobile agents. Theor. Comput. Sci. 795: 362-374 (2019)
• 
  Shlomi Dolev, Niv Gilboa, Ximing Li:
  Accumulating automata and cascaded equations automata for communicationless information theoretically secure multi-party computation. Theor. Comput. Sci. 795: 81-99 (2019)
• 
  Diodato Ferraioli, Carmine Ventre:
  Social pressure in opinion dynamics. Theor. Comput. Sci. 795: 345-361 (2019)
• 
  Pawel Garncarek, Tomasz Jurdzinski, Dariusz R. Kowalski, Krzysztof Lorys:
  Online packet scheduling under adversarial errors. Theor. Comput. Sci. 795: 492-509 (2019)
• 
  Amy Glen, Jamie Simpson, W. F. Smyth:
  More properties of the Fibonacci word on an infinite alphabet. Theor. Comput. Sci. 795: 301-311 (2019)
• 
  Frank Gurski, Carolin Rehs, Jochen Rethmann:
  On the hardness of palletizing bins using FIFO queues. Theor. Comput. Sci. 795: 100-107 (2019)
• 
  Keisuke Hara, Fuyuki Kitagawa, Takahiro Matsuda, Goichiro Hanaoka, Keisuke Tanaka:
  Simulation-based receiver selective opening CCA secure PKE from standard computational assumptions. Theor. Comput. Sci. 795: 570-597 (2019)
• 
  Yining Hu, Guoniu Wei-Han:
  On the automaticity of the Hankel determinants of a family of automatic sequences. Theor. Comput. Sci. 795: 154-164 (2019)
• 
  Yanze Huang, Limei Lin, Li Xu, Xiaoding Wang:
  Extra diagnosability and good-neighbor diagnosability of n-dimensional alternating group graph AG_n under the PMC model. Theor. Comput. Sci. 795: 36-49 (2019)
• 
  Bart M. P. Jansen, Jesper Nederlof:
  Computing the chromatic number using graph decompositions via matrix rank. Theor. Comput. Sci. 795: 520-539 (2019)
• 
  Naoyuki Kamiyama:
  Discrete Newton methods for the evacuation problem. Theor. Comput. Sci. 795: 510-519 (2019)
• 
  Mojtaba Khalili, Mohammad Dakhilalian, Carla Ràfols:
  Short tightly secure signatures for signing a vector of group elements: A new approach. Theor. Comput. Sci. 795: 225-239 (2019)
• 
  Samir Khuller, Jingling Li, Pascal Sturmfels, Kevin Sun, Prayaag Venkat:
  Select and permute: An improved online framework for scheduling to minimize weighted completion time. Theor. Comput. Sci. 795: 420-431 (2019)
• 
  Che-Nan Kuo, Yu-Huei Cheng:
  Cycles in folded hypercubes with two adjacent faulty vertices. Theor. Comput. Sci. 795: 115-118 (2019)
• 
  Michel Latteux, Yves Roos:
  On prefixal one-rule string rewrite systems. Theor. Comput. Sci. 795: 240-256 (2019)
• 
  Jan Legerský, Milena Svobodová:
  Construction of algorithms for parallel addition in expanding bases via Extending Window Method. Theor. Comput. Sci. 795: 547-569 (2019)

skipping 13 more matches