DOI,IST REx ID,Research Group,Title of publication
10.4230/LIPIcs.SoCG.2026.29,22004,MoHe,Charting the diameter computation landscape of intersection graphs in 3D and above
10.1007/s00493-025-00194-8,21159,"MaKw,MoHe",Counting perfect matchings in Dirac hypergraphs
10.1137/1.9781611978971.45,21719,MoHe,Dynamic hierarchical j-tree decomposition and its applications
10.1145/3798129.3800917,22246,MoHe,Cutting planarians: Planar emulators for string graphs
10.1145/3801895,22318,MoHe,Concurrent composition for differentially private continual mechanisms
10.1145/3801903,22322,"MoHe,GradSch",Improved lower bounds for privacy under continual release
10.1145/3796701.3815922,22368,MoHe,Order statistics in population protocols via simple dynamics
10.1145/3796701.3815920,22367,MoHe,Undecided state dynamics with many opinions
10.1145/3796701.3815913,22327,"MoHe,GradSch",Ranking opinions with few states in population protocols
10.15479/AT-ISTA-22281,22281,"GradSch,MoHe",Handling updates and failures: Dynamic graph algorithms and distributed computing on dynamic networks
10.1137/1.9781611978971.25,21720,"MoHe,GradSch",Deterministic and exact fully-dynamic minimum cut of superpolylogarithmic size in subpolynomial time
10.4230/LIPICS.ICALP.2026.54,22405,MoHe,Charting the landscape of diameter computation on geometric intersection graphs in the plane
10.1145/3816252,22716,MoHe,Incremental approximate maximum flow via residual graph sparsification
10.1016/j.ipl.2026.106663,22812,MoHe,Tight bounds on the performance of dynamic directed cutset data structures based on OMv
10.4230/LIPIcs.FORC.2026.2,22146,"ChLa,GradSch,MoHe",Learning rate scheduling with matrix factorization for private training
10.4230/LIPIcs.ESA.2026.106,22916,MoHe,Instance optimal and universally optimal bounds for imprecise pareto fronts
10.4230/LIPIcs.ESA.2026.101,22915,MoHe,Tight Better-Than-Worst-Case bounds for element distinctness and set intersection
10.4230/LIPIcs.ESA.2026.61,22914,MoHe,Real-weighted diameter and eccentricities of minor-free and bounded VC-dimension graphs in truly subquadratic time
10.4230/LIPIcs.ESA.2026.94,22918,MoHe,DAG covers for structured graphs: The Steiner point effect
10.4230/LIPIcs.ESA.2026.45,22917,MoHe,Near-optimal working-set heaps and dijkstra on pointer machines