• 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

• 2011
• 
  Alexander A. Ageev, Yohann Benchetrit, András Sebö, Zoltán Szigeti:
  An Excluded Minor Characterization of Seymour Graphs. IPCO 2011: 1-13
• 
  Yu Hin Au, Levent Tunçel:
  Complexity Analyses of Bienstock-Zuckerberg and Lasserre Relaxations on the Matching and Stable Set Polytopes. IPCO 2011: 14-26
• 
  Amitabh Basu, Gérard Cornuéjols, Marco Molinaro:
  A Probabilistic Analysis of the Strength of the Split and Triangle Closures. IPCO 2011: 27-38
• 
  Martin Bergner, Alberto Caprara, Fabio Furini, Marco E. Lübbecke, Enrico Malaguti, Emiliano Traversi:
  Partial Convexification of General MIPs by Dantzig-Wolfe Reformulation. IPCO 2011: 39-51
• 
  Pierre Bonami:
  Lift-and-Project Cuts for Mixed Integer Convex Programs. IPCO 2011: 52-64
• 
  Sylvia C. Boyd, René Sitters, Suzanne van der Ster, Leen Stougie:
  TSP on Cubic and Subcubic Graphs. IPCO 2011: 65-77
• 
  Deeparnab Chakrabarty, Chandra Chekuri, Sanjeev Khanna, Nitish Korula:
  Approximability of Capacitated Network Design. IPCO 2011: 78-91
• 
  Deeparnab Chakrabarty, Chaitanya Swamy:
  Facility Location with Client Latencies: Linear Programming Based Techniques for Minimum Latency Problems. IPCO 2011: 92-103
• 
  William J. Cook, Thorsten Koch, Daniel E. Steffy, Kati Wolter:
  An Exact Rational Mixed-Integer Programming Solver. IPCO 2011: 104-116
• 
  Claudia D'Ambrosio, Jeff T. Linderoth, James R. Luedtke:
  Valid Inequalities for the Pooling Problem with Binary Variables. IPCO 2011: 117-129
• 
  Daniel Dadush, Santanu S. Dey, Juan Pablo Vielma:
  On the Chvátal-Gomory Closure of a Compact Convex Set. IPCO 2011: 130-142
• 
  Santanu S. Dey, Sebastian Pokutta:
  Design and Verify: A New Scheme for Generating Cutting-Planes. IPCO 2011: 143-155
• 
  Aman Dhesi, Pranav Gupta, Amit Kumar, Gyana R. Parija, Sambuddha Roy:
  Contact Center Scheduling with Strict Resource Requirements. IPCO 2011: 156-169
• 
  Friedrich Eisenbrand, Naonori Kakimura, Thomas Rothvoß, Laura Sanità:
  Set Covering with Ordered Replacement: Additive and Multiplicative Gaps. IPCO 2011: 170-182
• 
  Matteo Fischetti, Michele Monaci:
  Backdoor Branching. IPCO 2011: 183-191
• 
  Oliver Friedmann:
  A Subexponential Lower Bound for Zadeh's Pivoting Rule for Solving Linear Programs and Games. IPCO 2011: 192-206
• 
  Bissan Ghaddar, Juan C. Vera, Miguel F. Anjos:
  An Iterative Scheme for Valid Polynomial Inequality Generation in Binary Polynomial Programming. IPCO 2011: 207-222
• 
  Monia Giandomenico, Adam N. Letchford, Fabrizio Rossi, Stefano Smriglio:
  A New Approach to the Stable Set Problem Based on Ellipsoids. IPCO 2011: 223-234
• 
  Inge Li Gørtz, Marco Molinaro, Viswanath Nagarajan, R. Ravi:
  Capacitated Vehicle Routing with Non-uniform Speeds. IPCO 2011: 235-247
• 
  Fabrizio Grandoni, Thomas Rothvoß:
  Approximation Algorithms for Single and Multi-Commodity Connected Facility Location. IPCO 2011: 248-260
• 
  Stephan Held, William J. Cook, Edward C. Sewell:
  Safe Lower Bounds for Graph Coloring. IPCO 2011: 261-273
• 
  Satoru Iwata, Mizuyo Takamatsu:
  Computing the Maximum Degree of Minors in Mixed Polynomial Matrices via Combinatorial Relaxation. IPCO 2011: 274-286
• 
  Volker Kaibel, Kanstantsin Pashkovich:
  Constructing Extended Formulations from Reflection Relations. IPCO 2011: 287-300
• 
  Anna R. Karlin, Claire Mathieu, C. Thach Nguyen:
  Integrality Gaps of Linear and Semi-Definite Programming Relaxations for Knapsack. IPCO 2011: 301-314
• 
  Tamás Király, Lap Chi Lau:
  Degree Bounded Forest Covering. IPCO 2011: 315-323
• 
  S. Thomas McCormick, Britta Peis:
  A Primal-Dual Algorithm for Weighted Abstract Cut Packing. IPCO 2011: 324-335
• 
  Trang T. Nguyen, Mohit Tawarmalani, Jean-Philippe P. Richard:
  Convexification Techniques for Linear Complementarity Constraints. IPCO 2011: 336-348
• 
  Ojas Parekh:
  Iterative Packing for Demand and Hypergraph Matching. IPCO 2011: 349-361
• 
  Britta Peis, Andreas Wiese:
  Universal Packet Routing with Arbitrary Bandwidths and Transit Times. IPCO 2011: 362-375
• 
  Mario Ruthmair, Günther R. Raidl:
  A Layered Graph Model and an Adaptive Layers Framework to Solve Delay-Constrained Minimum Tree Problems. IPCO 2011: 376-388

skipping 4 more matches