Sandeep R. B.


I am a postdoc at Institute for Computer Science and Control, Hungarian Academy of Sciences, Budapest (MTA SZTAKI). My adviser is Dr. Dániel Marx.
 
Research interest
Education
  • PhD
    • Department of Computer Science and Engineering
    • Indian Institute of Technology Hyderabad, India 
    • Advisers: Dr. N. R. Aravind, Dr. Naveen Sivadasan
    • Thesis title: Results on Hardness of Edge Modification Problems and Chromatic Discrepancy of Graphs (pdf)
  • Master's degree 
    • Department of Computer Science and Engineering
       
    • National Institute of Technology Calicut, India
    • Adviser: Dr. K. Muralikrishnan
  • Bachelor's degree 
    • Department of Computer Science and Engineering
       
    • Government Engineering College Thrissur, Kerala, India
  • 11 - 12 Government Higher Secondary School Kokkallur, Kerala, India
  • 1 - 10 Government High School Avitanallur, Kerala, India
Publications
DBLP  arXiv (list1, list2)

[J17] Dichotomy results on the hardness of H-free edge modification problems. with N. R. Aravind and Naveen Sivadasan. SIAM Journal on Discrete Mathematics. 31(1): 542-561 (2017) (preliminary versions: [C15b] and [C16b]). doi: 10.1137/16M1055797. [published version]

[C17] Minimum Fill-In: Inapproximability and Almost Tight Lower Bounds. with Yixin Cao. SODA 2017: 875--880.  doi:10.1137/1.9781611974782.55. [published version, slides]

[J16] On polynomial kernelization of ℋ-free Edge Deletion. with N. R. Aravind and Naveen Sivadasan. Algorithmica 2016 (yet to appear offline). doi:10.1007/s00453-016-0215-y (preliminary version: [C14]) [published version]

[C16b] Parameterized lower bounds and dichotomy results for the NP-completeness of H-free edge modification problems. with N. R. Aravind and Naveen Sivadasan. In LATIN, 2016:82--95. doi:10.1007/978-3-662-49529-2_7

[C16a] Compressing bounded degree graphs. with Pål Grønås Drange and Markus Sortland Dregi. In LATIN 2016, 2016:362--375. doi:10.1007/978-3-662-49529-2_27

[J15] The chromatic discrepancy of graphs. with N. R. Aravind. Subrahmanyam Kalyanasundaram and Naveen Sivadasan. Discrete Applied Mathematics 184: 40-49 (2015). doi:10.1016/j.dam.2014.10.038 [published version]

[C15b] Parameterized Lower Bound and NP-Completeness of Some H-Free Edge Deletion Problems. with N. R. Aravind and Naveen Sivadasan. COCOA 2015: 424-438. doi:10.1007/978-3-319-26626-8_31

[C15a] Parameterized Lower Bound and Improved Kernel for Diamond-free Edge Deletion. with Naveen Sivadasan. IPEC 2015: 365-376. doi:10.4230/LIPIcs.IPEC.2015.365

[C14] On polynomial kernelization of ℋ-free Edge Deletion. with N. R. Aravind and Naveen Sivadasan. IPEC 2014: 28-38. doi:10.1007/978-3-319-13524-3_3

[J11] Perfectly colorable graphs. R. B. Sandeep. Information Processing Letters. 111(19): 960-961 (2011). doi:10.1016/j.ipl.2011.07.001 [arxiv]

Contact 
gmail address: sandharb

Last updated 
22 May 2017