Ankit Chauhan

Research Interest

I am mainly interested in Theoretical Computer Science [See Picture]

I am especially interested in:

• Algorithmic Game Theory
• Parameterized Complexity
• Scale-Free Networks
• Approximation Algorithms

I also follow theoretical foundation in Machine Learning and Big data.

Short C.V.

Education: 

1. M.S. (Computer Science and Engineering) from Department of Computer Science and Engineering at IIT Madras, Chennai, Tamil Nadu, India. [Jan 2013 - July 2015]
2. Bachelors in Technology (Computer Science and Engineering) from Uttar Pradesh Technical University, Lucknow, Uttar Pradesh, India.[Aug 2008 - July 2012 ]
3. Intermediate from Kendriya Vidyalaya Dogra Lines, Meerut Cantt, Uttar Pradesh, India.[2007-08]
4. High School from Kendriya Vidyalaya Dogra Lines, Meerut Cantt, Uttar Pradesh, India.[2005-06] 

Positions:

• November 2015 - current : Ph.D. Student at chair of Algorithm Engineering at Hasso-Plattner-Institut, Potsdam, Germany.
• January 2013-July 2015 : Teaching Assistant at Department of Computer Science and Engineering at IIT Madras, Chennai, Tamil Nadu, India.

Teaching Activities:

• TA for Languages, Machines and Computations  - Jan-May, 2015
• TA for Mathematical Concepts of Computer Science - Jul-Nov, 2014

Publications

2020

•  

  Chauhan, Ankit; Friedrich, Tobias; Rothenberger, RalfGreed is Good for Deterministic Scale-Free NetworksAlgorithmica 2020: 3338–3389

  [ ][ ][ URL ][ DOI ][ Download ]

2018

•  

  Chauhan, Ankit; Lenzner, Pascal; Molitor, LouiseSchelling Segregation with Strategic AgentsSymposium on Algorithmic Game Theory (SAGT) 2018

  [ ][ ][ DOI ][ Download ]

2017

•  

  Chauhan, Ankit; Friedrich, Tobias; Quinzan, FrancescoApproximating Optimization Problems using EAs on Scale-Free NetworksGenetic and Evolutionary Computation Conference (GECCO) 2017: 235–242

  [ ][ ][ DOI ][ Download ]

•  

  Chauhan, Ankit; Lenzner, Pascal; Melnichenko, Anna; Molitor, LouiseSelfish Network Creation with Non-Uniform Edge CostSymposium on Algorithmic Game Theory (SAGT) 2017: 160–172

  [ ][ ][ DOI ][ Download ]

2016

•  

  Chauhan, Ankit; Friedrich, Tobias; Rothenberger, RalfGreed is Good for Deterministic Scale-Free NetworksFoundations of Software Technology and Theoretical Computer Science (FSTTCS) 2016: 33:1–33:15

  [ ][ ][ URL ][ DOI ][ Download ]

•  

  Chauhan, Ankit; Lenzner, Pascal; Melnichenko, Anna; Münn, MartinOn Selfish Creation of Robust NetworksSymposium on Algorithmic Game Theory (SAGT) 2016: 141–152

  [ ][ ][ URL ][ DOI ][ Download ]

2015

•  

  Chauhan, Ankit; Rao, B. V. RaghavendraParameterized Analogues of Probabilistic ComputationConference on Algorithms and Discrete Applied Mathematics (CALDAM) 2015: 181–192

  [ ][ ][ URL ][ DOI ][ Download ]

Miscellaneous

Interesting Links:

• Theory Conferences update[Link]
• Parameterized Complexity  Wiki[Link]
• Computational Complexity Blog [Link]
• P vs NP Solutions [Link]
• Proof God Exist (by Gödel)[Wiki]

P.S. : I hate those people who give Spoilers of Game of Thrones.