Abstract is missing.
- The Rewriting Logic Semantics Project: A Progress ReportJosé Meseguer, Grigore Rosu. 1-37 [doi]
- Impugning Randomness, ConvincinglyYuri Gurevich. 38 [doi]
- Kernelization: An OverviewDaniel Lokshtanov. 39-40 [doi]
- Almost Transparent Short Proofs for NPℝKlaus Meer. 41-52 [doi]
- The Effect of Homogeneity on the Complexity of k-AnonymityRobert Bredereck, André Nichterlein, Rolf Niedermeier, Geevarghese Philip. 53-64 [doi]
- On the Optimal Compression of Sets in PSPACEMarius Zimand. 65-77 [doi]
- Computational Randomness from Generalized Hardcore SetsChia-Jung Lee, Chi-Jen Lu, Shi-Chun Tsai. 78-89 [doi]
- Data Reduction for Graph Coloring ProblemsBart M. P. Jansen, Stefan Kratsch. 90-101 [doi]
- Hunting Distributed Malware with the κ-CalculusMila Dalla Preda, Cinzia Di Giusto. 102-113 [doi]
- Edge-Matching Problems with RotationsMartin Ebbesen, Paul Fischer, Carsten Witt. 114-125 [doi]
- On the Link between Strongly Connected Iteration Graphs and Chaotic Boolean Discrete-Time Dynamical SystemsJacques M. Bahi, Jean-François Couchot, Christophe Guyeux, Adrien Richard. 126-137 [doi]
- A New Bound for 3-Satisfiable Maxsat and Its Algorithmic ApplicationGregory Gutin, Mark Jones, Anders Yeo. 138-147 [doi]
- On Memoryless Quantitative ObjectivesKrishnendu Chatterjee, Laurent Doyen, Rohit Singh. 148-159 [doi]
- Principal Types for Nominal TheoriesElliot Fairweather, Maribel Fernández, Murdoch James Gabbay. 160-172 [doi]
- Modifying the Upper Bound on the Length of Minimal Synchronizing WordA. N. Trahtman. 173-180 [doi]
- Online Maximum k-CoverageGiorgio Ausiello, Nicolas Boria, Aristotelis Giannakos, Giorgio Lucarelli, Vangelis Th. Paschos. 181-192 [doi]
- Coloring Graphs without Short Cycles and Long Induced PathsPetr A. Golovach, Daniël Paulusma, Jian Song. 193-204 [doi]
- Succinct Algebraic Branching Programs Characterizing Non-uniform Complexity ClassesGuillaume Malod. 205-216 [doi]
- LIFO-Search on Digraphs: A Searching Game for Cycle-RankPaul Hunter. 217-228 [doi]
- Polynomial Kernels for Proper Interval Completion and Related ProblemsStéphane Bessy, Anthony Perez. 229-239 [doi]
- Parameterized Complexity of Vertex Deletion into Perfect Graph ClassesPinar Heggernes, Pim van t Hof, Bart M. P. Jansen, Stefan Kratsch, Yngve Villanger. 240-251 [doi]
- Constructive Dimension and Hausdorff Dimension: The Case of Exact DimensionLudwig Staiger. 252-263 [doi]
- Dag Realizations of Directed Degree SequencesAnnabell Berger, Matthias Müller-Hannemann. 264-275 [doi]
- A Coinductive Calculus for Asynchronous Side-Effecting ProcessesSergey Goncharov, Lutz Schröder. 276-287 [doi]
- Hardness, Approximability, and Exact Algorithms for Vector Domination and Total Vector Domination in GraphsFerdinando Cicalese, Martin Milanic, Ugo Vaccaro. 288-297 [doi]
- Enumeration of Minimal Dominating Sets and VariantsMamadou Moustapha Kanté, Vincent Limouzy, Arnaud Mary, Lhouari Nourine. 298-309 [doi]
- Specification Patterns and Proofs for Recursion through the StoreNathaniel Charlton, Bernhard Reus. 310-321 [doi]
- Sub-computabilitiesFabien Givors, Grégory Lafitte. 322-335 [doi]
- Functions That Preserve p-RandomnessStephen A. Fenner. 336-347 [doi]
- Reactive Turing MachinesJos C. M. Baeten, Bas Luttik, Paul van Tilburg. 348-359 [doi]
- Virtual Substitution for SMT-SolvingFlorian Corzilius, Erika Ábrahám. 360-371 [doi]