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

• 2011
• 
  Ernst Althaus, Joschka Kupilas, Rouven Naujoks:
  On the Low-Dimensional Steiner Minimum Tree Problem in Hamming Metric. TAMC 2011: 308-319
• 
  Tetsuo Asano:
  Designing Algorithms with Limited Work Space. TAMC 2011: 1
• 
  Paul C. Bell, Prudence W. H. Wong:
  Multiprocessor Speed Scaling for Jobs with Arbitrary Sizes and Deadlines. TAMC 2011: 27-36
• 
  Rémy Belmonte, Pinar Heggernes, Pim van 't Hof:
  Edge Contractions in Subclasses of Chordal Graphs. TAMC 2011: 528-539
• 
  Ondrej Bílka, Bernard Lidický, Marek Tesar:
  Locally Injective Homomorphism to the Simple Weight Graphs. TAMC 2011: 471-482
• 
  Gerth Stølting Brodal, Mark Greve, Vineet Pandey, Srinivasa Rao Satti:
  Integer Representations towards Efficient Counting in the Bit Probe Model. TAMC 2011: 206-217
• 
  Joshua Brody, Kevin Matulef, Chenggang Wu:
  Lower Bounds for Testing Computability by Small Width OBDDs. TAMC 2011: 320-331
• 
  Tobias Brunsch, Heiko Röglin:
  A Bad Instance for k-Means++. TAMC 2011: 344-352
• 
  Tobias Brunsch, Heiko Röglin:
  Lower Bounds for the Smoothed Number of Pareto Optimal Solutions. TAMC 2011: 416-427
• 
  Xue Chen, Guangda Hu, Xiaoming Sun:
  A Better Upper Bound on Weights of Exact Threshold Functions. TAMC 2011: 124-132
• 
  Francis Y. L. Chin, Henry C. M. Leung, Siu-Ming Yiu:
  Non-adaptive Complex Group Testing with Multiple Positive Sets. TAMC 2011: 172-183
• 
  Serafino Cicerone:
  Using Split Composition to Extend Distance-Hereditary Graphs in a Generative Way - (Extended Abstract). TAMC 2011: 286-297
• 
  Atlas F. Cook, Chenglin Fan, Jun Luo:
  Hide-and-Seek: Algorithms for Polygon Walk Problems. TAMC 2011: 495-504
• 
  Samir Datta, Nagarajan Krishnamurthy:
  Some Tractable Win-Lose Games. TAMC 2011: 365-376
• 
  Samir Datta, Gautam Prakriya:
  Planarity Testing Revisited. TAMC 2011: 540-551
• 
  Pooya Davoodi, S. Srinivasa Rao:
  Succinct Dynamic Cardinal Trees with Constant Time Operations for Small Alphabet. TAMC 2011: 195-205
• 
  Ning Ding, Dawu Gu:
  A Note on Obfuscation for Cryptographic Functionalities of Secret-Operation Then Public-Encryption. TAMC 2011: 377-389
• 
  András Faragó:
  Low Distortion Metric Embedding into Constant Dimension. TAMC 2011: 114-123
• 
  Rusins Freivalds, Thomas Zeugmann:
  On the Amount of Nonconstructivity in Learning Recursive Functions. TAMC 2011: 332-343
• 
  Jie Fu, Jeffrey Heinz, Herbert G. Tanner:
  An Algebraic Characterization of Strictly Piecewise Languages. TAMC 2011: 252-263
• 
  Takuro Fukunaga:
  Approximating Minimum Cost Source Location Problems with Local Vertex-Connectivity Demands. TAMC 2011: 428-439
• 
  Tomas Gavenciak:
  Catching a Fast Robber on Interval Graphs. TAMC 2011: 353-364
• 
  Takehiro Ito, Erik D. Demaine:
  Approximability of the Subset Sum Reconfiguration Problem. TAMC 2011: 58-69
• 
  Takehiro Ito, Kazuto Kawamura, Xiao Zhou:
  An Improved Sufficient Condition for Reconfiguration of List Edge-Colorings in a Tree. TAMC 2011: 94-105
• 
  Kazuo Iwama, Shuichi Miyazaki, Hiroki Yanagisawa:
  Improved Approximation Bounds for the Student-Project Allocation Problem with Preferences over Projects. TAMC 2011: 440-451
• 
  Kozue Iwata, Shiro Ishiwata, Shin-Ichi Nakano:
  A Compact Encoding of Unordered Binary Trees. TAMC 2011: 106-113
• 
  Sanjay Jain, Frank Stephan, Jason Teutsch:
  Closed Left-R.E. Sets. TAMC 2011: 218-229
• 
  Emmanuel Jeandel, Pascal Vanier:
  P⁰₁\it \Pi0_1 Sets and Tilings. TAMC 2011: 230-239
• 
  Eva Jelínková:
  Switching to Hedgehog-Free Graphs Is NP-Complete. TAMC 2011: 463-470
• 
  Konstanty Junosza-Szaniawski, Jan Kratochvíl, Mathieu Liedloff, Peter Rossmanith, Pawel Rzazewski:
  Fast Exact Algorithm for L(2, 1)-Labeling of Graphs. TAMC 2011: 82-93

skipping 24 more matches