• 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

• 2019
• 
  Lin Chen, Franziska Eberle, Nicole Megow, Kevin Schewior, Cliff Stein:
  A General Framework for Handling Commitment in Online Throughput Maximization. IPCO 2019: 141-154
• 
  Ahmad Abdi, Gérard Cornuéjols, Dabeen Lee:
  Identically Self-blocking Clutters. IPCO 2019: 1-12
• 
  Saba Ahmadi, Samir Khuller, Barna Saha:
  Min-Max Correlation Clustering via MultiCut. IPCO 2019: 13-26
• 
  Ross Anderson, Joey Huchette, Christian Tjandraatmadja, Juan Pablo Vielma:
  Strong Mixed-Integer Programming Formulations for Trained Neural Networks. IPCO 2019: 27-42
• 
  Manuel Aprile, Yuri Faenza:
  Extended Formulations from Communication Protocols in Output-Efficient Time. IPCO 2019: 43-56
• 
  Pascale Bendotti, Pierre Fouilhoux, Cécile Rottner:
  Sub-Symmetry-Breaking Inequalities for ILP with Structured Symmetry. IPCO 2019: 57-71
• 
  Kristóf Bérczi, Karthekeyan Chandrasekaran, Tamás Király, Vivek Madan:
  Improving the Integrality Gap for Multiway Cut. IPCO 2019: 115-127
• 
  Daniel Bienstock, Chen Chen, Gonzalo Muñoz:
  Intersection Cuts for Polynomial Optimization. IPCO 2019: 72-87
• 
  Thomas Bosman, Dario Frascaria, Neil Olver, René Sitters, Leen Stougie:
  Fixed-Order Scheduling on Parallel Machines. IPCO 2019: 88-100
• 
  Niv Buchbinder, Moran Feldman, Yuval Filmus, Mohit Garg:
  Online Submodular Maximization: Beating 1/2 Made Simple. IPCO 2019: 101-114
• 
  Chandra Chekuri, Kent Quanrud, Manuel R. Torres:
  \ell _1 -sparsity Approximation Bounds for Packing Integer Programs. IPCO 2019: 128-140
• 
  Federico Della Croce, Rosario Scatamacchia:
  Lower Bounds and a New Exact Approach for the Bilevel Knapsack with Interdiction Constraints. IPCO 2019: 155-167
• 
  Yann Disser, Alexander V. Hopp:
  On Friedmann's Subexponential Lower Bound for Zadeh's Pivot Rule. IPCO 2019: 168-180
• 
  Szymon Dudycz, Mateusz Lewandowski, Jan Marcinkowski:
  Tight Approximation Ratio for Minimum Maximal Matching. IPCO 2019: 181-193
• 
  Eduard Eiben, Robert Ganian, Dusan Knop, Sebastian Ordyniak, Michal Pilipczuk, Marcin Wrochna:
  Integer Programming and Incidence Treedepth. IPCO 2019: 194-204
• 
  Elisabeth Gaar, Franz Rendl:
  A Bundle Approach for SDPs with Exact Subgraph Constraints. IPCO 2019: 205-218
• 
  Ambros M. Gleixner, Daniel E. Steffy:
  Linear Programming Using Limited-Precision Oracles. IPCO 2019: 399-412
• 
  Lukas Graf, Tobias Harks:
  Dynamic Flows with Adaptive Route Choice. IPCO 2019: 219-232
• 
  Anupam Gupta, Haotian Jiang, Ziv Scully, Sahil Singla:
  The Markovian Price of Information. IPCO 2019: 233-246
• 
  Robert Hildebrand, Matthias Köppe, Yuan Zhou:
  On Perturbation Spaces of Minimal Valid Functions: Inverse Semigroup Theory and Equivariant Decomposition Theorem. IPCO 2019: 247-260
• 
  Christoph Hunkenschröder, Gina Reuland, Matthias Schymura:
  On Compact Representations of Voronoi Cells of Lattices. IPCO 2019: 261-274
• 
  Zhuan Khye Koh, Laura Sanità:
  An Efficient Characterization of Submodular Spanning Tree Games. IPCO 2019: 275-287
• 
  Anna Köhne, Vera Traub, Jens Vygen:
  The Asymmetric Traveling Salesman Path LP Has Constant Integrality Ratio. IPCO 2019: 288-298
• 
  Jochen Könemann, Kanstantsin Pashkovich, Justin Toth:
  Computing the Nucleolus of Weighted Cooperative Matching Games in Polynomial Time. IPCO 2019: 413-426
• 
  André Linhares, Neil Olver, Chaitanya Swamy, Rico Zenklusen:
  Approximate Multi-matroid Intersection via Iterative Refinement. IPCO 2019: 299-312
• 
  Martin Nägele, Rico Zenklusen:
  A New Contraction Technique with Applications to Congruency-Constrained Cuts. IPCO 2019: 327-340
• 
  Giacomo Nannicini, Giorgio Sartor, Emiliano Traversi, Roberto Wolfler Calvo:
  An Exact Algorithm for Robust Influence Maximization. IPCO 2019: 313-326
• 
  Timm Oertel, Joseph Paat, Robert Weismantel:
  Sparsity of Integer Solutions in the Average Case. IPCO 2019: 341-353
• 
  Artur Alves Pessoa, Ruslan Sadykov, Eduardo Uchoa, François Vanderbeck:
  A Generic Exact Solver for Vehicle Routing and Related Problems. IPCO 2019: 354-369
• 
  Miriam Schlöter:
  Earliest Arrival Transshipments in Networks with Multiple Sinks. IPCO 2019: 370-384

skipping 4 more matches