search result

Cover von FLOC 96; 2
special issue section : S. 233 - 371
Search for this author
Year: 2001
Publisher: San Diego, Academic Press
Count: 2
Media group: SPECIAL ISSUE
Cover von Incremental Approximate Maximum Flow via Residual Graph Sparsification

Incremental Approximate Maximum Flow via Residual Graph Sparsification

Year: 2025
Media group: LIPIcs
Cover von Fully Dynamic k-Means Coreset in Near-Optimal Update Time

Fully Dynamic k-Means Coreset in Near-Optimal Update Time

Year: 2024
Media group: LIPIcs
Cover von Electrical Flows for Polylogarithmic Competitive Oblivious Routing

Electrical Flows for Polylogarithmic Competitive Oblivious Routing

Year: 2024
Media group: LIPIcs
Cover von Faster Submodular Maximization for Several Classes of Matroids

Faster Submodular Maximization for Several Classes of Matroids

Year: 2023
Media group: LIPIcs
Cover von Finding All Global Minimum Cuts in Practice

Finding All Global Minimum Cuts in Practice

Year: 2020
Media group: LIPIcs
Cover von Dynamic Matching Algorithms in Practice

Dynamic Matching Algorithms in Practice

Year: 2020
Media group: LIPIcs
Cover von Algorithms and Hardness for Diameter in Dynamic Graphs

Algorithms and Hardness for Diameter in Dynamic Graphs

Year: 2019
Media group: LIPIcs
Cover von Conditional Hardness for Sensitivity Problems

Conditional Hardness for Sensitivity Problems

Year: 2017
Media group: LIPIcs
Cover von Near-Optimal Differentially Private Graph Algorithms via the Multidimensional AboveThreshold Mechanism

Near-Optimal Differentially Private Graph Algorithms via the Multidimensional AboveThreshold Mechanism

Year: 2025
Media group: LIPIcs
OPEN V 11.1.0.0