Junior Research Fellow (JRF) Position:
Applications are invited from highly motivated candidates with a background in Computer Science or Mathematics who are interested in working in the areas of Algorithms and Complexity, Graph Theory and Combinatorics.
The position is available under the externally funded project titled "Algorithmic Study on Graph Modification Problems."
For more information, visit our IISER-TVM website
Last Date for Application Submission: 30 June 2025
PhD Positions:
I am looking for highly motivated Ph.D. candidates in Theoretical Computer Science: Algorithms and Complexity, Graph Theory and Combinatorics. If you are interested and have some research experience in the design and analysis of algorithms, graph theory and combinatorics, graph algorithms etc, or have done some theory courses (graph theory, combinatorics, data structures, advanced algorithms, etc.), feel free to drop an email to dhanyamolantony[at]iisertvm[dot]ac[dot]in with your CV and research interests.
There are two possible routes for Ph.D. admission:
Direct Route: Candidates with an independent fellowship for a Ph.D. program (e.g., CSIR-JRF, UGC-JRF, DBT-JRF, INSPIRE Fellowship, NBHM, etc.) can apply at any time of the year. If you are interested, please send an email to dhanyamolantony[at]iisertvm[dot]ac[dot]in with your research interests and an approximate timeline for joining.
Regular Route: You can also apply through the regular admission process by submitting your application to IISER TVM during the official Ph.D. admission cycles. Applications will be screened, and shortlisted candidates will be invited for online interviews.