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

• 2012
• 
  Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono:
  Upper and Lower Degree Bounded Graph Orientation with Minimum Penalty. CATS 2012: 139-146
• 
  Franz-Josef Brandenburg:
  On the Curve Complexity of Upward Planar Drawings. CATS 2012: 27-36
• 
  Stefan Edelkamp, Amr Elmasry, Jyrki Katajainen:
  The Weak-Heap Family of Priority Queues in Theory and Praxis. CATS 2012: 103-112
• 
  Toshihiro Fujito, Takayoshi Sakamaki:
  How to guard a graph against tree movements. CATS 2012: 93-96
• 
  Aniruddh Gandhi, Bakhadyr Khoussainov, Jiamou Liu:
  Solving infinite games on trees with back-edges. CATS 2012: 113-122
• 
  Toshimasa Ishii:
  Augmenting Outerplanar Graphs to Meet Diameter Requirements. CATS 2012: 123-132
• 
  Chuzo Iwamoto, Kento Sasaki, Kenichi Morita:
  Computational Complexity of String Puzzles. CATS 2012: 69-74
• 
  Naonori Kakimura, Mizuyo Takamatsu:
  Matching Problems with Delta-Matroid Constraints. CATS 2012: 83-92
• 
  Ken-ichi Kawarabayashi, David R. Wood:
  Cliques in Odd-Minor-Free Graphs. CATS 2012: 133-138
• 
  Kewen Liao, Hong Shen:
  Approximating the Reliable Resource Allocation Problem Using Inverse Dual Fitting. CATS 2012: 75-82
• 
  Meena Mahajan, Nitin Saurabh, Karteek Sreenivasaiah:
  Counting paths in planar width 2 branching programs. CATS 2012: 59-68
• 
  Lee Naish, Harald Søndergaard, Benjamin Horsfall:
  Logic Programming: From Underspecification to Undefinedness. CATS 2012: 49-58
• 
  Martin Olsen:
  On Defining and Computing Communities. CATS 2012: 97-102
• 
  Radwa El Shawi, Joachim Gudmundsson, Christos Levcopoulos:
  Quickest Path Queries on Transportation Network. CATS 2012: 37-46
• 
  Tadao Takaoka:
  Efficient Algorithms for the All Pairs Shortest Path Problem with Limited Edge Costs. CATS 2012: 21-26
• 
  Yung H. Tsin:
  Decomposing a Multigraph into Split Components. CATS 2012: 3-12
• 
  Pavel Valtr:
  On empty pentagons and hexagons in planar point sets. CATS 2012: 47-48
• 
  Cong Zhang, Hiroshi Nagamochi:
  The Next-to-Shortest Path in Undirected Graphs with Nonnegative Weights. CATS 2012: 13-20
• 
  Julián Mestre:
  Eighteenth Computing: The Australasian Theory Symposium, CATS 2012, Melbourne, Australia, January 2012. CRPIT 128, Australian Computer Society 2012, ISBN 978-1-921770-09-8 [contents]