|
 | Up a level |
Goyal, Prachi and Misra, Pranabendu and Panolan, Fahad and Philip, Geevarghese and Saurabh, Saket (2018) Finding even subgraphs even faster. In: JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 97 . pp. 1-13.
Bhattacharyya, Arnab and Grandoni, Fabrizio and Nikolov, Aleksandar and Saha, Barna and Saurabh, Saket and Vijayaraghavan, Aravindan and Zhang, Qin (2018) Editorial: ACM-SIAM Symposium on Discrete Algorithms (SODA) 2016 Special Issue. In: ACM TRANSACTIONS ON ALGORITHMS, 14 (3, SI).
Fomin, Fedor V and Saurabh, Saket and Misra, Neeldhara (2015) Graph Modification Problems: A Modern Perspective. In: 9th International Frontiers of Algorithmics Workshop (FAW), JUL 03-05, 2015, Guilin, PEOPLES R CHINA, pp. 3-6.
Ashok, Pradeesha and Kolay, Sudeshna and Misra, Neeldhara and Saurabh, Saket (2015) Unique Covering Problems with Geometric Sets. In: 21st International Computing and Combinatorics Conference (COCOON) , AUG 04-06, 2015, Beijing, PEOPLES R CHINA, pp. 548-558.
Misra, Neeldhara and Panolan, Fahad and Rai, Ashutosh and Raman, Venkatesh and Saurabh, Saket (2013) Parameterized Algorithms for MAX COLORABLE INDUCED SUBGRAPH Problem on Perfect Graphs. In: 39th International Workshop on Graph-Theoretic Concepts in Computer Science (WG), JUN 19-21, 2013, Lubeck, GERMANY, pp. 370-381.
Misra, Neeldhara and Panolan, Fahad and Saurabh, Saket (2013) Subexponential Algorithm for d-Cluster Edge Deletion: Exception or Rule? In: 38th International Symposium on Mathematical Foundations of Computer Science (MFCS), AUG 26-30, 2013, IST Austria, Klosterneuburg, AUSTRIA, pp. 679-690.
