Jonathan Gal
1 indexed paper
Recent (6 mo)
1With code
0Influential cites
0Benchmarked
0Publications per year
126
Top categories
Algorithms×1
Frequent co-authors
Research Timeline
2026
Incremental Dominating Set
This paper presents deterministic and randomized algorithms for the incremental dominating set problem in vertex-weighted graphs, achieving competitive ratios of O(Δ) and O(log^2Δ) respectively. It also extends these results to the Connected Dominating Set problem using a linear-programming formulation.
Highlighted terms show continued research focus across papers