Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMithilesh Kumar 0001
Person information
- affiliation: Simula@UiB, Bergen, Norway
- affiliation (former): University of Bergen, Norway
Other persons with the same name
- Mithilesh Kumar 0002 — Virginia Tech, VA, USA
- Mithilesh Kumar 0003 — Tejas Networks India Ltd., Bangalore, India
- Mithilesh Kumar 0004 — Indian Institute of Technology (Indian School of Mines), Dhanbad , India
- Mithilesh Kumar 0005 — Rajasthan Technical University, Kota, India
- Mithilesh Kumar 0006 — Cisco Systems, Inc., CA, USA
- Mithilesh Kumar 0007 — ABV-Indian Institute of Information Technology and Management, Gwalior, India
- Mithilesh Kumar 0008 — National Institute of Technology Arunachal Pradesh, India
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2019
[j1]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)
Conference and Workshop Papers
- 2018
- [c4]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 - 2016
- [c3]Mithilesh Kumar, Daniel Lokshtanov:
Faster Exact and Parameterized Algorithm for Feedback Vertex Set in Bipartite Tournaments. FSTTCS 2016: 24:1-24:15 - [c2]Mithilesh Kumar, Daniel Lokshtanov:
A 2lk Kernel for l-Component Order Connectivity. IPEC 2016: 20:1-20:14 - [c1]Mithilesh Kumar, Daniel Lokshtanov:
Faster Exact and Parameterized Algorithm for Feedback Vertex Set in Tournaments. STACS 2016: 49:1-49:13
Informal and Other Publications
- 2020
- [i7]Akash Kumar, Mithilesh Kumar:
Deletion to Induced Matching. CoRR abs/2008.09660 (2020) - [i6]Kanav Gupta, Mithilesh Kumar, Håvard Raddum:
Obtuse Lattice Bases. CoRR abs/2009.00384 (2020) - 2019
- [i5]Mithilesh Kumar:
2-CLUB is NP-hard for distance to 2-club cluster graphs. CoRR abs/1903.05425 (2019) - [i4]Mithilesh Kumar:
Faster Lattice Enumeration. CoRR abs/1912.01781 (2019) - 2017
- [i3]Eduard Eiben, Mithilesh Kumar, Amer E. Mouawad, Fahad Panolan:
Lossy Kernels for Connected Dominating Set on Sparse Graphs. CoRR abs/1706.09339 (2017) - 2016
- [i2]Mithilesh Kumar, Daniel Lokshtanov:
A 2ℓk Kernel for ℓ-Component Order Connectivity. CoRR abs/1610.04711 (2016) - 2015
- [i1]Mithilesh Kumar, Daniel Lokshtanov:
Faster Exact and Parameterized Algorithm for Feedback Vertex Set in Tournaments. CoRR abs/1510.07676 (2015)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 02:44 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
