Indian Institute of Technology Gandhinagar (IITGN) invites applications for a Postdoctoral
Fellow in Computational Complexity Theory for a research project funded by Indian Institute of
Technology, Gandhinagar.
Job Description The candidate will work on the project “Complexity of Graph Patterns”. This
would involve a study of the existing methods to solve pattern (homomorphisms, isomorphisms,
induced isomorphisms, and related structures) detection and counting in graphs and proving con-
ditional lower bounds or finding improved algorithms for this class of problems.
Eligibility PhD in Complexity Theory, Theory of Algorithms, or related areas with a good sci-
entific publication record.
Experience working in graph algorithms or arithmetic circuit complexity is a plus. Candidates who have submitted their thesis are also eligible for the position.
Duration Initial appointment is for 1 year, extendable up to 1 more year based on performance
Remuneration 50,000 INR per month plus 10,000 INR HRA
Application Procedure Candidates must fill the online form provided at IIT Gandhinagar
website AND send following documents via e-mail to Dr. Balagopal Komarath (bkomarath at iitgn
dot ac dot in). The following documents must be sent as a single pdf attachment to the email:
1. Current CV with a list of publications.
2. A one-page summary of previous research/work experience
3. A one-page write-up about why you want to take up this postdoc position
4. Names and email addresses of 2 potential referees.