IPCO 2017 Accepted Papers
Kenjiro Takazawa. Optimal $t$-matchings Excluding Prescribed $t$-factors in Bipartite Graphs: A Unified Framework for Nonbipartite Matchings and Restricted $2$-matchings Iskander Aliev, Martin Henk and Timm Oertel. Integrality Gaps of Integer Knapsack Problems
Sungjin Im, Benjamin Moseley and Shi Li. Breaking 1 - 1/e Barrier for Non-preemptive Throughput Maximization Monaldo Mastrolilli. High Degree Sum of Squares Proofs, Bienstock-Zuckerberg hierarchy and Chvatal-Gomory cuts Guru Guruganesh and Sahil Singla. Online Matroid Intersection: Beating Half for Random Arrival Sayan Bhattacharya, Deeparnab Chakrabarty and Monika Henzinger. Deterministic Fully Dynamic Approximate Vertex Cover and Fractional Matching in $O(1)$ Amortized Update Time Klaus Jansen and Lars Rohwedder. A Quasi-Polynomial Approximation for the Restricted Assignment Problem Prabhanjan Kambadur, Viswanath Nagarajan and Fatemeh Navidi. Adaptive Submodular Ranking
Rebecca Hoberg, Harishchandra Ramadas, Thomas Rothvoss and Xin Yang. Number Balancing is as hard as Minkowski's Theorem and Shortest Vector Rebecca Hoberg and Thomas Rothvoss. An Improved Deterministic Rescaling for Linear Programming Algorithms Stefano Leonardi, Gianpiero Monaco, Piotr Sankowski and Qiang Zhang. Budget Feasible Mechanisms on Matroids
Veerle Timmermans and Tobias Harks. Equilibrium Computation in Atomic Splittable Singleton Congestion Games
Pierre Bonami, Andrea Lodi, Andrea Tramontani and Sven Wiese. Cutting Planes from Wide Split Disjunctions
Danny Nguyen and Igor Pak. Enumeration of integer points in projections of unbounded polyhedra Amitabh Basu, Michele Conforti, Marco Di Summa and Joseph Paat. The structure of the infinite models in integer programming
Gennadiy Averkov, Amitabh Basu and Joseph Paat. Constant factor approximations with families of intersection cuts
Moses Charikar, Neha Gupta and Roy Schwartz. Local Guarantees in Graph Cuts and Clustering Szymon Dudycz, Jan Marcinkowski, Katarzyna Paluch and Bartosz Rybicki. A 4/5 - Approximation Algorithm for the Maximum Traveling Salesman Problem Roberto Cominetti, Jose Correa and Neil Olver. Long term behavior of dynamic equilibria in fluid queuing networks Amitabh Basu, Kipp Martin, Christopher Ryan and Guanyi Wang. Mixed-integer linear representability, disjunctions, and variable elimination
Sharat Ibrahimpur and Chaitanya Swamy. Min-Max Theorems for Packing and Covering Odd $(u,v)$-trails Saba Ahmadi, Samir Khuller, Manish Purohit and Sheng Yang. On Scheduling Co-Flows Daniel Freund, Shane G. Henderson and David B. Shmoys. Minimizing Multimodular Functions and Allocating Capacity in Bike-sharing Systems
Kevin K. H. Cheung, Ambros Gleixner and Daniel E. Steffy. Verifying Integer Programming Results Sylvia Boyd and Andras Sebo. The Salesman's Improved Tours in Fundamental Graphs Miles Lubin, Ilias Zadik and Juan Pablo Vielma. Mixed-integer convex representability
Matthias Koeppe and Yuan Zhou. On the notions of facets, weak facets, and extreme functions of the Gomory-Johnson infinite group problem