default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAdil I. Erzin
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[i12]Adil I. Erzin, Roman V. Plotnikov, Georgii Zhukov:
Approximate weighted 3-coloring. CoRR abs/2502.15216 (2025)- 2022
- [c21]Adil I. Erzin
, Roman V. Plotnikov, Ilya Ladygin:
Constrained Shortest Path and Hierarchical Structures. LION 2022: 394-410 - [c20]Adil I. Erzin, Konstantin Sharankhaev:
Three-Bar Charts Packing Problem. OPTIMA (2) 2022: 61-75 - [i11]Adil I. Erzin, Roman V. Plotnikov, Ilya Ladygin:
Constrained Shortest Path and Hierarchical Structures. CoRR abs/2204.04960 (2022) - [i10]Adil I. Erzin, Alexander Kononov, Georgii Melidi, Stepan Nazarenko:
A 4/3·OPT+2/3 approximation for big two-bar charts packing problem. CoRR abs/2212.00944 (2022) - 2021
- [j9]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): 71-84 (2021) - [j8]Adil I. Erzin, Natalya Lagutkina:
FPTAS for barrier covering problem with equal touching circles in 2D. Optim. Lett. 15(4): 1397-1406 (2021) - [j7]Adil I. Erzin, Gregory Melidi, Stepan Nazarenko, Roman V. Plotnikov:
Two-Bar Charts Packing Problem. Optim. Lett. 15(6): 1955-1971 (2021) - [j6]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): 697-719 (2021) - [c19]Roman V. Plotnikov, Adil I. Erzin:
Multi-channel Conflict-Free Square Grid Aggregation. LION 2021: 299-314 - [i9]Adil I. Erzin, Vladimir Shenmaier:
An Improved Approximation for Packing Big Two-Bar Charts. CoRR abs/2101.00470 (2021) - [i8]Adil I. Erzin, Gregory Melidi, Stepan Nazarenko, Roman V. Plotnikov:
Approximation Algorithms for Two-Bar Charts Packing Problem. CoRR abs/2106.09919 (2021) - 2020
- [c18]Adil I. Erzin, Roman V. Plotnikov:
Two-Channel Conflict-Free Square Grid Aggregation. LION 2020: 168-183 - [i7]Adil I. Erzin, Gregory Melidi, Stepan Nazarenko, Roman V. Plotnikov:
Two-Bar Charts Packing Problem. CoRR abs/2005.14195 (2020) - [i6]Adil I. Erzin, Stepan Nazarenko, Gregory Melidi, Roman V. Plotnikov:
A 3/2-approximation for big two-bar charts packing. CoRR abs/2006.10361 (2020)
2010 – 2019
- 2019
- [j5]Roman V. Plotnikov, Adil I. Erzin, Nenad Mladenovic:
VNDS for the min-power symmetric connectivity problem. Optim. Lett. 13(8): 1897-1911 (2019) - [c17]Adil I. Erzin, Natalya Lagutkina, Nika Ioramishvili:
Barrier Covering in 2D Using Mobile Sensors with Circular Coverage Areas. LION 2019: 342-354 - [c16]Roman V. Plotnikov, Adil I. Erzin:
Metaheuristics for Min-Power Bounded-Hops Symmetric Connectivity Problem. LION 2019: 355-369 - [c15]Adil I. Erzin, Roman V. Plotnikov:
The Convergecast Scheduling Problem on a Regular Triangular Grid. MOTOR (2) 2019: 356-368 - [c14]Roman V. Plotnikov, Adil I. Erzin:
Constructive Heuristics for Min-Power Bounded-Hops Symmetric Connectivity Problem. MOTOR (2) 2019: 390-407 - [i5]Roman V. Plotnikov, Adil I. Erzin:
Constructive Heuristics for Min-Power Bounded-Hops Symmetric Connectivity Problem. CoRR abs/1902.06796 (2019) - [i4]Roman V. Plotnikov, Adil I. Erzin, Vyacheslav V. Zalyubovskiy:
GLS and VNS Based Heuristics for Conflict-Free Minimum-Latency Aggregation Scheduling in WSN. CoRR abs/1904.09802 (2019) - 2018
- [c13]Adil I. Erzin, Natalya Lagutkina:
Barrier Coverage Problem in 2D. ALGOSENSORS 2018: 118-130 - [c12]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: 131-140 - [i3]Adil I. Erzin, Natalya Lagutkina:
FPTAS for barrier covering problem with equal circles in 2D. CoRR abs/1811.10161 (2018) - 2017
- [j4]Adil I. Erzin, Nenad Mladenovic, Roman V. Plotnikov:
Variable neighborhood search variants for Min-power symmetric connectivity problem. Comput. Oper. Res. 78: 557-563 (2017) - [c11]Adil I. Erzin, Roman V. Plotnikov:
Conflict-Free Data Aggregation on a Square Grid When Transmission Distance is Not Less Than 3. ALGOSENSORS 2017: 141-154 - [c10]Adil I. Erzin:
Solution of the Convergecast Scheduling Problem on a Square Unit Grid When the Transmission Range is 2. LION 2017: 50-63 - [i2]Roman V. Plotnikov, Adil I. Erzin, Vyacheslav V. Zalyubovskiy:
Convergecast with Unbounded Number of Channels. CoRR abs/1707.05457 (2017) - [i1]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 abs/1707.05464 (2017) - 2016
- [c9]Adil I. Erzin, Artem V. Pyatkin:
Convergecast scheduling problem in case of given aggregation tree: The complexity status and some special cases. CSNDSP 2016: 1-6 - [c8]Roman V. Plotnikov, Adil I. Erzin, Nenad Mladenovic:
Variable Neighborhood Search-Based Heuristics for Min-Power Symmetric Connectivity Problem in Wireless Networks. DOOR 2016: 220-232 - [c7]Adil I. Erzin:
Cost-Effective Strip Covering with Identical Directed Sensors. DOOR (Supplement) 2016: 701-712 - [c6]Adil I. Erzin, Natalia Shabelnikova, Vyacheslav V. Zalyubovskiy:
Covering the Plane with Equal Sectors. IMCOM 2016: 9:1-9:8 - 2015
- [j3]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: 92-104 (2015) - [j2]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: 21-28 (2015) - 2014
- [c5]Radhamanjari Samanta, Adil I. Erzin, Soumyendu Raha:
Timing-driven Steiner tree construction on uniform λ-geometry. VDAT 2014: 1-4 - 2011
- [c4]Adil I. Erzin, Roman V. Plotnikov:
Wireless Sensor Network's Lifetime Maximization Problem in Case of Given Set of Covers. ICCSA (5) 2011: 44-57 - [c3]Adil I. Erzin, Sergey N. Astrakov:
Min-Density Stripe Covering and Applications in Sensor Networks. ICCSA (3) 2011: 152-162
2000 – 2009
- 2009
- [j1]Vyacheslav V. Zalyubovskiy, Adil I. Erzin, Sergey N. Astrakov, Hyunseung Choo:
Energy-efficient Area Coverage by Sensors with Adjustable Ranges. Sensors 9(4): 2446-2460 (2009) - [c2]Vyacheslav V. Zalyubovskiy, Adil I. Erzin, Sergey N. Astrakov, Hyunseung Choo:
Energy-efficient area coverage by sensors with two adjustable ranges. WiOpt 2009: 1-8 - 2008
- [c1]Adil I. Erzin, Vyacheslav V. Zalyubovskiy, Hyunseung Choo:
Maximizing lifetime for a sensor network. ICUIMC 2008: 436-440
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-03-21 01:17 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
