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, 2001, Volume 8

A B C D E F G H K L M N O P S T V Y Z Full List
K. N. Kashirskich, A. V. Kononov, S. V. Sevast'yanov, I. D. Chernykh
A polynomially solvable case of a two-stage open shop problem with three machines
Diskretn. Anal. Issled. Oper., Series 1, 2001, Volume 8:1,  23–39
A. V. Kononov, see K. N. Kashirskich
Diskretn. Anal. Issled. Oper., Series 1, 2001, Volume 8:1,  23–39
A. D. Korshunov
New books for discrete mathematics
Diskretn. Anal. Issled. Oper., Series 1, 2001, Volume 8:2,  92–93
A. D. Korshunov
New books for discrete mathematics
Diskretn. Anal. Issled. Oper., Series 1, 2001, Volume 8:4,  114–116
A. D. Korshunov
For what $k$ in almost every $n$-vertex graph do there exist all nonisomorphic $k$-vertex subgraphs?
Diskretn. Anal. Issled. Oper., Series 1, 2001, Volume 8:4,  54–67
Дискретный анализ и исследование операций
 
Contact us:
 Terms of Use  Registration  Logotypes © Steklov Mathematical Institute RAS, 2020