Research Interests
In principle, all of theoretical computer science. In practice, a
subset that includes primarily parts of computational geometry, but
also optimization problems on graphs and the like and
polynomial time computability of equilibria in games and some
economic models.
A selection of some papers that I have
placed online should give a better idea.
In Fall 2010, I am teaching Algorithms (22C:031).
Courses I have taught in the recent past:
| Spring 2005: | Limits of Computation (22C:131). | Fall 2005: | Computing Equilibria in Markets and Games (22C:196, Sec 003). | Spring 2006: | Design and Analysis of Algorithms (22C:231, Sec 001). | Fall 2006: | Design and Analysis of Algorithms (22C:231, Sec 001). | Spring 2007: | Computational Geometry (22C:196, Sec 005). | Fall 2007: | Algorithms (22C:031, Sec 001). | Fall 2008: | Algorithms (22C:031, Sec 001). | Fall 2008: | Design and Analysis of Algorithms (22C:231). | Spring 2009: | Computer Science II: Data Structures (22C:021) | Fall 2009: | Computer Science II: Data Structures (22C:021) | Spring 2010: | Computer Science II: Data Structures (22C:021) |
Wed 1.30--3.00, Thu 3.30--5.00
Kasturi R. Varadarajan ( kvaradar AT cs DOT uiowa DOT edu)