Accepted Papers

• Laurent Bulteau and Markus L. Schmid. Consensus Strings with Small Maximum Distance and Small Distance Sum
• Mikhail Andreev, Gleb Posobin and Alexander Shen. Plain stopping time and conditional complexities revisited
• Hasan Abasi. Error-Tolerant Non-Adaptive Learning of a Hidden Hypergraph
• Alexander Kozachinskiy. From expanders to hitting distributions and simulation theorems
• Titus Dose. Balance Problems for Integer Circuits
• Louis-Marie Dando and Sylvain Lombardy. On Hadamard Series and Rotating Q-Automata
• Egor Klenin and Alexander Kozachinskiy. One-sided error communication complexity of Gap Hamming Distance
• Spyros Angelopoulos, Christoph Dürr and Shendan Jin. Online Maximum Matching with Recourse
• Guillaume Burel. Linking Focusing and Resolution with Selection
• Andreas Krebs, Arne Meier, Jonni Virtema and Martin Zimmermann. Team Semantics for the Specification and Verification of Hyperproperties
• Florent Madelaine and Barnaby Martin. Consistency for counting quantifiers
• Naonori Kakimura, Naoyuki Kamiyama and Kenjiro Takazawa. The $b$-branching Problem in Digraphs
• Dani Dorfman, Haim Kaplan, Laszlo Kozma and Uri Zwick. Pairing heaps: the forward variant
• Yassine Hamoudi. Simultaneous Multiparty Communication Protocols for Composed Functions
• Moses Ganardi, Artur Jeż and Markus Lohrey. Sliding windows over context-free languages
• Louisa Seelbach Benkner and Markus Lohrey. Average case analysis of leaf-centric binary tree sources
• Pawel Idziak, Piotr Kawałek and Jacek Krzaczkowski. Expressive power, satisfiability and equivalence of circuits over nilpotent algebras
• P. Madhusudan, Dirk Nowotka, Aayush Rajasekaran and Jeffrey Shallit. Lagrange’s Theorem for Binary Squares
• Hendrik Fichtenberger and Yadu Vasudev. A Two-Sided Error Distributed Property Tester For Conductance
• Martin Grohe, Gaurav Rattan and Gerhard J. Woeginger. Graph Similarity and Approximate Isomorphism
• Andrew Ryzhikov and Marek Szykuła. Finding Short Synchronizing Words for Prefix Codes
• Bill Fefferman and Shelby Kimmel. Quantum vs. Classical Proofs and Subset Verification
• Guy Avni, Shibashis Guha and Orna Kupferman. Timed Network Games with Clocks
• Aris Filos-Ratsikas, Søren Stiil Frederiksen, Paul Goldberg and Jie Zhang. Hardness Results for Consensus-Halving
• Ioannis Lamprou, Russell Martin, Sven Schewe, Ioannis Sigalas and Vassilis Zissimopoulos. Maximum Rooted Connected Expansion
• Francois Le Gall, Tomoyuki Morimae, Harumichi Nishimura and Yuki Takeuchi. Interactive Proofs with Polynomial-Time Quantum Prover for Computing the Order of Solvable Groups
• Martin Lück. On the Complexity of Team Logic and its Two-Variable Fragment
• Andrea Clementi, Mohsen Ghaffari, Luciano Gualà, Emanuele Natale, Francesco Pasquale and Giacomo Scornavacca. A Tight Analysis of the Parallel Undecided-State Dynamics with Two Colors
• Jakub Gajarský and Dan Kral. Recovering sparse graphs
• Akitoshi Kawamura, Holger Thies and Martin Ziegler. Average-case polynomial-time computability of Hamiltonian dynamics
• Francesco Cellinese, Gianlorenzo D'Angelo, Gianpiero Monaco and Yllka Velaj. Generalized budgeted submodular set function maximization
• Mikhail Berlinkov, Robert Ferens and Marek Szykuła. Complexity of Preimage Problems for Deterministic Finite Automata
• Manuel Bodirsky, Marcello Mamino, Barnaby Martin and Antoine Mottet. The complexity of disjunctive linear Diophantine constraints
• Ran Ben Basat, Gil Einziger and Roy Friedman. Give Me Some Slack: Efficient Sliding Window Measurements
• Dan Hefetz, Orna Kupferman, Amir Lellouche and Gal Vardi. Spanning-Tree Games
• Thomas Erlebach and Jakob T. Spooner. Faster Exploration of Degree-Bounded Temporal Graphs
• Sayan Bandyapadhyay, Anil Maheshwari, Saeed Mehrabi and Subhash Suri. Approximating Dominating Set on Intersection Graphs of Rectangles and L-frames
• Marco Aldi, Niel De Beaudrap, Sevag Gharibian and Seyran Saeedi. On efficiently solvable cases of Quantum k-SAT
• Cedric Berenger, Peter Niebert and Kevin Perrot. Balanced connected partitioning of unweighted grid graphs
• Stephane Le Roux. Concurrent games and semi-random determinacy
• Chen Dan, Kristoffer Arnsfelt Hansen, He Jiang, Liwei Wang and Yuchen Zhou. Low Rank Approximation of Binary Matrices: Column Subset Selection and Generalizations
• Matthew Hague and Arnaud Carayol. Optimal Strategies in Pushdown Reachability Games
• Peter Jonsson and Victor Lagerqvist. Why are CSPs Based on Partition Schemes Computationally Hard?
• Argyrios Deligkas and Reshef Meir. Directed Graph Minors and Serial-Parallel Width
• Philipp Zschoche, Till Fluschnik, Hendrik Molter and Rolf Niedermeier. The Complexity of Finding Small Separators in Temporal Graphs
• Léo Exibard, Emmanuel Filiot and Ismaël Jecker. The Complexity of Transducer Synthesis from Multi-Sequential Specifications
• Vittorio Bilò, Michele Flammini, Gianpiero Monaco and Luca Moscardelli. Pricing Problems with Buyer Preselection
• Costanza Catalano and Raphaël M. Jungers. On randomized generation of slowly synchronizing automata
• Andreas Göbel, J. A. Gregor Lagodzinski and Karen Seidel. Counting Homomorphisms to Trees Modulo a Prime
• Kelin Luo, Thomas Erlebach and Yinfeng Xu. Car-Sharing between Two Locations: Online Scheduling with Two Servers
• Edith Hemaspaandra, Lane A. Hemaspaandra, Holger Spakowski and Osamu Watanabe. The Robustness of LWPP and WPP, with an Application to Graph Reconstruction
• Robert Gmyr, Kristian Hinnenthal, Irina Kostitsyna, Fabian Kuhn, Dorian Rudolph and Christian Scheideler. Shape Recognition by a Finite Automaton Robot
• Akanksha Agrawal, Pallavi Jain, Lawqueen Kanesh, Saket Saurabh and Daniel Lokshtanov. Conflict Free Feedback Vertex Set: A Parameterized Dichotomy
• Andre Droschinsky, Nils Kriege and Petra Mutzel. Largest Weight Common Subtree Embeddings with Distance Penalties
• Mozhgan Pourmoradnasseri, Mamadou Kanté and Kaveh Khoshkhah. Enumerating Minimal Transversals of Hypergraphs Without Small Holes
• Andreas Bärtschi, Daniel Graf and Matúš Mihalák. Collective fast delivery by energy-efficient agents
• Matthew Hague, Roland Meyer, Sebastian Muskalla and Martin Zimmermann. Parity to Safety in Polynomial Time for Pushdown and Collapsible Pushdown Systems
• Sevag Gharibian, Miklos Santha, Jamie Sikora, Aarthi Sundaram and Justin Yirka. Quantum generalizations of the polynomial hierarchy with applications to QMA(2)
• Martin Dietzfelbinger, Philipp Schlag and Stefan Walzer. A Subquadratic Algorithm for 3XOR
• Christian Doczkal and Damien Pous. Treewidth-Two Graphs as a Free Algebra
• Vinodchandran Variyam, A Pavan and Peter Dixon. On Pseudodeterministic Approximation Algorithms
• Lukas Fleischer and Manfred Kufleitner. Testing Simon’s congruence
• Konrad K. Dabrowski, Matthew Johnson, Giacomo Paesani, Daniël Paulusma and Viktor Zamaraev. On the Price of Independence for Vertex Cover, Feedback Vertex Set and Odd Cycle Transversal
• Paolo D'Arco, Roberto De Prisco, Alfredo De Santis, Ángel Pérez Del Pozo and Ugo Vaccaro. Probabilistic Secret Sharing
• Frank Kammer and Andrej Sajenko. Extra Space during Initialization of Succinct Data Structures and Dynamical Initializable Arrays
• Pawel Gawrychowski, Gad Landau and Tatiana Starikovskaya. Fast entropy-bounded string dictionary look-up with mismatches
• Remy Belmonte, Tesshu Hanaka, Ioannis Katsikarelis, Eun Jung Kim and Michael Lampis. New Results on Directed Edge Dominating Set
• Pavol Hell, Jing Huang, Ross McConnell and Arash Rafiey. Interval-Like Graphs and Digraphs
• Peter Hamburger, Ross McConnell, Attila Por, Jeremy Spinrad and Zhisheng Xu. Double Threshold Digraphs
• Jenish C Mehta. Tree Tribes and lower bounds for Switching Lemmas
• Donald Stull and Neil Lutz. Projection Theorems Using Effective Dimension
• Andrzej Murawski, Steven Ramsay and Nikos Tzevelekos. Polynomial-time equivalence testing for deterministic fresh-register automata
• Ralph Bottesch. On W[1]-Hardness as Evidence for Intractability
• Christian Konrad. A Simple Augmentation Method for Matchings with Applications to Streaming Algorithms
• Benjamin Moore, Naomi Nishimura and Vijay Subramanya. Reconfiguration of graph minors
• Erik Paul and Manfred Droste. A Feferman-Vaught Decomposition Theorem for Weighted MSO Logic
• Hugo Akitaya, Matthew Jones, David Stalfa and Csaba Toth. Maximum Area Axis-Aligned Square Packings
• Ninad Rajgopal, Rahul Santhanam and Srikanth Srinivasan. Deterministically Counting Satisfying Assignments for Constant-Depth Circuits with Parity Gates, with Implications for Lower Bounds
• Donald Stull. Results on the Dimension Spectra of Planar Lines
• Aris Pagourtzis and Tomasz Radzik. Tight bounds for deterministic $h$-shot broadcast in ad-hoc directed radio networks
• Kazuyuki Amano. Depth Two Majority Circuits for Majority and List Expanders
• Mareike Dressler, Adam Kurpisz and Timo de Wolff. Optimization over the Boolean Hypercube via Sums of Nonnegative Circuit Polynomials
• Pinar Heggernes, Davis Issac, Juho Lauri, Paloma de Lima and Erik Jan van Leeuwen. Rainbow Vertex Coloring Bipartite Graphs and Chordal Graphs
• Alessio Conte, Roberto Grossi, Andrea Marino, Romeo Rizzi and Luca Versari. Listing Subgraphs by Cartesian Decomposition

Contact: Igor Potapov