Nishad Kothari

14 papers Journal 13
YearRankTypeTitle / Venue / Authors
2025 J jnl
Planar cycle-extendable graphs.
Discret. Math. Theor. Comput. Sci.
Aditya Y. Dalwadi, Kapil R. Shenvi Pause, Ajit A. Diwan, Nishad Kothari
2024 J jnl
Extremal minimal bipartite matching covered graphs.
CoRR
Amit Kumar Mallik, Ajit A. Diwan, Nishad Kothari
2024 J jnl
Planar Cycle-Extendable Graphs.
CoRR
Aditya Y. Dalwadi, Kapil R. Shenvi Pause, Ajit A. Diwan, Nishad Kothari
2024 J jnl
θ-free matching covered graphs.
CoRR
Rohinee Joshi, Nishad Kothari
2021 J jnl
Minimal braces.
J. Graph Theory
Phelipe A. Fabres, Nishad Kothari, Marcelo Henriques de Carvalho
2020 J jnl
Birkhoff-von Neumann Graphs that are PM-Compact.
SIAM J. Discret. Math.
Marcelo Henriques de Carvalho, Nishad Kothari, Xiumei Wang, Yixun Lin
2020 J jnl
Equivalence classes in matching covered graphs.
Discret. Math.
Fuliang Lu, Nishad Kothari, Xing Feng, Lianzhu Zhang
2020 J jnl
Generating simple near-bipartite bricks.
J. Graph Theory
Nishad Kothari, Marcelo Henriques de Carvalho
2020 J jnl
On Essentially 4-Edge-Connected Cubic Bricks.
Electron. J. Comb.
Nishad Kothari, Marcelo Henriques de Carvalho, Claudio L. Lucchesi, Charles H. C. Little
2019 J jnl
Generating near-bipartite bricks.
J. Graph Theory
Nishad Kothari
2018 J jnl
On Two Unsolved Problems Concerning Matching Covered Graphs.
SIAM J. Discret. Math.
Claudio L. Lucchesi, Marcelo Henriques de Carvalho, Nishad Kothari, Uppaluri S. R. Murty
2016 — —
Brick Generation and Conformal Subgraphs.
Nishad Kothari
2015 J jnl
Approximation algorithms for digraph width parameters.
Theor. Comput. Sci.
Shiva Kintali, Nishad Kothari, Akash Kumar
2011 J jnl
Approximation Algorithms for Directed Width Parameters
CoRR
Shiva Kintali, Nishad Kothari, Akash Kumar