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

• 2012
• 
  Hee-Kap Ahn, Sang Won Bae, Shin-ichi Tanigawa:
  Rectilinear Covering for Imprecise Input Points - (Extended Abstract). ISAAC 2012: 309-318
• 
  Hee-Kap Ahn, Hyo-Sil Kim, Sang-Sub Kim, Wanbin Son:
  Computing k-center over Streaming Data for Small k. ISAAC 2012: 54-63
• 
  Tatsuya Akutsu, Takeyuki Tamura:
  On the Complexity of the Maximum Common Subgraph Problem for Partial k-Trees of Bounded Degree. ISAAC 2012: 146-155
• 
  Patrizio Angelini, Carla Binucci, William S. Evans, Ferran Hurtado, Giuseppe Liotta, Tamara Mchedlidze, Henk Meijer, Yoshio Okamoto:
  Universal Point Subsets for Planar Graphs. ISAAC 2012: 423-432
• 
  Sepehr Assadi, Ehsan Emamjomeh-Zadeh, Ashkan Norouzi-Fard, Sadra Yazdanbod, Hamid Zarrabi-Zadeh:
  The Minimum Vulnerability Problem. ISAAC 2012: 382-391
• 
  Sang Won Bae, Yoshio Okamoto, Chan-Su Shin:
  Area Bounds of Rectilinear Polygons Realized by Angle Sequences. ISAAC 2012: 629-638
• 
  Evripidis Bampis, Dimitrios Letsios, Giorgio Lucarelli:
  Green Scheduling, Flows and Matchings. ISAAC 2012: 106-115
• 
  Rémy Belmonte, Pim van 't Hof, Marcin Kaminski:
  Induced Immersions. ISAAC 2012: 299-308
• 
  René van Bevern, Matthias Mnich, Rolf Niedermeier, Mathias Weller:
  Interval Scheduling and Colorful Independent Sets. ISAAC 2012: 247-256
• 
  Binay K. Bhattacharya, Tsunehiko Kameda, Zhao Song:
  Computing Minmax Regret 1-Median on a Tree Network with Positive/Negative Vertex Weights. ISAAC 2012: 588-597
• 
  Andreas Brandstädt, Arne Leitert, Dieter Rautenbach:
  Efficient Dominating and Edge Dominating Sets for Graphs and Hypergraphs. ISAAC 2012: 267-277
• 
  Gerth Stølting Brodal, Jesper Sindahl Nielsen, Jakob Truelsen:
  Finger Search in the Implicit Model. ISAAC 2012: 527-536
• 
  Andrej Brodnik, Marko Grgurovic:
  Speeding Up Shortest Path Algorithms. ISAAC 2012: 156-165
• 
  Timothy M. Chan:
  Combinatorial Geometry and Approximation Algorithms. ISAAC 2012: 2
• 
  Panagiotis Cheilaris, Luisa Gargano, Adele A. Rescigno, Shakhar Smorodinsky:
  Strong Conflict-Free Coloring for Intervals. ISAAC 2012: 4-13
• 
  Wei Chen, Wenjie Fang, Guangda Hu, Michael W. Mahoney:
  On the Hyperbolicity of Small-World and Tree-Like Random Graphs. ISAAC 2012: 278-288
• 
  Danny Z. Chen, Xuehou Tan, Haitao Wang, Gangshan Wu:
  Optimal Point Movement for Covering Circular Regions. ISAAC 2012: 332-341
• 
  Danny Z. Chen, Haitao Wang:
  Weak Visibility Queries of Line Segments in Simple Polygons. ISAAC 2012: 609-618
• 
  Erik D. Demaine:
  Origami Robots and Star Trek Replicators. ISAAC 2012: 3
• 
  Xiaotie Deng, Paul W. Goldberg, Bo Tang, Jinshan Zhang:
  Revenue Maximization in a Bayesian Double Auction Market. ISAAC 2012: 690-699
• 
  Yann Disser, Jannik Matuschke:
  Degree-Constrained Orientations of Embedded Graphs. ISAAC 2012: 506-516
• 
  Reza Dorrigiv, Meng He, Norbert Zeh:
  On the Advice Complexity of Buffer Management. ISAAC 2012: 136-145
• 
  Stephane Durocher, Alexandre Leblanc, Jason Morrison, Matthew Skala:
  Robust Nonparametric Data Approximation of Point Sets via Data Reduction. ISAAC 2012: 319-331
• 
  Chinmoy Dutta, Jaikumar Radhakrishnan:
  More on a Problem of Zarankiewicz. ISAAC 2012: 257-266
• 
  Fabrizio Frati, Joachim Gudmundsson, Emo Welzl:
  On the Number of Upward Planar Orientations of Maximal Planar Graphs. ISAAC 2012: 413-422
• 
  Tobias Friedrich, Anton Krohmer:
  Parameterized Clique on Scale-Free Networks. ISAAC 2012: 659-668
• 
  Norie Fu:
  A Strongly Polynomial Time Algorithm for the Shortest Path Problem on Coherent Planar Periodic Graphs. ISAAC 2012: 392-401
• 
  François Le Gall:
  A Time-Efficient Output-Sensitive Quantum Algorithm for Boolean Matrix Multiplication. ISAAC 2012: 639-648
• 
  Sumit Ganguly:
  Precision vs Confidence Tradeoffs for ℓ2-Based Frequency Estimation in Data Streams. ISAAC 2012: 64-74
• 
  Petr A. Golovach, Dieter Kratsch, Daniël Paulusma:
  Detecting Induced Minors in AT-Free Graphs. ISAAC 2012: 495-505

skipping 42 more matches