Adil I. Erzin - RankMe

42 papers B 1C 2Journal 21Unranked 18

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