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


Series 1, 1999, Volume 6, Number 4  


A polynomial algorithm for finding the largest independent sets in claw-free graphs
V. E. Alekseev
3
Acyclic coloring of 1-planar graphs
O. V. Borodin, A. V. Kostochka, A. Raspaud, E. Sopena
20
On the connected coloring of graphs in prescribed colors
V. G. Vizing
36
On a lower bound for the number of perfect binary codes
S. A. Malyugin
44
A survey of methods for the undistorted coding of discrete sources
V. N. Potapov
49
On graphs of subwords of DOL-sequences
A. È. Frid
92
Maximization of a linear objective function by a greedy algorithm
V. V. Shenmaier
104

Information
New books for discrete mathematics
A. D. Korshunov
123
Дискретный анализ и исследование операций
 
Contact us:
 Terms of Use  Registration  Logotypes © Steklov Mathematical Institute RAS, 2020