default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNishad Kothari
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i4]Amit Kumar Mallik, Ajit A. Diwan, Nishad Kothari:
Extremal minimal bipartite matching covered graphs. CoRR abs/2404.06445 (2024)- [i3]Aditya Y. Dalwadi, Kapil R. Shenvi Pause, Ajit A. Diwan, Nishad Kothari:
Planar Cycle-Extendable Graphs. CoRR abs/2405.15416 (2024) - [i2]Rohinee Joshi, Nishad Kothari:
θ-free matching covered graphs. CoRR abs/2407.05264 (2024) - 2021
- [j9]Phelipe A. Fabres, Nishad Kothari
, Marcelo Henriques de Carvalho:
Minimal braces. J. Graph Theory 96(4): 490-509 (2021) - 2020
- [j8]Nishad Kothari, Marcelo Henriques de Carvalho, Claudio L. Lucchesi, Charles H. C. Little:
On Essentially 4-Edge-Connected Cubic Bricks. Electron. J. Comb. 27(1): 1 (2020) - [j7]Fuliang Lu, Nishad Kothari, Xing Feng, Lianzhu Zhang:
Equivalence classes in matching covered graphs. Discret. Math. 343(8): 111945 (2020) - [j6]Nishad Kothari, Marcelo Henriques de Carvalho:
Generating simple near-bipartite bricks. J. Graph Theory 95(4): 594-637 (2020) - [j5]Marcelo Henriques de Carvalho, Nishad Kothari, Xiumei Wang, Yixun Lin:
Birkhoff-von Neumann Graphs that are PM-Compact. SIAM J. Discret. Math. 34(3): 1769-1790 (2020)
2010 – 2019
- 2019
- [j4]Nishad Kothari:
Generating near-bipartite bricks. J. Graph Theory 90(4): 565-590 (2019) - 2018
- [j3]Claudio L. Lucchesi, Marcelo Henriques de Carvalho, Nishad Kothari, Uppaluri S. R. Murty:
On Two Unsolved Problems Concerning Matching Covered Graphs. SIAM J. Discret. Math. 32(2): 1478-1504 (2018) - 2016
- [b1]Nishad Kothari:
Brick Generation and Conformal Subgraphs. University of Waterloo, Ontario, Canada, 2016 - [j2]Nishad Kothari, Uppaluri S. R. Murty:
K4-free and C6¯-free Planar Matching Covered Graphs. J. Graph Theory 82(1): 5-32 (2016) - 2015
- [j1]Shiva Kintali, Nishad Kothari, Akash Kumar:
Approximation algorithms for digraph width parameters. Theor. Comput. Sci. 562: 365-376 (2015) - 2011
- [i1]Shiva Kintali, Nishad Kothari, Akash Kumar:
Approximation Algorithms for Directed Width Parameters. CoRR abs/1107.4824 (2011)
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-08-25 20:06 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:
