| On two unsolved problems concerning matching covered graphs CL Lucchesi, MH De Carvalho, N Kothari, USR Murty SIAM Journal on Discrete Mathematics 32 (2), 1478-1504, 2018 | 19 | 2018 |
| K4‐free and ‐free Planar Matching Covered Graphs N Kothari, USR Murty Journal of Graph Theory 82 (1), 5-32, 2016 | 13 | 2016 |
| On essentially 4-edge-connected cubic bricks N Kothari, MH de Carvalho, CL Lucchesi, CHC Little The Electronic Journal of Combinatorics 27 (1), P1.22, 2020 | 12 | 2020 |
| Approximation algorithms for digraph width parameters S Kintali, N Kothari, A Kumar Theoretical Computer Science 562, 365-376, 2015 | 12* | 2015 |
| Equivalence classes in matching covered graphs F Lu, N Kothari, X Feng, L Zhang Discrete Mathematics 343 (8), 111945, 2020 | 5 | 2020 |
| Birkhoff--von Neumann Graphs that are PM-Compact MH De Carvalho, N Kothari, X Wang, Y Lin SIAM Journal on Discrete Mathematics 34 (3), 1769-1790, 2020 | 5 | 2020 |
| Generating near‐bipartite bricks N Kothari Journal of Graph Theory 90 (4), 565-590, 2019 | 4 | 2019 |
| Brick generation and conformal subgraphs N Kothari University of Waterloo, 2016 | 4 | 2016 |
| Generating simple near‐bipartite bricks N Kothari, MH de Carvalho Journal of Graph Theory, 2020 | 3* | 2020 |
| Minimal braces PA Fabres, N Kothari, MH de Carvalho Journal of Graph Theory 96 (4), 490-509, 2021 | 2 | 2021 |
| Extremal minimal bipartite matching covered graphs AK Mallik, AA Diwan, N Kothari arXiv preprint arXiv:2404.06445, 2024 | | 2024 |
Akash KumarIIT BombayVerified email at purdue.edu
