|
|
|
Publications in Math-Net.Ru |
Citations |
|
2019 |
| 1. |
A. M. Magomedov, T. A. Magomedov, S. A. Lawrencenko, “Mutually-recursive formulas for enumerating partitions of the rectangle”, Prikl. Diskr. Mat., 2019, no. 46, 108–121  |
2
|
|
2016 |
| 2. |
A. M. Magomedov, T. A. Magomedov, “Successive partition of edges of bipartite graph into matchings”, Diskr. Mat., 28:1 (2016), 78–86   ; Discrete Math. Appl., 26:6 (2016), 347–353   |
1
|
|
2015 |
| 3. |
T. A. Magomedov, “On interval $\Delta$-coloring of bipartite graphs”, Avtomat. i Telemekh., 2015, no. 1, 101–109 ; Autom. Remote Control, 76:1 (2015), 80–87 |
3
|
| 4. |
A. M. Magomedov, T. A. Magomedov, “Edge-vertex incident matchings in scheduling”, Prikl. Diskr. Mat., 2015, no. 1(27), 92–95 |
1
|
|
2013 |
| 5. |
A. M. Magomedov, T. A. Magomedov, “Application of an Algorithm for Calculating the Maximum Density Subgraph to the Schedule Optimization Problem”, Mat. Zametki, 93:2 (2013), 313–315  ; Math. Notes, 93:2 (2013), 340–342 |
3
|
|
2012 |
| 6. |
T. A. Magomedov, “Matchings construction procedure”, Prikl. Diskr. Mat. Suppl., 2012, no. 5, 95 |
|
2011 |
| 7. |
A. M. Magomedov, T. A. Magomedov, “Interval on one party regular edge 5-coloring of bipatite graph”, Prikl. Diskr. Mat., 2011, no. 3(13), 85–91 |
1
|
|
| Organisations |
|
| |
|
|
Contact us: