search result

Cover von Partially-Dynamic Maximum Flow in Dense Graphs

Partially-Dynamic Maximum Flow in Dense Graphs

Year: 2026
Media group: LIPIcs
Cover von On the Complexity of the (Approximate) Nearest Colored Node Problem

On the Complexity of the (Approximate) Nearest Colored Node Problem

Year: 2018
Media group: LIPIcs
Cover von Near-Optimal Algorithm for Directed Expander Decompositions

Near-Optimal Algorithm for Directed Expander Decompositions

Year: 2025
Media group: LIPIcs
Cover von Parallel Reachability and Shortest Paths on Non-Sparse Digraphs

Parallel Reachability and Shortest Paths on Non-Sparse Digraphs

Near-Linear Work and Sub-Square-Root Depth
Year: 2026
Media group: LIPIcs
Cover von Practical Expander Decomposition

Practical Expander Decomposition

Year: 2024
Media group: LIPIcs
Cover von Optimal Electrical Oblivious Routing on Expanders

Optimal Electrical Oblivious Routing on Expanders

Year: 2024
Media group: LIPIcs
Cover von Hardness Results for Laplacians of Simplicial Complexes via Sparse-Linear Equation Complete Gadgets

Hardness Results for Laplacians of Simplicial Complexes via Sparse-Linear Equation Complete Gadgets

Year: 2022
Media group: LIPIcs
Cover von Decremental APSP in Unweighted Digraphs Versus an Adaptive Adversary

Decremental APSP in Unweighted Digraphs Versus an Adaptive Adversary

Year: 2021
Media group: LIPIcs
Cover von Fully-Dynamic Graph Sparsifiers Against an Adaptive Adversary

Fully-Dynamic Graph Sparsifiers Against an Adaptive Adversary

Author: Sidford, Aaron; Sun, He
Year: 2022
Media group: LIPIcs
OPEN V 11.1.0.0