default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSuchismita Mishra
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j6]Uttam K. Gupta, Suchismita Mishra, Dinabandhu Pradhan:
Cops and robber on subclasses of P5-free graphs. Discret. Math. 346(6): 113353 (2023)- [c2]Balagopal Komarath, Anant Kumar, Suchismita Mishra, Aditi Sethia
:
Finding and Counting Patterns in Sparse Graphs. STACS 2023: 40:1-40:20 - [i5]Balagopal Komarath, Anant Kumar, Suchismita Mishra, Aditi Sethia:
Finding and Counting Patterns in Sparse Graphs. CoRR abs/2301.02569 (2023) - 2022
- [j5]Catalina I. Hurwitz, Suchismita Mishra, Robert T. Daigler, Ihsan Badshah:
Dynamics of information leadership in the volatility complex with trading time changes: Evidence from VIX futures and VIX ETPs. Algorithmic Finance 9(3-4): 63-79 (2022) - [j4]Suresh Dara, Suchismita Mishra, Narayanan Narayanan, Zsolt Tuza:
Strong Edge Coloring of Cayley Graphs and Some Product Graphs. Graphs Comb. 38(2): 51 (2022) - 2021
- [j3]Florent Foucaud, Hervé Hocquard, Suchismita Mishra, Narayanan Narayanan, Reza Naserasr, Éric Sopena, Petru Valicov:
Exact square coloring of subcubic planar graphs. Discret. Appl. Math. 293: 74-89 (2021) - [c1]Florent Foucaud, Suchismita Mishra, Narayanan Narayanan, Reza Naserasr, Petru Valicov:
Cliques in exact distance powers of graphs of given maximum degree. LAGOS 2021: 427-436 - [i4]Uttam K. Gupta, Suchismita Mishra, Dinabandhu Pradhan:
Cops and robber on subclasses of P5-free graphs. CoRR abs/2111.06079 (2021) - 2020
- [i3]Florent Foucaud, Hervé Hocquard, Suchismita Mishra, Narayanan Narayanan, Reza Naserasr, Éric Sopena, Petru Valicov:
Exact square coloring of subcubic planar graphs. CoRR abs/2009.00843 (2020)
2010 – 2019
- 2018
- [j2]T. Karthick, Suchismita Mishra:
Chromatic bounds for some classes of 2K2-free graphs. Discret. Math. 341(11): 3079-3088 (2018) - [j1]T. Karthick, Suchismita Mishra:
On the Chromatic Number of (P6 , Diamond)-Free Graphs. Graphs Comb. 34(4): 677-692 (2018) - 2017
- [i2]T. Karthick, Suchismita Mishra:
Chromatic bounds for some classes of 2K2-free graphs. CoRR abs/1702.00622 (2017) - [i1]T. Karthick, Suchismita Mishra:
Coloring (P6, diamond, K4)-free graphs. CoRR abs/1703.00606 (2017)
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-10-07 21:20 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:
