Arindam Khan   Graduate Student College of Computing Georgia Institute of Technology, Atlanta, USA email: akhan67 [at] gatech dot edu

About me:

I am a third year graduate student in the Algorithms, Combinatorics and Optimization program at the College of Computing.

Before coming here, I got my B. Tech and M.Tech (Dual Degree) from the Department of Computer Science and Engineering, IIT Kharagpur in 2009. Then I had spent a year as a Blue Scholar at Analytics and Optimization group at IBM Research, India in New Delhi.

Top

• Approximation Algorithms and Combinatorial Optimization
• Algorithmic Game Theory
• Computational Geometry and Graph Algorithms

Top

pdf

Top

• On Mimicking Networks Representing Minimum Terminal Cuts
  with Prasad Raghavendra, Prasad Tetali, Laszlo Vegh
  Preprint in ArXiv

• Diffuse Reflection Diameter and Radius for Convex Quadrilateralizable Polygons
  with Sudebkumar P. Pal, Mridul Aanjaneya, Arijit Bishnu, Subhas C. Nandy
  Discrete Applied Mathematics 161(10-11): 1496-1505 (2013)

• Discovering Bucket Orders from Data
  with Sreyash Kenkre, Vinayaka Pandit
  In the Proceedings of the SIAM International Conference on Data Mining (SDM), 2011

• Attribute-based messaging: Access control and confidentiality
  with Rakesh Bobba, Omid Fatemieh, Fariba Khan, Carl A. Gunter, Himanshu Khurana and Manoj Prabhakaran
  ACM Transactions on Information and System Security (TISSEC), Volume 13 Issue 4, December 2010

• A framework for efficient and effective recovery of business operations
  with Soujanya Soni, Vinayaka Pandit and Sameep Mehta
  INFORMS Annual Meeting, Nov 7 - 10, 2010 Austin, Texas

• A Study on Detecting Malcodes Distribution Sites
  with DongWon Seo, Heejo Lee
  Korean Information Processing Society (KIPS) 30th Fall Conference, Vol. 15, No. 2, pp. 1425-1428, Nov. 14. 2008

• Polygon and Fortress Guarding by Diffuse Reflection, Angular Visibility and Direct Visibility
  under Prof. Sudebkumar P. Pal, Dept. of CSE, IIT Kharagpur, India
  Masters Thesis

• Being with and against the Thief: Geometric Characterization and Algorithms on Coverage Issues in Wireless Sensor Networks
  under Prof. Arijit Bishnu, Dept. of CSE, IIT Kharagpur, India
  Bachelors Thesis

Top

• Algebra 1(Fall 2010)
• Graph Theory(Fall 2010)
• Theory of Linear Inequalities(Fall 2010)
• Limits to Approximability(Fall 2010)
• Advanced Combinatorial Optimization(Spring 2011)
• Approximation Algorithms(Spring 2011)
• Advanced Classical Probability Theory(Spring 2011)
• Computatational Complexity(Fall 2011)
• High-Dimensional Algorithms(Fall 2011)
• Combinatorial Optimization - Structures and Algorithms(Fall 2011)
• Discrete Fourier Analysis(Spring 2012)
• Algebraic Topology I(Fall 2012)
• Convex Geometry (Fall 2012)
• Probabilistic Methods in Combinatorics (Spring 2013)
• Advanced Topics in Algorithmic Game Theory (Spring 2013)

• Quantum Computing(Sum12- Umesh Vazirani)

• CS4510: Automata and Complexity(Spring 2012)
• CS6505: Computability and Algorithms(Spring 2013)

Top

• (Short) LaTex Symbols
• The Comprehensive LATEX Symbol List
• Upcoming CS Theory Conference Deadlines
• Upcoming CS Theory Conferences
• Acceptance Rate/Statistics on CS Theory Conferences
• Discrete Math/Combinatorics Journals rankings
• TCS Blog Aggregator
• New in Arxiv
• ACO Student Seminar at GaTech
• Leveraging MOOC(Massive Open Online Course)
• OTHER INTERESTING LINKS

Top

---


Site created: September 15^th, 2010 10:15 PM (EDT)

Site last updated: May 20^th, 2013 01:30 PM (EDT)


Copyright Arindam Khan, 2013
Naah .. Template stolen from Anand Louis ;)