Table of Contents

• On the Complexity of Ontological Reasoning under Disjunctive Existential RulesGeorg Gottlob, Marco Manna, Michael Morak, Andreas Pieris. 1-18 [doi]
• New Races in Parameterized AlgorithmicsChristian Komusiewicz, Rolf Niedermeier. 19-30 [doi]
• Scott Is Always SimpleAntonino Salibra. 31-45 [doi]
• A Toolkit for Proving Limitations of the Expressive Power of LogicsNicole Schweikardt. 46-47 [doi]
• How to Reconstruct a GenomeEsko Ukkonen. 48 [doi]
• Simple Models for Recursive SchemesIgor Walukiewicz. 49-60 [doi]
• Transportation under Nasty Side ConstraintsGerhard J. Woeginger. 61-62 [doi]
• Computation of Least Fixed PointsMihalis Yannakakis. 63 [doi]
• Unordered Constraint Satisfaction GamesLauri Ahlroth, Pekka Orponen. 64-75 [doi]
• A Polynomial-Time Algorithm for Computing the Maximum Common Subgraph of Outerplanar Graphs of Bounded DegreeTatsuya Akutsu, Takeyuki Tamura. 76-87 [doi]
• Reductions to the Set of Random Strings: The Resource-Bounded CaseEric Allender, Harry Buhrman, Luke Friedman, Bruno Loff. 88-99 [doi]
• Approximate Graph IsomorphismVikraman Arvind, Johannes Köbler, Sebastian Kuhnert, Yadu Vasudev. 100-111 [doi]
• Near-Optimal Expanding Generator Sets for Solvable Permutation GroupsVikraman Arvind, Partha Mukhopadhyay, Prajakta Nimbhorkar, Yadu Vasudev. 112-123 [doi]
• Generating Functions of Timed LanguagesEugene Asarin, Nicolas Basset, Aldric Degorre, Dominique Perrin. 124-135 [doi]
• The Robust Set Problem: Parameterized Complexity and ApproximationCristina Bazgan, Morgan Chopin. 136-147 [doi]
• Mortality for 2×2 Matrices Is NP-HardPaul C. Bell, Mika Hirvensalo, Igor Potapov. 148-159 [doi]
• Solving Counter Parity GamesDietmar Berwanger, Lukasz Kaiser, Simon Leßenich. 160-171 [doi]
• Drawing Planar Graphs on Points Inside a PolygonTherese C. Biedl, Peter Floderus. 172-183 [doi]
• New Advances in Reoptimizing the Minimum Steiner Tree ProblemDavide Bilò, Anna Zych. 184-197 [doi]
• Smoothed Complexity TheoryMarkus Bläser, Bodo Manthey. 198-209 [doi]
• Abelian Pattern Avoidance in Partial WordsFrancine Blanchet-Sadri, Sean Simmons. 210-221 [doi]
• The Complexity of Rerouting Shortest PathsPaul Bonsma. 222-233 [doi]
• Computing with Large Populations Using InteractionsOlivier Bournez, Pierre Fraigniaud, Xavier Koegler. 234-246 [doi]
• Pancake Flipping Is HardLaurent Bulteau, Guillaume Fertin, Irena Rusu. 247-258 [doi]
• In-place Heap Construction with Optimized Comparisons, Moves, and Cache MissesJingsen Chen, Stefan Edelkamp, Amr Elmasry, Jyrki Katajainen. 259-270 [doi]
• Model Checking Stochastic Branching ProcessesTaolue Chen, Klaus Dräger, Stefan Kiefer. 271-282 [doi]
• Parameterized Study of the Test Cover ProblemRobert Crowston, Gregory Gutin, Mark Jones, Saket Saurabh, Anders Yeo. 283-295 [doi]
• Sitting Closer to Friends Than Enemies, RevisitedMarek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Jakub Onufry Wojtaszczyk. 296-307 [doi]
• A Dichotomy Theorem for Homomorphism PolynomialsNicolas de Rugy-Altherre. 308-322 [doi]
• Finite State Transducers for Modular Möbius Number SystemsMartin Delacourt, Petr Kurka. 323-334 [doi]
• Zero-Knowledge Proofs via Polynomial RepresentationsGiovanni Di Crescenzo, Vadym Fedyukovych. 335-347 [doi]
• Cluster Vertex Deletion: A Parameterization between Vertex Cover and Clique-WidthMartin Doucha, Jan Kratochvíl. 348-359 [doi]
• On the Impact of Fair Best Response DynamicsAngelo Fanelli, Luca Moscardelli, Alexander Skopalik. 360-371 [doi]
• Fast Balanced Partitioning Is Hard Even on Grids and TreesAndreas Emil Feldmann. 372-382 [doi]
• A Characterization of Bispecial Sturmian WordsGabriele Fici. 383-394 [doi]
• Online Sum-Radii ClusteringDimitris Fotakis, Paraschos Koutris. 395-406 [doi]
• Observe and Remain Silent (Communication-Less Agent Location Discovery)Tom Friedetzky, Leszek Gasieniec, Thomas Gorry, Russell Martin. 407-418 [doi]
• When Trees Grow Low: Shrubs and Fast MSO1Robert Ganian, Petr Hlinený, Jaroslav Nesetril, Jan Obdrzálek, Patrice Ossona de Mendez, Reshma Ramadurai. 419-430 [doi]
• Strategy Machines and Their ComplexityMarcus Gelderie. 431-442 [doi]
• Coloring Graphs Characterized by a Forbidden SubgraphPetr A. Golovach, Daniël Paulusma, Bernard Ries. 443-454 [doi]
• Obtaining Planarity by Contracting Few EdgesPetr A. Golovach, Pim van 't Hof, Daniël Paulusma. 455-466 [doi]
• Light Spanners in Bounded Pathwidth GraphsMichelangelo Grigni, Hao-Hsiang Hung. 467-477 [doi]
• Planarizing Gadgets for Perfect Matching Do Not ExistRohit Gurjar, Arpita Korwar, Jochen Messner, Simon Straub, Thomas Thierauf. 478-490 [doi]
• Kernels for Edge Dominating Set: Simpler or SmallerTorben Hagerup. 491-502 [doi]
• Categories of Coalgebraic GamesFurio Honsell, Marina Lenisa, Rekha Redamalla. 503-515 [doi]
• Quasi-recognizable vs MSO Definable Languages of One-Dimensional Overlapping Tiles - (Extended Abstract)David Janin. 516-528 [doi]
• An Improved Approximation Scheme for Variable-Sized Bin PackingKlaus Jansen, Stefan Kraft. 529-541 [doi]
• Gathering an Even Number of Robots in an Odd Ring without Global Multiplicity DetectionSayaka Kamei, Anissa Lamani, Fukuhito Ooshita, Sébastien Tixeuil. 542-553 [doi]
• Reversal Hierarchies for Small 2DFAsChristos A. Kapoutsis, Giovanni Pighizzini. 554-565 [doi]
• Strictness of the Collapsible Pushdown HierarchyAlexander Kartzow, Pawel Parys. 566-577 [doi]
• Computational Complexity of Smooth Differential EquationsAkitoshi Kawamura, Hiroyuki Ota, Carsten Rösnick, Martin Ziegler. 578-589 [doi]
• The Lower Reaches of Circuit UniformityChristoph Behle, Andreas Krebs, Klaus-Jörn Lange, Pierre McKenzie. 590-602 [doi]
• The Join Levels of the Trotter-Weil Hierarchy Are DecidableManfred Kufleitner, Alexander Lauser. 603-614 [doi]
• Equations X + A = B and (X + X) + C = (X - X) + D over Sets of Natural NumbersTommi Lehtinen. 615-629 [doi]
• Weakly-Synchronized Ground Tree Rewriting - (with Applications to Verifying Multithreaded Programs)Anthony Widjaja Lin. 630-642 [doi]
• Descriptional Complexity of Deterministic Regular ExpressionsKatja Losemann, Wim Martens, Matthias Niewerth. 643-654 [doi]
• Identity Testing, Multilinearity Testing, and Monomials in Read-Once/Twice Formulas and Branching ProgramsMeena Mahajan, B. V. Raghavendra Rao, Karteek Sreenivasaiah. 655-667 [doi]
• Fine and Wilf's Theorem and Pseudo-repetitionsFlorin Manea, Robert Mercas, Dirk Nowotka. 668-680 [doi]
• Taking It to the Limit: Approximate Reasoning for Markov ProcessesKim Guldstrand Larsen, Radu Mardare, Prakash Panangaden. 681-692 [doi]
• Asymmetric Swap-Equilibrium: A Unifying Equilibrium Concept for Network Creation GamesMatús Mihalák, Jan Christoph Schlegel. 693-704 [doi]
• Between Tree Patterns and Conjunctive Queries: Is There Tractability beyond Acyclicity?Filip Murlak, Michal Oginski, Marcin Przybylko. 705-717 [doi]
• Reducing a Target Interval to a Few Exact QueriesJesper Nederlof, Erik Jan van Leeuwen, Ruben van der Zwaan. 718-727 [doi]
• Maximum Cliques in Graphs with Small Intersection Number and Random Intersection GraphsSotiris E. Nikoletseas, Christoforos Raptopoulos, Paul G. Spirakis. 728-739 [doi]
• A Finite Basis for 'Almost Future' Temporal Logic over the RealsDorit Pardo Ordentlich, Alexander Rabinovich. 740-751 [doi]
• Constructing Premaximal Ternary Square-Free Words of Any LevelElena A. Petrova, Arseny M. Shur. 752-763 [doi]
• Regularity Problems for Weak Pushdown ω-Automata and GamesChristof Löding, Stefan Repke. 764-776 [doi]
• Computational Aspects of Cellular Automata on Countable Sofic ShiftsVille Salo, Ilkka Törmä. 777-788 [doi]
• Computing Lempel-Ziv Factorization OnlineTatiana A. Starikovskaya. 789-799 [doi]
• On Two Stronger Versions of Dejean's ConjectureIgor N. Tunev, Arseny M. Shur. 800-812 [doi]
• Probabilistic Automata and Probabilistic LogicThomas Weidner. 813-824 [doi]
• A Quadratic Vertex Kernel for Feedback Arc Set in Bipartite TournamentsMingyu Xiao, Jiong Guo. 825-835 [doi]