1. Systems of pairs of q-distant representatives, and graph colorings

   • P. A. Golovach

   OriginalPaper Pages: 1141 - 1151

2. Public-key cryptography and invariant theory

   • D. Grigoriev

   OriginalPaper Pages: 1152 - 1157

3. On non-Abelian homomorphic public-key cryptosystems

   • D. Grigoriev
   • I. Ponomarenko

   OriginalPaper Pages: 1158 - 1166

4. Blocks in k-connected graphs

   • D. V. Karpov

   OriginalPaper Pages: 1167 - 1181

5. Solution lifting method for handling meta-variables in TH∃OREM∀

   • B. Konev
   • T. Jebelean

   OriginalPaper Pages: 1182 - 1194

6. An upper bound O(2^0.16254n) for exact 3-satisfiability: a simpler proof

   • A. S. Kulikov

   OriginalPaper Pages: 1195 - 1199

7. A 2^|E|/4-time algorithm for MAX-CUT

   • A. S. Kulikov
   • S. S. Fedin

   OriginalPaper Pages: 1200 - 1204

8. Hard satisfiable instances for DPLL-type algorithms

   • S. I. Nikolenko

   OriginalPaper Pages: 1205 - 1209

9. Invertible infinitary calculus without loop rules for restricted FTL

   • R. Pliuškevičius

   OriginalPaper Pages: 1210 - 1228