|
|
|
Publications in Math-Net.Ru |
Citations |
|
2002 |
| 1. |
B. S. Tsybakov, A. R. Rubinov, “Some Constructions of Conflict-Avoiding Codes”, Probl. Peredachi Inf., 38:4 (2002), 24–36    ; Problems Inform. Transmission, 38:4 (2002), 268–279 |
23
|
|
1982 |
| 2. |
A. R. Rubinov, “On the reducibility of the generalized traveling salesman problem of lower dimension”, Dokl. Akad. Nauk SSSR, 264:5 (1982), 1087–1090 |
|
1981 |
| 3. |
A. R. Rubinov, “Turnpike theorems in the generalized traveling salesman problem and their application to cutting problems and problems in scheduling theory”, Dokl. Akad. Nauk SSSR, 259:3 (1981), 542–546 |
|
Contact us: