Asratyan A S

Publications in Math-Net.Ru

1. Approximating chromatic sum coloring of bipartite graphs in expected polynomial time
   
   Proceedings of ISP RAS, 27:5 (2015),  191–198
2. Analysis of the accuracy of randomized rounding for integer linear programming problems
   
   Diskr. Mat., 16:4 (2004),  3–13
3. Approximation of optima of integer programs of the packing–covering type
   
   Diskr. Mat., 12:1 (2000),  96–106
4. Counterexamples to the Kotzig problem
   
   Diskr. Mat., 4:2 (1992),  96–98
5. Transformations of edge colorings of a bipartite multigraph and their applications
   
   Dokl. Akad. Nauk SSSR, 316:1 (1991),  11–13
6. Cyclic properties of some Hamiltonian graphs
   
   Diskr. Mat., 3:4 (1991),  91–104
7. Transformations of Latin squares
   
   Diskr. Mat., 2:3 (1990),  21–28
8. Two theorems on Hamiltonian graphs
   
   Mat. Zametki, 35:1 (1984),  55–61