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

• 2002
• 
  Karen I. Aardal, Arjen K. Lenstra:
  Hard Equality Constrained Integer Knapsacks. IPCO 2002: 350-366
• 
  Ron Aharoni, Tamás Fleiner:
  On a Lemma of Scarf. IPCO 2002: 176-187
• 
  Ernst Althaus, Christian Fink:
  A Polyhedral Approach to Surface Reconstruction from Planar Contours. IPCO 2002: 258-272
• 
  Kent Andersen, Gérard Cornuéjols, Yanjun Li:
  Split Closure and Intersection Cuts. IPCO 2002: 127-144
• 
  Alexander I. Barvinok, Tamon Stephen:
  The Distribution of Values in the Quadratic Assignment Problem. IPCO 2002: 367-383
• 
  Sylvia C. Boyd, Geneviève Labonté:
  Finding the Exact Integrality Gap for Small Traveling Salesman Problems. IPCO 2002: 83-92
• 
  Mao-cheng Cai, Xiaotie Deng, Haodi Feng, Guojun Li, Guizhen Liu:
  A PTAS for Minimizing Total Completion Time of Bounded Batch Scheduling. IPCO 2002: 304-314
• 
  Gruia Calinescu, Amit Chakrabarti, Howard J. Karloff, Yuval Rabani:
  Improved Approximation Algorithms for Resource Allocation. IPCO 2002: 401-414
• 
  Alberto Caprara, Andrea Lodi, Michele Monaci:
  An Approximation Scheme for the Two-Stage, Two-Dimensional Bin Packing Problem. IPCO 2002: 315-328
• 
  Chandra Chekuri, Anupam Gupta, Amit Kumar, Joseph Naor, Danny Raz:
  Building Edge-Failure Resilient Networks. IPCO 2002: 439-456
• 
  Sanjeeb Dash:
  An Exponential Lower Bound on the Length of Some Classes of Branch-and-Cut Proofs. IPCO 2002: 145-160
• 
  Andreas Eisenblätter:
  The Semidefinite Relaxation of the k -Partition Polytope Is Strong. IPCO 2002: 273-290
• 
  Ismael R. de Farias Jr., George L. Nemhauser:
  A Polyhedral Study of the Cardinality Constrained Knapsack Problem. IPCO 2002: 291-303
• 
  Lisa Fleischer, Martin Skutella:
  The Quickest Multicommodity Flow Problem. IPCO 2002: 36-53
• 
  Ari Freund, Joseph Naor:
  Approximating the Advertisement Placement Problem. IPCO 2002: 415-424
• 
  Rajiv Gandhi, Samir Khuller, Yoo Ah Kim, Yung-Chun (Justin) Wan:
  Algorithms for Minimizing Response Time in Broadcast Scheduling. IPCO 2002: 425-438
• 
  Bertrand Guenin:
  A Short Proof of Seymour's Characterization of the Matroids with the Max-Flow Min-Cut Property. IPCO 2002: 188-193
• 
  Oktay Günlük:
  A New Min-Cut Max-Flow Ratio for Multicommodity Flows. IPCO 2002: 54-66
• 
  Satoru Iwata:
  A Faster Scaling Algorithm for Minimizing Submodular Functions. IPCO 2002: 1-8
• 
  Klaus Jansen, Lorant Porkolab:
  On Preemptive Resource Constrained Scheduling: Polynomial-Time Approximation Schemes. IPCO 2002: 329-349
• 
  Diego Klabjan:
  A New Subadditive Approach to Integer Programming. IPCO 2002: 384-400
• 
  Adam N. Letchford, Andrea Lodi:
  Polynomial-Time Separation of Simple Comb Inequalities. IPCO 2002: 93-108
• 
  Michael Lewin, Dror Livnat, Uri Zwick:
  Improved Rounding Techniques for the MAX 2-SAT and MAX DI-CUT Problems. IPCO 2002: 67-82
• 
  Ravi Ramamoorthi, Amitabh Sinha II:
  Integrated Logistics: Approximation Algorithms Combining Facility Location and Network Design. IPCO 2002: 212-229
• 
  Jean-Philippe P. Richard, Ismael R. de Farias Jr., George L. Nemhauser:
  Lifted Inequalities for 0-1 Mixed Integer Programming: Basic Theory and Algorithms. IPCO 2002: 161-175
• 
  Jay Sethuraman, Chung-Piaw Teo, Rakesh Vohra:
  Integer Programming and Arrovian Social Welfare Functions. IPCO 2002: 194-211
• 
  F. Bruce Shepherd, Adrian Vetta:
  The Demand Matching Problem. IPCO 2002: 457-474
• 
  René Sitters:
  The Minimum Latency Problem Is NP-Hard for Weighted Trees. IPCO 2002: 230-239
• 
  Bianca Spille, Robert Weismantel:
  A Generalization of Edmonds' Matching and Matroid Intersection Algorithms. IPCO 2002: 9-20
• 
  Maxim Sviridenko:
  An Improved Approximation Algorithm for the Metric Uncapacitated Facility Location Problem. IPCO 2002: 240-257

skipping 4 more matches