Nikhil Ayyadevara, Ashish Chiplunkar and Amatya Sharma
A Decomposition Approach to the Weighted k-Server Problem

Yinfeng Zhu
A quadratic upper bound on the reset thresholds of synchronizing automata containing a transitive permutation group

Dylan Bellier, Massimo Benerecetti, Fabio Mogavero and Sophie Pinchinat
Plan Logic

Anand Louis, Alantha Newman and Arka Ray
Improved linearly ordered colorings of hypergraphs via SDP rounding

L. Sunil Chandran, Rishikesh Gajjala, Shravan Mehra and Saladi Rahul
Two Results on LPT: A Near-Linear Time Algorithm and Parcel Delivery using Drones

Sujoy Kumar Bhore, Sarfaraz Equbal and Rohit Gurjar
Geometric Bipartite Matching is in NC

Bernd Finkbeiner, Felix Jahn and Julian Siber
Counterfactual Explanations for MITL Violations

Damien Busatto-Gaston, Youssouf Oualhadj, Léo Tible and Daniele Varacca
Promptness and fairness in Muller LTL formulas

Karthik Gajulapalli, Zeyong Li and Ilya Volkovich
Oblivious Classes Revisited: Lower Bounds and Hierarchies

Markus Bläser, Julian Dörfler and Gorav Jindal
PosSLP and Sum of Squares

Vishwas Bhargava and Anamay Tengse
Explicit Commutative ROABPs from Partial Derivatives

Johan Arcile, Étienne André and Engel Lefaucheux
Execution-time opacity problems in one-clock parametric timed automata

Deeparnab Chakrabarty and Hang Liao
Learning Partitions using Rank Queries

Benoit Barbot, Patricia Bouyer and Serge Haddad
Beyond Decisiveness of Infinite Markov Chains

Alberto Bombardelli, Laura Bozzelli, Cesar Sanchez and Stefano Tonetta
Unifying Asynchronous Logics for Hyperproperties

Christian Konrad, Andrew McGregor, Rik Sengupta and Cuong Than
Matchings in Low-Arboricity Graphs in the Dynamic Graph Stream Model

Aritra Banik, Sayani Das, Anil Maheshwari, Bubai Manna, Subhas C Nandy, Krishna Priya K M, Bodhayan Roy, Sasanka Roy and Abhishek Sahu
Minimum Consistent Subset in Trees and Interval Graphs

Nathaniel Harms and Artur Riazanov
Better Boosting of Communication Oracles, or Not

Ali Asadi, Krishnendu Chatterjee, Raimundo Saona and Jakub Svoboda
Concurrent Stochastic Games with Stateful-discounted and Parity Objectives: Complexity and Algorithms

Sravanthi Chede, Leroy Chew and Anil Shukla
Circuits, Proofs and Propositional Model Counting

Christian Komusiewicz and Jannik Schestag
Maximizing Phylogenetic Diversity under Ecological Constraints: A Parameterized Complexity Study

Pierre Popoli, Jeffrey Shallit and Manon Stipulanti
Additive word complexity and Walnut

Shanthanu Rai
Pseudo-Deterministic Construction of Irreducible Polynomials over Finite Fields

Vikraman Arvind, Samir Datta, Asif Khan, Shivdutt Sharma, Yadu Vasudev and Shankar Ram Vasudevan
The Parallel Dynamic Complexity of the Abelian Cayley Group Membership Problem

Arindam Khan, Aditya Subramanian, Tobias Widmann and Andreas Wiese
On Approximation Schemes for Stabbing Rectilinear Polygons

Rogers Mathew, Fahad Panolan and Seshikanth Varma
Parameterized Algorithms and Hardness for the Maximum Edge q-Coloring problem

Sushmita Gupta, Tanmay Inamdar, Pallavi Jain, Daniel Lokshtanov, Fahad Panolan and Saket Saurabh
When far is better: The Chamberlin-Courant approach to obnoxious committee selection

Sudatta Bhattacharya, Sanjana Dey, Elazar Goldenberg and Michal Koucky
The Many Flavors of Edit Distance

Kyveli Doveri, Pierre Ganty and B Srivathsan
A Myhill-Nerode style Characterization for Timed Automata With Integer Resets

Furio Honsell, Marina Lenisa and Ivan Scagnetto
Two Views on Unification: Terms as Strategies

Bireswar Das, Jinia Ghosh and Anant Kumar
The Isomorphism Problem of Power Graphs and a Question of Cameron

Arjan Cornelissen, Nikhil Mande and Subhasree Patro
Quantum sabotage complexity