Maximizing lifetime for a sensor network. - Adil I. Erzin; Vyacheslav V. Zalyubovskiy; Hyunseung Choo (ICUIMC, 2008)

Energy-efficient area coverage by sensors with two adjustable ranges. - Vyacheslav V. Zalyubovskiy; Adil I. Erzin; Sergey N. Astrakov; Hyunseung Choo (WiOpt, 2009)

Energy-efficient Area Coverage by Sensors with Adjustable Ranges. - Vyacheslav V. Zalyubovskiy; Adil I. Erzin; Sergey N. Astrakov; Hyunseung Choo (Sensors, 2009)

Min-Density Stripe Covering and Applications in Sensor Networks. - Adil I. Erzin; Sergey N. Astrakov (ICCSA (3), 2011)

Wireless Sensor Network's Lifetime Maximization Problem in Case of Given Set of Covers. - Adil I. Erzin; Roman V. Plotnikov (ICCSA (5), 2011)

Timing-driven Steiner tree construction on uniform λ-geometry. - Radhamanjari Samanta; Adil I. Erzin; Soumyendu Raha (VDAT, 2014)

A provably tight delay-driven concurrently congestion mitigating global routing algorithm. - Radhamanjari Samanta; Adil I. Erzin; Soumyendu Raha; Yuriy V. Shamardin; Ivan I. Takhonov; Vyacheslav V. Zalyubovskiy (Appl. Math. Comput., 2015)

Using VNS for the Optimal Synthesis of the Communication Tree in Wireless Sensor Networks. - Adil I. Erzin; Roman V. Plotnikov (Electron. Notes Discret. Math., 2015)

Convergecast scheduling problem in case of given aggregation tree: The complexity status and some special cases. - Adil I. Erzin; Artem V. Pyatkin (CSNDSP, 2016)

Cost-Effective Strip Covering with Identical Directed Sensors. - Adil I. Erzin (DOOR (Supplement), 2016)

Variable Neighborhood Search-Based Heuristics for Min-Power Symmetric Connectivity Problem in Wireless Networks. - Roman V. Plotnikov; Adil I. Erzin; Nenad Mladenovic (DOOR, 2016)

Covering the Plane with Equal Sectors. - Adil I. Erzin; Natalia Shabelnikova; Vyacheslav V. Zalyubovskiy (IMCOM, 2016)

Conflict-Free Data Aggregation on a Square Grid When Transmission Distance is Not Less Than 3. - Adil I. Erzin; Roman V. Plotnikov (ALGOSENSORS, 2017)

Solution of the Convergecast Scheduling Problem on a Square Unit Grid When the Transmission Range is 2. - Adil I. Erzin (LION, 2017)

Variable neighborhood search variants for Min-power symmetric connectivity problem. - Adil I. Erzin; Nenad Mladenovic; Roman V. Plotnikov (Comput. Oper. Res., 2017)

Energy-Efficient Strip Monitoring by Identical Devices Directed to One Side Along the Strip and Having a Coverage Area in the Form of a Sector. - Adil I. Erzin (CoRR, 2017)

Convergecast with Unbounded Number of Channels. - Roman V. Plotnikov; Adil I. Erzin; Vyacheslav V. Zalyubovskiy (CoRR, 2017)

Barrier Coverage Problem in 2D. - Adil I. Erzin; Natalya Lagutkina (ALGOSENSORS, 2018)

The Accuracy of One Polynomial Algorithm for the Convergecast Scheduling Problem on a Square Grid with Rectangular Obstacles. - Adil I. Erzin; Roman V. Plotnikov (LION, 2018)

FPTAS for barrier covering problem with equal circles in 2D. - Adil I. Erzin; Natalya Lagutkina (CoRR, 2018)

Barrier Covering in 2D Using Mobile Sensors with Circular Coverage Areas. - Adil I. Erzin; Natalya Lagutkina; Nika Ioramishvili (LION, 2019)

Metaheuristics for Min-Power Bounded-Hops Symmetric Connectivity Problem. - Roman V. Plotnikov; Adil I. Erzin (LION, 2019)

The Convergecast Scheduling Problem on a Regular Triangular Grid. - Adil I. Erzin; Roman V. Plotnikov (MOTOR (2), 2019)

Constructive Heuristics for Min-Power Bounded-Hops Symmetric Connectivity Problem. - Roman V. Plotnikov; Adil I. Erzin (MOTOR (2), 2019)

VNDS for the min-power symmetric connectivity problem. - Roman V. Plotnikov; Adil I. Erzin; Nenad Mladenovic (Optim. Lett., 2019)

Two-Channel Conflict-Free Square Grid Aggregation. - Adil I. Erzin; Roman V. Plotnikov (LION, 2020)

A 3/2-approximation for big two-bar charts packing. - Adil I. Erzin; Stepan Nazarenko; Gregory Melidi; Roman V. Plotnikov (CoRR, 2020)

Multi-channel Conflict-Free Square Grid Aggregation. - Roman V. Plotnikov; Adil I. Erzin (LION, 2021)

An Improved Approximation for Packing Big Two-Bar Charts. - Adil I. Erzin; Vladimir Shenmaier (CoRR, 2021)

Approximation Algorithms for Two-Bar Charts Packing Problem. - Adil I. Erzin; Gregory Melidi; Stepan Nazarenko; Roman V. Plotnikov (CoRR, 2021)

A 3/2-approximation for big two-bar charts packing. - Adil I. Erzin; Georgii Melidi; Stepan Nazarenko; Roman V. Plotnikov (J. Comb. Optim., 2021)

FPTAS for barrier covering problem with equal touching circles in 2D. - Adil I. Erzin; Natalya Lagutkina (Optim. Lett., 2021)

Two-Bar Charts Packing Problem. - Adil I. Erzin; Gregory Melidi; Stepan Nazarenko; Roman V. Plotnikov (Optim. Lett., 2021)

GLS and VNS based heuristics for conflict-free minimum-latency aggregation scheduling in WSN. - Roman V. Plotnikov; Adil I. Erzin; Vyacheslav V. Zalyubovskiy (Optim. Methods Softw., 2021)

Constrained Shortest Path and Hierarchical Structures. - Adil I. Erzin; Roman V. Plotnikov; Ilya Ladygin (LION, 2022)

Three-Bar Charts Packing Problem. - Adil I. Erzin; Konstantin Sharankhaev (OPTIMA (2), 2022)

A 4/3·OPT+2/3 approximation for big two-bar charts packing problem. - Adil I. Erzin; Alexander Kononov; Georgii Melidi; Stepan Nazarenko (CoRR, 2022)

Approximate weighted 3-coloring. - Adil I. Erzin; Roman V. Plotnikov; Georgii Zhukov (CoRR, 2025)