10 citations · 22 across the 8 of their papers we have counts for
Showing cs.DMShow all
2 papers · 1 filter
cs.DM2025
Approximate weighted 3-coloring
Adil Erzin, Roman Plotnikov, Georgii Zhukov
The paper considers the NP-hard graph vertex coloring problem, which differs from traditional problems in which it is required to color vertices with a given (or minimal) number of…
cs.DM2021
Approximation Algorithms for Two-Bar Charts Packing Problem
Adil Erzin, Georgii Melidi, Stepan Nazarenko +1
In the Two-Bar Charts Packing Problem (2-BCPP), it is required to pack the bar charts (BCs) consisting of two bars into the horizontal unit-height strip of minimal length. The bars…