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

• 2022
• 
  Reza Aghayan:
  Generating Visual Invariants -a New Approach to Invariant Recognition. Theory Comput. Syst. 66(1): 1-37 (2022)
• 
  Greg Aloupis, Tamon Stephen, Olga Zasenko:
  Computing Colourful Simplicial Depth and Median in ℝ₂. Theory Comput. Syst. 66(2): 417-431 (2022)
• 
  Yuuki Aoike, Tatsuya Gima, Tesshu Hanaka, Masashi Kiyomi, Yasuaki Kobayashi, Yusuke Kobayashi, Kazuhiro Kurita, Yota Otachi:
  An Improved Deterministic Parameterized Algorithm for Cactus Vertex Deletion. Theory Comput. Syst. 66(2): 502-515 (2022)
• 
  Vikraman Arvind, Abhranil Chatterjee, Rajit Datta, Partha Mukhopadhyay:
  Univariate Ideal Membership Parameterized by Rank, Degree, and Number of Generators. Theory Comput. Syst. 66(1): 56-88 (2022)
• 
  Pradeesha Ashok, Sudeshna Kolay, Neeldhara Misra, Saket Saurabh:
  Exact Multi-Covering Problems with Geometric Sets. Theory Comput. Syst. 66(1): 89-113 (2022)
• 
  Suman Banerjee, Rogers Mathew, Fahad Panolan:
  Target Set Selection Parameterized by Vertex Cover and More. Theory Comput. Syst. 66(5): 996-1018 (2022)
• 
  Cristina Bazgan, Stefan Ruzika, Clemens Thielen, Daniel Vanderpooten:
  The Power of the Weighted Sum Scalarization for Approximating Multiobjective Optimization Problems. Theory Comput. Syst. 66(1): 395-415 (2022)
• 
  Marie Louisa Tølbøll Berthelsen, Kristoffer Arnsfelt Hansen:
  On the Computational Complexity of Decision Problems About Multi-player Nash Equilibria. Theory Comput. Syst. 66(3): 519-545 (2022)
• 
  Jin-Yi Cai, Zhiguo Fu, Heng Guo, Tyson Williams:
  FKT is Not Universal - A Planar Holant Dichotomy for Symmetric Constraints. Theory Comput. Syst. 66(1): 143-308 (2022)
• 
  Ioannis Caragiannis, George Christodoulou, Nicos Protopapas:
  Impartial Selection with Additive Approximation Guarantees. Theory Comput. Syst. 66(3): 721-742 (2022)
• 
  Augustin Chaintreau, Guillaume Ducoffe, Dorian Mazauric:
  Non-Existence of Stable Social Groups in Information-Driven Networks. Theory Comput. Syst. 66(4): 758-777 (2022)
• 
  Ching-Lueh Chang:
  On Random Perfect Matchings in Metric Spaces with Not-too-large Diameters. Theory Comput. Syst. 66(4): 847-860 (2022)
• 
  Po-An Chen, Chi-Jen Lu, Yu-Sin Lu:
  An Alternating Algorithm for Finding Linear Arrow-Debreu Market Equilibria. Theory Comput. Syst. 66(1): 38-55 (2022)
• 
  Anastasiya Chistopolskaya, Vladimir V. Podolskii:
  On the Decision Tree Complexity of Threshold Functions. Theory Comput. Syst. 66(6): 1074-1098 (2022)
• 
  Yusong Du, Xiao Ma:
  On the Rejection Rate of Exact Sampling Algorithm for Discrete Gaussian Distributions over the Integers. Theory Comput. Syst. 66(6): 1099-1122 (2022)
• 
  Diodato Ferraioli, Carmine Ventre:
  Obvious Strategyproofness, Bounded Rationality and Approximation. Theory Comput. Syst. 66(3): 696-720 (2022)
• 
  Giannis Fikioris, Dimitris Fotakis:
  Mechanism Design for Perturbation Stable Combinatorial Auctions. Theory Comput. Syst. 66(4): 778-801 (2022)
• 
  Till Fluschnik, Rolf Niedermeier, Valentin Rohm, Philipp Zschoche:
  Multistage Vertex Cover. Theory Comput. Syst. 66(2): 454-483 (2022)
• 
  Fedor V. Fomin, Vijayaragunathan Ramamoorthi:
  On the Parameterized Complexity of the Expected Coverage Problem. Theory Comput. Syst. 66(2): 432-453 (2022)
• 
  Dimitris Fotakis, Evangelos Markakis:
  Special issue on algorithmic game theory (SAGT 2019). Theory Comput. Syst. 66(3): 517-518 (2022)
• 
  Péter Gács, Ilkka Törmä:
  Stable Multi-Level Monotonic Eroders. Theory Comput. Syst. 66(1): 322-353 (2022)
• 
  Chryssis Georgiou, Marios Mavronicolas, Burkhard Monien:
  (In)Existence of Equilibria for 2-Player, 2-Value Games with Semistrictly Quasiconcave Cost Functions. Theory Comput. Syst. 66(5): 957-995 (2022)
• 
  Petr A. Golovach, Paloma T. Lima, Charis Papadopoulos:
  Graph Square Roots of Small Distance from Degree One Graphs. Theory Comput. Syst. 66(4): 821-846 (2022)
• 
  Mathias Hedenborg, Jonas Lundberg, Welf Löwe, Martin Trapp:
  A Framework for Memory Efficient Context-Sensitive Program Analysis. Theory Comput. Syst. 66(5): 911-956 (2022)
• 
  John M. Hitchcock, Hadi Shafei:
  Nonuniform Reductions and NP-Completeness. Theory Comput. Syst. 66(4): 743-757 (2022)
• 
  Chien-Chung Huang, Naonori Kakimura:
  Multi-Pass Streaming Algorithms for Monotone Submodular Function Maximization. Theory Comput. Syst. 66(1): 354-394 (2022)
• 
  Hiroe Inoue, Yoshiaki Matsuoka, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
  Factorizing Strings into Repetitions. Theory Comput. Syst. 66(2): 484-501 (2022)
• 
  Chi-Kit Lam, C. Gregory Plaxton:
  Maximum Stable Matching with One-Sided Ties of Bounded Length. Theory Comput. Syst. 66(3): 645-678 (2022)
• 
  Chi-Kit Lam, C. Gregory Plaxton:
  On the Existence of Three-Dimensional Stable Matchings with Cyclic Preferences. Theory Comput. Syst. 66(3): 679-695 (2022)
• 
  Jiabao Lin:
  The Complexity of Counting CSP^d. Theory Comput. Syst. 66(1): 309-321 (2022)

skipping 8 more matches