Faster Exact and Parameterized Algorithm for Feedback Vertex Set in Bipartite Tournaments. - Mithilesh Kumar 001; Daniel Lokshtanov (FSTTCS, 2016)

A 2lk Kernel for l-Component Order Connectivity. - Mithilesh Kumar 001; Daniel Lokshtanov (IPEC, 2016)

Faster Exact and Parameterized Algorithm for Feedback Vertex Set in Tournaments. - Mithilesh Kumar 001; Daniel Lokshtanov (STACS, 2016)

Lossy Kernels for Connected Dominating Set on Sparse Graphs. - Eduard Eiben; Mithilesh Kumar 001; Amer E. Mouawad; Fahad Panolan (CoRR, 2017)

2-CLUB is NP-hard for distance to 2-club cluster graphs. - Mithilesh Kumar 001 (CoRR, 2019)

Faster Lattice Enumeration. - Mithilesh Kumar 001 (CoRR, 2019)

Lossy Kernels for Connected Dominating Set on Sparse Graphs. - Eduard Eiben; Mithilesh Kumar 001; Amer E. Mouawad; Fahad Panolan; Sebastian Siebertz (SIAM J. Discret. Math., 2019)

Deletion to Induced Matching. - Akash Kumar 006; Mithilesh Kumar 001 (CoRR, 2020)

Obtuse Lattice Bases. - Kanav Gupta; Mithilesh Kumar 001; Håvard Raddum (CoRR, 2020)