The following three papers by the group have recently been accepted to TCS conferences:

* “A General Reduction from Near-Additive Emulators to Near-Exact Hopsets” Julian Aeri, Sebastian Forster, Mara Grilnberger (alphabetic authorordering)  European Symposium on Algorithms (ESA) 2026 

* “Dynamic Matroids: Base Packing and Covering” Tijn de Vos, Mara Grilnberger (random author ordering)  European Symposium on Algorithms (ESA) 2026

* “Incremental Consistent k-Center Clustering” Mara Grilnberger, Antonis Skarlatos (alphabetic author ordering)  International Conference on Approximation Algorithms for Combinatorial Optimization Problems (APPROX) 2026

The first publication mentioned above, addressing an open problem onemulators and hopsets on graphs, is Julian’s first paper and emergedfrom his bachelor thesis. Meanwhile, Mara’s PhD thesis is progressing successfully: Including the paper “A Weighted-to-Unweighted Reductionfor Matroid Intersection” (joint work with Aditi Dudeja) presented at the 27th Conference on Integer Programming and Combinatorial Optimization (IPCO 2026) two weeks ago, Mara is publishing four papersthis summer.