Approximation Algorithms for Directed Width Parameters - Shiva Kintali; Nishad Kothari; Akash Kumar 003 (CoRR, 2011)

Approximation algorithms for digraph width parameters. - Shiva Kintali; Nishad Kothari; Akash Kumar 003 (Theor. Comput. Sci., 2015)

K4-free and C6¯-free Planar Matching Covered Graphs. - Nishad Kothari; Uppaluri S. R. Murty (J. Graph Theory, 2016)

Brick Generation and Conformal Subgraphs. - Nishad Kothari (2016)

On Two Unsolved Problems Concerning Matching Covered Graphs. - Claudio L. Lucchesi; Marcelo Henriques de Carvalho; Nishad Kothari; Uppaluri S. R. Murty (SIAM J. Discret. Math., 2018)

Generating near-bipartite bricks. - Nishad Kothari (J. Graph Theory, 2019)

On Essentially 4-Edge-Connected Cubic Bricks. - Nishad Kothari; Marcelo Henriques de Carvalho; Claudio L. Lucchesi; Charles H. C. Little (Electron. J. Comb., 2020)

Equivalence classes in matching covered graphs. - Fuliang Lu; Nishad Kothari; Xing Feng; Lianzhu Zhang (Discret. Math., 2020)

Generating simple near-bipartite bricks. - Nishad Kothari; Marcelo Henriques de Carvalho (J. Graph Theory, 2020)

Birkhoff-von Neumann Graphs that are PM-Compact. - Marcelo Henriques de Carvalho; Nishad Kothari; Xiumei Wang; Yixun Lin (SIAM J. Discret. Math., 2020)

Minimal braces. - Phelipe A. Fabres; Nishad Kothari; Marcelo Henriques de Carvalho (J. Graph Theory, 2021)

Extremal minimal bipartite matching covered graphs. - Amit Kumar Mallik; Ajit A. Diwan; Nishad Kothari (CoRR, 2024)

θ-free matching covered graphs. - Rohinee Joshi; Nishad Kothari (CoRR, 2024)

Planar cycle-extendable graphs. - Aditya Y. Dalwadi; Kapil R. Shenvi Pause; Ajit A. Diwan; Nishad Kothari (Discret. Math. Theor. Comput. Sci., 2025)