DOI,IST REx ID,Research Group,Title of publication
10.1007/s00493-025-00194-8,21159,"MaKw,MoHe",Counting perfect matchings in Dirac hypergraphs
10.4230/LIPIcs.SAND.2025.4,19858,MoHe,On b-matching and fully-dynamic maximum k-edge coloring
10.1137/1.9781611978322.22,19982,MoHe,Fully dynamic approximate minimum cut in subpolynomial time per operation
10.1145/3732772.3733505,20051,MoHe,An almost tight lower bound for plurality consensus with undecided state dynamics in the population protocol model
10.1145/3732772.3733512,20052,MoHe,Brief announcement: Minimizing energy solves relative majority with a cubic number of states in population protocols
null,20301,MoHe,Differentially private continual release of histograms and related queries
10.4230/LIPIcs.ESA.2025.2,20533,MoHe,Securing dynamic data: A primer on differentially private data structures
10.4230/LIPIcs.ESA.2025.36,20534,MoHe,Efficient contractions of dynamic graphs - with applications
10.4230/LIPIcs.ESA.2025.91,20535,MoHe,Near-optimal differentially private graph algorithms via the Multidimensional AboveThreshold Mechanism
10.4230/LIPIcs.WADS.2025.47,20536,MoHe,B-Treaps revised: Write efficient randomized block search trees with high load
10.1137/1.9781611978322.95,19038,MoHe,Improved differentially private continual observation using group algebra
10.1007/s10107-024-02066-3,15121,MoHe,Multiplicative auction algorithm for approximate maximum weight bipartite matching
10.4230/lipics.icalp.2025.91,21280,MoHe,Incremental approximate maximum flow via residual graph sparsification
null,20819,"ChLa,MoHe",Differentially private federated k-means clustering with server-side data
null,18115,MoHe,Data-efficient learning via clustering-based sensitivity sampling: Foundation models and beyond
null,18116,MoHe,Making old things new: A unified algorithm for differentially private clustering
10.4230/LIPIcs.APPROX/RANDOM.2024.40,18156,MoHe,Private counting of distinct elements in the turnstile model and extensions
10.4230/LIPIcs.ESA.2024.100,18308,MoHe,Fully dynamic k-means coreset in near-optimal update time
10.4230/LIPIcs.ESA.2024.72,18309,MoHe,Connectivity oracles for predictable vertex failures
10.1137/1.9781611977912.111,18503,MoHe,Deterministic near-linear time minimum cut in weighted graphs