_id,doi,title
14769,10.1137/1.9781611977929.17,Experimental evaluation of fully dynamic k-means via coresets
15008,10.4230/LIPIcs.ITCS.2024.55,Electrical flows for polylogarithmic competitive oblivious routing
14462,,Constant matters: Fine-grained error bound on differentially private continual observation
14558,10.1137/21M1428649,Deterministic near-optimal approximation algorithms for dynamic set cover
13236,10.1007/978-3-031-32726-1_32,"Multiplicative auction algorithm for approximate maximum weight bipartite matching"
14043,10.1007/s00453-023-01154-8,A combinatorial cut-toggling algorithm for solving Laplacian linear systems
14085,10.4230/LIPIcs.ICALP.2023.69,Efficient data structures for incremental exact and approximate maximum flow
14086,10.4230/LIPIcs.ICALP.2023.74,Faster submodular maximization for several classes of matroids
12760,10.4230/LIPIcs.STACS.2023.36,Dynamic maintenance of monotone dynamic programs and applications
11662,10.1145/3501403,"Constant-time Dynamic (Δ +1)-Coloring"
14236,10.48550/arXiv.2211.09606,Incremental approximate maximum flow in m1/2+o(1) update time
11808,10.4230/LIPIcs.SAND.2022.1,Recent advances in fully dynamic graph algorithms
11812,10.4230/LIPIcs.SAND.2022.18,Fully dynamic four-vertex subgraph counting
11918,10.1137/1.9781611977073.23,The complexity of average-case dynamic subgraph counting
11930,10.1137/1.9781611977042.2,Practical fully dynamic minimum cut algorithms
11649,10.23919/ifipnetworking52078.2021.9472803,On the complexity of weight-dynamic network algorithms
11663,10.1145/3469833,A deamortization approach for dynamic spanner and dynamic maximal matching
11756,10.1016/j.ic.2021.104805,Constant-time dynamic weight approximation for minimum spanning forest
11771,10.1007/978-3-030-83508-8_34,Upper and lower bounds for fully retroactive graph problems
9293,10.1016/j.artint.2021.103499,Algorithms and conditional lower bounds for planning problems