Table of Contents

• Invariantization of ListingsJörg Flum. 2 [doi]
• Duality and RecognitionMai Gehrke. 3-18 [doi]
• Some Variants of the Star Height ProblemDaniel Kirsten. 19-33 [doi]
• Generic Techniques to Round SDP RelaxationsPrasad Raghavendra. 34 [doi]
• New Proofs in Graph MinorsPaul Wollan. 35 [doi]
• The Least-Core of Threshold Network Flow GamesYoram Bachrach. 36-47 [doi]
• Adhesivity Is Not Enough: Local Church-Rosser RevisitedPaolo Baldan, Fabio Gadducci, Pawel Sobocinski. 48-59 [doi]
• Quantitative Refinement for Weighted Modal Transition SystemsSebastian S. Bauer, Uli Fahrenberg, Line Juhl, Kim G. Larsen, Axel Legay, Claus R. Thrane. 60-71 [doi]
• Faster Coupon Collecting via Replication with Applications in GossipingPetra Berenbrink, Robert Elsässer, Tom Friedetzky, Lars Nagel, Thomas Sauerwald. 72-83 [doi]
• Verifying Proofs in Constant DepthOlaf Beyersdorff, Samir Datta, Meena Mahajan, Gido Scharfenberger-Fabian, Karteek Sreenivasaiah, Michael Thomas, Heribert Vollmer. 84-95 [doi]
• The Complexity of the Cover Polynomials for Planar Graphs of Bounded DegreeMarkus Bläser, Radu Curticapean. 96-107 [doi]
• Model Checking Coverability Graphs of Vector Addition SystemsMichel Blockelet, Sylvain Schmitz. 108-119 [doi]
• Hard Functions for Low-Degree Polynomials over Prime FieldsAndrej Bogdanov, Akinori Kawachi, Hidetoki Tanaka. 120-131 [doi]
• Temporal Logics for Concurrent Recursive Programs: Satisfiability and Model CheckingBenedikt Bollig, Aiswarya Cyriac, Paul Gastin, Marc Zeitoun. 132-144 [doi]
• The Reachability Problem for Vector Addition System with One Zero-TestRémi Bonnet. 145-157 [doi]
• The Bounded Search Tree Algorithm for the Closest String Problem Has Quadratic Smoothed ComplexityChristina Boucher. 158-169 [doi]
• Solving Analytic Differential Equations in Polynomial Time over Unbounded DomainsOlivier Bournez, Daniel S. Graça, Amaury Pouly. 170-181 [doi]
• Pattern-Guided Data Anonymization and ClusteringRobert Bredereck, André Nichterlein, Rolf Niedermeier, Geevarghese Philip. 182-193 [doi]
• Language Equivalence of Deterministic Real-Time One-Counter Automata Is NL-CompleteStanislav Böhm, Stefan Göller. 194-205 [doi]
• The Role of Polymorphism in the Characterisation of Complexity by Soft TypesJacek Chrzaszcz, Aleksy Schubert. 219-230 [doi]
• An Algebraic Theory of Complexity for Valued Constraints: Establishing a Galois ConnectionDavid A. Cohen, Páidí Creed, Peter G. Jeavons, Stanislav Zivny. 231-242 [doi]
• On the Use of Guards for Logics with DataThomas Colcombet, Clemens Ley, Gabriele Puppis. 243-255 [doi]
• An Elementary Proof of a 3n - o(n) Lower Bound on the Circuit Complexity of Affine DispersersEvgeny Demenkov, Alexander S. Kulikov. 256-265 [doi]
• On the Complexity of the l-diversity ProblemRiccardo Dondi, Giancarlo Mauri, Italo Zoppis. 266-277 [doi]
• Infinite Synchronizing Words for Probabilistic AutomataLaurent Doyen, Thierry Massart, Mahsa Shirmohammadi. 278-289 [doi]
• Characterizing EF over Infinite Trees and Modal Logic on Transitive GraphsBalder ten Cate, Alessandro Facchini. 290-302 [doi]
• Parity Games on Graphs with Medium Tree-WidthJohn Fearnley, Oded Lachish. 303-314 [doi]
• Satisfiability of Systems of Equations of Real Analytic Functions Is Quasi-decidablePeter Franek, Stefan Ratschan, Piotr Zgliczynski. 315-326 [doi]
• On Minimising Automata with ErrorsPawel Gawrychowski, Artur Jez, Andreas Maletti. 327-338 [doi]
• Contracting a Chordal Graph to a Split Graph or a TreePetr A. Golovach, Marcin Kaminski, Daniël Paulusma. 339-350 [doi]
• Quantum Finite Automata and Probabilistic Reversible Automata: R-trivial Idempotent LanguagesMarats Golovkins, Maksim Kravtsev, Vasilijs Kravcevs. 351-363 [doi]
• A Universally Defined Undecidable Unimodal LogicEdith Hemaspaandra, Henning Schnoor. 364-375 [doi]
• On the Approximability of Minimum Topic Connected Overlay and Its Special InstancesJun Hosoda, Juraj Hromkovic, Taisuke Izumi, Hirotaka Ono, Monika Steinová, Koichi Wada. 376-387 [doi]
• Can Everybody Sit Closer to Their Friends Than Their Enemies?Anne-Marie Kermarrec, Christopher Thraves. 388-399 [doi]
• Submodularity on a Tree: Unifying L^/natural -Convex and Bisubmodular FunctionsVladimir Kolmogorov. 400-411 [doi]
• Streaming Algorithms for Recognizing Nearly Well-Parenthesized ExpressionsAndreas Krebs, Nutan Limaye, Srikanth Srinivasan. 412-423 [doi]
• Size and Computation of Injective Tree Automatic PresentationsDietrich Kuske, Thomas Weidner. 424-435 [doi]
• Symmetric Functions Capture General FunctionsRichard J. Lipton, Kenneth W. Regan, Atri Rudra. 436-447 [doi]
• Compressed Word Problems for Inverse MonoidsMarkus Lohrey. 448-459 [doi]
• Pushing for Weighted Tree AutomataAndreas Maletti, Daniel Quernheim. 460-471 [doi]
• Periodicity Algorithms for Partial WordsFlorin Manea, Robert Mercas, Catalin Tiseanu. 472-484 [doi]
• State Complexity of Operations on Input-Driven Pushdown AutomataAlexander Okhotin, Kai Salomaa. 485-496 [doi]
• Conflict Packing Yields Linear Vertex-Kernels for k -FAST, k -dense RTI and a Related ProblemChristophe Paul, Anthony Perez, Stéphan Thomassé. 497-507 [doi]
• Transduction on Kadanoff Sand Pile Model Avalanches, Application to Wave Pattern EmergenceKevin Perrot, Eric Rémila. 508-519 [doi]
• Distributed Synthesis for Regular and Contextfree SpecificationsWladimir Fridman, Bernd Puchala. 532-543 [doi]
• Geometric Graphs with Randomly Deleted Edges - Connectivity and Routing ProtocolsKrzysztof Krzywdzinski, Katarzyna Rybarczyk. 544-555 [doi]
• Untimed Language Preservation in Timed SystemsOcan Sankur. 556-567 [doi]
• Lower Bounds for Linear Decision Trees via an Energy Complexity ArgumentKei Uchizawa, Eiji Takimoto. 568-579 [doi]
• Weak Cost Monadic Logic over Infinite TreesMichael Vanden Boom. 580-591 [doi]
• Linear Problem Kernels for Planar Graph Problems with Small Distance PropertyJianxin Wang, Yongjie Yang, Jiong Guo, Jianer Chen. 592-603 [doi]
• New Parameterized Algorithms for the Edge Dominating Set ProblemMingyu Xiao, Ton Kloks, Sheung-Hung Poon. 604-615 [doi]