Track A

• Gordon Hoi, Sanjay Jain and Frank Stephan
  A Fast Algorithm for Max Hamming Distance X3SAT

• Jan Dreier and Peter Rossmanith
  Motif Counting in Preferential Attachment Graphs

• Rahul Jain and Raghunath Tewari
  An O(n^{¼ + ε}) Space and Polynomial Algorithm for Grid Graph Reachability

• Isolde Adler, Christophe Paul and Dimitrios Thilikos
  Connected Search for a Lazy Robber

• Giorgio Lucarelli, Benjamin Moseley, Nguyen Thang, Abhinav Srivastav and Denis Trystram
  Online Non-preemptive Scheduling to Minimize Maximum Weighted Flow-time on Related Machines

• Kanthi Sarpatwar, Baruch Schieber and Hadas Shachnai
  The Preemptive Resource Allocation Problem

• Chetan Gupta, Rahul Jain, Vimal Raj Sharma and Raghunath Tewari
  Unambiguous Catalytic Computation

• Telikepalli Kavitha
  Popular Roommates in Simply Exponential Time

• Prerona Chatterjee and Ramprasad Saptharishi
  Constructing Faithful Homomorphisms over Fields of Finite Characteristic

• V. Arvind, Abhranil Chatterjee, Rajit Datta and Partha Mukhopadhyay
  Fast Exact Algorithms Using Hadamard Product of Polynomials

• Yujin Choi, Seungjun Lee and Hee-Kap Ahn
  Maximum-Area Rectangles in a Simple Polygon

• Akanksha Agrawal, Arindam Biswas, Édouard Bonnet, Nick Brettell, Radu Curticapean, Dániel Marx, Tillmann Miltzow, Venkatesh Raman and Saket Saurabh
  Parameterized Streaming Algorithms for Min-Ones d-SAT

• Diptarka Chakraborty, Debarati Das and Michal Koucky
  Approximate Online Pattern Matching in Sublinear Time

• Roy Schwartz, Mohit Singh and Sina Yazdanbod
  Online and Offline Algorithms for Circuit Switch Scheduling

• Fedor Fomin, Petr Golovach and Kirill Simonov
  Parameterized k-Clustering: Tractability Island

• Sanjana Kolisetty, Linh Le, Ilya Volkovich and Mihalis Yannakakis
  The Complexity of Finding S-factors in Regular Graphs

• Aditya Potukuchi
  On the AC⁰[⊕] complexity of Andreev's Problem

• Srikanth Srinivasan, Utkarsh Tripathi and S. Venkitesh
  On the Probabilistic Degrees of Symmetric Boolean functions

• Rakesh Venkat and Anand Louis
  Planted Models for k-way Edge and Vertex Expansion

• Sébastien Tavenas, Maud Szusterman, Guillaume Malod and Hervé Fournier
  Nonnegative rank measures and monotone algebraic branching programs

• Nutan Limaye, Srikanth Srinivasan and Utkarsh Tripathi
  More on AC⁰[⊕] and Variants of the Majority Function

• Pallavi Jain, Lawqueen Kanesh, William Lochet, Saket Saurabh and Roohani Sharma
  Exact and Approximate Digraph Bandwidth

---

Track B

• Jérôme Leroux
  Distance Between Mutually Reachable Petri Net Configurations

• Laura Bozzelli, Angelo Montanari and Adriano Peron
  Taming complexity of timeline-based planning over dense temporal domains

• Hans Kleine Büning, Piotr Wojciechowski and K. Subramani
  New results on cutting plane proofs for Horn constraint systems

• David Mestel
  Widths of regular and context-free languages

• Laura Bozzelli, Angelo Montanari and Adriano Peron
  Interval temporal logic for visibly pushdown systems

• M. Praveen and Agnishom Chattopadhyay
  Query Preserving Watermarking Schemes for Locally Treelike Databases

• Ramanathan Thinniyam Srinivasan and Georg Zetzsche
  Regular Separability and Intersection Emptiness are Independent Problems

• Emmanuel Filiot, Shibashis Guha and Nicolas Mazzocchi
  Two-way Parikh Automata

• Marco Kuhlmann, Andreas Maletti and Lena Katharina Schiffer
  The Tree-Generative Capacity of Combinatory Categorial Grammars

• Thomas Brihaye, Gilles Geeraerts, Marion Hallet, Benjamin Monmege and Bruno Quoitin
  Dynamics on Games: Simulation-Based Techniques and Applications to Routing

• S. Akshay, Hugo Bazille, Eric Fabre and Blaise Genest
  Classification among Hidden Markov Models

• Alain Finkel and Ekanshdeep Gupta
  The well structured problem for Presburger counter machines

• Denis Kuperberg, Laureline Pinault and Damien Pous
  Cyclic Proofs and Jumping Automata

• Benjamin Bordais, Shibashis Guha and Jean-Francois Raskin
  Expected Window Mean-Payoff

• Alexandre Mansard
  Boolean algebras from trace automata

• Paolo Baldan and Alessandra Raffaeta
  Minimisation of Event Structures

• Salvatore La Torre and P. Madhusudan
  Reachability in Concurrent Uninterpreted Programs

• Alexander Rabinovich and Doron Tiferet
  Degrees of Ambiguity of Büchi Tree Automata

• Jeffrey M. Dudek and Dror Fried
  Transformations of Boolean Functions

• Nathalie Bertrand, Patricia Bouyer and Anirban Majumdar
  Concurrent parameterized games

• Peter Chini, Prakash Saivasan and Roland Meyer
  Complexity of Liveness in Parameterized Systems

• Manfred Droste, Sven Dziadek and Werner Kuich
  Greibach Normal Form for ω-Algebraic Systems and Weighted Simple ω-Pushdown Automata

• Fabio Gadducci, Hernan Melgratti, Matteo Sammartino and Christian Roldan
  A Categorical Account for the Specification of Replicated Data Type

---