|
|
|
Publications in Math-Net.Ru |
Citations |
|
2015 |
| 1. |
A. S. Asratyan, N. N. Kuzyurin, “Approximating chromatic sum coloring of bipartite graphs in expected polynomial time”, Proceedings of ISP RAS, 27:5 (2015), 191–198   |
|
2004 |
| 2. |
A. S. Asratyan, N. N. Kuzyurin, “Analysis of the accuracy of randomized rounding for integer linear programming problems”, Diskr. Mat., 16:4 (2004), 3–13   ; Discrete Math. Appl., 14:6 (2004), 543–554 |
1
|
|
2000 |
| 3. |
A. S. Asratyan, N. N. Kuzyurin, “Approximation of optima of integer programs of the packing–covering type”, Diskr. Mat., 12:1 (2000), 96–106 ; Discrete Math. Appl., 10:1 (2000), 75–86 |
|
1992 |
| 4. |
A. S. Asratyan, A. N. Mirumyan, “Counterexamples to the Kotzig problem”, Diskr. Mat., 4:2 (1992), 96–98 ; Discrete Math. Appl., 3:1 (1993), 59–61 |
|
1991 |
| 5. |
A. S. Asratyan, A. N. Mirumyan, “Transformations of edge colorings of a bipartite multigraph and
their applications”, Dokl. Akad. Nauk SSSR, 316:1 (1991), 11–13 ; Dokl. Math., 43:1 (1991), 1–3 |
| 6. |
A. S. Asratyan, G. V. Sarkisyan, “Cyclic properties of some Hamiltonian graphs”, Diskr. Mat., 3:4 (1991), 91–104 ; Discrete Math. Appl., 2:6 (1992), 623–637 |
|
1990 |
| 7. |
A. S. Asratyan, A. N. Mirumyan, “Transformations of Latin squares”, Diskr. Mat., 2:3 (1990), 21–28 |
|
1984 |
| 8. |
A. S. Asratyan, N. K. Khachatryan, “Two theorems on Hamiltonian graphs”, Mat. Zametki, 35:1 (1984), 55–61 ; Math. Notes, 35:1 (1984), 32–35  |
1
|
| |
|
|
Contact us: