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

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

The table below contains the list of citations in 2009 to the papers published in 2004–2008. 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 5  Full list
N	Citing pulication		Cited paper
1.	Xu B.G., Lu X.X., “A Structural Theorem on Embedded Graphs and Its Application to Colorings”, Acta Math Sin (Engl Ser ), 25:1 (2009), 47–50	→	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
2.	D. B. Khoroshilova, “O tsirkulyarnykh sovershennykh raskraskakh v dva tsveta”, Diskretn. analiz i issled. oper., 16:1 (2009), 80–92	→	Periodicity of perfect colorings of an infinite rectangular grid S. A. Puzynina Diskretn. Anal. Issled. Oper., 11:1, Series 1 (2004),  79–92
3.	Puzynina S.A., “On periodicity of generalized two-dimensional infinite words”, Information and Computation, 207:11 (2009), 1315–1328	→	Periodicity of perfect colorings of an infinite rectangular grid S. A. Puzynina Diskretn. Anal. Issled. Oper., 11:1, Series 1 (2004),  79–92
4.	N. G. Parvatov, “Problemy polnoty i vyrazimosti diskretnykh funktsii”, PDM, 2009, № 2(4), 56–78	→	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
5.	N. G. Parvatov, “Nizhnie i verkhnie okrestnosti v mnozhestve s zamykaniem”, PDM, 2009, № 3(5), 5–13	→	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
6.	N. G. Parvatov, “Ob invariantakh nekotorykh klassov kvazimonotonnykh funktsii na polureshetke”, PDM, 2009, № 4(6), 21–27	→	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
7.	S. A. Malyugin, “O nesistematicheskikh sovershennykh kodakh nad konechnymi polyami”, Diskretn. analiz i issled. oper., 16:1 (2009), 44–63	→	On partitions of $q$-ary Hamming codes into disjoint components A. M. Romanov Diskretn. Anal. Issled. Oper., 11:3, Series 1 (2004),  80–87
8.	L. A. Sholomov, “Logicheskie metody postroeniya i analiza modelei vybora”, PDM, 2009, № 1(3), 38–71	→	Recognition of the properties of order relations in discrete spaces L. A. Sholomov Diskretn. Anal. Issled. Oper., 11:3, Series 1 (2004),  88–110
9.	Moiseev A.I., “Algoritm resheniya chastnogo sluchaya zadachi optimalnogo raspredeleniya sredstv nablyudeniya sistemy osvescheniya obstanovki”, Avtomatizatsiya protsessov upravleniya, 2009, № 4, 50–52	→	On a generalization of the minimax assignment problem N. I. Glebov Diskretn. Anal. Issled. Oper., 11:4, Series 1 (2004),  36–43
10.	Semenov A.A., Otpuschennikov I.V., Kochemazov S.E., “Propozitsionalnyi podkhod v zadachakh testirovaniya diskretnykh avtomatov”, Sovremennye tekhnologii. Sistemnyi analiz. Modelirovanie, 2009, № 4, 48–56	→	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
11.	Ignatev A.S., Semenov A.A., Khmelnov A.E., “Ispolzovanie dvoichnykh diagramm reshenii v zadachakh obrascheniya diskretnykh funktsii”, Vestn. Tomskogo gos. un-ta. Upravlenie, vychislitelnaya tekhnika i informatika, 2009, № 1, 115–129	→	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
12.	Semenov A.A., “Dekompozitsionnye predstavleniya logicheskikh uravnenii v zadachakh obrascheniya diskretnykh funktsii”, Izv. RAN. Teoriya i sistemy upravleniya, 2009, № 5, 47–61	→	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
13.	A. A. Ageev, A. V. Pyatkin, “Priblizhennyi algoritm resheniya metricheskoi zadachi o dvukh kommivoyazherakh s otsenkoi tochnosti 2”, Diskretn. analiz i issled. oper., 16:4 (2009), 3–20	→	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
14.	Baburin A.E., Della Croce F., Gimadi E.K., Glazkov Y.V., Paschos V.T., “Approximation algorithms for the 2-peripatetic salesman problem with edge weights 1 and 2”, Discrete Appl Math, 157:9 (2009), 1988–1992	→	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.	Dobrynin A.A., Mel'nikov L.S., “4-chromatic edge critical Grotzsch-Sachs graphs”, Discrete Math, 309:8 (2009), 2564–2566	→	Families of planar 4-homogeneous 4-critical graphs L. S. Mel'nikov Diskretn. Anal. Issled. Oper., 11:1, Series 2 (2004),  79–115
16.	A. A. Dobrynin, “Indeks Vinera dlya grafov proizvolnogo obkhvata i ikh rebernykh grafov”, Sib. zhurn. industr. matem., 12:4 (2009), 44–50	→	The Wiener index for graphs and their edge graphs A. A. Dobrynin, L. S. Mel'nikov Diskretn. Anal. Issled. Oper., 11:2, Series 2 (2004),  25–44
17.	Shur A.M., “On intermediate factorial languages”, Discrete Appl. Math., 157:7 (2009), 1669–1675	→	Combinatorial complexity of rational languages A. M. Shur Diskretn. Anal. Issled. Oper., 12:2, Series 1 (2005),  78–99
18.	Shur A.M., “Polynomial languages with finite antidictionaries”, Theor. Inform. Appl., 43:2 (2009), 269–279	→	Combinatorial complexity of rational languages A. M. Shur Diskretn. Anal. Issled. Oper., 12:2, Series 1 (2005),  78–99
19.	L. P. Zhiltsova, “O matritse pervykh momentov razlozhimoi stokhasticheskoi KS-grammatiki”, Uchen. zap. Kazan. gos. un-ta. Ser. Fiz.-matem. nauki, 151, № 2, Izd-vo Kazanskogo un-ta, Kazan, 2009, 80–89	→	On the properties of a stochastic context-free language generated by a grammar with two classes of nonterminal symbols A. E. Borisov Diskretn. Anal. Issled. Oper., 12:3, Series 1 (2005),  3–31
20.	O. V. Borodin, A. O. Ivanova, “Predpisannaya 2–distantsionnaya $(\Delta+2)$-raskraska ploskikh grafov s obkhvatom 6 i $\Delta\ge24$”, Sib. matem. zhurn., 50:6 (2009), 1216–1224	→	Sufficient conditions for the 2-distance $(\Delta+1)$-colorability of planar graphs with girth 6 O. V. Borodin, A. O. Ivanova, T. K. Neustroeva Diskretn. Anal. Issled. Oper., 12:3, Series 1 (2005),  32–47
1 2 3 4 5  Full list