RUS  ENG JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB
General information
Latest issue
Archive
Impact factor
Subscription

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Diskretn. Anal. Issled. Oper.:
Year:
Volume:
Issue:
Page:
Find






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register

Author Index, 2012, Volume 19

A B C D E G I K M P R S V Z Full List
D. S. Malyshev
The complexity analysis of the edge-ranking problem for hereditary graph classes with at most three prohibitions
Diskretn. Anal. Issled. Oper., 2012, Volume 19:1,  74–96
D. S. Malyshev
Effective solvability of the independent set problem in a class of graphs without induced path and cycle with five vertices and a big clique
Diskretn. Anal. Issled. Oper., 2012, Volume 19:3,  58–64
D. S. Malyshev
Polynomial solvability of the independent set problem for one class of graphs with small diameter
Diskretn. Anal. Issled. Oper., 2012, Volume 19:4,  66–72
D. S. Malyshev
Study of boundary graph classes for colorability problems
Diskretn. Anal. Issled. Oper., 2012, Volume 19:6,  37–48
S. A. Malyugin
Affine nonsystematic codes
Diskretn. Anal. Issled. Oper., 2012, Volume 19:4,  73–85
S. S. Marchenkov
On solutions to systems of automata-type functional equations
Diskretn. Anal. Issled. Oper., 2012, Volume 19:4,  86–98
Yu. V. Merekin
The Shannon function of computation of the Arnold complexity of length $2^n$ binary words
Diskretn. Anal. Issled. Oper., 2012, Volume 19:6,  49–55
D. B. Mokeev, see V. E. Alekseev
Diskretn. Anal. Issled. Oper., 2012, Volume 19:4,  3–14
Дискретный анализ и исследование операций
 
Contact us:
 Terms of Use  Registration  Logotypes © Steklov Mathematical Institute RAS, 2020