Accepted Papers

  • Kristóf Bérczi , Vasilis Livanos , José Soto and Victor Verdugo . Matroid Secretary via Labeling Schemes
  • Christoph Grüne and Lasse Wulf . Completeness in the Polynomial Hierarchy for many natural Problems in Bilevel and Robust Optimization
  • 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
  • Rolf van der Hulst and Matthias Walter. Implied Integrality in Mixed-Integer Optimization
  • Alexander Black . Exponential Lower Bounds for Many Pivot Rules for the Simplex Method
  • Yuval Filmus, Roy Schwartz and Alexander Smal. Separating Coverage and Submodular: Maximization Subject to a Cardinality Constraint
  • Parinya Chalermsook and Chien-Ching Huang . Approximate Cut and Packing Ratios for Multi-Commodity Arborescences
  • Lars Rohwedder and Karol Węgrzycki. Space-Efficient Algorithm for Integer Programming with Few Constraints
  • Andrés Cristi and David Salas . Reducing the Large Set Threshold for Oertel’s Conjecture on the Mixed-Integer Volume
  • Sander Borst , Danish Kashaev and Zhuan Khye Koh . Online Matching on 3-Uniform Hypergraphs
  • Alexander Armbruster, Fabrizio Grandoni, Edin Husic, Antoine Tinguely and Andreas Wiese. On the Approximability of Unsplittable Flow on a Path with Time Windows
  • Max Klimm and Martin Knaack. Generalized Assignment and Knapsack Problems in the Random-Order Model
  • Jarosław Byrka , Fabrizio Grandoni and Vera Traub . On the Bidirected Cut Relaxation for Steiner Forest
  • 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
  • Sayan Bandyapadhyay, Tianzhi Chen, Zachary Friggstad and Mahya Jamshidian. A Constant-Factor Approximation for Pairwise Fair k-Center Clustering
  • Yann Disser and Nils Mosis. An unconditional lower bound for the active-set method on the hypercube
  • Yongchun Li . The Augmented Factorization Bound for Maximum-Entropy Sampling
  • Christopher En and Yuri Faenza . Non-distributive Lattices, Stable Matchings, and Linear Optimization
  • Mohammed Majthoub Almoghrabi, Martin Skutella and Philipp Warode. Integer and Unsplittable Multiflows in Series-Parallel Digraphs
  • Matteo Cacciola, Alexandre Forel , Antonio Frangioni and Andrea Lodi . The Differentiable Feasibility Pump
  • Diego Cifuentes, Santanu Dey and Jingye Xu. Lagrangian dual with zero duality gap that admits decomposition
  • Christoph Hunkenschröder, Martin Koutecký , Asaf Levin and Tung Anh Vu . (Near)-Optimal Algorithms for Sparse Separable Convex Integer Programs
  • Blake Harris, Viswanath Nagarajan and Rayen Tan. Sequential Testing with Subadditive Costs
  • Pascal Börner, Max Klimm , Annette Lutz, Marc Pfetsch, Martin Skutella and Lea Strubberg . Valid Cuts for the Design of Potential-based Flow Networks
  • Ishan Bansal. A Global Analysis of the Primal-Dual Method for Edge Augmentation Problems
  • Venkatesan Guruswami and Hsin-Po Wang . Semirandom Planted Clique via 1-norm Isometry Property
  • Jason Li and Owen Li. A Simple and Fast Algorithm for Fair Cuts
  • Nikhil Kumar and David Aleman-Espinosa. Unsplittable Multicommodity Flows in Outerplanar Graphs
  • Stefan Kober. Totally Δ-modular IPs with two non-zeros in most rows
  • Suho Kang, Ziyang Liu and Rajan Udwani. A Black-box Approach for Exogenous Replenishment in Online Resource Allocation
  • Sharat Ibrahimpur and László A. Végh . An O(log n)-Approximation Algorithm for (p,q)-Flexible Graph Connectivity via Independent Rounding

Accepted Posters

  • Yann Disser, Max Klimm, Annette Lutz, Lea Strubberg. Incremental-Decremental Maximization
  • Anouk Brose, Jesus De Loera, Antonio Torres, Gyivan Lopez-Campos. Lattice Diameters of Lattice Polygons
  • Arturo Ortiz San Miguel. The d-regular graph on n vertices with the most k-cycles
  • Barbara Fiedorowicz. Identifying Damaged Edges for General Partite Graphs Modeling Resistive Electrical Networks
  • Boyang Han, Aleksandr M. Kazachkov. An Extended Abstract Branch-and-Cut Model to Compare Parameterized Cutting and Branching Behavior
  • Jesus De Loera, Brittney Marsters, Christopher O’Neill. The Arithmetic Width of Convex Bodies
  • Dominic Yang, Miles Bakenhus, and Sven Leyffer. A Graver Augmentation Algorithm for Constrained Total Variation-Regularized Integer Programs
  • Francis Mouozie, Pilhwa Lee. Discrete Multi-task Learning optimization, on Wasserstein space: A combinatorial perspective
  • Gonzalo Gomez Abejon. Compact MIP relaxations of the Optimal Power Flow Problem
  • Hongyu Cheng, Amitabh Basu. Generalization Guarantees for Learning Branch-and-Cut Heuristics
  • Longe Idowu O., Pilhwa Lee. Liouville PDE-Based Sliced-Wasserstein Flows on Cartan-Hadamard Manifolds: A Theoretical Framework for Optimal Transport on SPD Matrices
  • Matthias Koppe, Matthias Walter, Luze Xu. SageMath Interface for Seymour Decomposition of Totally Unimodular Matrices
  • Mikolaj Cuszynski-Kruk. Broadcasting Multiple Messages in Odd Cycles and Wheel Graphs
  • Rohan Bansal. Totally Symmetric Self-Complementary Plane Partitions and Magog Matrices
  • Sergey Gusev, David E. Bernal Neira. Exact Hull Reformulation for Quadratically Constrained Generalized Disjunctive Programs
  • Siyue Liu. Minimum Cost Nowhere-Zero Flows and Cut-Balanced Orientations
  • Srikar Venkataraman Srinivas, Yuan Yuan Lee, and Rajiv Paudel. An Agent-Based Model and Mixed Integer Linear Optimization Approach for EV Battery Adoption and Recycling in the United States
  • Sina Bagheri Nezhad, Sayan Bandyapadhyay, Tianzhi Chen. Constant-Approximation Algorithms for Fair Sum-of-Radii Clustering
  • Toshiaki Yamanaka. Improved Integrality Gap for Half-Integral Degree Cuts of the TSP