Table of Contents

• Frontmatter, Foreword, Conference Organization, External Reviewers, Table of ContentsChristoph Dürr, Thomas Wilke. [doi]
• Forms of Determinism for Automata (Invited Talk)Thomas Colcombet. 1-23 [doi]
• Iterative Methods in Combinatorial Optimization (Invited Talk)R. Ravi. 24-24 [doi]
• On Randomness in Hash Functions (Invited Talk)Martin Dietzfelbinger. 25-28 [doi]
• Pseudo-deterministic Algorithms (Invited Talk)Shafi Goldwasser. 29-29 [doi]
• 13/9-approximation for Graphic TSPMarcin Mucha. 30-41 [doi]
• A (k+3)/2-approximation algorithm for monotone submodular k-set packing and general k-exchange systemsJustin Ward. 42-53 [doi]
• A Pumping Lemma for Pushdown Graphs of Any LevelPawel Parys. 54-65 [doi]
• Algorithmic Meta Theorems for Circuit Classes of Constant and Logarithmic DepthMichael Elberfeld, Andreas Jakoby, Till Tantau. 66-77 [doi]
• An Approximation Algorithm for #k-SATMarc Thurley. 78-87 [doi]
• Asymptotic enumeration of Minimal AutomataFrédérique Bassino, Julien David, Andrea Sportiello. 88-99 [doi]
• Balanced Partitions of Trees and ApplicationsAndreas Emil Feldmann, Luca Foschini. 100-111 [doi]
• Cache-Oblivious Implicit Predecessor Dictionaries with the Working-Set PropertyGerth Stølting Brodal, Casper Kejlberg-Rasmussen. 112-123 [doi]
• Chernoff-Hoeffding Bounds for Markov Chains: Generalized and SimplifiedKai-Min Chung, Henry Lam, Zhenming Liu, Michael Mitzenmacher. 124-135 [doi]
• Compressed Membership for NFA (DFA) with Compressed Labels is in NP (P)Artur Jez. 136-147 [doi]
• Concurrency Makes Simple Theories HardStefan Göller, Anthony Widjaja Lin. 148-159 [doi]
• Conflict-free Chromatic Art Gallery CoverageAndreas Bärtschi, Subhash Suri. 160-171 [doi]
• Constant compression and random weightsWolfgang Merkle, Jason Teutsch. 172-181 [doi]
• Contraction checking in graphs on surfacesMarcin Kaminski, Dimitrios M. Thilikos. 182-193 [doi]
• Distribution of the number of accessible states in a random deterministic automatonArnaud Carayol, Cyril Nicaud. 194-205 [doi]
• Edge-disjoint Odd Cycles in 4-edge-connected GraphsKen-ichi Kawarabayashi, Yusuke Kobayashi. 206-217 [doi]
• Efficient algorithms for highly compressed data: The Word Problem in Higman's group is in PVolker Diekert, Jürn Laun, Alexander Ushakov. 218-229 [doi]
• Efficiently Decodable Compressed Sensing by List-Recoverable Codes and RecursionHung Q. Ngo, Ely Porat, Atri Rudra. 230-241 [doi]
• Ehrenfeucht-Fraïssé goes elementarily automatic for structures of bounded degreeAntoine Durand-Gasselin, Peter Habermehl. 242-253 [doi]
• Improved Bounds for Bipartite Matching on SurfacesSamir Datta, Arjun Gopalan, Raghav Kulkarni, Raghunath Tewari. 254-265 [doi]
• Improved Spectral Sparsification and Numerical Algorithms for SDD MatricesIoannis Koutis, Alex Levin, Richard Peng. 266-277 [doi]
• Linear min-max relation between the treewidth of H-minor-free graphs and its largest gridKen-ichi Kawarabayashi, Yusuke Kobayashi. 278-289 [doi]
• Linear-Space Data Structures for Range Mode Query in ArraysTimothy M. Chan, Stephane Durocher, Kasper Green Larsen, Jason Morrison, Bryan T. Wilkinson. 290-301 [doi]
• Log-supermodular functions, functional clones and counting CSPsAndrei A. Bulatov, Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum. 302-313 [doi]
• Low Randomness Rumor Spreading via HashingGeorge Giakkoupis, Thomas Sauerwald, He Sun 0001, Philipp Woelfel. 314-325 [doi]
• Lower Bounds on the Complexity of MSO_1 Model-CheckingRobert Ganian, Petr Hlinený, Alexander Langer, Jan Obdrzálek, Peter Rossmanith, Somnath Sikdar. 326-337 [doi]
• LP can be a cure for Parameterized ProblemsN. S. Narayanaswamy, Venkatesh Raman, M. S. Ramanujan, Saket Saurabh. 338-349 [doi]
• Mind Change Speed-up for Learning Languages from Positive DataSanjay Jain, Efim B. Kinber. 350-361 [doi]
• Monomials in arithmetic circuits: Complete problems in the counting hierarchyHervé Fournier, Guillaume Malod, Stefan Mengel. 362-373 [doi]
• Motion planning with pulley, rope, and basketsChristian Eggermont, Gerhard J. Woeginger. 374-383 [doi]
• On Computing Pareto Stable AssignmentsNing Chen. 384-395 [doi]
• On the separation question for tree languagesAndré Arnold, Henryk Michalewski, Damian Niwinski. 396-407 [doi]
• On the treewidth and related parameters of random geometric graphsDieter Mitsche, Guillem Perarnau. 408-419 [doi]
• Optimizing Linear Functions with Randomized Search Heuristics - The Robustness of MutationCarsten Witt. 420-431 [doi]
• Parameterized Complexity of Connected Even/Odd Subgraph ProblemsFedor V. Fomin, Petr A. Golovach. 432-440 [doi]
• Playing Mastermind With Constant-Size MemoryBenjamin Doerr, Carola Winzen. 441-452 [doi]
• Polynomial-time Isomorphism Test for Groups with Abelian Sylow TowersLászló Babai, Youming Qiao. 453-464 [doi]
• Preemptive and Non-Preemptive Generalized Min Sum Set CoverSungjin Im, Maxim Sviridenko, Ruben van der Zwaan. 465-476 [doi]
• Randomized Communication Complexity for Linear Algebra Problems over Finite FieldsXiaoming Sun, Chengu Wang. 477-488 [doi]
• Regular tree languages, cardinality predicates, and addition-invariant FOFrederik Harwath, Nicole Schweikardt. 489-500 [doi]
• Simpler Approximation of the Maximum Asymmetric Traveling Salesman ProblemKatarzyna E. Paluch, Khaled M. Elbassioni, Anke van Zuylen. 501-506 [doi]
• Stabilization of Branching Queueing NetworksTomás Brázdil, Stefan Kiefer. 507-518 [doi]
• Stronger Lower Bounds and Randomness-Hardness Trade-Offs Using Associated Algebraic Complexity ClassesMaurice J. Jansen, Rahul Santhanam. 519-530 [doi]
• Surface Split Decompositions and Subgraph Isomorphism in Graphs on SurfacesPaul Bonsma. 531-542 [doi]
• The Denjoy alternative for computable functionsLaurent Bienvenu, Rupert Hölzl, Joseph S. Miller, André Nies. 543-554 [doi]
• The Determinacy of Context-Free GamesOlivier Finkel. 555-566 [doi]
• The dimension of ergodic random sequencesMathieu Hoyrup. 567-576 [doi]
• The Field of Reals is not omega-AutomaticFaried Abu Zaid, Erich Grädel, Lukasz Kaiser. 577-588 [doi]
• The Limits of Decidability for First Order Logic on CPDA GraphsChristopher H. Broadbent. 589-600 [doi]
• The Power of Local Search: Maximum Coverage over a MatroidYuval Filmus, Justin Ward. 601-612 [doi]
• Trichotomy for Integer Linear Systems Based on Their Sign PatternsKei Kimura, Kazuhisa Makino. 613-623 [doi]
• Tying up the loose ends in fully LZW-compressed pattern matchingPawel Gawrychowski. 624-635 [doi]
• Variable time amplitude amplification and quantum algorithms for linear algebra problemsAndris Ambainis. 636-647 [doi]
• Weak MSO+U over infinite treesMikolaj Bojanczyk, Szymon Torunczyk. 648-660 [doi]