|
|
|
Publications in Math-Net.Ru |
Citations |
|
1980 |
| 1. |
E. B. Kinber, “A polynomial algorithm for finding minimal vertex coverings for a class of planar graphs”, Izv. Vyssh. Uchebn. Zaved. Mat., 1980, no. 1, 75–77    ; Soviet Math. (Iz. VUZ), 24:1 (1980), 98–100 |
|
1974 |
| 2. |
E. B. Kinber, “Frequency enumeration of sets”, Algebra Logika, 13:4 (1974), 398–419 |
|
1972 |
| 3. |
E. B. Kinber, “Frequency calculations o f general recursive predicates and frequency enumeration of sets”, Dokl. Akad. Nauk SSSR, 205:1 (1972), 23–25 |
|
| Organisations |
|
|
Contact us: