Adil I. Erzin

Orcid: 0000-0002-2183-523X

According to our database1, Adil I. Erzin authored at least 37 papers between 2008 and 2022.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2022
A 4/3·OPT+2/3 approximation for big two-bar charts packing problem.
CoRR, 2022

Three-Bar Charts Packing Problem.
Proceedings of the Advances in Optimization and Applications, 2022

Constrained Shortest Path and Hierarchical Structures.
Proceedings of the Learning and Intelligent Optimization - 16th International Conference, 2022

2021
GLS and VNS based heuristics for conflict-free minimum-latency aggregation scheduling in WSN.
Optim. Methods Softw., 2021

Two-Bar Charts Packing Problem.
Optim. Lett., 2021

FPTAS for barrier covering problem with equal touching circles in 2D.
Optim. Lett., 2021

A 3/2-approximation for big two-bar charts packing.
J. Comb. Optim., 2021

Approximation Algorithms for Two-Bar Charts Packing Problem.
CoRR, 2021

An Improved Approximation for Packing Big Two-Bar Charts.
CoRR, 2021

Multi-channel Conflict-Free Square Grid Aggregation.
Proceedings of the Learning and Intelligent Optimization - 15th International Conference, 2021

2020
A 3/2-approximation for big two-bar charts packing.
CoRR, 2020

Two-Channel Conflict-Free Square Grid Aggregation.
Proceedings of the Learning and Intelligent Optimization - 14th International Conference, 2020

2019
VNDS for the min-power symmetric connectivity problem.
Optim. Lett., 2019

Constructive Heuristics for Min-Power Bounded-Hops Symmetric Connectivity Problem.
Proceedings of the Mathematical Optimization Theory and Operations Research, 2019

The Convergecast Scheduling Problem on a Regular Triangular Grid.
Proceedings of the Mathematical Optimization Theory and Operations Research, 2019

Metaheuristics for Min-Power Bounded-Hops Symmetric Connectivity Problem.
Proceedings of the Learning and Intelligent Optimization - 13th International Conference, 2019

Barrier Covering in 2D Using Mobile Sensors with Circular Coverage Areas.
Proceedings of the Learning and Intelligent Optimization - 13th International Conference, 2019

2018
FPTAS for barrier covering problem with equal circles in 2D.
CoRR, 2018

The Accuracy of One Polynomial Algorithm for the Convergecast Scheduling Problem on a Square Grid with Rectangular Obstacles.
Proceedings of the Learning and Intelligent Optimization - 12th International Conference, 2018

Barrier Coverage Problem in 2D.
Proceedings of the Algorithms for Sensor Systems, 2018

2017
Convergecast with Unbounded Number of Channels.
CoRR, 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.
CoRR, 2017

Variable neighborhood search variants for Min-power symmetric connectivity problem.
Comput. Oper. Res., 2017

Solution of the Convergecast Scheduling Problem on a Square Unit Grid When the Transmission Range is 2.
Proceedings of the Learning and Intelligent Optimization - 11th International Conference, 2017

Conflict-Free Data Aggregation on a Square Grid When Transmission Distance is Not Less Than 3.
Proceedings of the Algorithms for Sensor Systems, 2017

2016
Covering the Plane with Equal Sectors.
Proceedings of the 10th International Conference on Ubiquitous Information Management and Communication, 2016

Variable Neighborhood Search-Based Heuristics for Min-Power Symmetric Connectivity Problem in Wireless Networks.
Proceedings of the Discrete Optimization and Operations Research, 2016

Cost-Effective Strip Covering with Identical Directed Sensors.
Proceedings of the Supplementary Proceedings of the 9th International Conference on Discrete Optimization and Operations Research and Scientific School (DOOR 2016), Vladivostok, Russia, September 19, 2016

Convergecast scheduling problem in case of given aggregation tree: The complexity status and some special cases.
Proceedings of the 10th International Symposium on Communication Systems, 2016

2015
Using VNS for the Optimal Synthesis of the Communication Tree in Wireless Sensor Networks.
Electron. Notes Discret. Math., 2015

A provably tight delay-driven concurrently congestion mitigating global routing algorithm.
Appl. Math. Comput., 2015

2014
Timing-driven Steiner tree construction on uniform λ-geometry.
Proceedings of the 18th International Symposium on VLSI Design and Test, 2014

2011
Wireless Sensor Network's Lifetime Maximization Problem in Case of Given Set of Covers.
Proceedings of the Computational Science and Its Applications - ICCSA 2011, 2011

Min-Density Stripe Covering and Applications in Sensor Networks.
Proceedings of the Computational Science and Its Applications - ICCSA 2011, 2011

2009
Energy-efficient Area Coverage by Sensors with Adjustable Ranges.
Sensors, 2009

Energy-efficient area coverage by sensors with two adjustable ranges.
Proceedings of the 7th International Symposium on Modeling and Optimization in Mobile, 2009

2008
Maximizing lifetime for a sensor network.
Proceedings of the 2nd International Conference on Ubiquitous Information Management and Communication, 2008


  Loading...