Mithilesh Kumar
drmithileshkumar.com
+91 8797081308
Bangalore

Research Interests

Quantum Computing and Quantum Information, Algorithms, Discrete Mathematics

Work Experience

Jan 2024-Nov 2024 Assistant Professor, Department of Computer Applications, Dayananda Sagar University, Bangalore
Jul 2020-Dec 2023 Founder, Mathril, Vectorial
Jun 2017-Jun 2020 Post-doc research, Simula-UiB, Post-quantum cryptography (Advisor: Dr Havard Raddum)

Education

Mar 2014-May 2017 Ph.D. Parameterized Algorithms, University of Bergen, Norway, (Advisors: Prof Daniel Lokshtanov, Prof Saket Saurabh)
Jul 2013-Feb 2014 Research Scholar, Chennai Mathematical Institute, Chennai
Jul 2011-Jun 2013 M.Sc. Computer Science, Chennai Mathematical Institute, Chennai
Jul 2004-Dec 2009 M.Sc. Physics, IIT Kanpur

Achievements

2013 Gold medal for Academic Excellence (M.Sc.), Chennai Mathematical Institute
2004-2009 Merit-cub-means scholarship for academic performance (M.Sc.), IIT Kanpur
2004 IIT JEE All India Rank 971

Publications

Google Scholar Citations: 104 h-index: 4

Journal Articles

J1. Eiben, E., Kumar, Mithilesh, Mouawad, A. E., Panolan, F. & Siebertz, S. Lossy Kernels for Connected Dominating Set on Sparse Graphs. SIAM Journal on Discrete Mathematics 33,1743–1771 (2019).
J2. Kumar, Mithilesh, Varadarajan, S. & Raddum, H. Reducing Lattice Enumeration Search Trees. Infocommunications Journal XI, 8–16. issn: 2061-2079 (2019).

Peer-reviewed Conference Proceedings

C1. Kumar, Mithilesh, Varadarajan, S. & Raddum, H. Graphs and Self-dual additive codes over GF(4) in 11th International Workshop on Coding and Cryptography (2019). https://www.lebesgue.fr/en/content/sem2019-WCC.
C2. Kumar, Mithilesh & Lokshtanov, D. A 2lk Kernel for l-Component Order Connectivity in 11th International Symposium on Parameterized and Exact Computation (IPEC 2016) 63 (2017), 20:1-20:14. isbn: 978-3-95977-023-1.
C3. Kumar, Mithilesh & Lokshtanov, D. Faster Exact and Parameterized Algorithm for Feedback Vertex Set in Bipartite Tournaments in 36th IARCS Annual Conference on Foundations of Soft- ware Technology and Theoretical Computer Science (FSTTCS 2016) 65 (2016), 24:1–24:15.isbn: 978-3-95977-027-9.
C4. Kumar, Mithilesh & Lokshtanov, D. Faster Exact and Parameterized Algorithm for Feedback Vertex Set in Tournaments in 33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016) 47 (2016), 49:1–49:13. isbn: 978-3-95977-001-9.

Preprints

P1. Gupta, K., Kumar, Mithilesh & Raddum, H. Obtuse Lattice Bases ArXiv[Preprint]. Sep 2020. https://arxiv.org/abs/2009.00384.
P2. Kumar, A. & Kumar, Mithilesh. Deletion to Induced Matching ArXiv[Preprint]. Aug 2020. https://arxiv.org/abs/2008.09660.
P3. Kumar, Mithilesh. 2-CLUB is NP-hard for distance to 2-club cluster graphs ArXiv[Preprint]. Mar 2019. https://arxiv.org/abs/1903.05425.
P4. Kumar, Mithilesh. A guide to Quantum Channels Researchgate[Preprint]. Dec 2024. http://dx.doi.org/10.13140/RG.2.2.30460.45446.
P5. Kumar, Mithilesh. Faster Lattice Enumeration ArXiv[Preprint]. Dec 2019. https://arxiv.org/abs/1912.01781.

Teaching

Dayananda Sagar University

Jul 2024-Nov 2024 Instructor, Discrete Mathematical Structures (CODE 23CA2303)
Jul 2024-Nov 2024 Instructor, Mathematics I (CODE 24CA1101)
Feb 2024-Jun 2024 Instructor, Mathematics II (CODE 22CA1201)
Feb 2024-Jun 2024 Instructor, Internet Technologies (CODE 22CA2402)
Feb 2024-Jun 2024 Instructor, Internet Technologies Lab (CODE 22CA2405)

Tools & Software

  • Web editor: Developed online platform for practicing HTML, CSS, JavaScript for the course Internet Technologies
  • Mathril: Developed Mathematics practice platform for school students where problems are automatically generated
  • Vectorial: Developed SVG drawing tool with LaTex Support for researchers

Hobbies & Extra-curricular

  • Mathematics problem solving
  • Carrom (Finalist in IIT Kanpur and CMI every year)
  • Cricket (Member of my school team)
Last updated: Feb 1, 2025