Abstract is missing.
- The Two-Point Fano and Ideal Binary CluttersAhmad Abdi, Bertrand Guenin. 1-12 [doi]
- On Scheduling Coflows - (Extended Abstract)Saba Ahmadi, Samir Khuller, Manish Purohit, Sheng Yang. 13-24 [doi]
- Integrality Gaps of Integer Knapsack ProblemsIskander Aliev, Martin Henk, Timm Oertel. 25-38 [doi]
- An Improved Integrality Gap for the Călinescu-Karloff-Rabani Relaxation for Multiway CutHaris Angelidakis, Yury Makarychev, Pasin Manurangsi. 39-50 [doi]
- Approximation of Corner Polyhedra with Families of Intersection CutsGennadiy Averkov, Amitabh Basu, Joseph Paat. 51-62 [doi]
- The Structure of the Infinite Models in Integer ProgrammingAmitabh Basu, Michele Conforti, Marco Di Summa, Joseph Paat. 63-74 [doi]
- Mixed-Integer Linear Representability, Disjunctions, and Variable EliminationAmitabh Basu, R. Kipp Martin, Christopher Thomas Ryan, Guanyi Wang. 75-85 [doi]
- Deterministic Fully Dynamic Approximate Vertex Cover and Fractional Matching in O(1) Amortized Update TimeSayan Bhattacharya, Deeparnab Chakrabarty, Monika Henzinger. 86-98 [doi]
- Cutting Planes from Wide Split DisjunctionsPierre Bonami, Andrea Lodi 0001, Andrea Tramontani, Sven Wiese. 99-110 [doi]
- The Saleman's Improved Tours for Fundamental ClassesSylvia C. Boyd, András Sebö. 111-122 [doi]
- The Heterogeneous Capacitated k-Center ProblemDeeparnab Chakrabarty, Ravishankar Krishnaswamy, Amit Kumar 0001. 123-135 [doi]
- Local Guarantees in Graph Cuts and ClusteringMoses Charikar, Neha Gupta, Roy Schwartz. 136-147 [doi]
- Verifying Integer Programming ResultsKevin K. H. Cheung, Ambros M. Gleixner, Daniel E. Steffy. 148-160 [doi]
- Long Term Behavior of Dynamic Equilibria in Fluid Queuing NetworksRoberto Cominetti, José R. Correa, Neil Olver. 161-172 [doi]
- A 4/5 - Approximation Algorithm for the Maximum Traveling Salesman ProblemSzymon Dudycz, Jan Marcinkowski, Katarzyna E. Paluch, Bartosz Rybicki. 173-185 [doi]
- Minimizing Multimodular Functions and Allocating Capacity in Bike-Sharing SystemsDaniel Freund 0001, Shane G. Henderson, David B. Shmoys. 186-198 [doi]
- Compact, Provably-Good LPs for Orienteering and Regret-Bounded Vehicle RoutingZachary Friggstad, Chaitanya Swamy. 199-211 [doi]
- Discrete Newton's Algorithm for Parametric Submodular Function MinimizationMichel X. Goemans, Swati Gupta, Patrick Jaillet. 212-227 [doi]
- Stochastic Online Scheduling on Unrelated MachinesVarun Gupta, Benjamin Moseley, Marc Uetz, Qiaomin Xie. 228-240 [doi]
- Online Matroid Intersection: Beating Half for Random ArrivalGuru Prashanth Guruganesh, Sahil Singla. 241-253 [doi]
- Number Balancing is as Hard as Minkowski's Theorem and Shortest VectorRebecca Hoberg, Harishchandra Ramadas, Thomas Rothvoss, Xin Yang. 254-266 [doi]
- An Improved Deterministic Rescaling for Linear Programming AlgorithmsRebecca Hoberg, Thomas Rothvoss. 267-278 [doi]
- Min-Max Theorems for Packing and Covering Odd (u, v)-trailsSharat Ibrahimpur, Chaitanya Swamy. 279-291 [doi]
- Breaking 1 - 1/e Barrier for Non-preemptive Throughput MaximizationSungjin Im, Shi Li, Benjamin Moseley. 292-304 [doi]
- A Quasi-Polynomial Approximation for the Restricted Assignment ProblemKlaus Jansen, Lars Rohwedder. 305-316 [doi]
- Adaptive Submodular RankingPrabhanjan Kambadur, Viswanath Nagarajan, Fatemeh Navidi. 317-329 [doi]
- On the Notions of Facets, Weak Facets, and Extreme Functions of the Gomory-Johnson Infinite Group ProblemMatthias Köppe, Yuan Zhou. 330-342 [doi]
- Minimum Birkhoff-von Neumann DecompositionJanardhan Kulkarni, Euiwoong Lee, Mohit Singh. 343-354 [doi]
- Maximum Matching in the Online Batch-Arrival ModelEuiwoong Lee, Sahil Singla. 355-367 [doi]
- Budget Feasible Mechanisms on MatroidsStefano Leonardi, Gianpiero Monaco, Piotr Sankowski, Qiang Zhang. 368-379 [doi]
- Deterministic Discrepancy Minimization via the Multiplicative Weight Update MethodAvi Levy, Harishchandra Ramadas, Thomas Rothvoss. 380-391 [doi]
- Mixed-Integer Convex RepresentabilityMiles Lubin, Ilias Zadik, Juan Pablo Vielma. 392-404 [doi]
- High Degree Sum of Squares Proofs, Bienstock-Zuckerberg Hierarchy and CG CutsMonaldo Mastrolilli. 405-416 [doi]
- Enumeration of Integer Points in Projections of Unbounded PolyhedraDanny Nguyen, Igor Pak. 417-429 [doi]
- Excluded t-Factors in Bipartite Graphs: A Unified Framework for Nonbipartite Matchings and Restricted 2-MatchingsKenjiro Takazawa. 430-441 [doi]
- Equilibrium Computation in Atomic Splittable Singleton Congestion GamesTobias Harks, Veerle Timmermans. 442-454 [doi]