Geometric seminar (NDMI106)
|
- Presentation of papers and new results from discrete and computational geometry, possibly solving problems from this area.
- Credit:
- Every student has to present a paper to get credit for the course.
- It is possible to show the presentation to one of the instructors beforehand.
- The seminar in the previous semester: [link]
|
- First seminar (3.10.2023): Organizational meeting, short introductions of the participants.
- Second seminar (10.10.2023): We continued with short introductions of the participants.
- Third seminar (17.10.2023): A talk by Todor Antic: Convex-geometric k-planar graphs are convex-geometric (k+1)-quasiplanar.
- Fourth seminar (24.10.2023): A talk by Martin Balko: The Erdős-Szekeres theorem for split polygons.
- Fifth seminar (31.10.2023): A talk by Vít Jelínek: The Hierarchy of Hereditary Sorting Operators.
- Sixth seminar (7.11.2023): A talk by Felix Schröder: A new Formula for proving density bounds of beyond-planar graphs.
- Seventh seminar (14.11.2023): A talk by Maria Saumell: Computing largest minimum color-spanning intervals of imprecise points.
- Eighth seminar (21.11.2023): A talk by Jan Soukup: Extending monotone graphs.
- Ninth seminar (28.11.2023): The seminar was cancelled (Mathematical Colloquium).
- Tenth seminar (5.12.2023): The seminar was cancelled (Homonolo).
- Eleventh seminar (12.12.2023): A talk by Michal Opler: Optimization with pattern-avoiding input.
- Twelfth seminar (19.12.2023): A talk by Petr Chmel: String graphs with precise number of intersections.
- Thirteenth seminar (9.1.2024): Geometry Day 10:40 - ca. 16:00.
|
|