| 0 | -- | 0 | Martin Bullinger, René Romen. Online Coalition Formation under Random Arrival or Coalition Dissolution |
| 0 | -- | 0 | Asaf Petruschka, Shay Sapir, Elad Tzalik. Color Fault-Tolerant Spanners |
| 0 | -- | 0 | Fedor V. Fomin, Petr A. Golovach, Danil Sagunov, Kirill Simonov. Tree Containment above Minimum Degree Is FPT |
| 0 | -- | 0 | Loukas Georgiadis, Giuseppe F. Italiano, Evangelos Kosinas. Computing the 4-Edge-Connected Components of a Graph: An Experimental Study |
| 0 | -- | 0 | Iden Kalemaj, Sofya Raskhodnikova, Adam D. Smith 0001, Charalampos E. Tsourakakis. Node-Differentially Private Estimation of the Number of Connected Components |
| 0 | -- | 0 | Pallavi Jain 0001, Lawqueen Kanesh, Fahad Panolan, Souvik Saha 0002, Abhishek Sahu, Saket Saurabh 0001, Anannya Upasana. k-Weight SAT and Max Coverage |
| 0 | -- | 0 | Clément Dallard, Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, Martin Milanic. Computing Tree Decompositions with Small Independence Number |
| 0 | -- | 0 | Yongho Shin, Changyeol Lee, Gukryeol Lee, Hyung-Chan An. Improved Learning-Augmented Algorithms and (Tight) Lower Bounds for Multi-Option Ski Rental Problem |
| 0 | -- | 0 | Matthias Bentert, Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, William Lochet, Fahad Panolan, M. S. Ramanujan 0001, Saket Saurabh 0001, Kirill Simonov. Packing Short Cycles |
| 0 | -- | 0 | Sergio Cabello, Michael Hoffmann 0001, Katharina Klost, Wolfgang Mulzer, Josef Tkadlec. Long Plane Trees |
| 0 | -- | 0 | Fabrizio Grandoni 0001, Chris Schwiegelshohn, Shay Solomon, Amitai Uzrad. Maintaining an EDCS in General Graphs: Simpler, Density-Sensitive and with Worst-Case Time Bounds |
| 0 | -- | 0 | Dustin Cobas, Travis Gagie, Gonzalo Navarro 0001. Fast and Small Subsampled R-indexes |