Samuel Gutekunst, Billy Jin and David Williamson. The Two-Stripe Symmetric Circulant TSP is in P

Sammy Khalife and Amitabh Basu. Neural networks with linear threshold activations: structure and algorithms

Marcel Celaya, Stefan Kuhlmann, Joseph Paat and Robert Weismantel. Improving the Cook et al. Proximity Bound Given Integral Valued Constraints

Thomas Rothvoss and Moritz Venzin. Approximate CVP in time $2^{0.802 n}$ - now in any norm!

Renee Mirka, Devin Smedira and David Williamson. Graph Coloring and Semidefinite Rank

Meike Neuwohner. The Limits of Local Search for Weighted k-Set Packing

Ahmad Abdi, Gérard Cornuéjols, Bertrand Guenin and Levent Tunçel. Total dual dyadicness and dyadic generating sets

Alberto Del Pia and Matthias Walter. Simple odd β-cycle inequalities for binary polynomial optimization

Etienne Bamas, Marina Drygala and Ola Svensson. A Simple LP-Based Approximation Algorithm for the Matching Augmentation Problem

Gennadiy Averkov and Matthias Schymura. On the maximal number of columns of a Δ-modular matrix

Arindam Khan, Aditya Subramanian and Andreas Wiese. A PTAS for the Horizontal Rectangle Stabbing Problem

Rohan Ghuge, Anupam Gupta and Viswanath Nagarajan. Non-Adaptive Stochastic Score Classification and Explainable Halfspace Evaluation

Pranav Nuti. The Secretary Problem with Distributions

Zachary Friggstad, Ramin Mousavi, Mirmahdi Rahgoshay and Mohammad R. Salavatipour. Improved Approximations for Capacitated Vehicle Routing with Unsplittable Client Demands

Eric Balkanski, Yuri Faenza and Mathieu Kubik. The Simultaneous Semi-Random Model for TSP

Rui Chen and James Luedtke. Sparse Multi-Term Disjunctive Cuts for the Epigraph of a Function of Binary Variables

Benjamin Moseley, Kirk Pruhs, Clifford Stein and Rudy Zhou. A Competitive Algorithm for Throughout Maximization on Identical Machines

Martin Drees. Intersecting and dense restrictions of clutters in polynomial time

Calvin Beideman, Karthekeyan Chandrasekaran, Danupon Nanongkai and Sagnik Mukhopadhyay. Faster Connectivity in Low-rank Hypergraphs via Expander Decomposition

Dimitris Fotakis, Jannik Matuschke and Vasileios-Orestis Papadigenopoulos. Generalized Malleable Scheduling under $M^\natural$-Concave Processing Speeds

Markus Ahrens, Dorothee Henke, Stefan Rabenstein and Jens Vygen. Faster Goal-Oriented Shortest Path Search for Bulk and Incremental Detailed Routing

José Correa, Andrés Cristi, Andrés Fielbaum, Tristan Pollner and S. Matthew Weinberg. Optimal item pricing in online combinatorial auctions

Vincent Cohen-Addad, Tobias Mömke and Victor Verdugo. A 2-Approximation for the Bounded Treewidth Sparsest Cut Problem in FPT Time

Lukas Mayrhofer, Jamico Schade and Stefan Weltge. Lattice-free simplices with lattice width 2d - o(d)

Elisabeth Gaar, Jon Lee, Ivana Ljubic, Markus Sinnl and Kübra Taninmis Ersüs. SOCP-based disjunctive cuts for a class of integer nonlinear bilevel programs

Alberto Del Pia, Jeff Linderoth and Haoran Zhu. On the Complexity of Separation From the Knapsack Polytope

Daniel Dadush, Zhuan Khye Koh, Bento Natura and László A. Végh. On circuit diameter bounds via circuit imbalances

Maximilian Gläser and Marc Pfetsch. On the Complexity of Finding Shortest Variable Disjunction Branch-and-Bound Proofs

Anupam Gupta, Euiwoong Lee, Jason Li, Marcin Mucha, Heather Newman and Sherry Sarkar. Matroid-Based TSP Rounding for Half-Integral Solutions

Sina Dezfuli, Zachary Friggstad, Ian Post and Chaitanya Swamy. Combinatorial algorithms for rooted prize-collecting walks and applications to orienteering and minimum-latency problems.

Daniel Dadush, Christopher Hojny, Sophie Huiberts and Stefan Weltge. A Simple Method for Convex Optimization in the Oracle Model

Aleksandr M. Kazachkov, Pierre Le Bodic and Sriram Sankaranarayanan. An Abstract Model for Branch-and-Cut

Omar El Housni, Vineet Goyal and Ayoub Foussoul. LP-based Approximations for Disjoint Bilinear and Two-Stage Adjustable Robust Optimization.