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

• 2009
• 
  Faisal N. Abu-Khzam:
  A Quadratic Kernel for 3-Set Packing. TAMC 2009: 81-87
• 
  Klaus Ambos-Spies, Thorsten Kräling:
  Quantitative Aspects of Speed-Up and Gap Phenomena. TAMC 2009: 88-97
• 
  Ei Ando, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita:
  Computing the Exact Distribution Function of the Stochastic Longest Path Length in a DAG. TAMC 2009: 98-107
• 
  Evangelos Bampas, Andreas-Nikolas Göbel, Aris Pagourtzis, Aris Tentes:
  On the Connection between Interval Size Functions and Path Counting. TAMC 2009: 108-117
• 
  Sergey Bereg, Minghui Jiang, Boting Yang, Binhai Zhu:
  On the Red/Blue Spanning Tree Problem. TAMC 2009: 118-127
• 
  Jasper Berendsen, Taolue Chen, David N. Jansen:
  Undecidability of Cost-Bounded Reachability in Priced Probabilistic Timed Automata. TAMC 2009: 128-137
• 
  Jin-yi Cai, Pinyan Lu, Mingji Xia:
  A Computational Proof of Complexity of Some Restricted Counting Problems. TAMC 2009: 138-149
• 
  Alessandra Carbone, Linda Dib:
  Co-evolution and Information Signals in Biological Sequences. TAMC 2009: 6-17
• 
  Douglas Cenzer, Johanna N. Y. Franklin, Jiang Liu, Guohua Wu:
  Embedding the Diamond Lattice in the c.e. tt-Degrees with Superhigh Atoms. TAMC 2009: 420-429
• 
  Maw-Shang Chang, Ling-Ju Hung, Ton Kloks, Sheng-Lung Peng:
  Block-Graph Width. TAMC 2009: 150-157
• 
  Ruei-Yuan Chang, Guanling Lee, Sheng-Lung Peng:
  Minimum Vertex Ranking Spanning Tree Problem on Permutation Graphs. TAMC 2009: 158-167
• 
  Jianer Chen, Iyad A. Kanj, Ge Xia:
  On Parameterized Exponential Time Complexity. TAMC 2009: 168-177
• 
  S. Barry Cooper:
  The Extended Turing Model as Contextual Tool. TAMC 2009: 18-28
• 
  Ernst-Erich Doberkat:
  Behavioral and Logical Equivalence of Stochastic Kripke Models in General Measurable Spaces. TAMC 2009: 192-200
• 
  Michael Elberfeld, Ilka Schnoor, Till Tantau:
  Influence of Tree Topology Restrictions on the Complexity of Haplotyping with Missing Data. TAMC 2009: 201-210
• 
  Qilong Feng, Yang Liu, Songjian Lu, Jianxin Wang:
  Improved Deterministic Algorithms for Weighted Matching and Packing Problems. TAMC 2009: 211-220
• 
  Henning Fernau, Daniel Raible:
  Searching Trees: An Essay. TAMC 2009: 59-70
• 
  Jirí Fiala, Petr A. Golovach, Jan Kratochvíl:
  Parameterized Complexity of Coloring Problems: Treewidth versus Vertex Cover. TAMC 2009: 221-230
• 
  Bin Fu, Ming-Yang Kao, Lusheng Wang:
  Discovering Almost Any Hidden Motif from Multiple Sequences in Polynomial Time with Low Sample Complexity and High Success Probability. TAMC 2009: 231-240
• 
  Jiong Guo:
  Fixed-Parameter Algorithms for Graph-Modeled Date Clustering. TAMC 2009: 39-48
• 
  Pinar Heggernes, Daniel Meister, Charis Papadopoulos:
  A Complete Characterisation of the Linear Clique-Width of Path Powers. TAMC 2009: 241-250
• 
  Matthew Hennessy:
  Distributed Systems and Their Environments. TAMC 2009: 4-5
• 
  Markus Hinkelmann, Andreas Jakoby:
  Preserving Privacy versus Data Retention. TAMC 2009: 251-260
• 
  Bo Jiang, Xuehou Tan:
  Searching a Circular Corridor with Two Flashlights. TAMC 2009: 345-359
• 
  Iyad A. Kanj:
  On Spanners of Geometric Graphs. TAMC 2009: 49-58
• 
  Marc Kaplan, Sophie Laplante:
  Kolmogorov Complexity and Combinatorial Methods in Communication Complexity. TAMC 2009: 261-270
• 
  Grégory Lafitte, Michael Weiss:
  An Almost Totally Universal Tile Set. TAMC 2009: 271-280
• 
  Daniel Lokshtanov, Matthias Mnich, Saket Saurabh:
  Linear Kernel for Planar Connected Dominating Set. TAMC 2009: 281-290
• 
  Maren Martens:
  A Simple Greedy Algorithm for the k-Disjoint Flow Problem. TAMC 2009: 291-300
• 
  Takaaki Mizuki, Hitoshi Tsubata, Takao Nishizeki:
  Minimizing AND-EXOR Expressions for Multiple-Valued Two-Input Logic Functions. TAMC 2009: 301-310

skipping 20 more matches