Das Team – Algorithm Consulting

We offer professional consulting

Thanks to our master's degree in IT systems engineering at the renowned Hasso-Plattner-Institute we have access to the latest research insights. Additionally, we are familiar with the methods of Design Thinking. Therefore we rely on close collaboration and goal-oriented communication with our clients. We have supervised eight semesters of students as tutors, and in the process learned how to explain complex concepts in a comprehensible way.

We have been awarded scholarships, published several research results at top conferences, and won an international competition in algorithm design. Now we want our knowledge to benefit you.

Hans Gawendowicz

Because his studies in IT-Systems-Engineering had not yet pushed him to his limit,
he studied mathematics at the same time. In his free time, he is involved in organizing events for the Club of the alumni of the German SchülerAkademie.

Daniel Stephan

Has already collaborated with KPMG on an algorithmic project. Once he starts working, he doesn't stop anytime soon. He is equally enthusiastic about refining his cooking skills using the scientific method.

Michael Vaichenker

He takes on every algorithmic challenge with almost endless patience. Thanks to his semester abroad at the Technion he brings new perspectives to the table. After a hard day's work, nothing is more relaxing for him than a game of 5-Dimensional Chess.

Publications and awards

First place at the GECCO2019 – Bi-objective Traveling Thief Competition
The Travelling Thief problem combines two problems known for their difficulty into a modern logists challenge: a truck with limited cargo space must travel to several locations and load goods there. The goal is to minimize fuel consumption and travel time while maximizing the value of the transported goods.
Using heuristic methods, we were able to outcompete international competition.

Mixed integer programming versus evolutionary computation for optimizing a hard real-world staff assignment problem.
International Conference on Automated Planning and Scheduling (ICAPS) 2019: 541-554
Staff assignment is a challenge for any large company. When assigning work packages to employees, many different factors must be taken into account, such as the employees' skills, travel times to the work location, training time for new projects and many more.
For this problem we have developed a solution that beats an industry standard approach.

MetaExp: Interactive Explanation and Exploration of Large Knowledge Graphs.
The Web Conference (WWW) 2018: 199-202
In the age of Big Data, it is essential to extract useful information from data. This is also true in biology. More than 60 million data elements are available about a human cell.
We have developed an interactive system with which such a volume of data can be explored. This saves researchers in medicine valuable time.

Efficiency and Stability in Euclidean Network Design.
Symposium on Parallelism in Algorithms and Architectures (SPAA – being published) 2021
When forming a server network between several independent parties without a central authority, the result is rarely good. And because each party pursues its own interests, a network formed in this way is usually unstable.
The method we have developed proposes a network to the parties that avoids these two shortcomings.