| The Non-Uniform k-Center Problem D Chakrabarty, P Goyal, R Krishnaswamy ACM Transactions on Algorithms (TALG) 16 (4), 1-19, 2020 | 51* | 2020 |
| The Non-Uniform k-Center Problem D Chakrabarty, P Goyal, R Krishnaswamy ACM Transactions on Algorithms (TALG) 16 (4), 1-19, 2020 | 33 | 2020 |
| Deterministic algorithms for matching and packing problems based on representative sets P Goyal, N Misra, F Panolan, M Zehavi SIAM Journal on Discrete Mathematics 29 (4), 1815-1836, 2015 | 17 | 2015 |
| Faster deterministic algorithms for r-dimensional matching using representative sets P Goyal, N Misra, F Panolan IARCS Annual Conference on Foundations of Software Technology and …, 2013 | 13 | 2013 |
| Finding even subgraphs even faster P Goyal, P Misra, F Panolan, G Philip, S Saurabh Journal of Computer and System Sciences 97, 1-13, 2018 | 12 | 2018 |
| On the parameterized complexity of the maximum edge 2-coloring problem P Goyal, V Kamat, N Misra International Symposium on Mathematical Foundations of Computer Science, 492-503, 2013 | 4 | 2013 |
| Uno gets easier for a single player P Dey, P Goyal, N Misra International Conference on Fun with Algorithms, 147-157, 2014 | 2 | 2014 |
