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

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

The table below contains the list of citations in 2008 to the papers published in 2003–2007. 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 3 4  Full list
N	Citing pulication		Cited paper
1.	S. V. Avgustinovich, A. Yu. Vasileva, “Teoremy vosstanovleniya dlya tsentrirovannykh funktsii i sovershennykh kodov”, Sib. matem. zhurn., 49:3 (2008), 483–489	→	Computation of a centered function from its values on the middle layers of the Boolean cube S. V. Avgustinovich, A. Yu. Vasil'eva Diskretn. Anal. Issled. Oper., 10:2, Series 1 (2003),  3–16
2.	Heden O., “A survey of perfect codes”, Adv Math Commun, 2:2 (2008), 223–247	→	Computation of a centered function from its values on the middle layers of the Boolean cube S. V. Avgustinovich, A. Yu. Vasil'eva Diskretn. Anal. Issled. Oper., 10:2, Series 1 (2003),  3–16
3.	Puzynina S.A., Avgustinovich S.V., “On periodicity of two-dimensional words”, Theoret Comput Sci, 391:1–2 (2008), 178–187	→	Computation of a centered function from its values on the middle layers of the Boolean cube S. V. Avgustinovich, A. Yu. Vasil'eva Diskretn. Anal. Issled. Oper., 10:2, Series 1 (2003),  3–16
4.	Puzynina S., “On Periodicity of Generalized Two-Dimensional Words”, Language and Automata Theory and Applications, Lecture Notes in Computer Science, 5196, 2008, 440–451	→	Computation of a centered function from its values on the middle layers of the Boolean cube S. V. Avgustinovich, A. Yu. Vasil'eva Diskretn. Anal. Issled. Oper., 10:2, Series 1 (2003),  3–16
5.	Vladimir A. Emelichev, Andrey A. Platonov, “Measure of quasistability of a vector integer linear programming problem with generalized principle of optimality in the Helder metric”, Bul. Acad. Ştiinţe Repub. Mold. Mat., 2008, no. 2, 58–67	→	On linear factors of multigraphs V. G. Vizing Diskretn. Anal. Issled. Oper., 10:4, Series 1 (2003),  3–7
6.	T. V. Levanova, A. S. Fedorenko, “Lokalnyi poisk s chereduyuschimisya okrestnostyami dlya dvukhstadiinoi zadachi razmescheniya”, Diskretn. analiz i issled. oper., 15:3 (2008), 43–57	→	Local search with alternating neighborhoods Yu. A. Kochetov, N. Mladenovich, P. Khansen Diskretn. Anal. Issled. Oper., 10:1, Series 2 (2003),  11–43
7.	Krasovskii D.V., Furugyan M.G., “Algorithms for Solving Minimax Scheduling Problem”, Journal of Computer and Systems Sciences International, 47:5 (2008), 732–736	→	Local search with alternating neighborhoods Yu. A. Kochetov, N. Mladenovich, P. Khansen Diskretn. Anal. Issled. Oper., 10:1, Series 2 (2003),  11–43
8.	V. N. Shevchenko, D. V. Gruzdev, “Ob $f$-vektorakh piramidalnykh triangulyatsii tochechnykh konfiguratsii”, Diskretn. analiz i issled. oper., 15:3 (2008), 74–90	→	A modification of the Fourier-Motskin algorithm for constructing a triangulation V. N. Shevchenko, D. V. Gruzdev Diskretn. Anal. Issled. Oper., 10:1, Series 2 (2003),  53–64
9.	Vladimir A. Emelichev, Andrey A. Platonov, “Measure of quasistability of a vector integer linear programming problem with generalized principle of optimality in the Helder metric”, Bul. Acad. Ştiinţe Repub. Mold. Mat., 2008, no. 2, 58–67	→	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
10.	Krasovskii D.V., Furugyan M.G., “Algorithms for Solving Minimax Scheduling Problem”, Journal of Computer and Systems Sciences International, 47:5 (2008), 732–736	→	The use of alternating neighborhoods for an approximate solution of a resource-constrained scheduling problem Yu. A. Kochetov, A. A. Stolyar Diskretn. Anal. Issled. Oper., 10:2, Series 2 (2003),  29–55
11.	Felinskas G., Sakalauskas L., “Variable neighborhood Simulated Annealing method and application for design”, 25th International Symposium on Automation and Robotics in Construction - Isarc-2008, 2008, 566–572	→	The use of alternating neighborhoods for an approximate solution of a resource-constrained scheduling problem Yu. A. Kochetov, A. A. Stolyar Diskretn. Anal. Issled. Oper., 10:2, Series 2 (2003),  29–55
12.	V. A. Tashkinov, “O planarnykh grafakh bez predpisannoi $3$-raskraski”, Sib. elektron. matem. izv., 5 (2008), 685–690	→	A sufficient condition for the 3-colorability of plane graphs O. V. Borodin, A. N. Glebov Diskretn. Anal. Issled. Oper., 11:1, Series 1 (2004),  13–29
13.	Xu B., “On $(3,1)^*$-Coloring of Plane Graphs”, SIAM J Discrete Math, 23:1 (2008), 205–220	→	A sufficient condition for the 3-colorability of plane graphs O. V. Borodin, A. N. Glebov Diskretn. Anal. Issled. Oper., 11:1, Series 1 (2004),  13–29
14.	Puzynina S.A., Avgustinovich S.V., “On periodicity of two-dimensional words”, Theoret Comput Sci, 391:1–2 (2008), 178–187	→	Periodicity of perfect colorings of an infinite rectangular grid S. A. Puzynina Diskretn. Anal. Issled. Oper., 11:1, Series 1 (2004),  79–92
15.	Puzynina S., “On Periodicity of Generalized Two-Dimensional Words”, Language and Automata Theory and Applications, Lecture Notes in Computer Science, 5196, 2008, 440–451	→	Periodicity of perfect colorings of an infinite rectangular grid S. A. Puzynina Diskretn. Anal. Issled. Oper., 11:1, Series 1 (2004),  79–92
16.	S. A. Puzynina, “Perfect colorings of radius $r>1$ of the infinite rectangular grid”, Sib. elektron. matem. izv., 5 (2008), 283–292	→	Periodicity of perfect colorings of an infinite rectangular grid S. A. Puzynina Diskretn. Anal. Issled. Oper., 11:1, Series 1 (2004),  79–92
17.	Boros E., Gurvich V., Zverovich I., “Neighborhood hypergraphs of bipartite graphs”, J Graph Theory, 58:1 (2008), 69–95	→	Chain decompositions by distances, and graph isomorphisms O. V. Rasin Diskretn. Anal. Issled. Oper., 11:3, Series 1 (2004),  63–79
18.	Solov'eva F.I., “On perfect binary codes”, Discrete Appl Math, 156:9 (2008), 1488–1498	→	On partitions of $q$-ary Hamming codes into disjoint components A. M. Romanov Diskretn. Anal. Issled. Oper., 11:3, Series 1 (2004),  80–87
19.	O. S. Zaikin, A. A. Semenov, “Tekhnologiya krupnoblochnogo parallelizma v SAT-zadachakh”, Probl. upravl., 1 (2008), 43–50	→	On the complexity of the inversion of discrete functions of a certain class A. A. Semenov Diskretn. Anal. Issled. Oper., 11:4, Series 1 (2004),  44–55
20.	Flahive M., “Balancing cycli R-ary Gray codes II”, Electron J Combin, 15:1 (2008), R128	→	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
1 2 3 4  Full list