Topics for diploma and study papers
Projects about current topics are assigned at any time, especially in the following areas:
- Efficient algorithms,
- Graph algorithms,
- Random graphs,
- Evolutionary algorithms,
- Algorithmic geometry,
- Theory of Complexity,
- Optimizing of discrete structures,
- Cryptography and applications of cryptographic algorithms (smart cards),
- Prediction methods.
Topics refer to both theory and application. Each topic is chosen and adjusted with the interested student according to his/her interests and knowledge.
Contact: Prof. Dr. Hanno Lefmann