Table of Contents

• Frontmatter, Table of Contents, Preface, Conference Organization [doi]
• Polar Codes: Reliable Communication with Complexity Polynomial in the Gap to Shannon Capacity (Invited Talk)Venkatesan Guruswami. 1-1 [doi]
• Computing With a Fixed Number of Pointers (Invited Talk)Martin Hofmann 0001, Ramyaa. 3-18 [doi]
• On Approximation Resistance of Predicates (Invited Talk)Subhash Khot. 19-19 [doi]
• Characterisations of Nowhere Dense Graphs (Invited Talk)Martin Grohe, Stephan Kreutzer, Sebastian Siebertz. 21-40 [doi]
• Intersection Types for Normalization and Verification (Invited Talk)Kazushige Terui. 41-42 [doi]
• Polynomial Kernels for lambda-extendible Properties Parameterized Above the Poljak-Turzik BoundRobert Crowston, Mark Jones, Gabriele Muciaccia, Geevarghese Philip, Ashutosh Rai, Saket Saurabh. 43-54 [doi]
• On the Parameterised Complexity of String Morphism ProblemsHenning Fernau, Markus L. Schmid, Yngve Villanger. 55-66 [doi]
• Partially Polynomial Kernels for Set Cover and Test CoverManu Basavaraju, Mathew C. Francis, M. S. Ramanujan, Saket Saurabh. 67-78 [doi]
• Parameterized Complexity of the Anchored k-Core Problem for Directed GraphsRajesh Hemant Chitnis, Fedor V. Fomin, Petr A. Golovach. 79-90 [doi]
• Böhm Trees as Higher-Order Recursive SchemesPierre Clairambault, Andrzej S. Murawski. 91-102 [doi]
• Evaluation is MSOL-compatibleSylvain Salvati, Igor Walukiewicz. 103-114 [doi]
• Model Checking and Functional Program TransformationsAxel Haddad. 115-126 [doi]
• A Theory of Partitioned Global Address SpacesGeorgel Calin, Egor Derevenetc, Rupak Majumdar, Roland Meyer. 127-139 [doi]
• A Strong Direct Product Theorem for the Tribes Function via the Smooth-Rectangle BoundPrahladh Harsha, Rahul Jain. 141-152 [doi]
• Inapproximability of Rainbow ColouringL. Sunil Chandran, Deepak Rajendraprasad. 153-162 [doi]
• Primal Infon Logic: Derivability in Polynomial TimeAnguraj Baskar, Prasad Naldurg, K. R. Raghavendra, S. P. Suresh. 163-174 [doi]
• Composition Problems for BraidsIgor Potapov. 175-187 [doi]
• DLOGTIME Proof SystemsAndreas Krebs, Nutan Limaye. 189-200 [doi]
• On Improved Degree Lower Bounds for Polynomial ApproximationSrikanth Srinivasan. 201-212 [doi]
• Implementing Realistic Asynchronous AutomataS. Akshay, Ionut Dinca, Blaise Genest, Alin Stefanescu. 213-224 [doi]
• Computation of Summaries Using Net UnfoldingsJavier Esparza, Loïg Jezequel, Stefan Schwoon. 225-236 [doi]
• Faster Deterministic Algorithms for r-Dimensional Matching Using Representative SetsPrachi Goyal, Neeldhara Misra, Fahad Panolan. 237-248 [doi]
• Distributed and Parallel Algorithms for Set Cover Problems with Small Neighborhood CoversArchita Agarwal, Venkatesan T. Chakaravarthy, Anamitra R. Choudhury, Sambuddha Roy, Yogish Sabharwal. 249-261 [doi]
• Replica Placement via Capacitated Vertex CoverSonika Arora, Venkatesan T. Chakaravarthy, Neelima Gupta, Koyel Mukherjee, Yogish Sabharwal. 263-274 [doi]
• Knapsack Cover Subject to a Matroid ConstraintVenkatesan T. Chakaravarthy, Anamitra R. Choudhury, Sivaramakrishnan R. Natarajan, Sambuddha Roy. 275-286 [doi]
• Jumping Automata for Uniform StrategiesBastien Maubert, Sophie Pinchinat. 287-298 [doi]
• Emptiness Of Alternating Tree Automata Using Games With Imperfect InformationNathanaël Fijalkow, Sophie Pinchinat, Olivier Serre. 299-311 [doi]
• Saturation of Concurrent Collapsible Pushdown SystemsMatthew Hague. 313-325 [doi]
• Decidability Results on the Existence of Lookahead Delegators for NFAChristof Löding, Stefan Repke. 327-338 [doi]
• Fair Matchings and Related ProblemsChien-Chung Huang, Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail 0001. 339-350 [doi]
• Ranking with Diverse Intents and Correlated ContentsJian Li, Zeyu Zhang. 351-362 [doi]
• Separating Regular Languages by Locally Testable and Locally Threshold Testable LanguagesThomas Place, Lorijn van Rooijen, Marc Zeitoun. 363-375 [doi]
• On the Structure and Complexity of Rational Sets of Regular LanguagesAndreas Holzer, Christian Schallhart, Michael Tautschnig, Helmut Veith. 377-388 [doi]
• Geometric Avatar ProblemsMario E. Consuegra, Giri Narasimhan. 389-400 [doi]
• Clustering With Center ConstraintsParinya Chalermsook, Suresh Venkatasubramanian. 401-412 [doi]
• On Infinite Words Determined by Stack AutomataTim Smith. 413-424 [doi]
• The Combinatorics of Non-determinismOlivier Bodini, Antoine Genitrini, Frédéric Peschanski. 425-436 [doi]
• Renting a CloudBarna Saha. 437-448 [doi]
• Energy Efficient Scheduling and Routing via Randomized RoundingEvripidis Bampis, Alexander Kononov, Dimitrios Letsios, Giorgio Lucarelli, Maxim Sviridenko. 449-460 [doi]
• PTAS for Ordered Instances of Resource Allocation ProblemsKamyar Khodamoradi, Ramesh Krishnamurti, Arash Rafiey, Georgios Stamoulis. 461-473 [doi]
• On the Pseudoperiodic Extension of u^l = v^m w^nFlorin Manea, Mike Müller, Dirk Nowotka. 475-486 [doi]
• Solvency Markov Decision Processes with InterestTomás Brázdil, Taolue Chen, Vojtech Forejt, Petr Novotný, Aistis Simaitis. 487-499 [doi]
• Parameterized Verification of Many Identical Probabilistic Timed ProcessesNathalie Bertrand, Paulin Fournier. 501-513 [doi]
• Simulation Over One-counter Nets is PSPACE-CompletePiotr Hofman, Slawomir Lasota, Richard Mayr, Patrick Totzke. 515-526 [doi]
• Optimal Constructions for Active DiagnosisStefan Haar, Serge Haddad, Tarek Melliti, Stefan Schwoon. 527-539 [doi]