Table of Contents

• Front Matter, Table of Contents, Preface, Conference Organization [doi]
• New Developments in Iterated Rounding (Invited Talk)Nikhil Bansal. 1-10 [doi]
• Reasoning About Distributed Systems: WYSIWYG (Invited Talk)Aiswarya Cyriac, Paul Gastin. 11-30 [doi]
• Colour Refinement: A Simple Partitioning Algorithm with Applications From Graph Isomorphism Testing to Machine Learning (Invited Talk)Martin Grohe. 31-31 [doi]
• Properties and Utilization of Capacitated Automata (Invited Talk)Orna Kupferman, Tami Tamir. 33-44 [doi]
• Algorithms, Games, and Evolution (Invited Talk)Erick Chastain, Adi Livnat, Christos H. Papadimitriou, Umesh V. Vazirani. 45-46 [doi]
• The Polynomial Method in Circuit Complexity Applied to Algorithm Design (Invited Talk)Richard Ryan Williams. 47-60 [doi]
• Vertex Exponential Algorithms for Connected f-FactorsGeevarghese Philip, M. S. Ramanujan. 61-71 [doi]
• Connecting Vertices by Independent TreesManu Basavaraju, Fedor V. Fomin, Petr A. Golovach, Saket Saurabh. 73-84 [doi]
• Tree Deletion Set Has a Polynomial Kernel (but no OPT^O(1) Approximation)Archontia C. Giannopoulou, Daniel Lokshtanov, Saket Saurabh, Ondrej Suchý. 85-96 [doi]
• Editing to Eulerian GraphsKonrad Kazimierz Dabrowski, Petr A. Golovach, Pim van 't Hof, Daniël Paulusma. 97-108 [doi]
• Parameterized Complexity of Fixed Variable LogicsChristoph Berkholz, Michael Elberfeld. 109-120 [doi]
• Synchronizing Words for Weighted and Timed AutomataLaurent Doyen 0001, Line Juhl, Kim Guldstrand Larsen, Nicolas Markey, Mahsa Shirmohammadi. 121-132 [doi]
• Finite-Valued Weighted AutomataEmmanuel Filiot, Raffaella Gentilini, Jean-François Raskin. 133-145 [doi]
• First-order Definable String TransformationsEmmanuel Filiot, Shankara Narayanan Krishna, Ashutosh Trivedi. 147-159 [doi]
• Regular SensingShaull Almagor, Denis Kuperberg, Orna Kupferman. 161-173 [doi]
• Symbolic Solving of Extended Regular Expression InequalitiesMatthias Keil, Peter Thiemann. 175-186 [doi]
• Solving the Stable Set Problem in Terms of the Odd Cycle Packing NumberAdrian Bock, Yuri Faenza, Carsten Moldenhauer, Andres J. Ruiz-Vargas. 187-198 [doi]
• Lift & Project Systems Performing on the Partial Vertex Cover PolytopeKonstantinos Georgiou, Edward Lee. 199-211 [doi]
• Replica Placement on Directed Acyclic GraphsSonika Arora, Venkatesan T. Chakaravarthy, Kanika Gupta, Neelima Gupta, Yogish Sabharwal. 213-225 [doi]
• Maintaining Approximate Maximum Matching in an Incremental Bipartite Graph in Polylogarithmic Update TimeManoj Gupta. 227-239 [doi]
• The Complexity of Counting Models of Linear-time Temporal LogicHazem Torfah, Martin Zimmermann 0002. 241-252 [doi]
• Extending Temporal Logics with Data Variable QuantificationsFu Song, Zhilin Wu. 253-265 [doi]
• Generalized Data Automata and Fixpoint LogicThomas Colcombet, Amaldev Manuel. 267-278 [doi]
• Consistency of Injective Tree PatternsClaire David, Nadime Francis, Filip Murlak. 279-290 [doi]
• Asymptotically Optimal Encodings for Range SelectionGonzalo Navarro, Rajeev Raman, Srinivasa Rao Satti. 291-301 [doi]
• Output-Sensitive Pattern Extraction in SequencesRoberto Grossi, Giulia Menconi, Nadia Pisanti, Roberto Trani, Søren Vind. 303-314 [doi]
• Robust Proximity Search for Balls Using Sublinear SpaceSariel Har-Peled, Nirman Kumar. 315-326 [doi]
• The Benes Network is q*(q-1)/2n-Almost q-set-wise IndependentEfraim Gelman, Amnon Ta-Shma. 327-338 [doi]
• Notes on Counting with Finite MachinesDmitry V. Chistikov. 339-350 [doi]
• Mixed Nash Equilibria in Concurrent Terminal-Reward GamesPatricia Bouyer, Nicolas Markey, Daniel Stan. 351-363 [doi]
• Quantitative Games with Interval ObjectivesPaul Hunter, Jean-François Raskin. 365-377 [doi]
• Playing SafeThomas Colcombet, Nathanaël Fijalkow, Florian Horn. 379-390 [doi]
• Metaconfluence of Calculi with Explicit Substitutions at a DistanceFlávio L. C. de Moura, Delia Kesner, Mauricio Ayala-Rincón. 391-402 [doi]
• Behavioral Metrics via Functor LiftingPaolo Baldan, Filippo Bonchi, Henning Kerstan, Barbara König. 403-415 [doi]
• Foundation of Diagnosis and Predictability in Probabilistic SystemsNathalie Bertrand, Serge Haddad, Engel Lefaucheux. 417-429 [doi]
• Lipschitz Robustness of Finite-state TransducersThomas A. Henzinger, Jan Otop, Roopsha Samanta. 431-443 [doi]
• Separating Cook Completeness from Karp-Levin Completeness Under a Worst-Case Hardness HypothesisDebasis Mandal, A. Pavan, Rajeswari Venugopalan. 445-456 [doi]
• Constructing Small Tree Grammars and Small Circuits for FormulasDanny Hucke, Markus Lohrey, Eric Noeth. 457-468 [doi]
• One Time-traveling Bit is as Good as Logarithmically ManyRyan O'Donnell, A. C. Cem Say. 469-480 [doi]
• New Bounds for the Garden-Hose ModelHartmut Klauck, Supartha Podder. 481-492 [doi]
• Homomorphism Polynomials Complete for VPArnaud Durand, Meena Mahajan, Guillaume Malod, Nicolas de Rugy-Altherre, Nitin Saurabh. 493-504 [doi]
• Computing Information Flow Using Symbolic Model-CheckingRohit Chadha, Umang Mathur, Stefan Schwoon. 505-516 [doi]
• Information Leakage of Non-Terminating ProcessesFabrizio Biondi, Axel Legay, Bo Friis Nielsen, Pasquale Malacaria, Andrzej Wasowski. 517-529 [doi]
• Multiple-Environment Markov Decision ProcessesJean-François Raskin, Ocan Sankur. 531-543 [doi]
• Summary-Based Inter-Procedural Analysis via Modular Trace RefinementFranck Cassez, Christian Müller, Karla Burnett. 545-556 [doi]
• A Two-Level Logic Approach to Reasoning About Typed Specification LanguagesMary Southern, Kaustuv Chaudhuri. 557-569 [doi]
• On the Complexity of Computing Maximum Entropy for Markovian ModelsTaolue Chen, Tingting Han. 571-583 [doi]
• New Time-Space Upperbounds for Directed Reachability in High-genus and H-minor-free GraphsDiptarka Chakraborty, Aduri Pavan, Raghunath Tewari, N. V. Vinodchandran, Lin Yang. 585-595 [doi]
• Polynomial Min/Max-weighted Reachability is in Unambiguous Log-spaceAnant Dhayal, Jayalal Sarma, Saurabh Sawlani. 597-609 [doi]
• On Bounded Reachability Analysis of Shared Memory SystemsMohamed Faouzi Atig, Ahmed Bouajjani, K. Narayan Kumar, Prakash Saivasan. 611-623 [doi]
• Parameterized Communicating Automata: Complementation and Model CheckingBenedikt Bollig, Paul Gastin, Akshay Kumar. 625-637 [doi]
• Distributed Synthesis for Acyclic ArchitecturesAnca Muscholl, Igor Walukiewicz. 639-651 [doi]
• Verification of Dynamic Register AutomataParosh Aziz Abdulla, Mohamed Faouzi Atig, Ahmet Kara, Othmane Rezine. 653-665 [doi]