Arghya Chakraborty and Rahul Vaze
Online facility location with weights and congestion

Jishnu Roychoudhury and Jatin Yadav
An optimal algorithm for sorting in trees

R. Krithika, Kutty Malu V K, Roohani Sharma and Prafullkumar Tale
Parameterized Complexity of Biclique Contraction and Balanced Biclique Contraction

Pranav Bisht, Nikhil Gupta and Ilya Volkovich
Towards Identity Testing for Sums of Products of Read-Once and Multilinear Bounded-Read Formulae

Eugene Asarin, Aldric Degorre, Catalin Dima and Bernardo Jacobo Inclán
Bandwidth of Timed Automata: 3 Classes

Prerona Chatterjee, Kshitij Gajjar and Anamay Tengse
Monotone Classes Beyond VNP

Diptarka Chakraborty and Yan Hong Yao Alvin
Approximate Maximum Rank Aggregation: Beyond the Worst-Case

Léo Henry, Blaise Genest and Alexandre Drewery
Reinforcement Planning for effective epsilon-optimal policies in dense time with discontinuities

Harmender Gahlawat and Meirav Zehavi
Parameterized Complexity of Incomplete Connected Fair Division

Chris Köcher and Georg Zetzsche
Regular Separators for VASS Coverability Languages

Dmitry Chistikov, Wojciech Czerwiński, Piotr Hofman, Filip Mazowiecki and Henry Sinclair-Banks
Acyclic Petri and Workflow Nets with Resets

Mihir Vahanwala
Robust Positivity Problems for Linear Recurrence Sequences

Aniket Murhekar and Eklavya Sharma
Nash Equilibria of Two-Player Matrix Games Repeated Until Collision

Shaull Almagor, Daniel Assa and Udi Boker
Synchronized CTL over One-Counter Automata

Dietrich Kuske
A class of rational trace relations closed under composition

Vijay Vazirani
Towards a Practical, Budget-Oblivious Algorithm for the Adwords Problem under Small Bids

Wojciech Czerwinski, Maciej Debski, Tomasz Gogasz, Gordon Hoi, Sanjay Jain, Michal Skrzypczak, Frank Stephan and Christopher Tan
Languages given by Finite Automata over the Unary Alphabet

Andrej Bogdanov, Krishnamoorthy Dinesh, Yuval Filmus, Yuval Ishai, Avi Kaplan and Sruthi Sekar
Bounded Simultaneous Messages

Jacques Dark, Adithya Diddapur and Christian Konrad
Interval Selection in Data Streams: Weighted Intervals and the Insertion-deletion Setting

Amir Abboud, Seri Khoury, Oree Leibowitz and Ron Safier
Listing 4-Cycles

Yoav Feinstein and Orna Kupferman
Monotonicity Characterizations of Regular Languages

Rahul Chugh, Supartha Podder and Swagato Sanyal
Decision Tree Complexity versus Block Sensitivity and Degree

Tanmay Inamdar, Lawqueen Kanesh, Madhumita Kundu, Ramanujan M. Sridharan and Saket Saurabh
FPT Approximations for Packing and Covering Problems Parameterized by Elimination Distance and Even Less

Dieter van Melkebeek and Nicollas Mocelin Sdroievski
Leakage Resilience, Targeted Pseudorandom Generators, and Mild Derandomization of Arthur-Merlin Protocols

Nikhil Mande, Manaswi Paraashar and Nitin Saurabh
Randomized and quantum query complexities of finding a king in a tournament

Debajyoti Bera and Tharrmashastha Sapv
A Generalized Quantum Branching Program

Olivier Lalonde, Nikhil Mande and Ronald de Wolf
Tight Bounds for the Randomized and Quantum Communication Complexities of Equality with Small Error

Ulysse Lechine
Revisiting Mulmuley: Simple proof that maxflow is not in the algebraic version of NC

Irmak Saglam and Anne-Kathrin Schmuck
Solving Odd-Fair Parity Games

Ismaël Jecker, Wojciech Czerwiński, Jérôme Leroux, Sławomir Lasota and Łukasz Orlikowski
New Lower Bounds for Reachability in Vector Addition Systems

Ramanujan M. S and Akanksha Agrawal
Approximately Interpolating Between Uniformly and Non-uniformly Polynomial Kernels

Venkatesan Guruswami and Rishi Saket
Hardness of Learning Boolean Functions from Label Proportions

Abhimanyu Choudhury and Meena Mahajan
Dependency schemes in CDCL-based QBF solving: a proof-theoretic study

Prince Mathew, Vincent Penelle, Prakash Saivasan and A V Sreejith
Weighted one-deterministic-counter automata

Anupam Das, Abhishek De and Alexis Saurin
Comparing infinitary systems for linear logic with fixed points

Ashwin Bhaskar and M. Praveen
Constraint LTL with Remote Access

Alain Finkel, Krishna S, Khushraj Madnani, Rupak Majumdar and Georg Zetzsche
Counter Machines With Infrequent Reversals

Telikepalli Kavitha and Kazuhisa Makino
Popular Maximum Matchings in the Many-to-Many Setting