Brief Announcement: Broadcasting Time in Dynamic Rooted Trees is Linear. - Antoine El-Hayek; Monika Henzinger; Stefan Schmid 001 (PODC, 2022)

Asymptotically Tight Bounds on the Time Complexity of Broadcast and Its Variants in Dynamic Networks. - Antoine El-Hayek; Monika Henzinger; Stefan Schmid 001 (ITCS, 2023)

Time Complexity of Broadcast and Consensus for Randomized Oblivious Message Adversaries. - Antoine El-Hayek; Monika Henzinger; Stefan Schmid 001 (CoRR, 2023)

Broadcast and Consensus in Stochastic Dynamic Networks with Byzantine Nodes and Adversarial Edges. - Antoine El-Hayek; Monika Henzinger; Stefan Schmid 001 (DISC, 2024)

Brief Announcement: Minimizing Energy Solves Relative Majority with a Cubic Number of States in Population Protocols. - Tom-Lukas Breitkopf; Julien Dallot; Antoine El-Hayek; Stefan Schmid 001 (PODC, 2025)

An Almost Tight Lower Bound for Plurality Consensus with Undecided State Dynamics in the Population Protocol Model. - Antoine El-Hayek; Robert Elsässer; Stefan Schmid 001 (PODC, 2025)

On b-Matching and Fully-Dynamic Maximum k-Edge Coloring. - Antoine El-Hayek; Kathrin Hanauer; Monika Henzinger (SAND, 2025)

Fully Dynamic Approximate Minimum Cut in Subpolynomial Time per Operation. - Antoine El-Hayek; Monika Henzinger; Jason Li 006 (SODA, 2025)