1. Tight Lower and Upper Bounds for the Complexity of Canonical Colour Refinement

   • Christoph Berkholz
   • Paul Bonsma
   • Martin Grohe

   OriginalPaper Open access 27 June 2016 Pages: 581 - 614

   

2. Polynomial Kernelization for Removing Induced Claws and Diamonds

   • Marek Cygan
   • Marcin Pilipczuk
   • Marcin Wrochna

   OriginalPaper Open access 23 June 2016 Pages: 615 - 636

   

3. Multi-processor Search and Scheduling Problems with Setup Cost

   • Spyros Angelopoulos
   • Diogo Arsénio
   • Alejandro López-Ortiz

   OriginalPaper 20 June 2016 Pages: 637 - 670

   

4. On the Generic Undecidability of the Halting Problem for Normalized Turing Machines

   • Alexander Rybalov

   OriginalPaper 28 June 2016 Pages: 671 - 676

5. Atomic Read/Write Memory in Signature-Free Byzantine Asynchronous Message-Passing Systems

   • Achour Mostéfaoui
   • Matoula Petrolia
   • Claude Jard

   OriginalPaper 14 July 2016 Pages: 677 - 694

   

6. The Complexity of Model Checking Multi-Stack Systems

   • Benedikt Bollig
   • Dietrich Kuske
   • Roy Mennicke

   OriginalPaper 26 August 2016 Pages: 695 - 736

   

7. Paradigms for Parameterized Enumeration

   • Nadia Creignou
   • Arne Meier
   • Heribert Vollmer

   OriginalPaper 13 September 2016 Pages: 737 - 758

   

8. Tai Mapping Hierarchy for Rooted Labeled Trees Through Common Subforest

   • Takuya Yoshino
   • Kouichi Hirata

   OriginalPaper 02 September 2016 Pages: 759 - 783