Deterministic Dynamic Maximal Matching in Sublinear Update Time | Paper Citation Record

Observation 9f35b842-38a6-41f9-bf15-42a2b999a749 · outbound

This paper cites Towards a unified theory of sparsification for matching problems.

Deterministic Dynamic Maximal Matching in Sublinear Update Time Towards a unified theory of sparsification for matching problems

Reference 1

Resolution: unresolved; no resolver link, observed 2026-08-16T05:32:48.843593Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 705ad523-1299-4151-a1e9-f03ed0ddd505 · outbound

This paper cites Robust communication complexity of matching: Edcs achieves 5/6 approximation.

Deterministic Dynamic Maximal Matching in Sublinear Update Time Robust communication complexity of matching: Edcs achieves 5/6 approximation

Reference 2

Resolution: unresolved; no resolver link, observed 2026-08-16T05:32:48.850177Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 71a00c25-5253-4059-bd60-723eec86ef08 · outbound

This paper cites Coresets meet edcs: algorithms for matching and vertex cover on massive graphs.

Deterministic Dynamic Maximal Matching in Sublinear Update Time Coresets meet edcs: algorithms for matching and vertex cover on massive graphs

Reference 3

Resolution: unresolved; no resolver link, observed 2026-08-16T05:32:48.855507Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 1f419e68-011f-4433-8c2e-487e803b3df7 · outbound

This paper cites Mirrokni, and Cliff Stein.

Deterministic Dynamic Maximal Matching in Sublinear Update Time Mirrokni, and Cliff Stein

Reference 4

Resolution: unresolved; no resolver link, observed 2026-08-16T05:32:48.860946Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 9dbd7ba5-b64c-4116-9156-5171cf37938f · outbound

This paper cites Decremental matching in general graphs.

Deterministic Dynamic Maximal Matching in Sublinear Update Time Decremental matching in general graphs

Reference 5

Resolution: unresolved; no resolver link, observed 2026-08-16T05:32:48.867046Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 045ed53d-e312-4503-a769-69697c2a58b3 · outbound

This paper cites A fast and simple randomized parallel algorithm for the maximal independent set problem.

Deterministic Dynamic Maximal Matching in Sublinear Update Time A fast and simple randomized parallel algorithm for the maximal independent set problem

Reference 6

Resolution: unresolved; no resolver link, observed 2026-08-16T05:32:48.872695Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation ed89b215-0248-4133-b171-20303ce9e01f · outbound

This paper cites On regularity lemma and barriers in streaming and dynamic matching.

Deterministic Dynamic Maximal Matching in Sublinear Update Time On regularity lemma and barriers in streaming and dynamic matching

Reference 7

Resolution: unresolved; no resolver link, observed 2026-08-16T05:32:48.879587Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 7538b660-c2d2-4d42-99d3-100556af71c1 · outbound

This paper cites Fully dynamic matching: (2- 2 ) -approximation in polylog update time.

Deterministic Dynamic Maximal Matching in Sublinear Update Time Fully dynamic matching: (2- 2 ) -approximation in polylog update time

Reference 8

Resolution: unresolved; no resolver link, observed 2026-08-16T05:32:48.885973Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation cda52149-ac22-4b39-80cb-11f6c9430441 · outbound

This paper cites Dynamic matching: Reducing integral algorithms to approximately-maximal fractional algorithms.

Deterministic Dynamic Maximal Matching in Sublinear Update Time Dynamic matching: Reducing integral algorithms to approximately-maximal fractional algorithms

Reference 9

Resolution: unresolved; no resolver link, observed 2026-08-16T05:32:48.891141Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation e50252df-a5cb-4d60-99f3-fa05c3b7fd62 · outbound

This paper cites Extreme values of the stationary distribution of random walks on directed graphs.

Deterministic Dynamic Maximal Matching in Sublinear Update Time Extreme values of the stationary distribution of random walks on directed graphs

Reference 10

Resolution: unresolved; no resolver link, observed 2026-08-16T05:32:48.896678Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 304b331b-3d83-423f-acab-fd7b95efcaef · outbound

This paper cites Network decomposition and locality in distributed computation.

Deterministic Dynamic Maximal Matching in Sublinear Update Time Network decomposition and locality in distributed computation

Reference 11

Resolution: unresolved; no resolver link, observed 2026-08-16T05:32:48.901955Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f2171f62-a824-4d8c-a8f2-7db674ec7eaf · outbound

This paper cites The stochastic matching problem with (very) few queries.

Deterministic Dynamic Maximal Matching in Sublinear Update Time The stochastic matching problem with (very) few queries

Reference 12

Resolution: unresolved; no resolver link, observed 2026-08-16T05:32:48.907064Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation d7801466-40ff-4a23-931f-5130d2d84c4a · outbound

This paper cites Breaking the cubic barrier for all-pairs max-flow: Gomory-hu tree in nearly quadratic time.

Deterministic Dynamic Maximal Matching in Sublinear Update Time Breaking the cubic barrier for all-pairs max-flow: Gomory-hu tree in nearly quadratic time

Reference 13

Resolution: unresolved; no resolver link, observed 2026-08-16T05:32:48.912166Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation fea135b6-1f9b-48aa-8274-1fc23c6d5342 · outbound

This paper cites All-pairs max-flow is no harder than single-pair max-flow: Gomory-hu trees in almost-linear time.

Deterministic Dynamic Maximal Matching in Sublinear Update Time All-pairs max-flow is no harder than single-pair max-flow: Gomory-hu trees in almost-linear time

Reference 14

Resolution: unresolved; no resolver link, observed 2026-08-16T05:32:48.917086Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 209bbf31-381a-4979-a968-0b27882f0dcd · outbound

This paper cites Faster Vizing and Near-Vizing Edge Coloring Algorithms.

Deterministic Dynamic Maximal Matching in Sublinear Update Time Faster Vizing and Near-Vizing Edge Coloring Algorithms

Reference 15

Resolution: verified exact; local_arxiv, observed 2026-08-16T05:32:49.746126Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

Observation 6611cc94-1805-4d1c-b5a0-04d81e2265e0 · outbound

This paper cites Fully-Dynamic Graph Sparsifiers Against an Adaptive Adversary.

Deterministic Dynamic Maximal Matching in Sublinear Update Time Fully-Dynamic Graph Sparsifiers Against an Adaptive Adversary

Reference 16

Resolution: unresolved; no resolver link, observed 2026-08-16T05:32:48.927587Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 1224f2fa-2fea-42cc-bfb4-638d255f35c5 · outbound

This paper cites Lower bounds for maximal matchings and maximal independent sets.

Deterministic Dynamic Maximal Matching in Sublinear Update Time Lower bounds for maximal matchings and maximal independent sets

Reference 17

Resolution: unresolved; no resolver link, observed 2026-08-16T05:32:48.932884Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation b59354a7-661b-4c14-a230-a7f9e58f1cf0 · outbound

This paper cites Deterministic decremental single source shortest paths: beyond the o (mn) bound.

Deterministic Dynamic Maximal Matching in Sublinear Update Time Deterministic decremental single source shortest paths: beyond the o (mn) bound

Reference 18

Resolution: unresolved; no resolver link, observed 2026-08-16T05:32:48.939714Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 901a31b3-4e28-42c7-8968-11956b594e87 · outbound

This paper cites Deterministic partially dynamic single source shortest paths for sparse graphs.

Deterministic Dynamic Maximal Matching in Sublinear Update Time Deterministic partially dynamic single source shortest paths for sparse graphs

Reference 19

Resolution: unresolved; no resolver link, observed 2026-08-16T05:32:48.944804Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 49436309-d803-45d1-a133-787ddd482072 · outbound

This paper cites Matching Composition and Efficient Weight Reduction in Dynamic Matching.

Deterministic Dynamic Maximal Matching in Sublinear Update Time Matching Composition and Efficient Weight Reduction in Dynamic Matching

Reference 20

Resolution: verified exact; local_arxiv, observed 2026-08-16T05:32:49.703611Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

Observation 27b5e234-58bb-4cb8-beaf-cde7be0603ce · outbound

This paper cites Deterministic fully dynamic approximate vertex cover and fractional matching in O(1) amortized update time.

Deterministic Dynamic Maximal Matching in Sublinear Update Time Deterministic fully dynamic approximate vertex cover and fractional matching in O(1) amortized update time

Reference 21

Resolution: unresolved; no resolver link, observed 2026-08-16T05:32:48.954973Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 53cd6e3a-fbf8-40e3-86ec-5f77a06a4e1b · outbound

This paper cites Dynamic algorithms for graph coloring.

Deterministic Dynamic Maximal Matching in Sublinear Update Time Dynamic algorithms for graph coloring

Reference 22

Resolution: unresolved; no resolver link, observed 2026-08-16T05:32:48.959963Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation acd0faf0-4935-4d9a-bcc3-cc2992523f1b · outbound

This paper cites Almost-Linear Time Algorithms for Decremental Graphs: Min-Cost Flow and More via Duality.

Deterministic Dynamic Maximal Matching in Sublinear Update Time Almost-Linear Time Algorithms for Decremental Graphs: Min-Cost Flow and More via Duality

Reference 23

Resolution: verified exact; local_arxiv, observed 2026-08-16T05:32:49.679920Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

Observation 5344c2b5-bd37-4e24-b8f8-cea3b14d1be9 · outbound

This paper cites Fully dynamic maximal independent set with polylogarithmic update time.

Deterministic Dynamic Maximal Matching in Sublinear Update Time Fully dynamic maximal independent set with polylogarithmic update time

Reference 24

Resolution: unresolved; no resolver link, observed 2026-08-16T05:32:48.970257Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 25355a5a-33f7-4cd1-8e58-ca9ede10a6e5 · outbound

This paper cites A framework for dynamic matching in weighted graphs.

Deterministic Dynamic Maximal Matching in Sublinear Update Time A framework for dynamic matching in weighted graphs

Reference 25

Resolution: unresolved; no resolver link, observed 2026-08-16T05:32:48.974972Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 41b4185b-d683-40f2-b484-d80c98b6127d · outbound

This paper cites Dynamic algorithms for maximum matching size.

Deterministic Dynamic Maximal Matching in Sublinear Update Time Dynamic algorithms for maximum matching size

Reference 26

Resolution: unresolved; no resolver link, observed 2026-08-16T05:32:48.979954Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 94970b9c-f973-416e-8091-2504e70bdff0 · outbound

This paper cites Dynamic algorithms for maximum matching size.

Deterministic Dynamic Maximal Matching in Sublinear Update Time Dynamic algorithms for maximum matching size

Reference 27

Resolution: unresolved; no resolver link, observed 2026-08-16T05:32:48.985001Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation bb1f2d1c-78a1-4073-8e35-a37ea0893b45 · outbound

This paper cites The locality of distributed symmetry breaking.

Deterministic Dynamic Maximal Matching in Sublinear Update Time The locality of distributed symmetry breaking

Reference 28

Resolution: unresolved; no resolver link, observed 2026-08-16T05:32:48.990493Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation e1b10064-52f4-470c-aa23-34a4f2be22e3 · outbound

This paper cites The locality of distributed symmetry breaking.

Deterministic Dynamic Maximal Matching in Sublinear Update Time The locality of distributed symmetry breaking

Reference 29

Resolution: unresolved; no resolver link, observed 2026-08-16T05:32:48.995677Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 32462931-a5fe-43f0-868f-6f4a2926470a · outbound

This paper cites Deterministic Partially Dynamic Single Source Shortest Paths in Weighted Graphs.

Deterministic Dynamic Maximal Matching in Sublinear Update Time Deterministic Partially Dynamic Single Source Shortest Paths in Weighted Graphs

Reference 30

Resolution: unresolved; no resolver link, observed 2026-08-16T05:32:49.001169Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 2381dad3-5172-4a90-bd6b-484002e7c0bf · outbound

This paper cites Improved bounds for matching in random-order streams.

Deterministic Dynamic Maximal Matching in Sublinear Update Time Improved bounds for matching in random-order streams

Reference 31

Resolution: unresolved; no resolver link, observed 2026-08-16T05:32:49.006668Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f4559416-00be-452c-afce-cabd44f7dc02 · outbound

This paper cites A deamortization approach for dynamic spanner and dynamic maximal matching.

Deterministic Dynamic Maximal Matching in Sublinear Update Time A deamortization approach for dynamic spanner and dynamic maximal matching

Reference 32

Resolution: unresolved; no resolver link, observed 2026-08-16T05:32:49.011742Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation c3a0689f-aeb7-4f5f-9d9f-17ecbb8bf322 · outbound

This paper cites Fully dynamic maximal matching in O ( n) update time.

Deterministic Dynamic Maximal Matching in Sublinear Update Time Fully dynamic maximal matching in O ( n) update time

Reference 33

Resolution: unresolved; no resolver link, observed 2026-08-16T05:32:49.016956Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 20001a70-14ab-480f-b983-2342a9495270 · outbound

This paper cites Fully dynamic maximal matching in o( (n)) update time.

Deterministic Dynamic Maximal Matching in Sublinear Update Time Fully dynamic maximal matching in o( (n)) update time

Reference 34

Resolution: unresolved; no resolver link, observed 2026-08-16T05:32:49.022239Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation a35f707e-6fa7-4056-a5cd-5e1988a14ce7 · outbound

This paper cites Fully dynamic maximal matching in o( n) update time (corrected version).

Deterministic Dynamic Maximal Matching in Sublinear Update Time Fully dynamic maximal matching in o( n) update time (corrected version)

Reference 35

Resolution: unresolved; no resolver link, observed 2026-08-16T05:32:49.027387Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 7abe2802-5335-4b77-9d16-6465bf419b06 · outbound

This paper cites Deterministic decremental reachability, scc, and shortest paths via directed expanders and congestion balancing.

Deterministic Dynamic Maximal Matching in Sublinear Update Time Deterministic decremental reachability, scc, and shortest paths via directed expanders and congestion balancing

Reference 36

Resolution: unresolved; no resolver link, observed 2026-08-16T05:32:49.032715Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation b1b437e7-89f0-475b-9473-1c93ac685e6b · outbound

This paper cites Exponentially faster massively parallel maximal matching.

Deterministic Dynamic Maximal Matching in Sublinear Update Time Exponentially faster massively parallel maximal matching

Reference 37

Resolution: unresolved; no resolver link, observed 2026-08-16T05:32:49.038290Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 5d76af85-6e5d-4a1c-953c-6304b48e5587 · outbound

This paper cites Italiano.

Deterministic Dynamic Maximal Matching in Sublinear Update Time Italiano

Reference 38

Resolution: unresolved; no resolver link, observed 2026-08-16T05:32:49.043759Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 1cf0cb34-6f7b-4d74-a45e-d60a595a06ff · outbound

This paper cites New deterministic approximation algorithms for fully dynamic matching.

Deterministic Dynamic Maximal Matching in Sublinear Update Time New deterministic approximation algorithms for fully dynamic matching

Reference 39

Resolution: unresolved; no resolver link, observed 2026-08-16T05:32:49.049743Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation c3068640-4382-4dea-bedc-bf9b8f066079 · outbound

This paper cites Fully dynamic approximate maximum matching and minimum vertex cover in O(log$ ^ 3 $ n) worst case update time.

Deterministic Dynamic Maximal Matching in Sublinear Update Time Fully dynamic approximate maximum matching and minimum vertex cover in O(log$ ^ 3 $ n) worst case update time

Reference 40

Resolution: verified fuzzy; raw_fallback, observed 2026-08-16T05:32:50.853992Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

Observation 388a67c8-2ea7-4a51-b040-80a35a9f9713 · outbound

This paper cites Deterministically maintaining a (2 + ) -approximate minimum vertex cover in o(1/ ) amortized update time.

Deterministic Dynamic Maximal Matching in Sublinear Update Time Deterministically maintaining a (2 + ) -approximate minimum vertex cover in o(1/ ) amortized update time

Reference 41

Resolution: verified fuzzy; raw_fallback, observed 2026-08-16T05:32:50.838229Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

Observation 71017ec3-5dd7-47d6-b8e5-88fb26ee1e35 · outbound

This paper cites Deterministic rounding of dynamic fractional matchings.

Deterministic Dynamic Maximal Matching in Sublinear Update Time Deterministic rounding of dynamic fractional matchings

Reference 42

Resolution: verified fuzzy; raw_fallback, observed 2026-08-16T05:32:50.822198Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

Observation d43f2e58-f102-4620-95a3-57dd6e12f6cf · outbound

This paper cites Incremental $(1-\epsilon)$-approximate dynamic matching in $O(poly(1/\epsilon))$ update time.

Deterministic Dynamic Maximal Matching in Sublinear Update Time Incremental $(1-\epsilon)$-approximate dynamic matching in $O(poly(1/\epsilon))$ update time

Reference 43

Resolution: verified exact; local_arxiv, observed 2026-08-16T05:32:49.636366Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

Observation c44bcc12-d859-43ea-a628-07497db3ca22 · outbound

This paper cites Dynamic algorithms for packing-covering lps via multiplicative weight updates.

Deterministic Dynamic Maximal Matching in Sublinear Update Time Dynamic algorithms for packing-covering lps via multiplicative weight updates

Reference 44

Resolution: verified fuzzy; raw_fallback, observed 2026-08-16T05:32:50.805829Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

Observation 10c7c706-3705-49ba-b6bf-a44a89244fb7 · outbound

This paper cites Sublinear algorithms for (1.5+ ) -approximate matching.

Deterministic Dynamic Maximal Matching in Sublinear Update Time Sublinear algorithms for (1.5+ ) -approximate matching

Reference 45

Resolution: verified fuzzy; raw_fallback, observed 2026-08-16T05:32:50.789392Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

Observation 139605ea-a279-47ce-802f-e9ceb11df8dd · outbound

This paper cites Dynamic matching with better-than-2 approximation in polylogarithmic update time.

Deterministic Dynamic Maximal Matching in Sublinear Update Time Dynamic matching with better-than-2 approximation in polylogarithmic update time

Reference 46

Resolution: verified fuzzy; raw_fallback, observed 2026-08-16T05:32:50.772722Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

Observation 63085825-b4a1-42a8-b139-18f342d342b9 · outbound

This paper cites Near-optimal dynamic rounding of fractional matchings in bipartite graphs.

Deterministic Dynamic Maximal Matching in Sublinear Update Time Near-optimal dynamic rounding of fractional matchings in bipartite graphs

Reference 47

Resolution: verified fuzzy; raw_fallback, observed 2026-08-16T05:32:50.755683Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

Observation 3d4d1b6b-43c4-44ed-b37c-99ee6a066113 · outbound

This paper cites Fully dynamic matching: Beating 2-approximation in ^ update time.

Deterministic Dynamic Maximal Matching in Sublinear Update Time Fully dynamic matching: Beating 2-approximation in ^ update time

Reference 48

Resolution: verified fuzzy; raw_fallback, observed 2026-08-16T05:32:50.739107Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

Observation 3b3a5506-e925-49d6-9460-3d98afaafa80 · outbound

This paper cites Fully dynamic ( + 1) coloring against adaptive adversaries.

Deterministic Dynamic Maximal Matching in Sublinear Update Time Fully dynamic ( + 1) coloring against adaptive adversaries

Reference 49

Resolution: verified fuzzy; raw_fallback, observed 2026-08-16T05:32:50.722551Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

Observation 128528ef-8d4d-4051-b83b-459b2d1fe8c2 · outbound

This paper cites Fully dynamic matching in bipartite graphs.

Deterministic Dynamic Maximal Matching in Sublinear Update Time Fully dynamic matching in bipartite graphs

Reference 50

Resolution: verified fuzzy; raw_fallback, observed 2026-08-16T05:32:50.706264Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

Observation 780e3512-2081-4ae5-8341-d5e27883e963 · outbound

This paper cites Fully dynamic matching in bipartite graphs.

Deterministic Dynamic Maximal Matching in Sublinear Update Time Fully dynamic matching in bipartite graphs

Reference 51

Resolution: verified fuzzy; raw_fallback, observed 2026-08-16T05:32:50.688997Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

Observation 829e065c-fe29-448c-93fa-8dbb59b022d3 · outbound

This paper cites Faster fully dynamic matchings with small approximation ratios.

Deterministic Dynamic Maximal Matching in Sublinear Update Time Faster fully dynamic matchings with small approximation ratios

Reference 52

Resolution: verified fuzzy; raw_fallback, observed 2026-08-16T05:32:50.670744Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

Observation 6d0c9aa1-4cca-44d0-9776-ca9c3a653a88 · outbound

This paper cites Faster fully dynamic matchings with small approximation ratios.

Deterministic Dynamic Maximal Matching in Sublinear Update Time Faster fully dynamic matchings with small approximation ratios

Reference 53

Resolution: verified fuzzy; raw_fallback, observed 2026-08-16T05:32:50.653897Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

Observation 97876fbb-94d9-48be-b43f-780f7b16ea0a · outbound

This paper cites Simple Dynamic Spanners with Near-optimal Recourse against an Adaptive Adversary.

Deterministic Dynamic Maximal Matching in Sublinear Update Time Simple Dynamic Spanners with Near-optimal Recourse against an Adaptive Adversary

Reference 54

Resolution: verified exact; local_arxiv, observed 2026-08-16T05:32:49.612234Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

Observation 912f8ebd-41d4-4528-8f25-aa7827ae089c · outbound

This paper cites Fast dynamic cuts, distances and effective resistances via vertex sparsifiers.

Deterministic Dynamic Maximal Matching in Sublinear Update Time Fast dynamic cuts, distances and effective resistances via vertex sparsifiers

Reference 55

Resolution: verified fuzzy; raw_fallback, observed 2026-08-16T05:32:50.637168Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

Observation 98707a99-6777-441e-9cb9-9ca57c5d9c20 · outbound

This paper cites A deterministic algorithm for balanced cut with applications to dynamic connectivity, flows, and beyond.

Deterministic Dynamic Maximal Matching in Sublinear Update Time A deterministic algorithm for balanced cut with applications to dynamic connectivity, flows, and beyond

Reference 56

Resolution: verified fuzzy; raw_fallback, observed 2026-08-16T05:32:50.620631Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

Observation 026592e1-7c37-47d4-b921-2fcf9fc81f5e · outbound

This paper cites Adaptive Out-Orientations with Applications.

Deterministic Dynamic Maximal Matching in Sublinear Update Time Adaptive Out-Orientations with Applications

Reference 57

Resolution: verified exact; local_arxiv, observed 2026-08-16T05:32:49.588673Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

Observation 3d7be9e2-4f88-41ee-bc3e-145e843d70ba · outbound

This paper cites A new algorithm for decremental single-source shortest paths with applications to vertex-capacitated flow and cut problems.

Deterministic Dynamic Maximal Matching in Sublinear Update Time A new algorithm for decremental single-source shortest paths with applications to vertex-capacitated flow and cut problems

Reference 58

Resolution: verified fuzzy; raw_fallback, observed 2026-08-16T05:32:50.603436Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

Observation 90666e2b-d863-4d4f-accb-3ca42f64503a · outbound

This paper cites Maximum flow and minimum-cost flow in almost-linear time.

Deterministic Dynamic Maximal Matching in Sublinear Update Time Maximum flow and minimum-cost flow in almost-linear time

Reference 59

Resolution: unresolved; no resolver link, observed 2026-08-16T05:32:49.158765Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation eee7b026-1b0b-43d1-8ad8-edb533a3f809 · outbound

This paper cites Round compression for parallel matching algorithms.

Deterministic Dynamic Maximal Matching in Sublinear Update Time Round compression for parallel matching algorithms

Reference 60

Resolution: unresolved; no resolver link, observed 2026-08-16T05:32:49.163807Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation c11361ee-b98e-4af6-baa3-e3b2ffc66772 · outbound

This paper cites Fully dynamic almost-maximal matching: Breaking the polynomial worst-case time barrier.

Deterministic Dynamic Maximal Matching in Sublinear Update Time Fully dynamic almost-maximal matching: Breaking the polynomial worst-case time barrier

Reference 61

Resolution: verified fuzzy; raw_fallback, observed 2026-08-16T05:32:50.563948Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

Observation 3d762d35-f99a-4ccd-81f3-e75a48d9cce2 · outbound

This paper cites Deterministic algorithms for decremental shortest paths via layered core decomposition.

Deterministic Dynamic Maximal Matching in Sublinear Update Time Deterministic algorithms for decremental shortest paths via layered core decomposition

Reference 62

Resolution: verified fuzzy; raw_fallback, observed 2026-08-16T05:32:50.546618Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

Observation d8125507-8c62-4184-91a7-3f82ce16602a · outbound

This paper cites Entropy Regularization and Faster Decremental Matching in General Graphs.

Deterministic Dynamic Maximal Matching in Sublinear Update Time Entropy Regularization and Faster Decremental Matching in General Graphs

Reference 63

Resolution: verified exact; local_arxiv, observed 2026-08-16T05:32:49.565705Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

Observation 9eefbaf2-584d-4b6e-a480-5ee46653cc78 · outbound

This paper cites Fully dynamic maximal independent set in expected poly-log update time.

Deterministic Dynamic Maximal Matching in Sublinear Update Time Fully dynamic maximal independent set in expected poly-log update time

Reference 64

Resolution: verified fuzzy; raw_fallback, observed 2026-08-16T05:32:50.528951Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

Observation 5d768caa-3e0e-4e45-b63d-6cf882945cf3 · outbound

This paper cites A new deterministic algorithm for fully dynamic all-pairs shortest paths.

Deterministic Dynamic Maximal Matching in Sublinear Update Time A new deterministic algorithm for fully dynamic all-pairs shortest paths

Reference 65

Resolution: unresolved; no resolver link, observed 2026-08-16T05:32:49.188734Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation d448a54c-08fb-4865-8304-b55eb111b1ab · outbound

This paper cites On the hardness of partially dynamic graph problems and connections to diameter.

Deterministic Dynamic Maximal Matching in Sublinear Update Time On the hardness of partially dynamic graph problems and connections to diameter

Reference 66

Resolution: verified fuzzy; raw_fallback, observed 2026-08-16T05:32:50.499799Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

Observation 2cbb4967-fd59-4acd-99e2-746c9baf90c8 · outbound

This paper cites A Note on Rounding Matchings in General Graphs.

Deterministic Dynamic Maximal Matching in Sublinear Update Time A Note on Rounding Matchings in General Graphs

Reference 67

Resolution: verified exact; local_arxiv, observed 2026-08-16T05:32:49.541175Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

Observation 34d77521-f14c-422c-8e8c-95aee0bfa9e2 · outbound

This paper cites Deterministic Simple $(\Delta+\varepsilon\alpha)$-Edge-Coloring in Near-Linear Time.

Deterministic Dynamic Maximal Matching in Sublinear Update Time Deterministic Simple $(\Delta+\varepsilon\alpha)$-Edge-Coloring in Near-Linear Time

Reference 68

Resolution: unresolved; no resolver link, observed 2026-08-16T05:32:49.203893Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation eb4e3c10-4f16-4522-86b8-de6025ae8f90 · outbound

This paper cites Improved deterministic distributed matching via rounding.

Deterministic Dynamic Maximal Matching in Sublinear Update Time Improved deterministic distributed matching via rounding

Reference 69

Resolution: unresolved; no resolver link, observed 2026-08-16T05:32:49.209254Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 8aafa9c3-27c5-48bb-9371-ca9d28665bea · outbound

This paper cites Improved massively parallel computation algorithms for mis, matching, and vertex cover.

Deterministic Dynamic Maximal Matching in Sublinear Update Time Improved massively parallel computation algorithms for mis, matching, and vertex cover

Reference 70

Resolution: verified fuzzy; raw_fallback, observed 2026-08-16T05:32:50.469993Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

Observation 0b7f5db9-9b66-4377-9f02-89a6a68fb126 · outbound

This paper cites A time-optimal randomized parallel algorithm for mis.

Deterministic Dynamic Maximal Matching in Sublinear Update Time A time-optimal randomized parallel algorithm for mis

Reference 71

Resolution: verified fuzzy; raw_fallback, observed 2026-08-16T05:32:50.450401Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

Observation 60786ae0-760d-4ab1-95d0-68f51da7c79f · outbound

This paper cites (1+ ) -approximate incremental matching in constant deterministic amortized time.

Deterministic Dynamic Maximal Matching in Sublinear Update Time (1+ ) -approximate incremental matching in constant deterministic amortized time

Reference 72

Resolution: verified fuzzy; raw_fallback, observed 2026-08-16T05:32:50.431768Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

Observation 97ae3dd8-ed56-4682-8c04-5aa6d540a907 · outbound

This paper cites Gabow, Takao Nishizeki, Oded Kariv, Daniel Leven, and Osamu Terada.

Deterministic Dynamic Maximal Matching in Sublinear Update Time Gabow, Takao Nishizeki, Oded Kariv, Daniel Leven, and Osamu Terada

Reference 73

Resolution: verified fuzzy; raw_fallback, observed 2026-08-16T05:32:50.414436Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

Observation 12b5108c-d3b9-4c0d-a2e2-942101668cd3 · outbound

This paper cites Fully dynamic (1+ ) -approximate matchings.

Deterministic Dynamic Maximal Matching in Sublinear Update Time Fully dynamic (1+ ) -approximate matchings

Reference 74

Resolution: verified fuzzy; raw_fallback, observed 2026-08-16T05:32:50.397479Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

Observation 3f85ed55-8dcd-49e6-ab9f-003c9d1e8779 · outbound

This paper cites Maintaining approximate maximum matching in an incremental bipartite graph in polylogarithmic update time.

Deterministic Dynamic Maximal Matching in Sublinear Update Time Maintaining approximate maximum matching in an incremental bipartite graph in polylogarithmic update time

Reference 75

Resolution: verified fuzzy; raw_fallback, observed 2026-08-16T05:32:50.380637Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

Observation 44b9bab0-0de3-4405-a089-4eb91d73acd8 · outbound

This paper cites The expander hierarchy and its applications to dynamic graph algorithms.

Deterministic Dynamic Maximal Matching in Sublinear Update Time The expander hierarchy and its applications to dynamic graph algorithms

Reference 76

Resolution: unresolved; no resolver link, observed 2026-08-16T05:32:49.244268Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 9b229a6e-095c-4622-8f58-f7cf3bc936bf · outbound

This paper cites Maintaining an edcs in general graphs: Simpler, density-sensitive and with worst-case time bounds.

Deterministic Dynamic Maximal Matching in Sublinear Update Time Maintaining an edcs in general graphs: Simpler, density-sensitive and with worst-case time bounds

Reference 77

Resolution: verified fuzzy; raw_fallback, observed 2026-08-16T05:32:50.352426Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

Observation 3f218dac-1b86-4d19-a9b3-2671ed933774 · outbound

This paper cites Maintaining an edcs in general graphs: Simpler, density-sensitive and with worst-case time bounds.

Deterministic Dynamic Maximal Matching in Sublinear Update Time Maintaining an edcs in general graphs: Simpler, density-sensitive and with worst-case time bounds

Reference 78

Resolution: verified fuzzy; raw_fallback, observed 2026-08-16T05:32:50.333931Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

Observation bc75aa82-4cc5-4ee3-b768-6e1b16d5f433 · outbound

This paper cites Parallel dynamic maximal matching.

Deterministic Dynamic Maximal Matching in Sublinear Update Time Parallel dynamic maximal matching

Reference 79

Resolution: unresolved; no resolver link, observed 2026-08-16T05:32:49.258540Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 07d820a0-4410-48b5-8d44-9998b4572571 · outbound

This paper cites Sparsifying distributed algorithms with ramifications in massively parallel computation and centralized local computation.

Deterministic Dynamic Maximal Matching in Sublinear Update Time Sparsifying distributed algorithms with ramifications in massively parallel computation and centralized local computation

Reference 80

Resolution: verified fuzzy; raw_fallback, observed 2026-08-16T05:32:50.302223Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

Observation 06b4a00d-091b-4a5d-ac9b-c7c3338f5bd8 · outbound

This paper cites Decremental sssp in weighted digraphs: Faster and against an adaptive adversary.

Deterministic Dynamic Maximal Matching in Sublinear Update Time Decremental sssp in weighted digraphs: Faster and against an adaptive adversary

Reference 81

Resolution: verified fuzzy; raw_fallback, observed 2026-08-16T05:32:50.284583Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

Observation 5fe874f9-0392-4101-9e4e-432f2ab5216f · outbound

This paper cites Deterministic algorithms for decremental approximate shortest paths: Faster and simpler.

Deterministic Dynamic Maximal Matching in Sublinear Update Time Deterministic algorithms for decremental approximate shortest paths: Faster and simpler

Reference 82

Resolution: verified fuzzy; raw_fallback, observed 2026-08-16T05:32:50.267832Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

Observation 703e0f7d-ede4-4247-b921-2e975a1ac5a7 · outbound

This paper cites Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity.

Deterministic Dynamic Maximal Matching in Sublinear Update Time Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity

Reference 83

Resolution: verified fuzzy; raw_fallback, observed 2026-08-16T05:32:50.250966Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

Observation 8e838833-5e10-4f02-a716-a44cd2f4c0d0 · outbound

This paper cites Dynamic approximate all-pairs shortest paths: Breaking the o(mn) barrier and derandomization.

Deterministic Dynamic Maximal Matching in Sublinear Update Time Dynamic approximate all-pairs shortest paths: Breaking the o(mn) barrier and derandomization

Reference 84

Resolution: verified fuzzy; raw_fallback, observed 2026-08-16T05:32:50.233650Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

Observation 1fc19cf9-b65c-4fac-9728-d81055239ec0 · outbound

This paper cites Unifying and strengthening hardness for dynamic problems via the online matrix-vector multiplication conjecture.

Deterministic Dynamic Maximal Matching in Sublinear Update Time Unifying and strengthening hardness for dynamic problems via the online matrix-vector multiplication conjecture

Reference 85

Resolution: unresolved; no resolver link, observed 2026-08-16T05:32:49.288968Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation b62f78ca-8b96-4dc1-895b-e8ce1cc8a3a3 · outbound

This paper cites A faster distributed algorithm for computing maximal matchings deterministically.

Deterministic Dynamic Maximal Matching in Sublinear Update Time A faster distributed algorithm for computing maximal matchings deterministically

Reference 86

Resolution: verified fuzzy; raw_fallback, observed 2026-08-16T05:32:50.205136Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

Observation 1b75261f-2506-407e-898b-435518ee6a9e · outbound

This paper cites On the distributed complexity of computing maximal matchings.

Deterministic Dynamic Maximal Matching in Sublinear Update Time On the distributed complexity of computing maximal matchings

Reference 87

Resolution: verified fuzzy; raw_fallback, observed 2026-08-16T05:32:50.187603Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

Observation dc0e108f-95d1-482d-860f-6ebfd3b13ec7 · outbound

This paper cites Dynamic Deterministic Constant-Approximate Distance Oracles with $n^{\epsilon}$ Worst-Case Update Time.

Deterministic Dynamic Maximal Matching in Sublinear Update Time Dynamic Deterministic Constant-Approximate Distance Oracles with $n^{\epsilon}$ Worst-Case Update Time

Reference 88

Resolution: verified exact; local_arxiv, observed 2026-08-16T05:32:49.497618Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

Observation cf98d022-495a-4ca9-a87a-04d51eef851e · outbound

This paper cites Constant-time dynamic (  +1)-coloring.

Deterministic Dynamic Maximal Matching in Sublinear Update Time Constant-time dynamic (  +1)-coloring

Reference 89

Resolution: verified fuzzy; raw_fallback, observed 2026-08-16T05:32:50.170380Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

Observation 8bb61354-546b-404b-89d5-af741d1e8356 · outbound

This paper cites A fast and simple randomized parallel algorithm for maximal matching.

Deterministic Dynamic Maximal Matching in Sublinear Update Time A fast and simple randomized parallel algorithm for maximal matching

Reference 90

Resolution: verified fuzzy; raw_fallback, observed 2026-08-16T05:32:50.152892Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

Observation 6e4e3b78-a64d-4bf3-894e-4807668838df · outbound

This paper cites Fully dynamic maintenance of vertex cover.

Deterministic Dynamic Maximal Matching in Sublinear Update Time Fully dynamic maintenance of vertex cover

Reference 91

Resolution: verified fuzzy; raw_fallback, observed 2026-08-16T05:32:50.135684Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

Observation 13c7b869-ba64-448d-a557-748e6e5a0af3 · outbound

This paper cites An improved parallel algorithm for maximal matching.

Deterministic Dynamic Maximal Matching in Sublinear Update Time An improved parallel algorithm for maximal matching

Reference 92

Resolution: verified fuzzy; raw_fallback, observed 2026-08-16T05:32:50.117724Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

Observation 9eca33ba-a3f2-4484-b6b4-f0103d07fe45 · outbound

This paper cites Regularized box-simplex games and dynamic decremental bipartite matching.

Deterministic Dynamic Maximal Matching in Sublinear Update Time Regularized box-simplex games and dynamic decremental bipartite matching

Reference 93

Resolution: verified fuzzy; raw_fallback, observed 2026-08-16T05:32:50.098521Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

Observation 0878d581-2c92-430b-8173-dd919e4e40d7 · outbound

This paper cites an unresolved cited work.

Deterministic Dynamic Maximal Matching in Sublinear Update Time Unresolved cited work

Reference 94

Resolution: unresolved; raw_fallback, observed 2026-08-16T05:32:50.080727Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

Observation 67e71b9d-ba24-4c23-9376-3dacafbe5e56 · outbound

This paper cites Deterministic dynamic matching in worst-case update time.

Deterministic Dynamic Maximal Matching in Sublinear Update Time Deterministic dynamic matching in worst-case update time

Reference 95

Resolution: verified fuzzy; raw_fallback, observed 2026-08-16T05:32:50.062680Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

Observation e6848ae8-7648-44af-a09e-dda1603576d0 · outbound

This paper cites A dynamic shortest paths toolbox: Low-congestion vertex sparsifiers and their applications.

Deterministic Dynamic Maximal Matching in Sublinear Update Time A dynamic shortest paths toolbox: Low-congestion vertex sparsifiers and their applications

Reference 96

Resolution: verified fuzzy; raw_fallback, observed 2026-08-16T05:32:50.043874Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

Observation 8bf7dc91-8da9-4619-ba85-3bf7b8ae7624 · outbound

This paper cites A fast parallel algorithm for the maximal independent set problem.

Deterministic Dynamic Maximal Matching in Sublinear Update Time A fast parallel algorithm for the maximal independent set problem

Reference 97

Resolution: verified fuzzy; raw_fallback, observed 2026-08-16T05:32:50.026312Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

Observation e60cc699-f55c-4256-b0c1-ea26d522c3a3 · outbound

This paper cites On Approximate Fully-Dynamic Matching and Online Matrix-Vector Multiplication.

Deterministic Dynamic Maximal Matching in Sublinear Update Time On Approximate Fully-Dynamic Matching and Online Matrix-Vector Multiplication

Reference 98

Resolution: unresolved; no resolver link, observed 2026-08-16T05:32:49.351948Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation a6e5c52c-13b3-4a3e-b388-5d61c10ee0fd · outbound

This paper cites Filtering: a method for solving graph problems in mapreduce.

Deterministic Dynamic Maximal Matching in Sublinear Update Time Filtering: a method for solving graph problems in mapreduce

Reference 99

Resolution: unresolved; no resolver link, observed 2026-08-16T05:32:49.356901Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation ee8565ce-1a0d-42fa-b863-6db7aba27850 · outbound

This paper cites A simple parallel algorithm for the maximal independent set problem.

Deterministic Dynamic Maximal Matching in Sublinear Update Time A simple parallel algorithm for the maximal independent set problem

Reference 100

Resolution: verified fuzzy; raw_fallback, observed 2026-08-16T05:32:49.998406Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

Coverage vector

Reference resolution

Outbound references

Pith citing papers