Table of Contents

• Counting Homomorphisms to Trees Modulo a PrimeAndreas Göbel 0001, J. A. Gregor Lagodzinski, Karen Seidel 0001. [doi]
• Hardness Results for Consensus-HalvingAris Filos-Ratsikas, Søren Kristoffer Stiil Frederiksen, Paul W. Goldberg, Jie Zhang 0008. [doi]
• Spanning-Tree GamesDan Hefetz, Orna Kupferman, Amir Lellouche, Gal Vardi. [doi]
• Complexity of Preimage Problems for Deterministic Finite AutomataMikhail V. Berlinkov, Robert Ferens, Marek Szykula. [doi]
• Expressive Power, Satisfiability and Equivalence of Circuits over Nilpotent AlgebrasPawel M. Idziak, Piotr Kawalek, Jacek Krzaczkowski. [doi]
• Collective Fast Delivery by Energy-Efficient AgentsAndreas Bärtschi, Daniel Graf 0001, Matús Mihalák. [doi]
• Graph Similarity and Approximate IsomorphismMartin Grohe, Gaurav Rattan, Gerhard J. Woeginger. [doi]
• The Complexity of Transducer Synthesis from Multi-Sequential SpecificationsLéo Exibard, Emmanuel Filiot, Ismaël Jecker. [doi]
• Approximating Dominating Set on Intersection Graphs of Rectangles and L-framesSayan Bandyapadhyay, Anil Maheshwari, Saeed Mehrabi 0001, Subhash Suri. [doi]
• Quantum vs. Classical Proofs and Subset VerificationBill Fefferman, Shelby Kimmel. [doi]
• Maximum Rooted Connected ExpansionIoannis Lamprou, Russell Martin, Sven Schewe, Ioannis Sigalas, Vassilis Zissimopoulos. [doi]
• Linking Focusing and Resolution with SelectionGuillaume Burel. [doi]
• Average-Case Polynomial-Time Computability of Hamiltonian DynamicsAkitoshi Kawamura, Holger Thies, Martin Ziegler 0001. [doi]
• Tree Tribes and Lower Bounds for Switching LemmasJenish C. Mehta. [doi]
• Car-Sharing between Two Locations: Online Scheduling with Two ServersKelin Luo, Thomas Erlebach, Yinfeng Xu. [doi]
• Interactive Proofs with Polynomial-Time Quantum Prover for Computing the Order of Solvable GroupsFrançois Le Gall, Tomoyuki Morimae, Harumichi Nishimura, Yuki Takeuchi. [doi]
• Give Me Some Slack: Efficient Network MeasurementsRan Ben-Basat, Gil Einziger, Roy Friedman. [doi]
• New Results on Directed Edge Dominating SetRémy Belmonte, Tesshu Hanaka, Ioannis Katsikarelis, Eun Jung Kim 0002, Michael Lampis. [doi]
• Consistency for Counting QuantifiersFlorent R. Madelaine, Barnaby Martin. [doi]
• Depth Two Majority Circuits for Majority and List ExpandersKazuyuki Amano. [doi]
• On the Complexity of Team Logic and Its Two-Variable FragmentMartin Lück. [doi]
• On Hadamard Series and Rotating Q-AutomataLouis-Marie Dando, Sylvain Lombardy. [doi]
• Consensus Strings with Small Maximum Distance and Small Distance SumLaurent Bulteau, Markus L. Schmid. [doi]
• Projection Theorems Using Effective DimensionNeil Lutz, Donald M. Stull. [doi]
• Optimization over the Boolean Hypercube via Sums of Nonnegative Circuit PolynomialsMareike Dressler, Adam Kurpisz, Timo de Wolff. [doi]
• Error-Tolerant Non-Adaptive Learning of a Hidden HypergraphHasan Abasi. [doi]
• From Expanders to Hitting Distributions and Simulation TheoremsAlexander Kozachinskiy. [doi]
• Directed Graph Minors and Serial-Parallel WidthArgyrios Deligkas, Reshef Meir. [doi]
• Testing Simon's congruenceLukas Fleischer, Manfred Kufleitner. [doi]
• Enumerating Minimal Transversals of Hypergraphs without Small HolesMamadou Moustapha Kanté, Kaveh Khoshkhah, Mozhgan Pourmoradnasseri. [doi]
• The Complexity of Finding Small Separators in Temporal GraphsPhilipp Zschoche, Till Fluschnik, Hendrik Molter, Rolf Niedermeier. [doi]
• Online Maximum Matching with RecourseSpyros Angelopoulos 0001, Christoph Dürr, Shendan Jin. [doi]
• Interval-Like Graphs and DigraphsPavol Hell, Jing Huang 0007, Ross M. McConnell, Arash Rafiey. [doi]
• A Simple Augmentation Method for Matchings with Applications to Streaming AlgorithmsChristian Konrad. [doi]
• Maximum Area Axis-Aligned Square PackingsHugo A. Akitaya, Matthew D. Jones, David Stalfa, Csaba D. Tóth. [doi]
• Double Threshold DigraphsPeter Hamburger, Ross M. McConnell, Attila Pór, Jeremy P. Spinrad, Zhisheng Xu. [doi]
• Lagrange's Theorem for Binary SquaresP. Madhusudan, Dirk Nowotka, Aayush Rajasekaran, Jeffrey Shallit. [doi]
• Shape Recognition by a Finite Automaton RobotRobert Gmyr, Kristian Hinnenthal, Irina Kostitsyna, Fabian Kuhn, Dorian Rudolph, Christian Scheideler. [doi]
• Recovering Sparse GraphsJakub Gajarský, Daniel Král. [doi]
• Generalized Budgeted Submodular Set Function MaximizationFrancesco Cellinese, Gianlorenzo D'Angelo, Gianpiero Monaco, Yllka Velaj. [doi]
• Average Case Analysis of Leaf-Centric Binary Tree SourcesLouisa Seelbach Benkner, Markus Lohrey. [doi]
• Balance Problems for Integer CircuitsTitus Dose. [doi]
• Finding Short Synchronizing Words for Prefix CodesAndrew Ryzhikov, Marek Szykula. [doi]
• A Two-Sided Error Distributed Property Tester For ConductanceHendrik Fichtenberger, Yadu Vasudev. [doi]
• Faster Exploration of Degree-Bounded Temporal GraphsThomas Erlebach, Jakob T. Spooner. [doi]
• On the Price of Independence for Vertex Cover, Feedback Vertex Set and Odd Cycle TransversalKonrad K. Dabrowski, Matthew Johnson 0002, Giacomo Paesani, Daniël Paulusma, Viktor Zamaraev. [doi]
• On Efficiently Solvable Cases of Quantum k-SATMarco Aldi, Niel de Beaudrap, Sevag Gharibian, Seyran Saeedi. [doi]
• Fast Entropy-Bounded String Dictionary Look-Up with MismatchesPawel Gawrychowski, Gad M. Landau, Tatiana A. Starikovskaya. [doi]
• Rainbow Vertex Coloring Bipartite Graphs and Chordal GraphsPinar Heggernes, Davis Issac, Juho Lauri, Paloma T. Lima, Erik Jan van Leeuwen. [doi]
• Balanced Connected Partitioning of Unweighted Grid GraphsCedric Berenger, Peter Niebert, Kévin Perrot. [doi]
• Polynomial-Time Equivalence Testing for Deterministic Fresh-Register AutomataAndrzej S. Murawski, Steven J. Ramsay, Nikos Tzevelekos. [doi]
• Sliding Windows over Context-Free LanguagesMoses Ganardi, Artur Jez, Markus Lohrey. [doi]
• A Feferman-Vaught Decomposition Theorem for Weighted MSO LogicManfred Droste, Erik Paul. [doi]
• Largest Weight Common Subtree Embeddings with Distance PenaltiesAndre Droschinsky, Nils M. Kriege, Petra Mutzel. [doi]
• Low Rank Approximation of Binary Matrices: Column Subset Selection and GeneralizationsChen Dan, Kristoffer Arnsfelt Hansen, He Jiang, Liwei Wang 0001, Yuchen Zhou. [doi]
• Front Matter, Table of Contents, Preface, Conference Organization [doi]
• Why are CSPs Based on Partition Schemes Computationally Hard?Peter Jonsson, Victor Lagerkvist. [doi]
• On Pseudodeterministic Approximation AlgorithmsPeter Dixon, Aduri Pavan, N. V. Vinodchandran. [doi]
• On Randomized Generation of Slowly Synchronizing AutomataCostanza Catalano, Raphaël M. Jungers. [doi]
• The Complexity of Disjunctive Linear Diophantine ConstraintsManuel Bodirsky, Barnaby Martin, Marcello Mamino, Antoine Mottet. [doi]
• Pairing heaps: the forward variantDani Dorfman, Haim Kaplan, László Kozma 0002, Uri Zwick. [doi]
• Quantum Generalizations of the Polynomial Hierarchy with Applications to QMA(2)Sevag Gharibian, Miklos Santha, Jamie Sikora, Aarthi Sundaram, Justin Yirka. [doi]
• Reconfiguration of Graph MinorsBenjamin Moore, Naomi Nishimura, Vijay Subramanya. [doi]
• A Subquadratic Algorithm for 3XORMartin Dietzfelbinger, Philipp Schlag, Stefan Walzer. [doi]
• Treewidth-Two Graphs as a Free AlgebraChristian Doczkal, Damien Pous. [doi]
• Listing Subgraphs by Cartesian DecompositionAlessio Conte, Roberto Grossi, Andrea Marino, Romeo Rizzi, Luca Versari. [doi]
• Pricing Problems with Buyer PreselectionVittorio Bilò, Michele Flammini, Gianpiero Monaco, Luca Moscardelli. [doi]
• Plain Stopping Time and Conditional Complexities RevisitedMikhail Andreev, Gleb Posobin, Alexander Shen. [doi]
• Optimal Strategies in Pushdown Reachability GamesArnaud Carayol, Matthew Hague. [doi]
• The b-Branching Problem in DigraphsNaonori Kakimura, Naoyuki Kamiyama, Kenjiro Takazawa. [doi]
• Concurrent Games and Semi-Random DeterminacyStéphane Le Roux 0001. [doi]
• Extra Space during Initialization of Succinct Data Structures and Dynamical Initializable ArraysFrank Kammer, Andrej Sajenko. [doi]
• Timed Network Games with ClocksGuy Avni, Shibashis Guha, Orna Kupferman. [doi]
• Tight Bounds for Deterministic h-Shot Broadcast in Ad-Hoc Directed Radio NetworksAris Pagourtzis, Tomasz Radzik. [doi]
• Simultaneous Multiparty Communication Protocols for Composed FunctionsYassine Hamoudi. [doi]
• The Robustness of LWPP and WPP, with an Application to Graph ReconstructionEdith Hemaspaandra, Lane A. Hemaspaandra, Holger Spakowski, Osamu Watanabe 0001. [doi]
• Conflict Free Feedback Vertex Set: A Parameterized DichotomyAkanksha Agrawal, Pallavi Jain, Lawqueen Kanesh, Daniel Lokshtanov, Saket Saurabh 0001. [doi]
• One-Sided Error Communication Complexity of Gap Hamming DistanceEgor Klenin, Alexander Kozachinskiy. [doi]
• A Tight Analysis of the Parallel Undecided-State Dynamics with Two ColorsAndrea E. F. Clementi, Mohsen Ghaffari, Luciano Gualà, Emanuele Natale, Francesco Pasquale, Giacomo Scornavacca. [doi]
• Probabilistic Secret SharingPaolo D'Arco, Roberto De Prisco, Alfredo De Santis, Angel L. Pérez del Pozo, Ugo Vaccaro. [doi]
• Parity to Safety in Polynomial Time for Pushdown and Collapsible Pushdown SystemsMatthew Hague, Roland Meyer, Sebastian Muskalla, Martin Zimmermann 0002. [doi]
• Team Semantics for the Specification and Verification of HyperpropertiesAndreas Krebs, Arne Meier, Jonni Virtema, Martin Zimmermann 0002. [doi]
• Results on the Dimension Spectra of Planar LinesDonald M. Stull. [doi]
• On W[1]-Hardness as Evidence for IntractabilityRalph Christian Bottesch. [doi]
• Deterministically Counting Satisfying Assignments for Constant-Depth Circuits with Parity Gates, with Implications for Lower BoundsNinad Rajgopal, Rahul Santhanam, Srikanth Srinivasan 0001. [doi]