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


Series 2, 2006, Volume 13, Number 2  


An approximate algorithm for finding a maximum-weight $d$-homogeneous connected spanning subgraph in a complete graph with random edge weights
A. E. Baburin, E. Kh. Gimadi
3
An algorithm for the formation of a hierarchical system of invariants of isomorphisms of mappings of finite sets
Yu. I. Brodskii, V. I. Novitskii, Yu. N. Pavlovsky
21
By-passes with ordered enclosing in planar graphs
T. A. Panyukova
31
A polynomially solvable case of the three-stage Johnson problem
V. V. Servakh
44
On the approximation of an optimal solution of the integer knapsack problem by optimal solutions of the integer knapsack problem with a restriction on the cardinality
A. Yu. Chirkov, V. N. Shevchenko
56
A generalized linear exchange model
V. I. Shmyrev
74
Дискретный анализ и исследование операций
 
Contact us:
 Terms of Use  Registration  Logotypes © Steklov Mathematical Institute RAS, 2018