Adil I. Erzin

Publication Activity (10 Years)

Years Active: 2008-2022
Publications (10 Years): 33

Top Topics

Approximation Algorithms

Wireless Sensor Networks

Multivalued Dependencies

Hierarchical Structure

Top Venues

Publications

Adil I. Erzin, Alexander Kononov, Georgii Melidi, Stepan Nazarenko
A 4/3·OPT+2/3 approximation for big two-bar charts packing problem. CoRR (2022)
Adil I. Erzin, Roman V. Plotnikov, Ilya Ladygin
Constrained Shortest Path and Hierarchical Structures. CoRR (2022)
Adil I. Erzin, Roman V. Plotnikov, Ilya Ladygin
Constrained Shortest Path and Hierarchical Structures. LION (2022)
Adil I. Erzin, Konstantin Sharankhaev
Three-Bar Charts Packing Problem. OPTIMA (2) (2022)
Adil I. Erzin, Gregory Melidi, Stepan Nazarenko, Roman V. Plotnikov
Two-Bar Charts Packing Problem. Optim. Lett. 15 (6) (2021)
Roman V. Plotnikov, Adil I. Erzin
Multi-channel Conflict-Free Square Grid Aggregation. LION (2021)
Roman V. Plotnikov, Adil I. Erzin, Vyacheslav V. Zalyubovskiy
GLS and VNS based heuristics for conflict-free minimum-latency aggregation scheduling in WSN. Optim. Methods Softw. 36 (4) (2021)
Adil I. Erzin, Vladimir Shenmaier
An Improved Approximation for Packing Big Two-Bar Charts. CoRR (2021)
Adil I. Erzin, Natalya Lagutkina
FPTAS for barrier covering problem with equal touching circles in 2D. Optim. Lett. 15 (4) (2021)
Adil I. Erzin, Georgii Melidi, Stepan Nazarenko, Roman V. Plotnikov
A 3/2-approximation for big two-bar charts packing. J. Comb. Optim. 42 (1) (2021)
Adil I. Erzin, Gregory Melidi, Stepan Nazarenko, Roman V. Plotnikov
Approximation Algorithms for Two-Bar Charts Packing Problem. CoRR (2021)
Adil I. Erzin, Gregory Melidi, Stepan Nazarenko, Roman V. Plotnikov
Two-Bar Charts Packing Problem. CoRR (2020)
Adil I. Erzin, Stepan Nazarenko, Gregory Melidi, Roman V. Plotnikov
A 3/2-approximation for big two-bar charts packing. CoRR (2020)
Adil I. Erzin, Roman V. Plotnikov
Two-Channel Conflict-Free Square Grid Aggregation. LION (2020)
Roman V. Plotnikov, Adil I. Erzin
Constructive Heuristics for Min-Power Bounded-Hops Symmetric Connectivity Problem. MOTOR (2) (2019)
Roman V. Plotnikov, Adil I. Erzin
Metaheuristics for Min-Power Bounded-Hops Symmetric Connectivity Problem. LION (2019)
Adil I. Erzin, Natalya Lagutkina, Nika Ioramishvili
Barrier Covering in 2D Using Mobile Sensors with Circular Coverage Areas. LION (2019)
Roman V. Plotnikov, Adil I. Erzin, Vyacheslav V. Zalyubovskiy
GLS and VNS Based Heuristics for Conflict-Free Minimum-Latency Aggregation Scheduling in WSN. CoRR (2019)
Roman V. Plotnikov, Adil I. Erzin
Constructive Heuristics for Min-Power Bounded-Hops Symmetric Connectivity Problem. CoRR (2019)
Adil I. Erzin, Roman V. Plotnikov
The Convergecast Scheduling Problem on a Regular Triangular Grid. MOTOR (2) (2019)
Roman V. Plotnikov, Adil I. Erzin, Nenad Mladenovic
VNDS for the min-power symmetric connectivity problem. Optim. Lett. 13 (8) (2019)
Adil I. Erzin, Roman V. Plotnikov
The Accuracy of One Polynomial Algorithm for the Convergecast Scheduling Problem on a Square Grid with Rectangular Obstacles. LION (2018)
Adil I. Erzin, Natalya Lagutkina
FPTAS for barrier covering problem with equal circles in 2D. CoRR (2018)
Adil I. Erzin, Natalya Lagutkina
Barrier Coverage Problem in 2D. ALGOSENSORS (2018)
Adil I. Erzin, Roman V. Plotnikov
Conflict-Free Data Aggregation on a Square Grid When Transmission Distance is Not Less Than 3. ALGOSENSORS (2017)
Roman V. Plotnikov, Adil I. Erzin, Vyacheslav V. Zalyubovskiy
Convergecast with Unbounded Number of Channels. CoRR (2017)
Adil I. Erzin
Solution of the Convergecast Scheduling Problem on a Square Unit Grid When the Transmission Range is 2. LION (2017)
Adil I. Erzin, Nenad Mladenovic, Roman V. Plotnikov
Variable neighborhood search variants for Min-power symmetric connectivity problem. Comput. Oper. Res. 78 (2017)
Adil I. Erzin
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. CoRR (2017)
Adil I. Erzin
Cost-Effective Strip Covering with Identical Directed Sensors. DOOR (Supplement) (2016)
Adil I. Erzin, Artem V. Pyatkin
Convergecast scheduling problem in case of given aggregation tree: The complexity status and some special cases. CSNDSP (2016)
Adil I. Erzin, Natalia Shabelnikova, Vyacheslav V. Zalyubovskiy
Covering the Plane with Equal Sectors. IMCOM (2016)
Roman V. Plotnikov, Adil I. Erzin, Nenad Mladenovic
Variable Neighborhood Search-Based Heuristics for Min-Power Symmetric Connectivity Problem in Wireless Networks. DOOR (2016)
Radhamanjari Samanta, Adil I. Erzin, Soumyendu Raha, Yuriy V. Shamardin, Ivan I. Takhonov, Vyacheslav V. Zalyubovskiy
A provably tight delay-driven concurrently congestion mitigating global routing algorithm. Appl. Math. Comput. 255 (2015)
Adil I. Erzin, Roman V. Plotnikov
Using VNS for the Optimal Synthesis of the Communication Tree in Wireless Sensor Networks. Electron. Notes Discret. Math. 47 (2015)
Radhamanjari Samanta, Adil I. Erzin, Soumyendu Raha
Timing-driven Steiner tree construction on uniform λ-geometry. VDAT (2014)
Adil I. Erzin, Roman V. Plotnikov
Wireless Sensor Network's Lifetime Maximization Problem in Case of Given Set of Covers. ICCSA (5) (2011)
Adil I. Erzin, Sergey N. Astrakov
Min-Density Stripe Covering and Applications in Sensor Networks. ICCSA (3) (2011)
Vyacheslav V. Zalyubovskiy, Adil I. Erzin, Sergey N. Astrakov, Hyunseung Choo
Energy-efficient area coverage by sensors with two adjustable ranges. WiOpt (2009)
Vyacheslav V. Zalyubovskiy, Adil I. Erzin, Sergey N. Astrakov, Hyunseung Choo
Energy-efficient Area Coverage by Sensors with Adjustable Ranges. Sensors 9 (4) (2009)
Adil I. Erzin, Vyacheslav V. Zalyubovskiy, Hyunseung Choo
Maximizing lifetime for a sensor network. ICUIMC (2008)