|
 | 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.
Goyal, Prachi and Misra, Neeldhara and Panolan, Fahad and Zehavi, Meirav (2015) DETERMINISTIC ALGORITHMS FOR MATCHING AND PACKING PROBLEMS BASED ON REPRESENTATIVE SETS. In: SIAM JOURNAL ON DISCRETE MATHEMATICS, 29 (4). pp. 1815-1836.
Dey, Palash and Goyal, Prachi and Misra, Neeldhara (2014) UNO Gets Easier for a Single Player. In: 7th International Conference on Fun with Algorithms, JUL 01-03, 2014, ITALY, pp. 147-157.
Goyal, Prachi and Kamat, Vikram and Misra, Neeldhara (2013) On the Parameterized Complexity of the Maximum Edge 2-Coloring Problem. In: 38th International Symposium on Mathematical Foundations of Computer Science (MFCS), AUG 26-30, 2013, IST Austria, Klosterneuburg, AUSTRIA, pp. 492-503.
