In this project we apply the primal-dual technique to bound the price of anarchy of a scheduling game on related machines. ( Project codes , Paper )

Advisors: Dr. Andre Berger , Dr. Marc Schröder

In this project we develop exact and approximation algorithms for scheduling jobs with an imposed processing order on the minimum possible number of machines. ( Project codes , Paper )

Advisors: Dr. Andre Berger , Dr. Marc Schröder

In this project we provide a dependent randomized rounding algorithm for many-to-many assignments on a bipartite graph that satisfies cost-preservation properties.

Advisor: Dr. Lars Rohwedder

In this project we improve the approximation guarantee of the coordinate-wise median mechanism for the facility location problem.

Advisor: Dr. Andre Berger

In this project we provide an efficient algorithm for the bi-objective path planning problem that minimizes path length (Manhattan metric) while maximizing distance from obstacles (Euclidean metric), aiming to compute Pareto-optimal paths.

Advisor: Dr. Mansoor Davoodi Monfared

In this project we develop a word sense disambiguation system for the Persian language using expert systems. The result is used in AvaNama application that converts speech/text to Persian Sign Language.

Advisor: Dr. Mansoor Davoodi Monfared