Up a level |
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.
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.
Czygrinow, Andrzej and Kamat, Vikram (2012) Tight co-degree condition for perfect matchings in 4-graphs. In: ELECTRONIC JOURNAL OF COMBINATORICS, 19 (2).