default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHarshil Mittal
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j4]Koustav De
, Harshil Mittal, Palash Dey, Neeldhara Misra:
Parameterized aspects of distinct Kemeny rank aggregation. Acta Informatica 61(4): 401-414 (2024)- [j3]Harshil Mittal, Saraswati Nanoti, Aditi Sethia:
Diverse fair allocations: Complexity and algorithms. Discret. Appl. Math. 359: 343-353 (2024) - [j2]N. R. Aravind, Neeldhara Misra, Harshil Mittal:
Chess is hard even for a single player. Theor. Comput. Sci. 1015: 114726 (2024) - [c9]Koustav De, Harshil Mittal, Palash Dey, Neeldhara Misra:
Parameterized Aspects of Distinct Kemeny Rank Aggregation. CALDAM 2024: 14-28 - [c8]Neeldhara Misra, Harshil Mittal, Ashutosh Rai:
On the Parameterized Complexity of Diverse SAT. ISAAC 2024: 50:1-50:18 - [c7]Pranjal Dutta, Christian Ikenmeyer, Balagopal Komarath, Harshil Mittal, Saraswati Girish Nanoti, Dhara Thakkar:
On the Power of Border Width-2 ABPs over Fields of Characteristic 2. STACS 2024: 31:1-31:16 - [i6]Neeldhara Misra, Harshil Mittal, Ashutosh Rai:
On the Parameterized Complexity of Diverse SAT. CoRR abs/2412.09717 (2024) - 2023
- [c6]Harshil Mittal, Saraswati Nanoti, Aditi Sethia:
Diverse Fair Allocations: Complexity and Algorithms. CALDAM 2023: 101-117 - [c5]Neeldhara Misra, Harshil Mittal, Saket Saurabh, Dhara Thakkar:
On the Complexity of the Eigenvalue Deletion Problem. ISAAC 2023: 53:1-53:17 - [i5]Koustav De, Harshil Mittal, Palash Dey, Neeldhara Misra:
Parameterized Aspects of Distinct Kemeny Rank Aggregation. CoRR abs/2309.03517 (2023) - [i4]Neeldhara Misra, Harshil Mittal, Saket Saurabh, Dhara Thakkar:
On the Complexity of the Eigenvalue Deletion Problem. CoRR abs/2310.00600 (2023) - 2022
- [c4]Neeldhara Misra, Harshil Mittal, Saraswati Nanoti:
Diverse Non Crossing Matchings. CCCG 2022: 249-256 - [c3]N. R. Aravind, Neeldhara Misra, Harshil Mittal:
Chess Is Hard Even for a Single Player. FUN 2022: 5:1-5:20 - [i3]N. R. Aravind, Neeldhara Misra, Harshil Mittal:
Chess is hard even for a single player. CoRR abs/2203.14864 (2022) - 2021
- [j1]Neeldhara Misra, Harshil Mittal:
Imbalance parameterized by twin cover revisited. Theor. Comput. Sci. 895: 1-15 (2021) - 2020
- [c2]Neeldhara Misra, Harshil Mittal, Aditi Sethia:
Red-Blue Point Separation for Points on a Circle. CCCG 2020: 266-272 - [c1]Neeldhara Misra, Harshil Mittal:
Imbalance Parameterized by Twin Cover Revisited. COCOON 2020: 162-173 - [i2]Neeldhara Misra, Harshil Mittal:
Imbalance Parameterized by Twin Cover Revisited. CoRR abs/2005.03800 (2020) - [i1]Neeldhara Misra, Harshil Mittal, Aditi Sethia:
Red-Blue Point Separation for Points on a Circle. CoRR abs/2005.06046 (2020)
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 2025-01-21 21:24 CET 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:
