DOI,IST REx ID,Research Group,Title of publication
10.4230/LIPIcs.ITCS.2024.55,15008,MoHe,Electrical flows for polylogarithmic competitive oblivious routing
10.1137/1.9781611977929.17,14769,MoHe,Experimental evaluation of fully dynamic k-means via coresets
10.4230/LIPIcs.STACS.2023.36,12760,MoHe,Dynamic maintenance of monotone dynamic programs and applications
10.1007/978-3-031-32726-1_32,13236,MoHe,"Multiplicative auction algorithm for approximate maximum weight bipartite matching"
10.1007/s00453-023-01154-8,14043,MoHe,A combinatorial cut-toggling algorithm for solving Laplacian linear systems
10.4230/LIPIcs.ICALP.2023.69,14085,MoHe,Efficient data structures for incremental exact and approximate maximum flow
10.4230/LIPIcs.ICALP.2023.74,14086,MoHe,Faster submodular maximization for several classes of matroids
null,14462,MoHe,Constant matters: Fine-grained error bound on differentially private continual observation
10.1137/21M1428649,14558,MoHe,Deterministic near-optimal approximation algorithms for dynamic set cover
10.1109/focs57990.2023.00066,14768,MoHe,Deterministic clustering in high dimensional spaces: Sketches and approximation