_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