No article text was recorded for this version.
deterministic dynamic matching
Version 1 of 124 papers41 conceptsfrozen 2026-10-04
Papers in this version
- Blog: Fully Dynamic Matching in Bipartite Graphs
- Blog: Entropy Regularization and Faster Decremental Matching in General Graphs
- Blog: Maintaining an EDCS in General Graphs: Simpler, Density-Sensitive and with Worst-Case Time Bounds
- Blog: New Deterministic Approximation Algorithms for Fully Dynamic Matching
- Blog: Fully Dynamic Matching and Ordered Ruzsa-Szemerédi Graphs
- Blog: Dynamic Matching with Better-than-2 Approximation in Polylogarithmic Update Time
- Blog: Deterministic Fully Dynamic Data Structures for Vertex Cover and Matching
- Blog: Dynamic Matching Algorithms Under Vertex Updates
- Blog: Beating the Folklore Algorithm for Dynamic Matching
- Blog: Dynamic Sketching for Graph Optimization Problems with Applications to Cut-Preserving Sketches
- Blog: Fully Dynamic Matching: Beating 2-Approximation in Δϵ Update Time
- Blog: Deterministic Dynamic Maximal Matching in Sublinear Update Time
- Blog: Sparse-pivot: Dynamic correlation clustering for node insertions
- Blog: Streaming Algorithms for Graph k-Matching with Optimal or Near-Optimal Update Time
- Blog: Near-Optimal Dynamic Rounding of Fractional Matchings in Bipartite Graphs
- Blog: Settling the Pass Complexity of Approximate Matchings in Dynamic Graph Streams
- Blog: Maintaining a large matching and a small vertex cover
- Blog: Fully Dynamic Approximate Maximum Matching and Minimum Vertex Cover in O(log3 n) Worst Case Update Time
- Blog: Dynamic $(1+ε)$-Approximate Matching Size in Truly Sublinear Update Time
- Blog: Dynamic Matching: Reducing Integral Algorithms to Approximately-Maximal Fractional Algorithms
- Blog: Dynamic Approximate All-Pairs Shortest Paths: Breaking the O(mn) Barrier and Derandomization
- Blog: Improved Bounds for Fully Dynamic Matching via Ordered Ruzsa-Szemerédi Graphs
- Blog: Deterministic Fully Dynamic Approximate Vertex Cover and Fractional Matching in O(1) Amortized Update Time
- Blog: On Regularity Lemma and Barriers in Streaming and Dynamic Matching
History & citation
Current · Permanent link
- This direction split from Fully Dynamic Approximation Algorithms for Combinatorial Optimization (71% overlap)
Cite this direction
Latest version (a living page):
@misc{lacuna_deterministic_dynamic_matching_baa61d6a,
title = {deterministic dynamic matching},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/deterministic-dynamic-matching/rdr_baa61d6ac3824dd59c0c4b4d74d02fda},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-21},
}This exact version (version 1, frozen text):
@misc{lacuna_deterministic_dynamic_matching_baa61d6a_v1,
title = {deterministic dynamic matching},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/deterministic-dynamic-matching/rdr_baa61d6ac3824dd59c0c4b4d74d02fda/v/1},
note = {Version 1, frozen 2026-10-04. Accessed 2026-11-21},
}