Showing 2025Show all
3 papers · 1 filter
cs.DS2025
Fully Dynamic Algorithms for Transitive Reduction
Gramoz Goranci, Adam Karczmarz, Ali Momeni +1
Given a directed graph , a transitive reduction of (first studied by Aho, Garey, Ullman [SICOMP `72]) is a minimal subgraph of that preserves the reachability rela…
cs.DS2025
Fully Dynamic Spectral Sparsification of Hypergraphs
Gramoz Goranci, Ali Momeni
Spectral hypergraph sparsification, a natural generalization of the well-studied spectral sparsification notion on graphs, has been the subject of intensive research in recent year…
cs.LG2025
Locality-aware Surrogates for Gradient-based Black-box Optimization
Ali Momeni, Stefan Uhlich, Arun Venkitaraman +5
In physics and engineering, many processes are modeled using non-differentiable black-box simulators, making the optimization of such functions particularly challenging. To address…