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

• 1999
• 
  Pankaj K. Agarwal, Binay K. Bhattacharya, Sandeep Sen:
  Output-Sensitive Algorithms for Uniform Partitions of Points. ISAAC 1999: 403-414
• 
  Vikraman Arvind, K. V. Subrahmanyam, N. V. Vinodchandran:
  The Query Complexity of Program Checking by Constant-Depth Circuits. ISAAC 1999: 123-132
• 
  Tetsuo Asano, Naoki Katoh, Kazuhiro Kawashima:
  A New Approximation Algorithm for the Capacitated Vehicle Routing Problem on a Tree. ISAAC 1999: 317-326
• 
  Nikhil Bansal, Venkatesh Raman:
  Upper Bounds for MaxSat: Further Improved. ISAAC 1999: 247-258
• 
  Binay K. Bhattacharya, Michael E. Houle:
  Generalized Maximum Independent Sets for Trees in Subquadratic Time. ISAAC 1999: 435-445
• 
  Therese C. Biedl, Erik D. Demaine, Sylvain Lazard, Steven M. Robbins, Michael A. Soss:
  Convexifying Monotone Polygons. ISAAC 1999: 415-424
• 
  Jacir Luiz Bordim, JiangTao Cui, Tatsuya Hayashi, Koji Nakano, Stephan Olariu:
  Energy-Efficient Initialization Protocols for Ad-hoc Radio Networks. ISAAC 1999: 215-224
• 
  Prosenjit Bose, Christos Kaklamanis, Lefteris M. Kirousis, Evangelos Kranakis, Danny Krizanc, David Peleg:
  Station Layouts in the Presence of Location Constraints. ISAAC 1999: 269-278
• 
  Prosenjit Bose, Pat Morin:
  Online Routing in Triangulations. ISAAC 1999: 113-122
• 
  Wun-Tat Chan, Francis Y. L. Chin, Hing-Fung Ting:
  A Faster Algorithm for Finding Disjoint Paths in Grids. ISAAC 1999: 393-402
• 
  Jou-Ming Chang, Chin-Wen Ho, Ming-Tat Ko:
  LexBFS-Ordering in Asteroidal Triple-Free Graphs. ISAAC 1999: 163-172
• 
  Serafino Cicerone, Gabriele Di Stefano, Dagmar Handke:
  Survivable Networks with Bounded Delay: The Edge Failure Case. ISAAC 1999: 205-214
• 
  Peter Damaschke:
  Multiple Spin-Block Decisions. ISAAC 1999: 27-36
• 
  Mirela Damian-Iordache, Sriram V. Pemmaraju:
  Hardness of Approximating Independent Domination in Circle Graphs. ISAAC 1999: 56-69
• 
  Mirela Damian-Iordache, Sriram V. Pemmaraju:
  Constant-Factor Approximation Algorithms for Domination Problems on Circle Graphs. ISAAC 1999: 70-82
• 
  Abhijit Das, C. E. Veni Madhavan:
  Performance Comparison of Linear Sieve and Cubic Sieve Algorithms for Discrete Logarithms over Prime Fields. ISAAC 1999: 295-306
• 
  Xiaotie Deng, Chung Keung Poon, Yuzhong Zhang:
  Approximation Algorithms in Batch Processing. ISAAC 1999: 153-162
• 
  Stephan J. Eidenbenz:
  How Many People Can Hide in a Terrain? ISAAC 1999: 184-194
• 
  Paola Flocchini, Giuseppe Prencipe, Nicola Santoro, Peter Widmayer:
  Hard Tasks for Weak Robots: The Role of Common Knowledge in Pattern Formation by Autonomous Mobile Robots. ISAAC 1999: 93-102
• 
  Daya Ram Gaur, Ramesh Krishnamurti:
  Simple Approximation Algorithms for MAXNAESP and Hypergraph 2-colorability. ISAAC 1999: 49-55
• 
  George F. Georgakopoulos, David J. McClurkin:
  General Splay: A Basic Theory and Calculus. ISAAC 1999: 4-17
• 
  Takashi Horiyama, Toshihide Ibaraki:
  Ordered Binary Decision Diagrams as Knowledge-Bases. ISAAC 1999: 83-92
• 
  Fang-Rong Hsu, Yaw-Ling Lin, Yin-Te Tsai:
  Parallel Algorithms for Shortest Paths and Related Problems on Trapezoid Graphs. ISAAC 1999: 173-182
• 
  Shuji Isobe, Xiao Zhou, Takao Nishizeki:
  A Linear Algorithm for Finding Total Colorings of Partial k-Trees. ISAAC 1999: 347-356
• 
  Kazuo Iwama, Shuichi Miyazaki:
  Tree-Like Resolution Is Superpolynomially Slower Than DAG-Like Resolution for the Pigeonhole Principle. ISAAC 1999: 133-142
• 
  Jeannette C. M. Janssen, Lata Narayanan:
  Approximation Algorithms for Channel Assignment with Constraints. ISAAC 1999: 327-336
• 
  Yoshiyuki Kusakari, Daisuke Masubuchi, Takao Nishizeki:
  Algorithms for Finding Noncrossing Steiner Forests in Plane Graphs. ISAAC 1999: 337-346
• 
  Jae-Ha Lee, Kyung-Yong Chwa:
  Online Scheduling of Parallel Communications with Individual Deadlines. ISAAC 1999: 383-392
• 
  Jae-Ha Lee, Chong-Dae Park, Kyung-Yong Chwa:
  Carrying Umbrellas: An Online Relocation Problem on Graphs. ISAAC 1999: 195-204
• 
  Anil Maheshwari, Norbert Zeh:
  External Memory Algorithms for Outerplanar Graphs. ISAAC 1999: 307-316

skipping 15 more matches