Hello, I'm Mithilesh Kumar. I'm passionate about anything related to Quantum Mechanics. Currently, I'm working actively in quantum error correction. I have done research in quantum-safe cryptography (Post-Doc). My PhD involved studying parameterized algorithms. Prior to that I have masters in two fields, computer science (CMI) and physics (IIT Kanpur). In addition, I have founded two websites Mathril (Mathematics) and Vectorial (Graphics). ( My CV )


Work and Education

In my case, work and education have gone hand-in-hand. One can not be seen independent of the other. I describe them briefly below.

Web development

Pandemic gave me enough time to gain a new skill, web development. I taught myself nodejs, mongodb, svelte and sveltekit. I have developed my own qr-code based authentication scheme that helps users to set long and secure passwords without having to memorize them.

Post Doctoral Research

Between June 2017 and June 2020, I did Post-doctoral research in quantum-safe cryptography in a research-based company Simula-UiB, Bergen, Norway.

LCPath

PhD

During my masters in CMI, I grew interest in graph algorithms. Between March, 2014 and May, 2017, I did PhD in parameterized algorithms from University of Bergen, Norway under Prof. Daniel Lokshtanov. My research papers are listed below.

santa

Masters in Theoretical Computer Science

To improve my understanding of quantum computing, I taught myself basics of computer science. Between July 2011 and July 2013, I did masters in theoretical computer science from Chennai Mathematical Institute, Chennai. I'm the gold medalist of my batch. My master's thesis can be accessed here.

Medal

Masters in Theotical Physics

In 2004, I cleared IIT-JEE entrance exam with AIR 971. Between July 2004 and Dec 2010, I did msc integrated in physics from IIT Kanpur. In my theory project, I developed an algorithm that would generalize Deutsch-Jozsa quantum algorithm for operations modulo 2N. The experimental project involved Z-Scan measurement in Quantum Computing.

Medal

School

I have been academically inclined from the start. I was class topper (sometimes school topper) in my school. I passed Class X from BISSC 8B, Bokaro with 94% marks. I was 2nd rank in all Bokaro Steel City schools in the city. I completed Class XII from DPS, Bokaro with 80.2% marks.

Research Papers

Journal

Mithilesh Kumar, Srimathi Varadarajan, Håvard Raddum

Graphs and Self-dual additive codes over GF(4)

WCC, 2019

Mithilesh Kumar, Srimathi Varadarajan, Håvard Raddum

Reducing Lattice Enumeration Search Trees

Infocommunications Journal, 2019

Eduard Eiben, Mithilesh Kumar, Amer E. Mouawad, Fahad Panolan, Sebastian Siebertz

Lossy Kernels for Connected Dominating Set on Sparse Graphs

SIAM J. Discret. Math. 33(3): 1743-1771 (2019)

Conferences

Eduard Eiben, Mithilesh Kumar, Amer E. Mouawad, Fahad Panolan, Sebastian Siebertz

Lossy Kernels for Connected Dominating Set on Sparse Graphs

STACS 2018: 29:1-29:15

Mithilesh Kumar, Daniel Lokshtanov

Faster Exact and Parameterized Algorithm for Feedback Vertex Set in Bipartite Tournaments

FSTTCS 2016: 24:1-24:15

Mithilesh Kumar, Daniel Lokshtanov

A 2lk Kernel for l-Component Order Connectivity

IPEC 2016: 20:1-20:14

Mithilesh Kumar, Daniel Lokshtanov

Faster Exact and Parameterized Algorithm for Feedback Vertex Set in Tournaments

STACS 2016: 49:1-49:13

Arxiv

Akash Kumar, Mithilesh Kumar

Deletion to Induced Matching

CoRR abs/2008.09660 (2020)

Kanav Gupta, Mithilesh Kumar, Håvard Raddum

Obtuse Lattice Bases

CoRR abs/2009.00384 (2020)

Mithilesh Kumar

2-CLUB is NP-hard for distance to 2-club cluster graphs

CoRR abs/1903.05425 (2019)

Mithilesh Kumar

Faster Lattice Enumeration

CoRR abs/1912.01781 (2019)

Eduard Eiben, Mithilesh Kumar, Amer E. Mouawad, Fahad Panolan, Sebastian Siebertz

Lossy Kernels for Connected Dominating Set on Sparse Graphs

CoRR abs/1706.09339 (2017)

Mithilesh Kumar, Daniel Lokshtanov

A 2ℓk Kernel for ℓ-Component Order Connectivity

CoRR abs/1610.04711 (2016)

Mithilesh Kumar, Daniel Lokshtanov

Faster Exact and Parameterized Algorithm for Feedback Vertex Set in Tournaments

CoRR abs/1510.07676 (2015)