|
 | Up a level |
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.
Kamat, Vikram and Misra, Neeldhara (2015) Parameterized Algorithms and Kernels for 3-Hitting Set with Parity Constraints. In: 9th International Conference on Algorithms and Complexity (CIAC), MAY 20-22, 2015, Univ Paris Dauphine, Paris, FRANCE, pp. 249-260.
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.
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.
Agrawal, Akanksha and Govindarajan, Sathish and Misra, Neeldhara (2014) Vertex Cover Gets Faster and Harder on Low Degree Graphs. In: 20th International Conference on Computing and Combinatorics (COCOON), AUG 04-06, 2014, Atlanta, GA, pp. 179-190.
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.
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.
Dey, Palash and Misra, Neeldhara and Narahari, Y (2019) Parameterized dichotomy of choosing committees based on approval votes in the presence of outliers. In: THEORETICAL COMPUTER SCIENCE, 783 . pp. 53-70.
Gaspers, Serge and Misra, Neeldhara and Ordyniak, Sebastian and Szeider, Stefan and Zivny, Stanislav (2017) Backdoors into heterogeneous classes of SAT and CSP. In: JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 85 . pp. 38-56.
Dey, Palash and Misra, Neeldhara and Narahari, Y (2017) Frugal bribery in voting. In: THEORETICAL COMPUTER SCIENCE, 676 . pp. 15-32.
Dey, Palash and Misra, Neeldhara and Narahari, Y (2016) Kernelization complexity of possible winner and coalitional manipulation problems in voting. In: THEORETICAL COMPUTER SCIENCE, 616 . pp. 111-125.
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.
Heggernes, Pinar and van't Hof, Pim and Marx, Daniel and Misra, Neeldhara and Villanger, Yngve (2015) On the Parameterized Complexity of Finding Separators with Non-Hereditary Properties. In: ALGORITHMICA, 72 (3). pp. 687-713.
Misra, Neeldhara and Narayanaswamy, NS and Raman, Venkatesh and Shankar, Bal Sri (2013) Solving MIN ONES 2-SAT as fast as VERTEX COVER. In: THEORETICAL COMPUTER SCIENCE, 506 . pp. 115-121.
