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

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

The table below contains the list of citations in 2007 to the papers published in 2002–2006. 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.	V. G. Vizing, A. V. Pyatkin, “Ob otsenkakh intsidentornogo khromaticheskogo chisla vzveshennogo neorientirovannogo multigrafa”, Diskretn. analiz i issled. oper., ser. 1, ser. 1, 14:2 (2007), 3–15	→	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
2.	A. N. Glebov, D. Zh. Zambalaeva, “Putevye razbieniya planarnykh grafov”, Sib. elektron. matem. izv., 4 (2007), 450–459	→	On path kernels and partitions in nondirected graphs L. S. Mel'nikov, I. V. Petrenko Diskretn. Anal. Issled. Oper., 9:2, Series 1 (2002),  21–35
3.	F. I. Soloveva, N. N. Tokareva, “O distantsionnoi neregulyarnosti kodov Preparaty”, Sib. matem. zhurn., 48:2 (2007), 408–416	→	Strong distance invariance of perfect binary codes A. Yu. Vasil'eva Diskretn. Anal. Issled. Oper., 9:4, Series 1 (2002),  33–40
4.	V. I. Erokhin, “Matrichnaya korrektsiya dvoistvennoi pary nesobstvennykh zadach lineinogo programmirovaniya”, Zh. vychisl. matem. i matem. fiz., 47:4 (2007), 587–601	→	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
5.	Mladenovic N., Brimberg J., Hansen P., Moreno-Perez J.A., “The p-median problem: A survey of metaheuristic approaches”, European J Oper Res, 179:3 (2007), 927–939	→	Probabilistic search with exclusions for discrete unconstrained optimization E. N. Goncharov, Yu. A. Kochetov Diskretn. Anal. Issled. Oper., 9:2, Series 2 (2002),  13–30
6.	V. I. Erokhin, “Matrichnaya korrektsiya dvoistvennoi pary nesobstvennykh zadach lineinogo programmirovaniya”, Zh. vychisl. matem. i matem. fiz., 47:4 (2007), 587–601	→	Optimal matrix correction and regularization of incompatible linear models V. I. Erokhin Diskretn. Anal. Issled. Oper., 9:2, Series 2 (2002),  41–77
7.	D. S. Ivanenko, A. V. Plyasunov, “O svodimosti zadach dvukhurovnevogo programmirovaniya k zadacham vektornoi optimizatsii”, Diskretn. analiz i issled. oper., ser. 2, ser. 2, 14:1 (2007), 72–99	→	The problem of the choice of a series of goods with partial external financing Yu. A. Kochetov, A. V. Plyasunov Diskretn. Anal. Issled. Oper., 9:2, Series 2 (2002),  78–96
8.	van den Brink R., van der Laan G., Vasil'ev V., “Component efficient solutions in line-graph games with applications”, Economic Theory, 33:2 (2007), 349–364	→	Extreme points of the Weber polytope V. A. Vasil'ev Diskretn. Anal. Issled. Oper., 10:2, Series 1 (2003),  17–55
9.	M. A. Posypkin, I. Kh. Sigal, “Primenenie parallelnykh evristicheskikh algoritmov dlya uskoreniya parallelnogo metoda vetvei i granits”, Zh. vychisl. matem. i matem. fiz., 47:9 (2007), 1524–1537	→	Local search with alternating neighborhoods Yu. A. Kochetov, N. Mladenovich, P. Khansen Diskretn. Anal. Issled. Oper., 10:1, Series 2 (2003),  11–43
10.	D. S. Ivanenko, A. V. Plyasunov, “O svodimosti zadach dvukhurovnevogo programmirovaniya k zadacham vektornoi optimizatsii”, Diskretn. analiz i issled. oper., ser. 2, ser. 2, 14:1 (2007), 72–99	→	A two-level linear programming problem with a multivariant knapsack at the lower level A. V. Plyasunov Diskretn. Anal. Issled. Oper., 10:1, Series 2 (2003),  44–52
11.	E. E. Gurevskii, V. A. Emelichev, “Analiz ustoichivosti leksikograficheskoi bulevoi zadachi minimizatsii modulei lineinykh funktsii”, Diskretn. analiz i issled. oper., ser. 2, ser. 2, 14:1 (2007), 59–71	→	Parametrization of the optimality principle (“from Pareto to Slater”) and the stability of multicriterial trajectory problems S. E. Bukhtoyarov, V. A. Emelichev Diskretn. Anal. Issled. Oper., 10:2, Series 2 (2003),  3–18
12.	N. G. Parvatov, “Nasledstvennye sistemy diskretnykh funktsii”, Diskretn. analiz i issled. oper., ser. 2, ser. 2, 14:2 (2007), 76–91	→	Remarks on the finite generability of closed classes of multivalued functions N. G. Parvatov Diskretn. Anal. Issled. Oper., 11:3, Series 1 (2004),  32–47
13.	Flahive M., Bose B., “Balancing cyclic R-ary Gray codes”, Electron J Combin, 14:1 (2007), R31	→	Totally balanced and exponentially balanced Gray codes A. J. van Zanten, I. N. Suparta Diskretn. Anal. Issled. Oper., 11:4, Series 1 (2004),  81–98
14.	E. Kh. Gimadi, Yu. V. Glazkov, A. N. Glebov, “Algoritmy priblizhennogo resheniya zadachi o dvukh kommivoyazherakh v polnom grafe s vesami reber 1 i 2”, Diskretn. analiz i issled. oper., ser. 2, ser. 2, 14:2 (2007), 41–61	→	Approximate algorithms for finding two edge-disjoint Hamiltonian cycles of minimal weight A. E. Baburin, E. Kh. Gimadi, N. M. Korkishko Diskretn. Anal. Issled. Oper., 11:1, Series 2 (2004),  11–25
15.	Shur A.M., “Rational approximations of polynomial factorial languages”, Internat. J. Found. Comput. Sci., 18:3 (2007), 655–665	→	Combinatorial complexity of rational languages A. M. Shur Diskretn. Anal. Issled. Oper., 12:2, Series 1 (2005),  78–99
16.	T. I. Fedoryaeva, “Vektory raznoobraziya sharov dlya grafov i otsenki ikh komponent”, Diskretn. analiz i issled. oper., ser. 1, ser. 1, 14:2 (2007), 47–67	→	Variety of balls in metric spaces of trees T. I. Fedoryaeva Diskretn. Anal. Issled. Oper., 12:3, Series 1 (2005),  74–84
17.	K. L. Rychkov, “Ob usloviyakh suschestvovaniya grafa s zadannymi diametrom, chislom vershinnoi svyaznosti i vektorom raznoobraziya sharov”, Diskretn. analiz i issled. oper., ser. 1, ser. 1, 14:4 (2007), 43–56	→	Variety of balls in metric spaces of trees T. I. Fedoryaeva Diskretn. Anal. Issled. Oper., 12:3, Series 1 (2005),  74–84
18.	V. A. Gorelik, I. A. Zoltoeva, R. V. Pechenkin, “Metody korrektsii nesovmestnykh lineinykh sistem s razrezhennymi matritsami”, Diskretn. analiz i issled. oper., ser. 2, ser. 2, 14:2 (2007), 62–75	→	Optimal matrix correction of incompatible systems of linear algebraic equations with block matrices of coefficients V. A. Gorelik, V. I. Erokhin, R. V. Pechenkin Diskretn. Anal. Issled. Oper., 12:2, Series 2 (2005),  3–23
19.	V. I. Erokhin, “Matrichnaya korrektsiya dvoistvennoi pary nesobstvennykh zadach lineinogo programmirovaniya”, Zh. vychisl. matem. i matem. fiz., 47:4 (2007), 587–601	→	Optimal matrix correction of incompatible systems of linear algebraic equations with block matrices of coefficients V. A. Gorelik, V. I. Erokhin, R. V. Pechenkin Diskretn. Anal. Issled. Oper., 12:2, Series 2 (2005),  3–23
20.	A. G. Vodennikov, V. A. Emelichev, K. G. Kuzmin, “Ob odnom tipe ustoichivosti vektornoi kombinatornoi zadachi razmescheniya”, Diskretn. analiz i issled. oper., ser. 2, ser. 2, 14:2 (2007), 32–40	→	Analysis of the sensitivity of an efficient solution of a vector Boolean problem of the minimization of projections of linear functions onto $\mathbb R_+$ and $\mathbb R_-$ V. A. Emelichev, K. G. Kuz'min Diskretn. Anal. Issled. Oper., 12:2, Series 2 (2005),  24–43
1 2  Full list