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.48550/arXiv.2211.09606,14236,,Incremental approximate maximum flow in m1/2+o(1) update time
10.1145/3501403,11662,,"Constant-time Dynamic (Δ +1)-Coloring"
10.4230/LIPIcs.SAND.2022.1,11808,,Recent advances in fully dynamic graph algorithms
10.4230/LIPIcs.SAND.2022.18,11812,,Fully dynamic four-vertex subgraph counting
10.1137/1.9781611977073.23,11918,,The complexity of average-case dynamic subgraph counting
10.1137/1.9781611977042.2,11930,,Practical fully dynamic minimum cut algorithms
10.1016/j.artint.2021.103499,9293,KrCh,Algorithms and conditional lower bounds for planning problems
10.1109/LICS52264.2021.9470739,10002,KrCh,Symbolic time and space tradeoffs for probabilistic verification
10.4230/LIPIcs.ICALP.2021.124,10054,KrCh,Faster algorithms for bounded liveness in graphs and game graphs
10.23919/ifipnetworking52078.2021.9472803,11649,,On the complexity of weight-dynamic network algorithms
10.1145/3469833,11663,,A deamortization approach for dynamic spanner and dynamic maximal matching