Abstract is missing.
- Total Dual Dyadicness and Dyadic Generating SetsAhmad Abdi, Gérard Cornuéjols, Bertrand Guenin, Levent Tunçel. 1-14 [doi]
- Faster Goal-Oriented Shortest Path Search for Bulk and Incremental Detailed RoutingMarkus Ahrens, Dorothee Henke, Stefan Rabenstein, Jens Vygen. 15-28 [doi]
- On the Maximal Number of Columns of a $\varDelta $-modular MatrixGennadiy Averkov, Matthias Schymura. 29-42 [doi]
- The Simultaneous Semi-random Model for TSPEric Balkanski, Yuri Faenza, Mathieu Kubik. 43-56 [doi]
- A Simple LP-Based Approximation Algorithm for the Matching Augmentation ProblemÉtienne Bamas, Marina Drygala, Ola Svensson. 57-69 [doi]
- Faster Connectivity in Low-Rank Hypergraphs via Expander DecompositionCalvin Beideman, Karthekeyan Chandrasekaran, Sagnik Mukhopadhyay, Danupon Nanongkai. 70-83 [doi]
- Improving the Cook et al. Proximity Bound Given Integral Valued ConstraintsMarcel Celaya, Stefan Kuhlmann, Joseph Paat, Robert Weismantel. 84-97 [doi]
- Sparse Multi-term Disjunctive Cuts for the Epigraph of a Function of Binary VariablesRui Chen, James R. Luedtke. 98-111 [doi]
- A 2-Approximation for the Bounded Treewidth Sparsest Cut Problem in FPT TimeVincent Cohen-Addad, Tobias Mömke, Victor Verdugo. 112-125 [doi]
- Optimal Item Pricing in Online Combinatorial AuctionsJosé R. Correa, Andrés Cristi, Andrés Fielbaum, Tristan Pollner, S. Matthew Weinberg. 126-139 [doi]
- On Circuit Diameter Bounds via Circuit ImbalancesDaniel Dadush, Zhuan Khye Koh, Bento Natura, László A. Végh. 140-153 [doi]
- A Simple Method for Convex Optimization in the Oracle ModelDaniel Dadush, Christopher Hojny, Sophie Huiberts, Stefan Weltge. 154-167 [doi]
- On the Complexity of Separation from the Knapsack PolytopeAlberto Del Pia, Jeff T. Linderoth, Haoran Zhu. 168-180 [doi]
- Simple Odd β-Cycle Inequalities for Binary Polynomial OptimizationAlberto Del Pia, Matthias Walter. 181-194 [doi]
- Combinatorial Algorithms for Rooted Prize-Collecting Walks and Applications to Orienteering and Minimum-Latency ProblemsSina Dezfuli, Zachary Friggstad, Ian Post, Chaitanya Swamy. 195-209 [doi]
- Intersecting and Dense Restrictions of Clutters in Polynomial TimeMartin Drees. 210-222 [doi]
- LP-Based Approximations for Disjoint Bilinear and Two-Stage Adjustable Robust OptimizationOmar El Housni, Ayoub Foussoul, Vineet Goyal. 223-236 [doi]
- A Constant-Factor Approximation for Generalized Malleable Scheduling Under $M^\natural $-Concave Processing SpeedsDimitris Fotakis 0001, Jannik Matuschke, Orestis Papadigenopoulos. 237-250 [doi]
- Improved Approximations for Capacitated Vehicle Routing with Unsplittable Client DemandsZachary Friggstad, Ramin Mousavi, Mirmahdi Rahgoshay, Mohammad R. Salavatipour. 251-261 [doi]
- SOCP-Based Disjunctive Cuts for a Class of Integer Nonlinear Bilevel ProgramsElisabeth Gaar, Jon Lee 0001, Ivana Ljubic, Markus Sinnl, Kübra Taninmis. 262-276 [doi]
- Non-adaptive Stochastic Score Classification and Explainable Halfspace EvaluationRohan Ghuge, Anupam Gupta 0001, Viswanath Nagarajan. 277-290 [doi]
- On the Complexity of Finding Shortest Variable Disjunction Branch-and-Bound ProofsMax Gläser, Marc E. Pfetsch. 291-304 [doi]
- Matroid-Based TSP Rounding for Half-Integral SolutionsAnupam Gupta 0001, Euiwoong Lee, Jason Li 0006, Marcin Mucha, Heather Newman, Sherry Sarkar. 305-318 [doi]
- The Two-Stripe Symmetric Circulant TSP is in PSamuel C. Gutekunst, Billy Jin, David P. Williamson. 319-332 [doi]
- An Abstract Model for Branch-and-CutAleksandr M. Kazachkov, Pierre Le Bodic, Sriram Sankaranarayanan 0002. 333-346 [doi]
- Neural Networks with Linear Threshold Activations: Structure and AlgorithmsSammy Khalife, Amitabh Basu. 347-360 [doi]
- A PTAS for the Horizontal Rectangle Stabbing ProblemArindam Khan 0001, Aditya Subramanian, Andreas Wiese. 361-374 [doi]
- Lattice-Free Simplices with Lattice Width 2d - o(d)Lukas Mayrhofer, Jamico Schade, Stefan Weltge. 375-386 [doi]
- Graph Coloring and Semidefinite RankRenee Mirka, Devin Smedira, David P. Williamson. 387-401 [doi]
- A Competitive Algorithm for Throughput Maximization on Identical MachinesBenjamin Moseley, Kirk Pruhs, Clifford Stein 0001, Rudy Zhou. 402-414 [doi]
- The Limits of Local Search for Weighted k-Set PackingMeike Neuwohner. 415-428 [doi]
- The Secretary Problem with DistributionsPranav Nuti. 429-439 [doi]
- 0.802 n - Now in Any Norm!Thomas Rothvoss, Moritz Venzin. 440-453 [doi]