Research Seminar
November 10, 2025, Sander Borst (Max Planck Institute for Informatics, Saarbrücken), Stronger adversaries grow cheaper forests: Online Node-Weighted Steiner Problems Speaker: Sander Borst (Max Planck Institute [...] approximation ratio better than 2 for this case. January 30, 2024 Sander Borst (CWI): Selection in Explorable Heaps Sander Borst (CWI) January 30, 2023 at 09:00 AM virtually over zoom Title : Selection [...] with François Sellier at École des Mines. November 07, 2023 Júlia Baligács (TU Darmstadt): Exploration of Graphs with Excluded Minors Júlia Baligács (TU Darmstadt) November 07, 2023 at 10:30 AM virtually
