Magomedov Abdulkarim Magomedovich

Publications in Math-Net.Ru

1. Computational algorithm for enumerating graphs of a given order
   
   Daghestan Electronic Mathematical Reports, 2021, no. 16,  1–15
2. Computational aspects of the partition enumeration problem
   
   Daghestan Electronic Mathematical Reports, 2020, no. 14,  1–21
3. Solving puzzles by O. Ore's method
   
   Daghestan Electronic Mathematical Reports, 2020, no. 13,  22–30
4. Some aspects of familiarization with binomial coefficients
   
   Daghestan Electronic Mathematical Reports, 2019, no. 11,  49–53
5. Mutually-recursive formulas for enumerating partitions of the rectangle
   
   Prikl. Diskr. Mat., 2019, no. 46,  108–121
6. Automation of the creation of test units by programming language
   
   Daghestan Electronic Mathematical Reports, 2018, no. 9,  76–80
7. Piecewise continuous paths in the task of building and optimizing schedules
   
   Informatsionnye Tekhnologii i Vychslitel'nye Sistemy, 2018, no. 1,  78–84
8. Algorithm for coloring edges of a simple graph
   
   Daghestan Electronic Mathematical Reports, 2016, no. 6,  25–30
9. Search elimination of bipartite graphs on 15 vertices
   
   Daghestan Electronic Mathematical Reports, 2016, no. 5,  20–24
10. Successive partition of edges of bipartite graph into matchings
    
    Diskr. Mat., 28:1 (2016),  78–86
11. The coloring of special kind bipartite graphs
    
    Meždunar. nauč.-issled. žurn., 2016, no. 9-2(51),  128–131
12. Chain structures in schedules tasks
    
    Prikl. Diskr. Mat., 2016, no. 3(33),  67–77
13. Edge-vertex incident matchings in scheduling
    
    Prikl. Diskr. Mat., 2015, no. 1(27),  92–95
14. Continuous participation of objects in the schedule with the prescribed operations
    
    Daghestan Electronic Mathematical Reports, 2014, no. 2,  68–74
15. Bipartite ${(6,3)}_6$-biregular graphs which do not allow interval coloring
    
    Daghestan Electronic Mathematical Reports, 2014, no. 1,  71–78
16. Reduction enumeration of bipartite graphs
    
    Meždunar. nauč.-issled. žurn., 2014, no. 3(22),  11–12
17. Application of an Algorithm for Calculating the Maximum Density Subgraph to the Schedule Optimization Problem
    
    Mat. Zametki, 93:2 (2013),  313–315
18. A continuous timetable with $m$, $m-2$, or $2$ instructor's class hours
    
    Diskr. Mat., 24:2 (2012),  37–45
19. On interval edge $\Delta$-colouring
    
    Prikl. Diskr. Mat. Suppl., 2012, no. 5,  94–95
20. The continuous schedule with two-element instructions
    
    Izv. Saratov Univ. Math. Mech. Inform., 11:2 (2011),  113–119
21. Existence of a Trade-Off Factorization of a Partially $4$-Homogeneous Graph
    
    Mat. Zametki, 89:3 (2011),  378–383
22. Interval on one party regular edge 5-coloring of bipatite graph
    
    Prikl. Diskr. Mat., 2011, no. 3(13),  85–91
23. Defragmentation of permutation tables with four columns
    
    Diskr. Mat., 21:4 (2009),  95–104
24. On the edge colouring of bipartite graphs
    
    Diskr. Mat., 21:2 (2009),  153–158
25. Condensing Timetables with Target Date Divisible by Each Instructor's Number of Teaching Hours
    
    Mat. Zametki, 85:1 (2009),  65–72
26. Method of studying polymorphic transformations in melts of metals
    
    TVT, 23:5 (1985),  900–903
27. Исследование строения расплавов эвтектической системы галлий-олово
    
    TVT, 22:6 (1984),  1212–1214
28. Скорость ультразвука и сжимаемость сплавов цинк – кадмий
    
    TVT, 17:4 (1979),  728–734
29. Электросопротивление расплавов кадмий – цинк и индий – цинк
    
    TVT, 17:2 (1979),  323–329
30. Электросопротивление расплавов $\mathrm{Zn} - \mathrm{Sn}$ и $\mathrm{Zn} - \mathrm{Bi}$
    
    TVT, 16:3 (1978),  526–530
31. Теплопроводность цинка, галлия и их сплавов (№ 192–78 Деп. от 12 I 1978)
    
    TVT, 16:2 (1978),  442


32. Влияние внешних факторов равновесия на удельное сопротивление металлических расплавов (№ 7508-86 от 31.Х.1986)
    
    TVT, 25:1 (1987),  201