Program

Wednesday June 11

  • 8 – 8:45: Registration and Breakfast
  • 8:45 – 9: Opening Remarks
  • 9 – 10:30:
    • Lars Rohwedder and Karol Węgrzycki. Space-Efficient Algorithm for Integer Programming with Few Constraints
    • Christoph Hunkenschröder, Martin Koutecký, Asaf Levin and Tung Anh Vu. (Near)-Optimal Algorithms for Sparse Separable Convex Integer Programs
    • Stefan Kober. Totally Δ-modular IPs with two non-zeros in most rows
  • 10:30 – 11: Coffee break
  • 11 – 12:30:
    • Mohammed Majthoub Almoghrabi, Martin Skutella and Philipp Warode. Integer and Unsplittable Multiflows in Series-Parallel Digraphs
    • Nikhil Kumar and David Aleman-Espinosa. Unsplittable Multicommodity Flows in Outerplanar Graphs
    • Alexander Armbruster, Fabrizio Grandoni, Edin Husic, Antoine Tinguely and Andreas Wiese. On the Approximability of Unsplittable Flow on a Path with Time Windows
  • 12:30 – 2: Lunch break
  • 2 – 3:30:
    • Max Klimm and Martin Knaack. Generalized Assignment and Knapsack Problems in the Random-Order Model
    • Sander Borst, Danish Kashaev and Zhuan Khye Koh. Online Matching on 3-Uniform Hypergraphs
    • Suho Kang, Ziyang Liu and Rajan Udwani. A Black-box Approach for Exogenous Replenishment in Online Resource Allocation
  • 3:30 — 4: Coffee break
  • 4 – 5:30:
    • Matteo Cacciola, Alexandre Forel, Antonio Frangioni and Andrea Lodi. The Differentiable Feasibility Pump
    • Pascal Börner, Max Klimm, Annette Lutz, Marc Pfetsch, Martin Skutella and Lea Strubberg. Valid Cuts for the Design of Potential-based Flow Networks
    • Yongchun Li. The Augmented Factorization Bound for Maximum-Entropy Sampling
  • 6 – 8: Poster session and conference reception

Thursday June 12

  • 8:30 – 9: Breakfast
  • 9 – 10:30:
    • Jarosław Byrka, Fabrizio Grandoni and Vera Traub. On the Bidirected Cut Relaxation for Steiner Forest
    • Parinya Chalermsook and Chien-Chung Huang. Approximate Cut and Packing Ratios for Multi-Commodity Arborescences
    • Sharat Ibrahimpur and László A. Végh. An O(log n)-Approximation Algorithm for (p,q)-Flexible Graph Connectivity via Independent Rounding
  • 10:30 – 11: Coffee break
  • 11 – 12:30:
    • Stefan Kuhlmann, Timm Oertel and Robert Weismantel. Sparse Approximation in Lattices and Semigroups
    • Ahmad Abdi, Gerard Cornuejols, Siyue Liu and Olha Silina. Strongly connected orientations and integer lattices
    • Andrés Cristi and David Salas. Reducing the Large Set Threshold for Oertel’s Conjecture on the Mixed-Integer Volume
  • 12:30 – 2: Lunch break
  • 2 – 3:30:
    • Christopher En and Yuri Faenza. Non-distributive Lattices, Stable Matchings, and Linear Optimization
    • Alexander Black. Exponential Lower Bounds for Many Pivot Rules for the Simplex Method
    • Yann Disser and Nils Mosis. An unconditional lower bound for the active-set method on the hypercube
  • 3:30 — 4: Coffee break
  • 4 – 5:30:
    • Yuval Filmus, Roy Schwartz and Alexander Smal. Separating Coverage and Submodular: Maximization Subject to a Cardinality Constraint
    • Ali Ahmadi, Iman Gholami, Mohammadtaghi Hajiaghayi, Peyman Jabbarzade and Mohammad Mahdavi.
    • Prize-Collecting Forest with Submodular Penalties: Improved Approximation
    • Richard Bi, Karthekeyan Chandrasekaran and Soham Joshi. Monotone Submodular Multiway Partition
  • 7 – 9pm: Conference dinner cruise (boarding time: 6:30pm)

Friday June 13

  • 8:30 – 9: Breakfast
  • 9 – 10:30:
    • Christoph Grüne and Lasse Wulf. Completeness in the Polynomial Hierarchy for many natural problems in Bilevel and Robust Optimization
    • Rolf van der Hulst and Matthias Walter. Implied Integrality in Mixed-Integer Optimization
    • Diego Cifuentes, Santanu Dey and Jingye Xu. Lagrangian dual with zero duality gap that admits decomposition
  • 10:30 – 11: Coffee break
  • 11 – 12:30:
    • Sayan Bandyapadhyay, Tianzhi Chen, Zachary Friggstad and Mahya Jamshidian. A Constant-Factor Approximation for Pairwise Fair k-Center Clustering
    • Ishan Bansal. A Global Analysis of the Primal-Dual Method for Edge Augmentation Problems
    • Jason Li and Owen Li. A Simple and Fast Algorithm for Fair Cuts
  • 12:30 – 1: Lunch break
  • 2 – 3:30:
    • Kristóf Bérczi, Vasilis Livanos, José Soto and Victor Verdugo. Matroid Secretary via Labeling Schemes
    • Blake Harris, Viswanath Nagarajan and Rayen Tan. Sequential Testing with Subadditive Costs
    • Venkatesan Guruswami and Hsin-Po Wang. Semirandom Planted Clique via 1-norm Isometry Property