Informatik-Abteilung V - teaching:ss26 https://tcs.informatik.uni-bonn.de/ 2026-04-15T00:25:23+00:00 Informatik-Abteilung V https://tcs.informatik.uni-bonn.de/ https://tcs.informatik.uni-bonn.de/lib/exe/fetch.php/wiki/dokuwiki.svg text/html 2026-03-20T09:36:18+00:00 Anonymous (anonymous@undisclosed.example.com) Lab: Efficient Algorithms for selected Problems https://tcs.informatik.uni-bonn.de/doku.php/teaching/ss26/lab-efficientalg?rev=1773999378&do=diff Lab: Efficient Algorithms for selected Problems MA-INF 1309 Times and Organization When Where LecturerTuesday 10:15 - 11:45Room 2.050 Joshua Könen, Sarah Sturm, Heiko Röglin The kick-off meeting will take place on Tuesday, April 14, at 10:15 in room 2.050. Students interested in the Lab are asked to be present at this meeting. text/html 2026-03-06T14:27:52+00:00 Anonymous (anonymous@undisclosed.example.com) MA-INF 1206 - Seminar Randomized and Approximation Algorithms https://tcs.informatik.uni-bonn.de/doku.php/teaching/ss26/sem-fg-kp?rev=1772807272&do=diff MA-INF 1206 - Seminar Randomized and Approximation Algorithms Lecture Hours What When Where Begin LecturerSeminar Tuesday, 12-14 ct. 2.050 14. April 2026 Heiko Röglin Tim Sinen Contents In this seminar, we cover modern randomized algorithms for knapsack and packing problems. Topics range from approximation schemes and randomized rounding to online and random-order models, as well as geometric and multidimensional variants. text/html 2026-03-07T10:27:07+00:00 Anonymous (anonymous@undisclosed.example.com) MA-INF 1206 - Seminar Randomized and Approximation Algorithms https://tcs.informatik.uni-bonn.de/doku.php/teaching/ss26/sem-rand-kp?rev=1772879227&do=diff MA-INF 1206 - Seminar Randomized and Approximation Algorithms Lecture Hours What When Where Begin LecturerSeminar Tuesday, 12-14 ct. Room 2.050 in the Computer Science Building 14. April 2026 Heiko Röglin, Tim Sinen Contents In this seminar, we cover modern randomized algorithms for knapsack and packing problems. Topics range from approximation schemes and randomized rounding to online and random-order models, as well as geometric and multidimensional variants. text/html 2026-03-24T15:02:18+00:00 Anonymous (anonymous@undisclosed.example.com) Algorithmische Grundlagen des Maschinellen Lernens https://tcs.informatik.uni-bonn.de/doku.php/teaching/ss26/vl-agml?rev=1774364538&do=diff Algorithmische Grundlagen des Maschinellen Lernens Weitere Informationen und Materialien finden Sie im eCampus-Kurs. Vorlesung Wann Wo Beginn DozentinDienstag, 14:15-15:45 HSZ, Hörsaal 4 14. April 2026 Driemel Donnerstag, 12:15-13:45 HSZ, Hörsaal 4 16. April 2026 Driemel Übungen Wann text/html 2026-04-13T11:23:37+00:00 Anonymous (anonymous@undisclosed.example.com) MA-INF 1301: Algorithmic Game Theory https://tcs.informatik.uni-bonn.de/doku.php/teaching/ss26/vl-agt?rev=1776079417&do=diff MA-INF 1301: Algorithmic Game Theory Lecture When Where Start LecturerMonday, 10:15-11:45 CP1-HSZ / Hörsaal 3 April 13 KesselheimWednesday, 12:15-13:45 CP1-HSZ / Hörsaal 3 April 15 Kesselheim Tutorials When Where Start LecturerThursday, 10:15-11:45 Seminar room 2.025 text/html 2026-04-07T10:46:24+00:00 Anonymous (anonymous@undisclosed.example.com) BA-INF 114 : Grundlagen der Algorithmischen Geometrie https://tcs.informatik.uni-bonn.de/doku.php/teaching/ss26/vl-alg-geo?rev=1775558784&do=diff BA-INF 114 : Grundlagen der Algorithmischen Geometrie Vorlesungszeiten (SS 2026) Was Wann Wo Beginn Umfang Dozent/Tutor Vorlesung Di 12:15-13:45 Do 10:15-11:45 HS 7, Hörsaalzentrum Campus Poppelsdorf 14. April 4 SWS Herman Haverkort, Elmar Langetepe Übung Mo 14:15-15:45 text/html 2026-04-09T11:24:27+00:00 Anonymous (anonymous@undisclosed.example.com) Algorithmen und Berechnungskomplexität II https://tcs.informatik.uni-bonn.de/doku.php/teaching/ss26/vl-algo-ii?rev=1775733867&do=diff Algorithmen und Berechnungskomplexität II Vorlesungen Wann Wo Beginn DozentMittwoch 12:15-13:45 CP1-HSZ / Hörsaal 2 15. April 2026 Heiko Röglin Freitag 10:15-11:45 CP1-HSZ / Hörsaal 2 17. April 2026 Heiko Röglin Inhalt In dieser Vorlesung werden wir uns mit der Berechenbarkeit und Komplexität von Problemen beschäftigen. Wir werden zunächst formalisieren, was wir unter einem Problem verstehen, und verschiedene Rechnermodelle kennenlernen. Wir haben im vergangenen Semester effiziente … text/html 2026-03-27T12:49:12+00:00 Anonymous (anonymous@undisclosed.example.com) MA-INF 1213: Randomized Algorithms & Probabilistic Analysis https://tcs.informatik.uni-bonn.de/doku.php/teaching/ss26/vl-rapa?rev=1774615752&do=diff MA-INF 1213: Randomized Algorithms & Probabilistic Analysis Lecture When Where Start Lecturer Wednesday, 10:15 - 11:45 Lecture Hall 6, Informatik-Zentrum April 15 Heiko Röglin Friday, 12:15 - 13:45 Lecture Hall 7, Informatik-Zentrum April 17 Heiko Röglin Tutorials When