| 20 | -- | 0 | Alexander Dobler, Martin Nöllenburg. Block Crossings in One-Sided Tanglegrams |
| 21 | -- | 0 | Sharmila Duppala, George Z. Li, Juan Luque, Aravind Srinivasan, Renata Valieva. Concentration of Submodular Functions and Read-k Families Under Negative Dependence |
| 22 | -- | 0 | Gabriel Ponte, Marcia Fampa, Jon Lee 0001. Convex relaxation for the generalized maximum-entropy sampling problem |
| 23 | -- | 0 | Vijay V. Vazirani. Towards a Practical, Budget-Oblivious Algorithm for the Adwords Problem Under Small Bids |
| 24 | -- | 0 | Stéphane Devismes, Yoann Dieudonné, Arnaud Labourel. Graph Exploration: The Impact of a Distance Constraint |
| 25 | -- | 0 | Daniel Hathcock, Guy Kortsarz, R. Ravi 0001. The Telephone k-Multicast Problem |
| 26 | -- | 0 | Théo Boury, Laurent Bulteau, Bertrand Marchand, Yann Ponty. Bipartite Independent Set Reconfiguration: General and RNA-Inspired Parameterized Algorithms |
| 27 | -- | 0 | Carlos Alegría, Ioannis Mantas, Evanthia Papadopoulou, Marko Savic, Carlos Seara, Martin Suderland. The Voronoi Diagram of Rotating Rays with Applications to Floodlight Illumination |
| 28 | -- | 0 | Dominique Attali, André Lieutier. 1-Norm Minimization |
| 29 | -- | 0 | Vikraman Arvind, Roman Nedela, Ilia Ponomarenko, Peter Zeman 0001. Testing Isomorphism of Chordal Graphs of Bounded Leafage is Fixed-Parameter Tractable |
| 30 | -- | 0 | Telikepalli Kavitha. Max-Utility Matchings with Popularity via Critical Vertices |
| 31 | -- | 0 | Ildikó Schlotter. Shortest Two Disjoint Paths in Conservative Graphs |
| 32 | -- | 0 | Duc-Cuong Dang, Per Kristian Lehre. The SLO Hierarchy of Pseudo-Boolean Functions and Runtime of Evolutionary Algorithms |
| 33 | -- | 0 | Suryendu Dalal, Rahul Gangopadhyay, Rajiv Raman 0001, Saurabh Ray. Sweeping Arrangements of Non-Piercing Regions in the Plane |
| 34 | -- | 0 | Zachary Friggstad, Mahya Jamshidian. Approximation Algorithms for Clustering with Minimum Sum of Radii, Diameters, and Squared Radii |
| 35 | -- | 0 | Feodor F. Dragan, Guillaume Ducoffe , Michel Habib, Laurent Viennot. Correction: Certificates in P and Subquadratic-Time Computation of Radius, Diameter, and all Eccentricities in Graphs |