This shows you the differences between two versions of the page.
Both sides previous revision Previous revision Next revision | Previous revision Next revision Both sides next revision | ||
research [2014/10/10 15:29] admin |
research [2018/07/03 17:31] admin |
||
---|---|---|---|
Line 12: | Line 12: | ||
+ | |||
+ | |||
+ | == Publications in Journals== | ||
+ | Approximability of Clique Transversal in Perfect Graphs.\\ | ||
+ | Samuel Fiorini, R. Krithika, N.S. Narayanaswamy and Venkatesh Raman. \\ | ||
+ | Accepted at Algorithmica 2017. | ||
+ | |||
+ | Approximation Algorithms for Connected Graph Factors of Minimum Weight. \\ | ||
+ | Kamiel Cornelissen, Ruben Hoeksma, Bodo Manthey, N. S. Narayanaswamy, C. S. Rahul, Marten Waanders \\ | ||
+ | Accepted at Theory of Computing Systems 2016. | ||
On the Complexity of Connected (s, t)-Vertex Separator. \\ | On the Complexity of Connected (s, t)-Vertex Separator. \\ | ||
N.S.Narayanaswamy and N.Sadagopan \\ | N.S.Narayanaswamy and N.Sadagopan \\ | ||
- | CoRR abs/1111.1814 (2011) | + | Accepted at Journal of Graph Algorithms and Applications 2015. |
- | |||
- | == Publications in Journals== | ||
On Minimum Average Stretch Spanning Trees in Polygonal 2-trees. \\ | On Minimum Average Stretch Spanning Trees in Polygonal 2-trees. \\ | ||
N.S Narayanaswamy, G Ramakrishna\\ | N.S Narayanaswamy, G Ramakrishna\\ | ||
Line 37: | Line 45: | ||
Faster Parameterized Algorithms using Linear Programming.\\ | Faster Parameterized Algorithms using Linear Programming.\\ | ||
Daniel Lokshtanov, N. S. Narayanaswamy, Venkatesh Raman, M. S. Ramanujan, Saket Saurabh\\ | Daniel Lokshtanov, N. S. Narayanaswamy, Venkatesh Raman, M. S. Ramanujan, Saket Saurabh\\ | ||
- | Accepted at the ACM Transactions on Algorithms 2013 . | + | ACM Transactions on Algorithms (TALG), Volume 11 Issue 2, October 2014, (Accepted in 2013) |
Another Disjoint Compression Algorithm for OCT. \\ | Another Disjoint Compression Algorithm for OCT. \\ | ||
R. Krithika and N. S. Narayanaswamy \\ | R. Krithika and N. S. Narayanaswamy \\ | ||
- | Accepted at Information Processing Letters 2013 . | + | Information Processing Letters, Volume 113 Issue 22-24, November, 2013, Pages 849-851. |
Solving minones-2-sat as fast as vertex cover. \\ | Solving minones-2-sat as fast as vertex cover. \\ | ||
Neeldhara Misra, N.S. Narayanaswamy, Venkatesh Raman, Bal Sri Shankar \\ | Neeldhara Misra, N.S. Narayanaswamy, Venkatesh Raman, Bal Sri Shankar \\ | ||
- | Accepted at Theoretical Computer Science 2013. | + | Theoretical Computer Science, Volume 506, 30 September 2013, Pages 115–121. |
A Dirac-type Characterization of k-chordal Graphs. \\ | A Dirac-type Characterization of k-chordal Graphs. \\ | ||
R. Krithika, Rogers Mathew, N. S. Narayanaswamy, N. Sadagopan\\ | R. Krithika, Rogers Mathew, N. S. Narayanaswamy, N. Sadagopan\\ | ||
- | CoRR abs/1206.5397 (2012). Accepted at Discrete Mathematics 2013. | + | Discrete Mathematics, Volume 313, Issue 24, 28 December 2013, Pages 2865–2867. |
Parameterized Algorithms for (r,l)-partization.\\ | Parameterized Algorithms for (r,l)-partization.\\ | ||
Line 112: | Line 120: | ||
== Publications in Conferences== | == Publications in Conferences== | ||
+ | A Refined Analysis of Online Path Coloring in Trees \\ | ||
+ | Astha Chauhan, N.S. Narayanaswamy. \\ | ||
+ | Accepted at WAOA 2016. | ||
+ | |||
+ | On the Complexity Landscape of Connected f-factor Problems\\ | ||
+ | Robert Ganian, N.S. Narayanaswamy, Sebastian Ordyniak, C.S. Rahul and Ramanujan M. S. \\ | ||
+ | Accepted at MFCS 2016. | ||
+ | |||
+ | Hitting Set for hypergraphs of low VC-dimension \\ | ||
+ | Karl Bringmann, László Kozma, Shay Moran and N.S. Narayanaswamy. \\ | ||
+ | Accepted at ESA 2016. | ||
+ | |||
+ | Approximation and Exact Algorithms for special cases of Connected $f$-Factors. \\ | ||
+ | N.S. Narayanaswamy and Rahul C.S. \\ | ||
+ | Accepted at CSR 2015. | ||
+ | |||
+ | Block Sorting is APX-Hard. \\ | ||
+ | N.S. Narayanaswamy and Swapnoneel Roy. \\ | ||
+ | Accepted at CIAC 2015. | ||
+ | |||
+ | Approximate Distance Oracle in $O(n^2)$ Time and $O(n)$ Space for Chordal Graphs. \\ | ||
+ | Gaurav Singh, N.S. Narayanaswamy and G. Ramakrishna. \\ | ||
+ | Accepted at WALCOM 2015. | ||
+ | |||
+ | Tree Path Labeling of Hypergraphs – A Generalization of the Consecutive Ones Property. \\ | ||
+ | N.S. Narayanaswamy and Anju Srinivasan. \\ | ||
+ | Accepted at CALDAM 2015. | ||
+ | |||
LP Approaches to Improved Approximation for Clique Transversal in Perfect Graphs. \\ | LP Approaches to Improved Approximation for Clique Transversal in Perfect Graphs. \\ | ||
Samuel Fiorini, R. Krithika, N.S. Narayanaswamy and Venkatesh Raman. \\ | Samuel Fiorini, R. Krithika, N.S. Narayanaswamy and Venkatesh Raman. \\ | ||
Line 235: | Line 271: | ||
* G. Ramakrishna (IITM M.S, IITM PhD, Assistant Professor at IIIT-Sri City) | * G. Ramakrishna (IITM M.S, IITM PhD, Assistant Professor at IIIT-Sri City) | ||
* R. Subashini (IITM M.Tech, IITM PhD, Assistant Professor, NIT Calicut) | * R. Subashini (IITM M.Tech, IITM PhD, Assistant Professor, NIT Calicut) | ||
- | * R. Krithika (IITM M.S, current IITM PhD) | + | * R. Krithika (IITM M.S, IITM PhD(Aug 2016), PostDoc, IMSc) |
- | * C.S. Rahul (Current PhD) | + | * C.S. Rahul (IITM M.Tech(with Prof. Hema Murthy), IITM PhD(Nov 2016), Starting PostDoc at U. Warsaw) |
* Dhannya Gopakumar (Current PhD) | * Dhannya Gopakumar (Current PhD) | ||
- | * Ramya C (Current Phd, co-guiding with B.V. Raghavendra Rao) | + | * Vijaya Ragunathan (Current Phd, co-guiding with Meghana Nasre) |
+ | * Manas Jyoti Kashyop (IITM M.Tech, Current PhD (Aug 2016)) | ||
+ | * Rajesh Pandian (IITM M.Tech, Current PhD (Aug 2016)) | ||
+ | * Anil Kumar (Current PhD (September 2016)) | ||
+ | * K.K. Nisha (Current PhD (August 2017)) | ||
* R. Subhash Babu (IITM M.S, D.E. Shaw) | * R. Subhash Babu (IITM M.S, D.E. Shaw) | ||
* Srinibas Swain (IITM M.S, Oracle) | * Srinibas Swain (IITM M.S, Oracle) | ||
Line 247: | Line 287: | ||
* Anju Srinivasan (IITM M.S) | * Anju Srinivasan (IITM M.S) | ||
* Anup Joshi (IITM M.S, Now PhD student at Dartmouth) | * Anup Joshi (IITM M.S, Now PhD student at Dartmouth) | ||
- | * Gaurav Singh (Current M.S) | + | * Gaurav Singh (IITM M.S, VMWare) |
- | * Aastha Chauhan (Current M.S) | + | * Aastha Chauhan (IITM M.S, Robert Bosch Limited) |
+ | * Sharmili Murthy (Current M.S, Microsoft Limited) | ||