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

2-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 2006–2007.

The table below contains the list of citations in 2008 to the papers published in 2006–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  Full list
N	Citing pulication		Cited paper
1.	Ochem P., Pinlou A., “Oriented colorings of partial 2-trees”, Inform. Process. Lett., 108:2 (2008), 82–86	→	Oriented 5-coloring of sparse plane graphs O. V. Borodin, A. O. Ivanova, A. V. Kostochka Diskretn. Anal. Issled. Oper., 13:1, Series 1 (2006),  16–32
2.	O. V. Borodin, S. G. Hartke, A. O. Ivanova, A. V. Kostochka, D. B. West, “Circular $(5,2)$-coloring of sparse graphs”, Sib. elektron. matem. izv., 5 (2008), 417–426	→	Oriented 5-coloring of sparse plane graphs O. V. Borodin, A. O. Ivanova, A. V. Kostochka Diskretn. Anal. Issled. Oper., 13:1, Series 1 (2006),  16–32
3.	Yu. L. Vasilev, S. V. Avgustinovich, D. S. Krotov, “O podvizhnykh mnozhestvakh v dvoichnom giperkube”, Diskretn. analiz i issled. oper., 15:3 (2008), 11–21	→	On enumeration of nonequivalent perfect binary codes of length 15 and rank 15 S. A. Malyugin Diskretn. Anal. Issled. Oper., 13:1, Series 1 (2006),  77–98
4.	E. Kh. Gimadi, Yu. V. Glazkov, I. A. Rykov, “O dvukh zadachakh vybora podmnozhestva vektorov s tselochislennymi koordinatami s maksimalnoi normoi summy v evklidovom prostranstve”, Diskretn. analiz i issled. oper., 15:4 (2008), 30–43	→	Polynomial algorithms for solving the vector sum problem A. E. Baburin, A. V. Pyatkin Diskretn. Anal. Issled. Oper., 13:2, Series 1 (2006),  3–10
5.	E. Kh. Gimadi, A. V. Pyatkin, I. A. Rykov, “O polinomialnoi razreshimosti nekotorykh zadach vybora podmnozhestva vektorov v evklidovom prostranstve fiksirovannoi razmernosti”, Diskretn. analiz i issled. oper., 15:6 (2008), 11–19	→	Polynomial algorithms for solving the vector sum problem A. E. Baburin, A. V. Pyatkin Diskretn. Anal. Issled. Oper., 13:2, Series 1 (2006),  3–10
6.	Ageev A.A., Pyatkin A.V., “A 2-approximation algorithm for the metric 2-peripatetic salesman problem”, Approximation and Online Algorithms, Lecture Notes in Computer Science, 4927, 2008, 103–115	→	A polynomial algorithm with an accuracy estimate of 3/4 for finding two nonintersecting Hamiltonian cycles of maximum weight A. A. Ageev, A. E. Baburin, E. Kh. Gimadi Diskretn. Anal. Issled. Oper., 13:2, Series 1 (2006),  11–20
7.	V. V. Kochergin, “O slozhnosti sovmestnogo vychisleniya trekh elementov svobodnoi abelevoi gruppy s dvumya obrazuyuschimi”, Diskretn. analiz i issled. oper., 15:2 (2008), 23–64	→	Asymptotics of the complexity of systems of integer linear forms for additive computations V. V. Kochergin Diskretn. Anal. Issled. Oper., 13:2, Series 1 (2006),  38–58
8.	Marchenkov S.S., “Strong closure operators on the set of partial Boolean functions”, Doklady Mathematics, 77:2 (2008), 288–289	→	A criterion for positive completeness in ternary logic S. S. Marchenkov Diskretn. Anal. Issled. Oper., 13:3, Series 1 (2006),  27–39
9.	I. A. Pankratova, “Usloviya realizuemosti funktsii na polureshetkakh ustoichivymi k sostyazaniyam skhemami”, Izv. Sarat. un-ta. Nov. ser. Ser. Matematika. Mekhanika. Informatika, 8:1 (2008), 55–58	→	Conditions for realization of a function on a semilattice over real bases of switching elements I. A. Pankratova Diskretn. Anal. Issled. Oper., 13:3, Series 1 (2006),  40–61
10.	V. V. Chugunova, “O realizatsiyakh bulevykh funktsii asimptoticheski optimalnymi po nadezhnosti skhemami”, Diskretn. analiz i issled. oper., 15:6 (2008), 63–89	→	On schemes that are asymptotically best with respect to reliability in the basis $\{&,\vee,^-\}$ with inverse faults at the inputs of elements M. A. Alekhina, V. V. Chugunova Diskretn. Anal. Issled. Oper., 13:4, Series 1 (2006),  3–17
11.	Yu. L. Vasilev, S. V. Avgustinovich, D. S. Krotov, “O podvizhnykh mnozhestvakh v dvoichnom giperkube”, Diskretn. analiz i issled. oper., 15:3 (2008), 11–21	→	A lower bound for the number of transitive perfect codes V. N. Potapov Diskretn. Anal. Issled. Oper., 13:4, Series 1 (2006),  49–59
12.	A. V. Eremeev, M. Ya. Kovalev, P. M. Kuznetsov, “Priblizhennoe reshenie zadachi upravleniya postavkami so mnogimi intervalami i vognutymi funktsiyami stoimosti”, Avtomat. i telemekh., 2008, № 7, 90–97	→	Approximation solution of the supply management problem A. V. Eremeev, A. A. Romanova, V. V. Servakh, S. S. Chauhan Diskretn. Anal. Issled. Oper., 13:1, Series 2 (2006),  27–39
13.	M. I. Grinchuk, “Utochnenie verkhnei otsenki glubiny summatora i komparatora”, Diskretn. analiz i issled. oper., 15:2 (2008), 12–22	→	On the construction of schemes for adders of small depth S. B. Gashkov, M. I. Grinchuk, I. S. Sergeev Diskretn. Anal. Issled. Oper., 14:1, Series 1 (2007),  27–44
14.	S. B. Gashkov, M. I. Grinchuk, I. S. Sergeev, “Pismo v redaktsiyu”, Diskretn. analiz i issled. oper., 15:4 (2008), 92–93	→	On the construction of schemes for adders of small depth S. B. Gashkov, M. I. Grinchuk, I. S. Sergeev Diskretn. Anal. Issled. Oper., 14:1, Series 1 (2007),  27–44
15.	M. I. Grinchuk, “Utochnenie verkhnei otsenki glubiny summatora i komparatora”, Diskretn. analiz i issled. oper., 15:2 (2008), 12–22	→	On one of the possibilities of sharpening estimates for the delay of a parallel adder V. M. Khrapchenko Diskretn. Anal. Issled. Oper., 14:1, Series 1 (2007),  86–93
16.	V. V. Shenmaier, “Priblizhennyi algoritm dlya ierarkhicheskoi zadachi o naznacheniyakh”, Diskretn. analiz i issled. oper., 15:4 (2008), 84–91	→	V. V. Shenmaier Diskretn. Anal. Issled. Oper., 14:2, Series 1 (2007),  95–101
17.	Marchenkov S.S., “Strong closure operators on the set of partial Boolean functions”, Doklady Mathematics, 77:2 (2008), 288–289	→	S. S. Marchenkov Diskretn. Anal. Issled. Oper., 14:3, Series 1 (2007),  53–66
18.	Zinovik I., Kroening D., Chebiryak Yu., “Computing binary combinatorial gray codes via exhaustive search with SAT solvers”, IEEE Trans Inform Theory, 54:4 (2008), 1819–1823	→	A. L. Perezhogin Diskretn. Anal. Issled. Oper., 14:3, Series 1 (2007),  67–79
19.	N. N. Tokareva, “Opisanie $k$-bent-funktsii ot chetyrekh peremennykh”, Diskretn. analiz i issled. oper., 15:4 (2008), 74–83	→	N. N. Tokareva Diskretn. Anal. Issled. Oper., 14:4, Series 1 (2007),  76–102
20.	N. N. Tokareva, “O kvadratichnykh approksimatsiyakh v blochnykh shifrakh”, Probl. peredachi inform., 44:3 (2008), 105–127	→	N. N. Tokareva Diskretn. Anal. Issled. Oper., 14:4, Series 1 (2007),  76–102
1 2  Full list