Our group offers support for algorithm related problems, especially those arising from practical research projects.

If you are affiliated with any institute on the Saarland University Campus and are facing a research-level algorithm challenge, we invite you to fill out this Google Form.

Based on the description of your problem, we will select several researchers from our group with relevant expertise and contact you to arrange a meeting to discuss your problem in detail and explore possible solutions.

Our research interests include (but are not limited to):

• Computational geometry
• Data structures & hashing
• Graph & networks algorithms
• Learning theory
• Online algorithms & scheduling
• Optimization
• Parallel, distributed, streaming, sublinear algorithms
• Strings algorithms

For more information, please check out the research areas of our department.

If your problem falls into one of these areas, we can best match you with our experts. However, we also welcome any theoretical problems that broadly align with the theme of algorithms and complexity.

It is helpful if your problem can be formalized as a theoretical challenge, though this is not required. We are happy to assist in formulating it during the discussion.

This service is completely free for anyone affiliated with institutes on the Saarland University Campus. We also do not seek authorship in research papers unless there are follow-up discussions that evolve into explicit collaborations. Our goal is to strengthen the connection between theory and application of algorithms, and to help the campus community develop more efficient and theoretically sound solutions to practical problems.

This page is inspired by MIT's algorithm office hour.