Advanced Seminar in Theoretical Computer Science

Lectures cover topics from current research. The advanced seminar is open to all students and employees of the University of Trier. Interested parties are warmly invited! The Lectures will take place on thursday at 2:15 pm in Room H 406.

Summer Semester 2026

DatePresenterTitle
09.04.2025Salmoon IlyasAutomated Image Re-Identification Using Computer Vision and Deep Learning Approaches:
Application to Field Monitoring of the Endangered Species Bombina variegata in Rhineland-Palatinate, Germany
16.04.2025CancelledCancelled
23.04.2025Henning FernauMatrix Forbidding Grammars
30.04.2025CancelledCancelled
07.05.2025Kevin MannEnumerating minimal vertex covers and dominating sets with capacity and/or connectivity constraints
14.05.2025Ascension of ChristAscension of Christ
21.05.2025Philipp KindermannCan we extend this to biconnected graphs with SPQR-trees?
28.05.2025CancelledCancelled
04.06.2025Corpus ChristiCorpus Christi
11.06.2025Cancelled (Woche der Informatik)Cancelled
18.06.2025  
25.06.2025Silas Cato SacherOn Languages Describing Large Graph Classes
02.07.2025  
09.07.2025Silas Cato SacherTowards Settling the Complexity of the Lettericity Problem
16.07.2025Silas Cato SacherSome Descriptional Complexity Results for Context-Conditional Grammars

Winter Semester 2025/2026

DateTitlePresenter
16.10.2025CancelledCancelled
23.10.2025Separability of Witness Gabriel DrawingsCarolina Haase
30.10.2025On Graph Drawing with Few Slopes and BendsSimon Szulik
06.11.2025Orthogonal Wiring ProblemsKilian Bartz
13.11.2025Hash-Bäume von MerkleMarlin Zapp
20.11.2025Cancelled (room occupied)Cancelled 
27.11.2025Cancelled (room occupied)Cancelled
04.12.2025Visualisierung Erreichbarer Flächen in Netzwerk GraphenMarley Arns
11.12.2025Enumeration With Nice Roman Domination PropertiesKevin Mann
18.12.2025Boustrophedon Pushdown Automata for Two-dimensional Picture LanguagesHenning Fernau
25.12.2025Christmas HolidaysChristmas Holidays
01.01.2026Christmas HolidaysChristmas Holidays
08.01.2026Cancelled (room occupied)Cancelled 
15.01.2026On the Complexity of Hyperpath and Minimal Separator Enumeration in Directed HypergraphsKevin Mann
22.01.2026An Algorithm for Accurate and Simple-Looking Metaphorical MapsEleni Katsanou
29.01.2026CancelledCancelled
05.02.2026Letter graphs and well-quasi-order by induced subgraphs (room H 6)Tillmann Faust
12.02.2026CancelledCancelled
18.02.2026Discovering Functional Dependencies through Hitting Set Enumeration (room H 7 at 1 pm)Martin Schirneck
19.02.2026Enumerating Variations of Roman Dominating FunctionsKevin Mann