2 papers
cs.CC2023
Fine-grained reductions around CFL-reachability
Aleksandra Istomina, Semyon Grigorev, Ekaterina Shemetova
In this paper we study the fine-grained complexity of the CFL reachability problem. We first present one of the existing algorithms for the problem and an overview of conditional l…
cs.CG2021
Morphing tree drawings in a small 3D grid
Elena Arseneva, Rahul Gangopadhyay, Aleksandra Istomina
We study crossing-free grid morphs for planar tree drawings using 3D. A morph consists of morphing steps, where vertices move simultaneously along straight-line trajectories at con…