| 2529 | -- | 2553 | Vlady Ravelomanana, Ny Aina Andriambolamalala. Transmitting Once to Elect a Leader on Wireless Networks |
| 2554 | -- | 2579 | Balagopal Komarath, Anurag Pandey 0001, Chengot Sankaramenon Rahul. Monotone Arithmetic Complexity of Graph Homomorphism Polynomials |
| 2580 | -- | 2604 | Barnaby Martin, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen. Induced Disjoint Paths and Connected Subgraphs for H-Free Graphs |
| 2605 | -- | 2666 | Walter Didimo, Michael Kaufmann 0001, Giuseppe Liotta, Giacomo Ortali. Computing Bend-Minimum Orthogonal Drawings of Plane Series-Parallel Graphs in Linear Time |
| 2667 | -- | 2692 | Patrizio Angelini, Michael A. Bekos, Henry Förster, Martin Gronemann. Bitonic st-Orderings for Upward Planar Graphs: Splits and Bends in the Variable Embedding Scenario |
| 2693 | -- | 2734 | Amey Bhangale, Aleksa Stankovic. Max-3-Lin Over Non-abelian Groups with Universal Factor Graphs |
| 2735 | -- | 2778 | Arindam Khan 0001, Eklavya Sharma. Tight Approximation Algorithms for Geometric Bin Packing with Skewed Items |
| 2779 | -- | 2816 | Nicolas Bousquet, Takehiro Ito, Yusuke Kobayashi 0001, Haruka Mizuta, Paul Ouvrard, Akira Suzuki, Kunihiro Wasa. Reconfiguration of Spanning Trees with Degree Constraints or Diameter Constraints |
| 2817 | -- | 2842 | Sotiris E. Nikoletseas, Christoforos L. Raptopoulos, Paul G. Spirakis. MAX CUT in Weighted Random Intersection Graphs and Discrepancy of Sparse Random Set Systems |
| 2843 | -- | 2884 | Shunhua Jiang, Bento Natura, Omri Weinstein. A Faster Interior-Point Method for Sum-of-Squares Optimization |
| 2885 | -- | 2921 | Matteo Castiglioni, Andrea Celli, Nicola Gatti 0001. Public Bayesian Persuasion: Being Almost Optimal and Almost Persuasive |