RUS  ENG JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PERSONAL OFFICE
General information
Latest issue
Archive
Impact factor

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


2009, Volume 16, Number 5  


Polynomial algorithm for the path facility location problem with uniform capacities
A. A. Ageev, E. Kh. Gimadi, A. A. Kurochkin
3
On the entropy minimal hereditary classes of coloured graphs
V. E. Alekseev, S. V. Sorochan
19
Acyclic 3-choosability of plane graphs without cycles of length from 4 to 12
O. V. Borodin
26
On one twocriterial graph problem
V. G. Vizing
34
Continued sets of boundary classes of graphs for colorability problems
D. S. Malyshev
41
On nonexistence of some perfect 2-colorings of Johnson graphs
I. Yu. Mogilnykh
52
Lower bound for the computation complexity of BCH-codes for branching programs
E. A. Okolnishnikova
69
On the complexity of generalized contact circuits
K. L. Rychkov
78
Дискретный анализ и исследование операций
 
Contact us:
 Terms of Use  Registration  Logotypes © Steklov Mathematical Institute RAS, 2018