DOI,IST REx ID,Research Group,Title of publication
10.1137/1.9781611978971.25,21720,"MoHe,GradSch",Deterministic and exact fully-dynamic minimum cut of superpolylogarithmic size in subpolynomial time
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
10.4230/LIPIcs.DISC.2024.21,18557,MoHe,Broadcast and Consensus in stochastic dynamic networks with Byzantine nodes and adversarial edges