Go to content
- {{#headlines}}
- {{title}} {{/headlines}}
Profile
| Academic position | Full Professor |
|---|---|
| Research fields | Theoretical Computer Science,Numerical Analysis, Optimization, Simulation |
| Keywords | Algorithms, Combinatorial Optimization, Complexity, Graph Theory, NP-hardness |
Current contact address
| Country | India |
|---|---|
| City | South West Delhi |
| Institution | Indian Institute of Technology (IIT) Delhi |
| Institute | Department of Computer Science and Engineering |
| Homepage | http://www.cse.iitd.ac.in/~naveen |
Host during sponsorship
| Prof. Dr. Dr. h.c. mult. Kurt Mehlhorn | Max-Planck-Institut für Informatik, Saarbrücken |
|---|---|
| Start of initial sponsorship | 01/05/2002 |
Programme(s)
| 2001 | Friedrich Wilhelm Bessel Research Award Programme |
|---|
Nominator's project description
| Professor Garg is one of the leading young researchers in computer science. In particular, he is interested in approximation algorithms for network problems. An example of one of his breakthrough results is a novel algorithmic framework for computing flows in networks. This framework has been adopted and extended by several other researchers and the obtained algorithms outperform all previously nown algorithms by several orders of magnitude. During his stay at the Max Planck Institute Professor Garg is going to collaborate on network optimization problems. |