Table of Contents

• Frontmatter, Table of Contents, Preface, Workshop OrganizationNatacha Portier, Thomas Wilke. [doi]
• The complexity of analyzing infinite-state Markov chains, Markov decision processes, and stochastic games (Invited talk)Kousha Etessami. 1-2 [doi]
• Graph coloring, communication complexity and the stubborn problem (Invited talk)Nicolas Bousquet, Aurélie Lagoutte, Stéphan Thomassé. 3-4 [doi]
• Physarum Computations (Invited talk)Kurt Mehlhorn. 5-6 [doi]
• Algorithmic Graph Structure Theory (Tutorial)Dániel Marx. 7-7 [doi]
• Searching for better fill-inFedor V. Fomin, Yngve Villanger. 8-19 [doi]
• Probably Optimal Graph MotifsAndreas Björklund, Petteri Kaski, Lukasz Kowalik. 20-31 [doi]
• Tight bounds for Parameterized Complexity of Cluster EditingFedor V. Fomin, Stefan Kratsch, Marcin Pilipczuk, Michal Pilipczuk, Yngve Villanger. 32-43 [doi]
• Bounded-width QBF is PSPACE-completeAlbert Atserias, Sergi Oliva. 44-54 [doi]
• Model Counting for CNF Formulas of Bounded Modular TreewidthDaniël Paulusma, Friedrich Slivovsky, Stefan Szeider. 55-66 [doi]
• Backdoors to q-HornSerge Gaspers, Sebastian Ordyniak, M. S. Ramanujan, Saket Saurabh, Stefan Szeider. 67-79 [doi]
• On Polynomial Kernels for Sparse Integer Linear ProgramsStefan Kratsch. 80-91 [doi]
• Linear kernels for (connected) dominating set on graphs with excluded topological subgraphsFedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Dimitrios M. Thilikos. 92-103 [doi]
• The PCP theorem for NP over the realsMartijn Baartse, Klaus Meer. 104-115 [doi]
• Mutual DimensionAdam Case, Jack H. Lutz. 116-126 [doi]
• Exact and Approximation Algorithms for the Maximum Constraint Satisfaction Problem over the Point AlgebraYoichi Iwata, Yuichi Yoshida. 127-138 [doi]
• Local Search is Better than Random Assignment for Bounded Occurrence Ordering k-CSPsKonstantin Makarychev. 139-147 [doi]
• The complexity of approximating conservative counting CSPsXi Chen, Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum, Pinyan Lu, Colin McQuillan, David Richerby. 148-159 [doi]
• Lossy Chains and Fractional Secret SharingYuval Ishai, Eyal Kushilevitz, Omer Strulovich. 160-171 [doi]
• Two Hands Are Better Than One (up to constant factors): Self-Assembly In The 2HAM vs. aTAMSarah Cannon, Erik D. Demaine, Martin L. Demaine, Sarah Eisenstat, Matthew J. Patitz, Robert T. Schweller, Scott M. Summers, Andrew Winslow. 172-184 [doi]
• Unlabeled Data Does Provably HelpMalte Darnstädt, Hans-Ulrich Simon, Balázs Szörényi. 185-196 [doi]
• Computing cutwidth and pathwidth of semi-complete digraphs via degree orderingsMichal Pilipczuk. 197-208 [doi]
• On Pairwise SpannersMarek Cygan, Fabrizio Grandoni, Telikepalli Kavitha. 209-220 [doi]
• Excluded vertex-minors for graphs of linear rank-width at most k.Jisu Jeong, O-joung Kwon, Sang-il Oum. 221-232 [doi]
• Recompression: a simple and powerful technique for word equationsArtur Jez. 233-244 [doi]
• Fast Algorithms for Abelian Periods in Words and Greatest Common Divisor QueriesTomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter. 245-256 [doi]
• Finding Pseudo-repetitionsPawel Gawrychowski, Florin Manea, Robert Mercas, Dirk Nowotka, Catalin Tiseanu. 257-268 [doi]
• Algorithms for Designing Pop-Up CardsZachary Abel, Erik D. Demaine, Martin L. Demaine, Sarah Eisenstat, Anna Lubiw, André Schulz, Diane L. Souvaine, Giovanni Viglietta, Andrew Winslow. 269-280 [doi]
• Space-Time Trade-offs for Stack-Based AlgorithmsLuis Barba, Matias Korman, Stefan Langerman, Rodrigo I. Silveira, Kunihiko Sadakane. 281-292 [doi]
• L_1 Shortest Path Queries among Polygonal Obstacles in the PlaneDanny Z. Chen, Haitao Wang. 293-304 [doi]
• Quantifier Alternation in Two-Variable First-Order Logic with Successor Is DecidableManfred Kufleitner, Alexander Lauser. 305-316 [doi]
• FO^2 with one transitive relation is decidableWieslaw Szwast, Lidia Tendera. 317-328 [doi]
• Two-variable first order logic with modular predicates over wordsLuc Dartois, Charles Paperman. 329-340 [doi]
• Abusing the Tutte Matrix: An Algebraic Instance Compression for the K-set-cycle ProblemMagnus Wahlström. 341-352 [doi]
• Subexponential-Time Parameterized Algorithm for Steiner Tree on Planar GraphsMarcin Pilipczuk, Michal Pilipczuk, Piotr Sankowski, Erik Jan van Leeuwen. 353-364 [doi]
• The arithmetic complexity of tensor contractionsFlorent Capelli, Arnaud Durand, Stefan Mengel. 365-376 [doi]
• Search versus Decision for Election Manipulation ProblemsEdith Hemaspaandra, Lane A. Hemaspaandra, Curtis Menton. 377-388 [doi]
• Improved Bounds for Online Preemptive MatchingLeah Epstein, Asaf Levin, Danny Segev, Oren Weimann. 389-399 [doi]
• Parameterized Matching in the Streaming ModelMarkus Jalsenius, Benny Porat, Benjamin Sach. 400-411 [doi]
• Popular Matchings: Structure and Cheating StrategiesMeghana Nasre. 412-423 [doi]
• Fooling One-Sided Quantum ProtocolsHartmut Klauck, Ronald de Wolf. 424-433 [doi]
• Explicit relation between all lower bound techniques for quantum query complexityLoïck Magnin, Jérémie Roland. 434-445 [doi]
• Optimal quantum query bounds for almost all Boolean functionsAndris Ambainis, Arturs Backurs, Juris Smotrovs, Ronald de Wolf. 446-453 [doi]
• Streaming Complexity of Checking Priority QueuesNathanaël François, Frédéric Magniez. 454-465 [doi]
• Deterministic algorithms for skewed matrix productsKonstantin Kutzkov. 466-477 [doi]
• The Simulated Greedy Algorithm for Several Submodular Matroid Secretary ProblemsTengyu Ma, Bo Tang 0003, Yajun Wang. 478-489 [doi]
• Hardness of Conjugacy, Embedding and Factorization of multidimensional Subshifts of Finite TypeEmmanuel Jeandel, Pascal Vanier. 490-501 [doi]
• The finiteness of a group generated by a 2-letter invertible-reversible Mealy automaton is decidableInes Klimann. 502-513 [doi]
• Mortality of Iterated Piecewise Affine Functions over the Integers: Decidability and Complexity (extended abstract)Amir M. Ben-Amram. 514-525 [doi]
• On the practically interesting instances of MAXCUTYonatan Bilu, Amit Daniely, Nati Linial, Michael Saks. 526-537 [doi]
• First Fit bin packing: A tight analysisGyörgy Dósa, Jiri Sgall. 538-549 [doi]
• Constrained Binary Identification ProblemAmin Karbasi, Morteza Zadimoghaddam. 550-561 [doi]
• Regular languages of thin treesMikolaj Bojanczyk, Tomasz Idziaszek, Michal Skrzypczak. 562-573 [doi]
• Approximate comparison of distance automataThomas Colcombet, Laure Daviaud. 574-585 [doi]
• The Rank of Tree-Automatic Linear OrderingsMartin Huschenbett. 586-597 [doi]
• A general framework for the realistic analysis of sorting and searching algorithms. Application to some popular algorithmsJulien Clément, Thu Hien Nguyen Thi, Brigitte Vallée. 598-609 [doi]
• Search using queries on indistinguishable itemsMark Braverman, Gal Oshri. 610-621 [doi]
• Pebbling, Entropy and Branching Program Size Lower BoundsBalagopal Komarath, Jayalal M. N. Sarma. 622-633 [doi]
• Advice Lower Bounds for the Dense Model TheoremThomas Watson. 634-645 [doi]
• Author IndexNatacha Portier, Thomas Wilke. 646-647 [doi]