A. Subramani and K. Subramani
An Analysis of Constrained Client Server Assignment Problems

Shubhada Aute, Fahad Panolan and Geevarghese Philip
The Parameterized Complexity of Vertex-Coloring Edge-Weighting

Caroline Lemke and Heike Wehrheim
Forward-Responsibility in Petri Nets

Olivier Bournez, Johanne Cohen, Laura Cohen and Adrian Wurm
Fractal Gadgets for Neural Networks: The Complexity of the Narrow Regime

Yi-Jun Chang and Shaun Quek
Improved Massively Parallel Shortest Path Computation

Léonard Brice, Thomas A. Henzinger and K. S. Thejaswini
Algorithms for Equilibria in Concurrent Stopping Games

Dario Fiorenza, Daniele Gorla and Ivano Salvo
An Incremental Algorithm for Checking the Possibility of Braess Paradox in Dynamic Nets

Raja S
Polynomial-Time Circuit Minimization for Non-commutative 1-Regular Skew and UPT Circuits

Zongchen Chen, Andreas Galanis, Leslie Ann Goldberg, Xandru Mifsud, Paulina Smolarova and Xusheng Zhang
Fast Mixing for Low-Temperature Potts Models via Poisson Trees

Andreas Galanis, Leslie Ann Goldberg and Xandru Mifsud
Logarithmic Mixing of Random Walks on Dynamical Random Cluster Models

Koustav De, Debajyoti Kar and Swagato Sanyal
Query-efficient winner prediction in district-based elections

Swarnalipa Datta, Koustav De and Swagato Sanyal
A simple randomised algorithm for MaxLin2 parameterised above average

Eldon Chung, Alexander Golovnev, Zeyong Li, Maciej Obremski, Sidhant Saraogi and Noah Stephens-Davidowitz
The hardness of range avoidance for randomized algorithms implies Minicrypt

Dipan Dey and Telikepalli Kavitha
Fault-Tolerant Sparsifiers for Low-Cost Arborescence and Min-Cost Matroid Basis

Smayan Agarwal and Aalok Thakkar
Localising Stochasticity in Weighted Automata

Amir Kafshdar Goharshady and Pavel Hudec
Hardness Results and Parameterizations for Success Probabilities in Liquid Democracy

Guy Avni and Fatima Murra
Multi-Player Discrete-Bidding Games; Determinacy, Equilibria, and Complexity

Piotr Hofman and Tymoteusz Kucharek
Integer Reachability in VASS with Transfers: A Refined Complexity Analysis

Gaspard Reghem and Constantin Enea
Compositional Reasoning About Randomized Distributed Protocols

Ugo Dal Lago and Giulia Giusti
(Implicitly) Characterizing Probabilistic Polynomial Time as Used in Cryptography

C Aiswarya, Sahil Mhaskar and M. Praveen
Type-checking for Pattern-based Tree Transformations

Archit Chauhan, Rohit Gurjar, Kilian Rothmund and Thomas Thierauf
Planarizing Gadgets for 2D Minimally Rigid Graphs Do Not Exist

Samruddhi Pednekar and Supartha Podder
On the Approximate Non-Deterministic Degree of Total Boolean Functions

Akash Kumar, Abhiruk Lahiri and C Seshadhri
Reducing the Randomness in Partition Oracles for Bounded Degree Minor-Free Graphs

Jaikumar Radhakrishnan and Rohit Sarma Sarkar
A lower bound for quantum search with circuits of small quantum depth

Niranka Banerjee, Praneet Kumar Patra and Abhishek Sahu
Coupled-Task Scheduling on Paths, Trees and Beyond: filling the gaps of DP with Knapsack

Patricia Bouyer, B Srivathsan and Vaishnavi Vishwanath
A Simple Obligation to Metric Interval Temporal Logic

Béatrice Bérard, Benjamin Monmege, B Srivathsan and Arnab Sur
A Zielonka-type Construction for Connectedly Communicating Processes

Syamantak Das, Sharath Raghvendra and Ritesh Seth
Near Optimal Online Bipartite Matching on the Line with Amortized Logarithmic Recourse

L. Sunil Chandran and Rishikesh Gajjala
Connectivity Bounds for GHZ Graphs

Shubham Bhardwaj
Unconditional Separation Between LL and CLL

Yash Chawda, Saraswati Girish Nanoti and Brahadeesh Sankarnarayanan
On the majority game chromatic number of forests and other graphs

Sravanthi Chede, Vaibhav Krishan and Anil Shukla
On Knowledge Compilation Languages for QBFs

Suchismita Mishra, Ravindra Pawar, Nidhi Purohit, Shivesh K. Roy and Saket Saurabh
Minimum Sum Coloring Revisited

Alvin George, Deepak D'Souza and Pavithra Prabhakar
CEGAR-Based Verification of Temporal Properties of Infinite-State Systems

Pritesh Kumar, Madhumita Kundu, Sounak Modak and Saket Saurabh
Vertex Deletion to d-Quasi-Forest: Kernelization and Single-Exponential Algorithms

Venkatesan Guruswami, Shilun Li and Mihir Singhal
Average-Radius List-Decodability of Random Linear Codes

Rohan Goyal and Venkatesan Guruswami
Exponentially improved explicit lossless rank dispersers over small fields

Satyabrata Jana
Breaking the 2ⁿ Barrier for Defensive Alliance

Ravindra Metta, Kumar Madhukar and Samarjit Chakraborty
Cooperative Verification for Arithmetic Overflows

Minati De, Mohit Singh Karki and Ratnadip Mandal
Online Disjoint Set Cover Problem with Recourse

Maurice Almeida, Raveena Chahar, Siddharth Gupta, Ravindra Pawar and Tarkeshwar Singh
Balanced k-Coloring of Graphs

Sudharshan Rajagopalan and Nitin Saurabh
On Non-Deterministic Representation of Boolean Functions

Dmitry Chistikov, Radosław Piórkowski, Neha Rino and Brink van der Merwe
Evaluating weighted automata: from the Boolean semiring to finite fields

Bhabya Deep Rai and Jayalal Sarma
Word Reconstruction via Lyndon-subword Counting