To content
Fakultät für Informatik

Seminar on Geometric and Parameterized Algorithms

Description

In this seminar we will deal with current research topics in the field of geometric and parameterized algorithms, especially with topics in the intersection of computational geometry and graph parameters. 

Prerequisites

Previous knowledge of at least one of the lectures "Algorithms and Data Structures" or "Geometric Algorithms" or comparable knowledge is expected.

Format 

  • block seminar
  • 10-12 pages seminar thesis
  • 25-30 min. seminar talk
  • optional personal interim meetings
  • peer-review phase before handing in the seminar thesis

Topics

Topics will base on a recently published paper that gives parameterized results on a problem in computational geometry. Possible topics include:

 

Parameterized algorithms for geometric graphs:

Modifying and recognizing geometric graphs:

Parameterized algorithms in graph drawing:

 

In case you found an interesting paper that fits in the scope of this seminar, it might be possible to add that as a seminar topic. 

Language

  • Seminar talks can be presented either in German or in English

Time plan:

  • 13.4. Presentation of topics
  • 20.4. Distribution of topics
  • 11.5.-13.5. Interim meetings (seminar thesis)
  • 8.6. Handing in seminar thesis for peer review
  • 22.6. Handing in peer reviews
  • 6.7. Handing in seminar thesis
  • 13.-16.7. Interim meetings (seminar talk)
  • 3.-5.8. Presentations