Accepted Papers
- Nikolay Vereshchagin. How much randomness is needed to convert MA protocols to AM protocols?
- Jasine Babu, Neeldhara Misra and Saraswati Nanoti. Eternal Vertex Cover on Bipartite and Co-Bipartite Graphs
- Sayan Bandyapadhyay, Fedor Fomin, Petr Golovach, Nidhi Purohit and Kirill Simonov. Lossy Kernelization of Same-Size Clustering
- Peter Kostolányi. Finite Ambiguity and Finite Sequentiality in Weighted Automata over Fields
- Niranka Banerjee, Manoj Gupta, Venkatesh Raman and Saket Saurabh. Output Sensitive Fault Tolerant Maximum Matching
- Lorenzo Balzotti and Paolo G. Franciosa. Non-Crossing Shortest Paths in Undirected Unweighted Planar Graphs in Linear Time
- Laurent Doyen and Marie Van Den Bogaard. Bounds for Synchronizing Markov Decision Processes
- Ankit Abhinav, Susobhan Bandopadhyay, Aritra Banik and Saket Saurabh. Parameterized Algorithms for Finding Highly Connected Solution
- Elena Petrova and Arseny Shur. Abelian Repetition Threshold Revisited
- Kamil Khadiev and Maxim Yagafarov. The Fast Algorithm for Online k-server Problem on Trees
- Fahad Panolan and Hannane Yaghoubizade. Partial Vertex Cover on Graphs of Bounded Degeneracy
- Petr Golovach, Fahad Panolan, Ashutosh Rai and Saket Saurabh. Parameterized Complexity of Set-Restricted Disjoint Paths on Chordal Graphs
- V P Abidha, Pradeesha Ashok, Avi Tomar and Dolly Yadav. Coloring a Dominating Set without Conflicts: \\$q$-Subset Square Coloring
- Bardiya Aryanfard and Fahad Panolan. Parameterized Complexity of List Coloring and Max Coloring
- Thomas Place and Marc Zeitoun. Characterizing level one in group-based concatenation hierarchies
- Alexander Grishutin and Daniil Musatov. Discrete versions of KKM lemma and their PPAD-completeness
- Pierre Ohlmann. The GKK Algorithm is the Fastest over Simple Mean-Payoff Games
- Pavel Alaev. Quotient structures and groups computable in polynomial time
- Yifen Li, Xiaohui Bei, Youming Qiao, Dacheng Tao and Zhiya Chen. Heterogeneous Multi-Commodity Network Flows Over Time
- Alexander Kozachinskiy. New Bounds for the Flock-of-Birds Problem
- Mizuhito Ogawa and Alexander Okhotin. On the determinization of event-clock input-driven pushdown automata