Roman V. Plotnikov

24 papers C 1Journal 14Unranked 9
YearRankTypeTitle / Venue / Authors
2025 J jnl
Approximate weighted 3-coloring.
CoRR
Adil I. Erzin, Roman V. Plotnikov, Georgii Zhukov
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
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
Approximation Algorithms for Two-Bar Charts Packing Problem.
CoRR
Adil I. Erzin, Gregory Melidi, Stepan Nazarenko, Roman V. Plotnikov
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
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 — 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
Variable neighborhood search variants for Min-power symmetric connectivity problem.
Comput. Oper. Res.
Adil I. Erzin, Nenad Mladenovic, Roman V. Plotnikov
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
Using VNS for the Optimal Synthesis of the Communication Tree in Wireless Sensor Networks.
Electron. Notes Discret. Math.
Adil I. Erzin, Roman V. Plotnikov
2011 — conf
Wireless Sensor Network's Lifetime Maximization Problem in Case of Given Set of Covers.
ICCSA (5)
Adil I. Erzin, Roman V. Plotnikov