1. Symmetric spaces of graphs

   • V. E. Alekseev
   • D. V. Zakharova

   OriginalPaper 03 June 2008 Pages: 151 - 154

2. An approximation algorithm for finding a d-regular spanning connected subgraph of maximum weight in a complete graph with random weights of edges

   • A. E. Baburin
   • E. Kh. Gimadi

   OriginalPaper 03 June 2008 Pages: 155 - 166

3. Circuit design of an adder of small depth

   • S. B. Gashkov
   • M. I. Grinchuk
   • I. S. Sergeev

   OriginalPaper 03 June 2008 Pages: 167 - 178

4. Reducibility of bilevel programming problems to vector optimization problems

   • D. S. Ivanenko
   • A. V. Plyasunov

   OriginalPaper 03 June 2008 Pages: 179 - 195

5. Depth of Boolean functions over an arbitrary infinite basis

   • O. M. Kasim-Zade

   OriginalPaper 03 June 2008 Pages: 196 - 210

6. On possibility of refining bounds for the delay of a parallel adder

   • V. M. Khrapchenko

   OriginalPaper 03 June 2008 Pages: 211 - 214

7. Harpedonaptae and abstract convexity

   • S. S. Kutateladze

   OriginalPaper 03 June 2008 Pages: 215 - 221

8. Approximate solution to a boundary value problem for the Lyapunov differential equation with a parameter

   • I. I. Matveeva
   • E. A. Samuylova

   OriginalPaper 03 June 2008 Pages: 222 - 230

9. Global solvability of the equations of one-dimensional nonisothermic motion of a two-phase mixture. I. Statement of the problem and auxiliary assertions

   • A. A. Papin

   OriginalPaper 03 June 2008 Pages: 231 - 251

10. Survey of the methods for constructing nonlinear perfect binary codes

    • A. M. Romanov

    OriginalPaper 03 June 2008 Pages: 252 - 269

11. Complexity of sequential computations of partial Boolean functions by circuits

    • L. A. Sholomov

    OriginalPaper 03 June 2008 Pages: 270 - 289

12. Controlling the shape of a crack in an elastic body under the condition of a possible contact of edges

    • E. V. Vtorushin

    OriginalPaper 03 June 2008 Pages: 290 - 299