Erzin Adil Iliasovich

Publications in Math-Net.Ru

1. About density of a covering of a strip with identical sectors
   
   Diskretn. Anal. Issled. Oper., 22:4 (2015),  21–34
2. Some polynomially solvable cases and approximation algorithms for optimal communication tree construction problem
   
   Diskretn. Anal. Issled. Oper., 20:1 (2013),  12–27
3. On maximization of sensor network's lifetime subject to the limited resources
   
   Diskretn. Anal. Issled. Oper., 18:6 (2011),  17–32
4. The Coverage of a Planar Region by Randomly Deployed Sensors
   
   Vestn. Novosib. Gos. Univ., Ser. Mat. Mekh. Inform., 10:4 (2010),  7–25
5. Elmor model-based algorithm to select optimal connections on the clock tree
   
   Avtomat. i Telemekh., 2009, no. 10,  172–183
6. Sensor networks and covering of plane by discs
   
   Diskretn. Anal. Issled. Oper., 16:3 (2009),  3–19
7. On the Reliability of Series-Parallel Networks in Grid Graphs
   
   Vestn. Novosib. Gos. Univ., Ser. Mat. Mekh. Inform., 9:2 (2009),  3–14
8. The problem of the search for a balanced flow
   
   Sib. Zh. Ind. Mat., 9:4 (2006),  50–63
9. Equilibrium resource distribution in a network model
   
   Sib. Zh. Ind. Mat., 8:3 (2005),  58–68
10. Concurrent Placement and Routing in the Design of Integrated Circuits
    
    Avtomat. i Telemekh., 2003, no. 12,  177–190
11. Skew Minimization Problem with Possible Sink Displacement
    
    Avtomat. i Telemekh., 2003, no. 3,  163–176
12. Models and problems of the optimal synthesis of homogeneous hierarchical systems
    
    Trudy Inst. Mat. SO RAN, 28 (1994),  63–76
13. Задача синтеза надежной сети связи ограниченного веса
    
    Upravliaemie systemy, 1993, no. 31,  3–9
14. Solution of a knapsack problem
    
    Upravliaemie systemy, 1989, no. 29,  41–56
15. The problem of constructing a spanning tree of maximal weight with a bounded radius
    
    Upravliaemie systemy, 1987, no. 27,  70–78
16. A problem of construction of an optimal tree
    
    Upravliaemie systemy, 1983, no. 23,  44–54