10 citations · 54 across the 49 of their papers we have counts for
Showing 2026Show all
3 papers · 1 filter
cs.DS2026
Dynamic Edge Orientation via Random Walks: From Trees to Outerplanar Graphs and Beyond
Gabriel Marques Domingues, Minh Hang Nguyen, Shay Solomon
We study the \emph{fully dynamic edge orientation problem}, focusing on \emph{worst-case} time bounds. An undirected graph undergoes edge insertions and deletions, and the goal is…
cs.CG2026
Improved Euclidean Shallow Light Trees
Hung Le, Shay Solomon, Cuong Than +2
For parameters , a spanning tree of a weighted graph rooted at a designated vertex is called an -shallow-light tree (SLT) if (i) for every vertex ,…
cs.DS2026
Dynamic Dominating Set in Uniformly Sparse Graphs
Anton Bukov, Shay Solomon
In the dynamic {\em minimum dominating set (MDS)} problem, the goal is to efficiently maintain an approximate MDS in an -vertex graph with vertex costs in undergoing e…