1 citations · 1 across the 2 of their papers we have counts for
5 papers
Space-Efficient Hierholzer for Undirected Graphs
Elena Grigorescu, Ziad Ismaili Alaoui, Tamio-Vesa Nakajima +2
We present a simple linear-time algorithm that outputs an Eulerian tour of an undirected multigraph with vertices and edges, if one exists, in time and using …
A Linear-Time Approximation Scheme for the Densest Subgraph Problem
Elena Grigorescu, Mehrshad Taziki
In the undirected \emph{Densest Subgraph Problem (DSG)} the goal is to output a subset of vertices of a given graph that maximizes the quantity , where i…
Testing the Independent Set Property in Hypergraphs
Elena Grigorescu, Shreya Nasa, Cameron Seth
The optimal sample complexity of testing if an -vertex graph has an independent set of size , or is -far from having an independent set of size , was establ…
Routing-Controlled Spanners
Elena Grigorescu, Nithish Kumar Kumar, Young-San Lin
Designing sparse directed spanners, which are subgraphs that approximately maintain distance constraints, has attracted sustained interest in TCS, especially due to their wide appl…
Learning-Augmented Algorithms for Online Concave Packing and Convex Covering Problems
Elena Grigorescu, Young-San Lin, Maoyuan Song
Learning-augmented algorithms have been extensively studied across the computer science community in the recent years, driven by advances in machine learning predictors, which can…