Track A

• Philip Bille, Inge Li Gørtz, Max Rishøj Pedersen, Eva Rotenberg and Teresa Anna Steiner
  String Indexing for Top-k Close Consecutive Occurrences

• Aaron Bernstein and Aditi Dudeja
  Online Matching With Recourse: Random Edge Arrivals

• Anup Bhattacharya, Dishant Goyal, Ragesh Jaiswal and Amit Kumar
  On Sampling Based Algorithms for k-Means

• Lidiya Binti Khalil and Christian Konrad
  Constructing Large Matchings via Query Access to a Maximal Matching Oracle

• Pavel Dvořák and Bruno Loff
  Lower Bounds for Semi-adaptive Data Structures via Corruption

• Joshua Cook
  Size Bounds on Low Depth Circuits for Promise Majority

• Anupam Gupta, Ravishankar Krishnaswamy, Amit Kumar and Sahil Singla
  Online Carpooling using Expander Decompositions

• Nikhil Mande and Swagato Sanyal
  On parity decision trees for Fourier-sparse Boolean functions

• Édouard Bonnet, Nicolas Grelier and Till Miltzow
  Maximum Clique in Disk-Like Intersection Graphs

• Davide Bilò, Tobias Friedrich, Pascal Lenzner, Anna Melnichenko and Louise Molitor
  Fair Tree Connection Games with Topology-Dependent Edge Cost

• Isolde Adler and Polly Fahey
  Faster Property Testers in a Variation of the Bounded Degree Model

• Kishore Kothapalli, Shreyas Pai and Sriram Pemmaraju
  Sample-and-Gather: Fast Ruling Set Algorithms in the Low-Memory MPC Model

• Shreyas Pai and Sriram Pemmaraju
  Connectivity Lower Bounds in Broadcast Congested Clique

• Olaf Beyersdorff, Joshua Blinkhorn, Meena Mahajan, Tomáš Peitl and Gaurav Sood
  Hard QBFs for Merge Resolution

• Karthik Gajulapalli, James Liu, Tung Mai and Vijay Vazirani
  Stability-Preserving, Time-Efficient Mechanisms for School Choice in Two Rounds

• Emmanuel Arrighi, Henning Fernau, Mateus de Oliveira Oliveira and Petra Wolf
  Width Notions for Ordering-Related Problems

• Erin Taylor, Pankaj K. Agarwal, Kamesh Munagala, Emo Welzl and Hsien-Chih Chang
  Clustering under Perturbation Stability in Near-Linear Time

• Dana Moshkovitz, Justin Oh and David Zuckerman
  Randomness Efficient Noise Stability and Generalized Small Bias Sets

• Pratibha Choudhary, Daniel Lokshtanov, Lawqueen Kanesh, Fahad Panolan and Saket Saurabh
  Parameterized Complexity of Feedback Vertex Sets on Hypergraphs

• Telikepalli Kavitha
  Min-cost Popular Matchings

• Yash Khanna and Anand Louis
  Planted Models for the Densest k-Subgraph Problem

• Niranka Banerjee, Venkatesh Raman and Saket Saurabh
  Optimal Output Sensitive Fault Tolerant Cuts

• Omer Wasim and Valerie King
  Fully dynamic sequential and distributed algorithms for MAX-CUT

• Nils Morawietz, Niels Grüttemeier, Christian Komusiewicz and Frank Sommer
  Colored Cut Games

• Sushmita Gupta, Pallavi Jain, Sanjukta Roy, Saket Saurabh and Meirav Zehavi
  On the (Parameterized) Complexity of Almost Stable Marriage

• Alexander Block, Jeremiah Blocki, Elena Grigorescu, Shubhang Kulkarni and Minshen Zhu
  Locally Decodable/Correctable Codes for Insertions and Deletions

• Prantar Ghosh
  New Verification Schemes for Frequency-Based Functions on Data Streams

---

Track B

• Sven Schewe
  Minimising Good-for-Games Automata is NP-Complete

• M. Praveen
  What You Must Remember When Transforming Datawords (Extended Abstract)

• Peter Chini and Prakash Saivasan
  A Framework for Consistency Algorithms

• Paweł Parys
  Higher-Order Nonemptiness Step by Step

• Orna Kupferman and Noam Shenwald
  Perspective Games with Notifications

• Dominique Perrin and Andrew Ryzhikov
  The Degree of a Finite Set of Words

• A. R. Balasubramanian
  Parameterized Complexity of Safety of Threshold Automata

• Stefan Haar, Serge Haddad, Stefan Schwoon and Lina Ye
  Active Prediction for Discrete Event Systems

• Rebecca Bernemann, Benjamin Cabrera, Reiko Heckel and Barbara König
  Uncertainty Reasoning for Probabilistic Petri Nets via Bayesian Networks

• Michal Konecny, Florian Steinberg and Holger Thies
  Computable analysis for verified exact real computation

• Petra Wolf
  Synchronization under Dynamic Constraints

• Emmanuel Filiot, Christof Löding and Sarah Winter
  Synthesis from Weighted Specifications with Partial Domains over Finite Words

• Nathalie Bertrand, Patricia Bouyer and Anirban Majumdar
  Synthesizing safe coalition strategies

• Henning Fernau and Petra Wolf
  Synchronization of Deterministic Visibly Push-Down Automata

• Udi Boker, Denis Kuperberg, Karoliina Lehtinen and Michał Skrzypczak
  On the Succinctness of Alternating Parity Good-for-Games Automata

• Shaull Almagor
  Process Symmetry in Probabilistic Transducers

• Rishi Tulsyan, R Rekha and Deepak D'Souza
  Static Race Detection for RTOS Applications

• Oscar Darwin and Stefan Kiefer
  Equivalence of Hidden Markov Models with Continuous Observations

• Christel Baier, Florian Funke, Simon Jantsch, Toghrul Karimov, Engel Lefaucheux, Joël Ouaknine, Amaury Pouly, David Purser and Markus A. Whiteland
  Reachability in Dynamical Systems with Rounding

• Sören van der Wall and Roland Meyer
  On the Complexity of Multi-Pushdown Games

• Manfred Droste, Sven Dziadek and Werner Kuich
  Nivat-Theorem and Logic for Weighted Pushdown Automata on Infinite Words

• Paul Gastin, Sayan Mukherjee and B Srivathsan
  Reachability for updatable timed automata made faster and more effective

• Stefan Kiefer and Qiyi Tang
  Comparing Labelled Markov Decision Processes

• Nathalie Bertrand, Nicolas Markey, Suman Sadhukhan and Ocan Sankur
  Dynamic Network Congestion Games

• C. Aiswarya and Paul Gastin
  Weighted Tiling Systems for Graphs: Evaluation Complexity

---