scientific article; zbMATH DE number 7788470

DOI10.5555/3458064.3458196MaRDI QIDQ6147388zbMATH OpenFDO

Authors Gramoz Goranci, Harald Räcke, Thatchaphol Saranurak, Zihan Tan

Publication date 15 January 2024

Full work available at URL https://arxiv.org/abs/2005.02369

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cited in

(13)

• Parameterized algorithms for the Steiner arborescence problem on a hypercube
• Fully dynamic strongly connected components in planar digraphs
• Optimal electrical oblivious routing on expanders
• On the streaming complexity of expander decomposition
• Fine-grained complexity lower bounds for families of dynamic graphs
• Simple dynamic spanners with near-optimal recourse against an adaptive adversary
• Deterministic rounding of dynamic fractional matchings
• Worst-case to expander-case reductions: derandomized and generalized
• Length-constrained directed expander decomposition and length-constrained vertex-capacitated flow shortcuts
• Cut-preserving vertex sparsifiers for planar and quasi-bipartite graphs
• O( n)-approximation algorithms for bipartiteness ratio
• Incremental approximate maximum flow via residual graph sparsification
• Incremental approximate maximum flow via residual graph sparsification

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6147388)