|
|
Download PDF
Chinmay D. Karande
Graduate Student,
College of Computing,
Georgia Institute of Technology
|
Room #2124, Klaus Advanced Computing Building,
266, Ferst Drive,
Atlanta, GA 30332
1-404-385-2026
ckarande [at] cc.gatech.edu
http://www.cc.gatech.edu/~ckarande
|
| RESEARCH INTERESTS
|
- Approximation Algorithms, Mechanism Design, Markets and Game Theory
|
|
| EDUCATION
|
- Ph.D. in Algorithms, Combinatorics and Optimization, Georgia Institute of Technology, Atlanta
Currently enrolled.
- B.Tech. in Computer Science and Engineering, Indian Institute of Technology, Bombay
Final GPA: 9.56/10.00
|
|
|
|
PUBLICATIONS
|
- Market Equilibrium with Transaction Costs - with Nikhil Devanur and Sourav Chakraborty. Under submission. Oct 2009.
- Approximability of Combinatorial Problems with Multi-agent Submodular Cost Functions - with
Gagan Goel, Pushkar Tripathi and Lei Wang. To appear in FOCS 2009.
- Speeding up Algorithms on Compressed Webgraphs - with Kumar Chellapilla and Reid Andersen.
In proceedings of ACM Web Search and Data Mining (ACM WSDM) 2009. PDF
- A note on the problem of reporting maximal cliques with Frederic Cazals. Theoretical Computer Science - Volume 407:564-568, Nov. 2008. URL
- Computing Market Equilibrium: Beyond Weak Gross Substitutes with Nikhil Devanur. In proceedings of
Workshop on Internet and Network Economics (WINE) 2007. PDF
- An Algorithm for Reporting Maximal C-Cliques with Frederic Cazals. Theoretical Computer Science - Volume 349,
Issue 3:484-490, Dec 2005. URL
- The Effect of Malice on Social Optimum in Congestion Games - Manuscript. Feb 2008. URL
- Polynomially Correlated Knapsack is NP-Complete : Tech Report. July 2007. URL
- Non-preemptive Precedence Constraint Scheduling : Senior Thesis at IIT Bombay, May 2006.
- NP-completeness of Flow Shop Scheduling : Junior Thesis at IIT Bombay, May 2005.
|
|
|
PATENTS
|
- Faster Algorithms for Compressed Web Graphs - Patent Filed (Microsoft Live Labs)
- Short Paths in Web Graphs with Small Query Time - Patent Filed (Microsoft Live Labs)
|
|
|
INVITED TALKS
|
- Market Equilibrium with Transaction Costs - INFORMS 2009, San Diego.
- Spam Classification using First Principles - Microsoft Tech Talk (July 2007)
- Combinatoric Aspects of Geometric Shape Matching - INRIA Sophia Antipolis (July 2006)
|
|
| ACADEMIC ACHIEVEMENTS |
- ACM International Collegiate Programming Competition: World finalist in 2006 and 2008.
- Aditya Birla Scholarship: Scholarship holder 2002-2006.
- IIT JEE 2002: All India Rank 33.
- Indian National Physics Olympiad 2002 (INPhO): Among 30 Gold Medalists from all over India.
- Indian National Chemistry Olympiad 2002 (INChO): Among 30 Gold Medalists from all over India.
|
|
|
WORK EXPERIENCE
|
- Research Intern positions
- Microsoft Research, Redmond - Summer 2009.
- Microsoft Live Labs, Redmond - Summer 2008.
- Microsoft Corporation, Redmond - Summer 2007.
- INRIA, Sophia Antipolis, France - Summer 2005 and 2006.
- School of Computing, National University of Singapore - Summer 2004.
- Teaching Assistant for CS1050 Honors at Georgia Tech in Spring 2008 and 2009.
|
|
|
PREVIOUS RESEARCH PROJECTS
|
- Non-preemptive Precedence Constraint Scheduling : BTech Project (2005-2006)
- Combinatorial Approach to Partial Geometric Shape Matching: (Summer 2005 and 2006)
- NP-completeness of Flow Shop Scheduling: (Spring 2005)
- Approximate Near Neighbours in Higher Dimensions: (Summer 2004)
|
|
|
|
