(Former) Member Profile :
|
Rahul C.S.Former Ph.D. student.Associated with group during : Jul 2011 - Nov Advisor(s) : Narayanaswamy N S Email : rahulcsbn@gmail.com |
Disclaimer : This page lists only the information about the individual member relevant to the theory group activities. Please visit the individual's page (using the link above) for broader profile information.
Research InterestsAn Exploration of NP using Connected f-FactorsMoved to:Postdoc, University of Warsaw, Poland. |
Teaching Actvities (while with the theory group - since Jan 2011)
- TA for Advanced Algorithms - Jan-May, 2015
- TA for Advanced Data Structures & Algorithms - Jul-Nov, 2013
- TA for Advanced Programming Lab - Jul-Nov, 2012
- TA for Advanced Data Structures & Algorithms - Jul-Nov, 2012
Publications (while with the group, last 10)
See here for all publications while at IITM
- On the Complexity Landscape of Connected f-factor Problems
Authors: Robert Ganian, Narayanaswamy N S, Sebastian Ordyniak, Rahul C.S., M S Ramanujan
41st International Symposium on Mathematical Foundations of Computer Science (MFCS), Aug 2016 - Approximation and Exact Algorithms for special cases of Connected f-Factors
Authors: Narayanaswamy N S, Rahul C.S.
10th International Computer Science Symposium in Russia, Jul 2015 - Connected f-Factors of Large Minimum Degree in Polynomial Time.
Authors: Narayanaswamy N S, Rahul C.S.
9th International Colloquium on Graph Theory and Combinatorics (ICGT 2014), Jul 2014 - Approximability of Connected Factors
Authors: Kamiel Cornelissen, Ruben Hoeksma, Bodo Manthey, Narayanaswamy N S, Rahul C.S.
11th Workshop on Approximation and Online Algorithms (WAOA), Sep 2013