Personal information

Websites & social links

Homepage
MathSciNet profile
Google Scholar page
DBLP page

Other IDs

Scopus Author ID: 56581607800

Activities

Collapse all

Employment (5)

Indian Institute of Technology Madras: Chennai, Tamil Nadu, IN

2020-07-06 to present | Assistant Professor (Computer Science and Engineering)
Employment
Source: Self-asserted source
Nishad Kothari

University of Campinas: Campinas, Sao Paulo, BR

2018-09 to 2020-06 | Postdoc (Institute of Computing)
Employment
Source: Self-asserted source
Nishad Kothari

University of Vienna: Vienna, AT

2017-10 to 2018-08 | Postdoc (Faculty of Mathematics)
Employment
Source: Self-asserted source
Nishad Kothari

University of Waterloo: Waterloo, Ontario, CA

2017-01 to 2017-08 | Postdoc (Dept. of Combinatorics and Optimization)
Employment
Source: Self-asserted source
Nishad Kothari

University of Waterloo: Waterloo, Ontario, CA

2016-05 to 2016-12 | Lecturer (Dept. of Combinatorics and Optimization)
Employment
Source: Self-asserted source
Nishad Kothari

Education and qualifications (3)

University of Waterloo: Waterloo, Ontario, CA

2011-09 to 2016-04 | PhD (Dept. of Combinatorics and Optimization)
Qualification
Source: Self-asserted source
Nishad Kothari

Georgia Institute of Technology: Atlanta, Georgia, US

2009-09 to 2011-05 | MS (College of Computing)
Qualification
Source: Self-asserted source
Nishad Kothari

Birla Institute of Technology: Ranchi, Jharkhand, IN

2004-09 to 2008-05 | Undergrad student (Dept. of Computer Science and Engineering)
Qualification
Source: Self-asserted source
Nishad Kothari

Works (10)

Minimal braces

Journal of Graph Theory
2020-10-15 | Journal article
DOI: 10.1002/jgt.22628
Part of ISSN: 0364-9024
Part of ISSN: 1097-0118
Source: Self-asserted source
Nishad Kothari

Equivalence classes in matching covered graphs

Discrete Mathematics
2020-08 | Journal article
DOI: 10.1016/j.disc.2020.111945
Part of ISSN: 0012-365X
Source: Self-asserted source
Nishad Kothari

Birkhoff--von Neumann Graphs that are PM-Compact

SIAM Journal on Discrete Mathematics
2020-08-12 | Journal article
DOI: 10.1137/18m1202347
Part of ISSN: 0895-4801
Part of ISSN: 1095-7146
Source: Self-asserted source
Nishad Kothari

Generating simple near‐bipartite bricks

Journal of Graph Theory
2020-05-20 | Journal article
DOI: 10.1002/jgt.22579
Part of ISSN: 0364-9024
Part of ISSN: 1097-0118
Source: Self-asserted source
Nishad Kothari

On Essentially 4-Edge-Connected Cubic Bricks

The Electronic Journal of Combinatorics
2020-01-24 | Journal article
DOI: 10.37236/8594
Part of ISSN: 1077-8926
Source: Self-asserted source
Nishad Kothari

Generating near-bipartite bricks

Journal of Graph Theory
2019 | Journal article
DOI: 10.1002/jgt.22414
EID:

2-s2.0-85054924688
Contributors: Kothari, N.
Source: Self-asserted source
Nishad Kothari via Scopus - Elsevier

On two unsolved problems concerning matching covered graphs

SIAM Journal on Discrete Mathematics
2018 | Journal article
DOI: 10.1137/17M1138704
EID:

2-s2.0-85049555254
Source: Self-asserted source
Nishad Kothari
grade
Preferred source (of 2)‎

K4-free and Prism-free Planar Matching Covered Graphs

Journal of Graph Theory
2016 | Journal article
DOI: 10.1002/jgt.21882
EID:

2-s2.0-84960225367
Source: Self-asserted source
Nishad Kothari
grade
Preferred source (of 2)‎

Brick Generation and Conformal Subgraphs

University of Waterloo
2016-04-15 | Other
DOI: https://uwspace.uwaterloo.ca/handle/10012/10376
Source: Self-asserted source
Nishad Kothari

Approximation algorithms for digraph width parameters

Theoretical Computer Science
2015 | Journal article
DOI: 10.1016/j.tcs.2014.10.009
EID:

2-s2.0-84926372764
Contributors: Kintali, S.; Kothari, N.; Kumar, A.
Source: Self-asserted source
Nishad Kothari via Scopus - Elsevier
How many people are using ORCID?