Table of Contents

• One Useful Logic That Defines Its Own TruthAndreas Blass, Yuri Gurevich. 1-15 [doi]
• On Synchronous and Asynchronous Interaction in Distributed SystemsRob J. van Glabbeek, Ursula Goltz, Jens-Wolfhard Schicke. 16-35 [doi]
• A Robust Class of Regular LanguagesAntonio Cano Gómez, Jean-Eric Pin. 36-51 [doi]
• Deterministic Models of Communication FaultsRastislav Kralovic, Richard Královic. 52-67 [doi]
• Algebraic Graph AlgorithmsPiotr Sankowski. 68-82 [doi]
• Question/Answer Games on Towers and PyramidsSarmad Abbasi, Numan Sheikh. 83-95 [doi]
• The Maximum Independent Set Problem in Planar GraphsVladimir E. Alekseev, Vadim V. Lozin, Dmitriy Malyshev, Martin Milanic. 96-107 [doi]
• When Ignorance Helps: Graphical Multicast Cost Sharing GamesVittorio Bilò, Angelo Fanelli, Michele Flammini, Luca Moscardelli. 108-119 [doi]
• Shortest Synchronizing Strings for Huffman CodesMarek Tomasz Biskup. 120-131 [doi]
• Optimizing Conjunctive Queries over Trees Using Schema InformationHenrik Björklund, Wim Martens, Thomas Schwentick. 132-143 [doi]
• Clustering with Partial InformationHans Leo Bodlaender, Michael R. Fellows, Pinar Heggernes, Federico Mancini, Charis Papadopoulos, Frances A. Rosamond. 144-155 [doi]
• Reoptimization of the Metric Deadline TSPHans-Joachim Böckenhauer, Dennis Komm. 156-167 [doi]
• On the Shortest Linear Straight-Line Program for Computing Linear FormsJoan Boyar, Philip Matthews, René Peralta. 168-179 [doi]
• Flip Algorithm for Segment TriangulationsMathieu Brévilliers, Nicolas Chevallier, Dominique Schmitt. 180-192 [doi]
• Computing Sharp 2-Factors in Claw-Free GraphsHajo Broersma, Daniël Paulusma. 193-204 [doi]
• A 6/5-Approximation Algorithm for the Maximum 3-Cover ProblemIoannis Caragiannis, Gianpiero Monaco. 205-216 [doi]
• Positional Strategies for Higher-Order Pushdown Parity GamesArnaud Carayol, Michaela Slaats. 217-228 [doi]
• Arthur and Merlin as OraclesVenkatesan T. Chakaravarthy, Sambuddha Roy. 229-240 [doi]
• A Decision Problem for Ultimately Periodic Sets in Non-standard Numeration SystemsEmilie Charlier, Michel Rigo. 241-252 [doi]
• Regional Languages and Tiling: A Unifying Approach to Picture GrammarsAlessandra Cherubini, Stefano Crespi-Reghizzi, Matteo Pradella. 253-264 [doi]
• On a Special Class of Primitive WordsElena Czeizler, Lila Kari, Shinnosuke Seki. 265-277 [doi]
• Complexity of Data Tree Patterns over XML DocumentsClaire David. 278-289 [doi]
• A PTAS for the Sparsest Spanners Problem on Apex-Minor-Free GraphsFeodor F. Dragan, Fedor V. Fomin, Petr A. Golovach. 290-298 [doi]
• Computational Complexity of Perfect-Phylogeny-Related Haplotyping ProblemsMichael Elberfeld, Till Tantau. 299-310 [doi]
• Sincere-Strategy Preference-Based Approval Voting Broadly Resists ControlGábor Erdélyi, Markus Nowak, Jörg Rothe. 311-322 [doi]
• Reversal-Bounded Counter Machines RevisitedAlain Finkel, Arnaud Sangnier. 323-334 [doi]
• Iterative Compression and Exact AlgorithmsFedor V. Fomin, Serge Gaspers, Dieter Kratsch, Mathieu Liedloff, Saket Saurabh. 335-346 [doi]
• Complexity and Limiting Ratio of Boolean Functions over ImplicationHervé Fournier, Danièle Gardy, Antoine Genitrini, Bernhard Gittenberger. 347-362 [doi]
• Succinctness of Regular Expressions with Interleaving, Intersection and CountingWouter Gelade. 363-374 [doi]
• Nilpotency and Limit Sets of Cellular AutomataPierre Guillon, Gaétan Richard. 375-386 [doi]
• A Note on k-Colorability of P5-Free GraphsChính T. Hoàng, Marcin Kaminski, Vadim V. Lozin, Joe Sawada, Xiao Shu. 387-394 [doi]
• Combinatorial Bounds and Algorithmic Aspects of Image Matching under Projective TransformationsChristian Hundt, Maciej Liskiewicz. 395-406 [doi]
• Lower Bounds for Syntactically Multilinear Algebraic Branching ProgramsMaurice J. Jansen. 407-418 [doi]
• Periodicity and Immortality in Reversible ComputingJarkko Kari, Nicolas Ollinger. 419-430 [doi]
• Step-Out Ring SignaturesMarek Klonowski, Lukasz Krzywiecki, Miroslaw Kutylowski, Anna Lauks. 431-442 [doi]
• The Height of Factorization ForestsManfred Kufleitner. 443-454 [doi]
• Arithmetic Circuits, Syntactic Multilinearity, and the Limitations of Skew FormulaeMeena Mahajan, B. V. Raghavendra Rao. 455-466 [doi]
• Smoothed Analysis of Binary Search Trees and Quicksort under Additive NoiseBodo Manthey, Till Tantau. 467-478 [doi]
• From lambda-Calculus to Universal Algebra and BackGiulio Manzonetto, Antonino Salibra. 479-490 [doi]
• A Complete Axiomatic System for a Process-Based Spatial LogicRadu Mardare, Alberto Policriti. 491-502 [doi]
• Voronoi Games on Cycle GraphsMarios Mavronicolas, Burkhard Monien, Vicky G. Papadopoulou, Florian Schoppmann. 503-514 [doi]
• Colouring Random Empire TreesAndrew R. McGrae, Michele Zito. 515-526 [doi]
• A Random Oracle Does Not Help Extract the Mutual InformationAndrei A. Muchnik, Andrei E. Romashchenko. 527-538 [doi]
• Approximating Independent Set and Coloring in Random Uniform HypergraphsKai Plociennik. 539-550 [doi]
• A New Upper Bound for Max-2-SAT: A Graph-Theoretic ApproachDaniel Raible, Henning Fernau. 551-562 [doi]
• Directed Percolation Arising in Stochastic Cellular Automata AnalysisDamien Regnault. 563-574 [doi]
• Resolution Width and Cutting Plane Rank Are IncomparableMark Rhodes. 575-587 [doi]
• On the Decidability of Bounded Valuedness for TransducersJacques Sakarovitch, Rodrigo de Souza. 588-600 [doi]
• Monadic Second Order Logic on Graphs with Local Cardinality ConstraintsStefan Szeider. 601-612 [doi]
• Short Proofs of Strong NormalizationAleksander Wojdyga. 613-623 [doi]