5-years impact-factor Math-Net.Ru of «Diskretnyi Analiz i Issledovanie Operatsii» journal, 2006

5-years impact-factor Math-Net.Ru of the journal in 2006 is calculated as the number of citations in 2006 to the scientific papers published during 2001–2005.

The table below contains the list of citations in 2006 to the papers published in 2001–2005. We take into account all citing publications we found from different sources, mostly from references lists available on Math-Net.Ru. Both original and translation versions are taken into account.

The impact factor Math-Net.Ru may change when new citations to a year given are found.

1 2  Full list
N	Citing pulication		Cited paper
1.	A. M. Romanov, “Obzor metodov postroeniya nelineinykh sovershennykh dvoichnykh kodov”, Diskretn. analiz i issled. oper., ser. 1, ser. 1, 13:4 (2006), 60–88	→	Nonsystematic perfect binary codes S. A. Malyugin Diskretn. Anal. Issled. Oper., 8:1, Series 1 (2001),  55–76
2.	S. A. Malyugin, “O perechislenii neekvivalentnykh sovershennykh dvoichnykh kodov dliny 15 i ranga 15”, Diskretn. analiz i issled. oper., ser. 1, ser. 1, 13:1 (2006), 77–98	→	Nonsystematic perfect binary codes S. A. Malyugin Diskretn. Anal. Issled. Oper., 8:1, Series 1 (2001),  55–76
3.	A. M. Romanov, “Obzor metodov postroeniya nelineinykh sovershennykh dvoichnykh kodov”, Diskretn. analiz i issled. oper., ser. 1, ser. 1, 13:4 (2006), 60–88	→	Perfect codes of complete rank with kernels of large dimensions S. V. Avgustinovich, F. I. Solov'eva, O. Heden Diskretn. Anal. Issled. Oper., 8:4, Series 1 (2001),  3–8
4.	S. A. Malyugin, “O perechislenii neekvivalentnykh sovershennykh dvoichnykh kodov dliny 15 i ranga 15”, Diskretn. analiz i issled. oper., ser. 1, ser. 1, 13:1 (2006), 77–98	→	Perfect codes of complete rank with kernels of large dimensions S. V. Avgustinovich, F. I. Solov'eva, O. Heden Diskretn. Anal. Issled. Oper., 8:4, Series 1 (2001),  3–8
5.	Heden O., “A remark on full rank perfect codes”, Discrete Math, 306:16 (2006), 1975–1980	→	Perfect codes of complete rank with kernels of large dimensions S. V. Avgustinovich, F. I. Solov'eva, O. Heden Diskretn. Anal. Issled. Oper., 8:4, Series 1 (2001),  3–8
6.	Heden O., “A full rank perfect code of length 31”, Des Codes Cryptogr, 38:1 (2006), 125–129	→	Perfect codes of complete rank with kernels of large dimensions S. V. Avgustinovich, F. I. Solov'eva, O. Heden Diskretn. Anal. Issled. Oper., 8:4, Series 1 (2001),  3–8
7.	O. V. Borodin, A. O. Ivanova, T. K. Neustroeva, “Predpisannaya $(p,q)$-raskraska razrezhennykh ploskikh grafov”, Sib. elektron. matem. izv., 3 (2006), 355–361	→	Minimal degrees and chromatic numbers of squares of planar graphs O. V. Borodin, H. Broersma, A. N. Glebov, J. van den Heuvel Diskretn. Anal. Issled. Oper., 8:4, Series 1 (2001),  9–33
8.	Calamoneri T., “The L(h, k)-labelling problem: A survey and annotated bibliography”, The Computer Journal, 49:5 (2006), 585–608	→	Minimal degrees and chromatic numbers of squares of planar graphs O. V. Borodin, H. Broersma, A. N. Glebov, J. van den Heuvel Diskretn. Anal. Issled. Oper., 8:4, Series 1 (2001),  9–33
9.	Salavatipour M.R., “Large induced forests in triangle-free planar graphs”, Graphs and Combinatorics, 22:1 (2006), 113–126	→	On the partition of a planar graph of girth 5 into an empty and an acyclic subgraph O. V. Borodin, A. N. Glebov Diskretn. Anal. Issled. Oper., 8:4, Series 1 (2001),  34–53
10.	E. E. Gurevskii, V. A. Emelichev, “Ob ustoichivosti vektornoi bulevoi zadachi minimizatsii absolyutnykh uklonenii ot nulya lineinykh funktsii”, Izv. vuzov. Matem., 2006, № 12, 27–32	→	Stability and regularization of vector problems of integer linear programming V. A. Emelichev, D. P. Podkopaev Diskretn. Anal. Issled. Oper., 8:1, Series 2 (2001),  47–69
11.	Vladimir A. Emelichev, Olga V. Karelkina, Kirill G. Kuzmin, “Measure of stability and quasistability to a vector integer programming problem in the $l_1$ metric”, Bul. Acad. Ştiinţe Repub. Mold. Mat., 2006, no. 1, 39–50	→	Stability and regularization of vector problems of integer linear programming V. A. Emelichev, D. P. Podkopaev Diskretn. Anal. Issled. Oper., 8:1, Series 2 (2001),  47–69
12.	E. Kh. Gimadi, Yu. V. Glazkov, “Ob asimptoticheski tochnom algoritme resheniya odnoi modifikatsii trekhindeksnoi planarnoi zadachi o naznacheniyakh”, Diskretn. analiz i issled. oper., ser. 2, ser. 2, 13:1 (2006), 10–26	→	An asymptotically exact algorithm for solving the location problem with constrained production volumes I. P. Voznyuk, E. Kh. Gimadi, M. Yu. Filatov Diskretn. Anal. Issled. Oper., 8:2, Series 2 (2001),  3–16
13.	V. G. Vizing, A. V. Pyatkin, “O raskraske intsidentorov v orientirovannom vzveshennom multigrafe”, Diskretn. analiz i issled. oper., ser. 1, ser. 1, 13:1 (2006), 33–44	→	A bipartite interpretation of a directed multigraph in problems of the coloring of incidentors V. G. Vizing Diskretn. Anal. Issled. Oper., 9:1, Series 1 (2002),  27–41
14.	A. M. Romanov, “Obzor metodov postroeniya nelineinykh sovershennykh dvoichnykh kodov”, Diskretn. analiz i issled. oper., ser. 1, ser. 1, 13:4 (2006), 60–88	→	On partitions of Hamming codes into disjoint components S. A. Malyugin, A. M. Romanov Diskretn. Anal. Issled. Oper., 9:1, Series 1 (2002),  42–48
15.	S. A. Malyugin, “O perechislenii neekvivalentnykh sovershennykh dvoichnykh kodov dliny 15 i ranga 15”, Diskretn. analiz i issled. oper., ser. 1, ser. 1, 13:1 (2006), 77–98	→	On partitions of Hamming codes into disjoint components S. A. Malyugin, A. M. Romanov Diskretn. Anal. Issled. Oper., 9:1, Series 1 (2002),  42–48
16.	M. A. Alekhina, “O nadezhnosti skhem v bazise $\{x\vee y\vee z,x\mathbin&y\mathbin&z,\bar{x}\}$ pri odnotipnykh konstantnykh neispravnostyakh na vkhodakh elementov”, Diskret. matem., 18:1 (2006), 116–125	→	Lower bounds for the reliability of schemes in some bases with single-type constant faults at the inputs of the elements M. A. Alekhina Diskretn. Anal. Issled. Oper., 9:3, Series 1 (2002),  3–28
17.	M. A. Alekhina, V. V. Chugunova, “Ob asimptoticheski nailuchshikh po nadezhnosti skhemakh v bazise $\{&,\lor,{^-}\}$ pri inversnykh neispravnostyakh na vkhodakh elementov”, Diskretn. analiz i issled. oper., ser. 1, ser. 1, 13:4 (2006), 3–17	→	Lower bounds for the reliability of schemes in some bases with single-type constant faults at the inputs of the elements M. A. Alekhina Diskretn. Anal. Issled. Oper., 9:3, Series 1 (2002),  3–28
18.	D. A. Zhukov, “Ob odnom klasse kletochnykh skhem”, Diskret. matem., 18:4 (2006), 84–98	→	Fast cellular schemes for multiplication D. A. Zhukov Diskretn. Anal. Issled. Oper., 9:3, Series 1 (2002),  40–47
19.	I. A. Pankratova, “Usloviya realizuemosti funktsii na polureshetke v realnykh bazisakh iz pereklyuchatelnykh elementov”, Diskretn. analiz i issled. oper., ser. 1, ser. 1, 13:3 (2006), 40–61	→	On the completeness of systems of monotone functions for the realization of quasi-monotone functions on finite semilattices G. P. Agibalov, N. G. Parvatov Diskretn. Anal. Issled. Oper., 9:4, Series 1 (2002),  5–22
20.	Gorelik V.A., Erokhin V.I., Pechenkin R.V., “Minimax matrix correction of inconsistent systems of linear algebraic equations with block matrices of coefficients”, Journal of Computer and Systems Sciences International, 45:5 (2006), 727–737	→	Properties of optimal single-rank correction of matrices of coefficients of inconsistent nonhomogeneous linear models V. I. Erokhin Diskretn. Anal. Issled. Oper., 9:1, Series 2 (2002),  33–60
1 2  Full list