max planck institut
informatik

Homepage

Rajiv Raman Max-Planck-Institut für Informatik Department 1: Algorithms and Complexity Building 46.1, Room 315 Stuhlsatzenhausweg 85 66123 Saarbrücken Germany Email: Get my email address via email Phone: +49 681 9325 115 Fax: +49 681 9325 199

---

Research Interests

• Approximation Algorithms
• Graph Theory

---

Publications

• Working Papers
• Journals
• An experimental study of different approaches to solve the market equilibrium problem.
  with B.Codenotti, B. McCune, S. Pemmaraju and K.Varadarajan.
  ACM Journal of Experimental Algorithmcs 12, 2008.


• Approximating Interval Coloring and Max-Coloring in Chordal Graphs
  with S. Pemmaraju, and S. Penumatcha.
  ACM Journal of experimental algorithmics 10, 2005.


• Max-Coloring and Online Coloring with Bandwidths on Interval Graphs
  with S. Pemmaraju and K. Varadarajan.
  ACM Transactions on Algorithms, accepted for publication.
• Conferences
• On Profit Maximizing Pricing for the Highway and Tollbooth Problems.
  with K. Elbassioni, S. Ray and R. Sitters.
  2nd International Symposium on Algorithmic Game Theory (SAGT) 2009.


• An SDP Primal-Dual Algorithm for Approximating the Lovasz-Theta function.
  with H. Chan and K. Chang.
  IEEE International Symposium on Information Theory (ISIT) 2009.


• Sub-coloring and hypo-coloring interval graphs.
  with R. Gandhi, B. Greening and S. Pemmaraju.
  35th International Conference on Graph-Theoretic Concepts in Computer Science (WG) 2009.


• On the approximability of the maximum feasible subsystem problem with 0/1-coefficients.
  with K. Elbassioni, S. Ray and R. Sitters.
  ACM-SIAM Symposium on Discrete Algorithms (SODA) 2009. (complete version in preparation)


• Computing Equilibrium Prices : Does Theory meet Practice
  with B. Codenotti, B. McCune and K. Varadarajan.
  In 13th European Symposium on Algorithms (ESA) 2005.


• Approximation Algorithms for Max-Coloring
  with S. Pemmaraju
  32nd International Colloquium on Automata Languages and Programming (ICALP) 2005.


• An experimental study of different approaches to solve the market equilibrium problem
  with B. Codenotti, B. McCune, S. Pemmaraju and Kasturi Varadarajan.
  7th Workshop on Algorithm Engineering and Experiments (ALENEX) 2005.


• Approximating Interval Coloring and Max-Coloring on Chordal Graphs
  with S. Pemmaraju and S. Penumatcha.
  3rd Workshop on Experimental and Efficient Algorithms (WEA) 2004.


• Buffer minimization using max-coloring
  with S. Pemmaraju and K. Varadarajan.
  15th ACM-SIAM Symposium on Discrete Algorithms (SODA) 2004.


• Reports
• Chromatic Scheduling.
  PhD Thesis, University of Iowa. July 2007.


• Approximation Algorithms for Graph Multicolorings.
  Comprehensive Exam Report, University of Iowa. November 2004.


• A survey of recent results in min-sum scheduling
  Qualifier exam report, University of Iowa, November 2003.

---

Teaching

---

• Approximation Algorithms with Spyros Angelopolous and Nicole Megow.
• Optimization of Submudular Functions and Applications with Khaled Elbassioni and Julian Mestre.

---

Recent Positions

---

• June 2007 - October 2007:
  Postdoc at TU-Berlin in the Combinatorial Optimization and Graph Algorithms Group

---

Education

---

• May 2007: Ph. D. in Computer Science at the University of Iowa, USA.

---

• Firstname Lastname:
• Research Interests
• Publications
• Teaching
• Recent Positions
• Education
• Links
• Private