Accepted Papers

Rajesh Chitnis, Fedor Fomin and Petr Golovach. Parameterized Complexity of the Anchored k-Core Problem for Directed Graphs
Henning Fernau, Markus L. Schmid and Yngve Villanger. On the Parameterised Complexity of String Morphism Problems
Parinya Chalermsook and Suresh Venkatasubramanian. Clustering with center constraints
Florin Manea, Mike Müller and Dirk Nowotka. On the Pseudoperiodic Extension of $u^\ell = v^mw^n$ (Extended Abstract)
Jian Li and Zeyu Zhang. Ranking with Diverse Intents and Correlated Contents
Olivier Bodini, Antoine Genitrini and Frederic Peschanski. The Combinatorics of Non-determinism
Javier Esparza, Loig Jezequel and Stefan Schwoon. Computation of summaries using net unfoldings
Thomas Place, Lorijn van Rooijen and Marc Zeitoun. Separating Regular Languages by Locally Testable and Locally Threshold Testable Languages
Mario Consuegra and Giri Narasimhan. Geometric Avatar Problems
Sylvain Salvati and Igor Walukiewicz. Evaluation is MSOL-compatible
Georgel Calin, Egor Derevenetc, Rupak Majumdar and Roland Meyer. A Theory of Partitioned Global Address Spaces
Piotr Hofman, Sławomir Lasota, Richard Mayr and Patrick Totzke. Simulation Over One-counter Nets is PSPACE-Complete
Prachi Goyal, Neeldhara Misra and Fahad Panolan. Faster Deterministic Algorithms for r-Dimensional Matching Using Representative Sets
Evripidis Bampis, Alexander Kononov, Dimitrios Letsios, Giorgio Lucarelli and Maxim Sviridenko. Energy Efficient Scheduling and Routing via Randomized Rounding
Robert Crowston, Mark Jones, Gabriele Muciaccia, Geevarghese Philip, Ashutosh Rai and Saket Saurabh. Polynomial Kernels for lambda-extendible Properties Parameterized Above the Poljak-Turzik Bound
Igor Potapov. Composition problems for braids
A Baskar, Prasad Naldurg, Raghavendra K. R. and S P Suresh. Primal infon logic: derivability in polynomial time
Christof Löding and Stefan Repke. Decidability Results on the Existence of Lookahead Delegators for NFA
Nathalie Bertrand and Paulin Fournier. Parameterized verification of many identical probabilistic timed processes
Stefan Haar, Serge Haddad, Tarek Melliti and Stefan Schwoon. Optimal Constructions for Active Diagnosis
L. Sunil Chandran and Deepak Rajendraprasad. Inapproximability of Rainbow Colouring
Manu Basavaraju, Mathew C. Francis, Ramanujan M. S. and Saket Saurabh. Partial Kernels for Set Cover and Test Cover
Archita Agarwal, Venkatesan Chakaravarthy, Anamitra Roy Choudhury, Sambuddha Roy and Yogish Sabharwal. Distributed and Parallel Algorithms for Set Cover Problems with Small Neighborhood Covers
Matthew Hague. Saturation of Concurrent Collapsible Pushdown Systems
Axel Haddad. Model Checking and Functional Program Transformations
Chien-Chung Huang, Telikepalli Kavitha, Kurt Mehlhorn and Dimitrios Michail. Fair Matchings and Related Problems
Sonika Arora, Venkatesan Chakaravarthy, Neelima Gupta, Koyel Mukherjee and Yogish Sabharwal. Replica Placement via Capacitated Vertex Cover
Bastien Maubert and Sophie Pinchinat. Jumping Automata for Uniform Strategies
Prahladh Harsha and Rahul Jain. A strong direct product theorem for the tribes function via the smooth-rectangle bound
Venkatesan Chakaravarthy, Anamitra Roy Choudhury, Sivaramakrishnan Natarajan and Sambuddha Roy. Knapsack Cover subject to a Matroid Constraint
Pierre Clairambault and Andrzej Murawski. Böhm Trees as Higher-Order Recursive Schemes
S. Akshay, Ionut Dinca, Blaise Genest and Alin Stefanescu. Implementing Realistic Asynchronous Automata
Kamyar Khodamoradi, Ramesh Krishnamurti, Arash Rafiey and Georgios Stamoulis. PTAS for Ordered Instances of Resource Allocation Problems
Andreas Krebs and Nutan Limaye. DLOGTIME proof systems
Srikanth Srinivasan. On improved degree lower bounds for polynomial approximation
Barna Saha. Renting a Cloud
Andreas Holzer, Christian Schallhart, Michael Tautschnig and Helmut Veith. On the Structure and Complexity of Rational Sets of Regular Languages
Tim Smith. On Infinite Words Determined by Stack Automata
Nathanaël Fijalkow, Sophie Pinchinat and Olivier Serre. Emptiness Of Alternating Tree Automata Using Games With Imperfect Information
Tomas Brazdil, Taolue Chen, Vojtech Forejt, Petr Novotný and Aistis Simaitis. Solvency Markov Decision Processes with Interest