Please use this identifier to cite or link to this item: http://hdl.handle.net/10603/289079
Title: Parameterized complexity of graph partitioning and Geometric Covering
Researcher: sudeshna kolay
Guide(s): Saket Saurabh
Keywords: Mathematics
Physical Sciences
University: Homi Bhabha National Institute
Completed Date: 2017
Abstract: newline
Pagination: 
URI: http://hdl.handle.net/10603/289079
Appears in Departments:Department of Mathematical Sciences

Files in This Item:
File Description SizeFormat 
01_title.pdfAttached File48.71 kBAdobe PDFView/Open
02_certificate.pdf105.8 kBAdobe PDFView/Open
03_prelim_pages.pdf257.94 kBAdobe PDFView/Open
04_contents.pdf441.21 kBAdobe PDFView/Open
05_tabfiglist.pdf402.08 kBAdobe PDFView/Open
06_chapter_1.pdf3.52 MBAdobe PDFView/Open
07_chapter_2.pdf4.48 MBAdobe PDFView/Open
08_chapter_3.pdf2.44 MBAdobe PDFView/Open
09_chapter_4.pdf7.75 MBAdobe PDFView/Open
10_chapter_5.pdf3.72 MBAdobe PDFView/Open
11_chapter_6.pdf7.18 MBAdobe PDFView/Open
12_chapter_7.pdf3.51 MBAdobe PDFView/Open
13_chapter_8.pdf4.5 MBAdobe PDFView/Open
14_chapter_9.pdf8.76 MBAdobe PDFView/Open
15_chapter_10.pdf471.93 kBAdobe PDFView/Open
16_misc.pdf3.36 MBAdobe PDFView/Open
80_recommendation.pdf48.71 kBAdobe PDFView/Open
Show full item record


Items in Shodhganga are licensed under Creative Commons Licence Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0).

Altmetric Badge: