Parallel Machine Scheduling to Minimize Energy Consumption A Antoniadis, N Garg, G Kumar, N Kumar SODA 2020, 2020 | 24 | 2020 |
Integer Plane Multiflow Maximisation: Flow-Cut Gap and One-Quarter-Approximation N Garg, N Kumar, A Sebő IPCO 2020, 2020 | 9 | 2020 |
Dual Half-integrality for Uncrossable Cut Cover and its Application to Maximum Half-Integral Flow N Garg, N Kumar ESA 2020, 2020 | 6 | 2020 |
An Approximate Generalization of the Okamura-Seymour Theorem N Kumar FOCS 2022, 2022 | 5 | 2022 |
On a Linear Diophantine Problem Involving the Fibonacci and Lucas Sequences SS Batra, N Kumar, A Tripathi Integers : Electronic Journal of Combinatorial Number Theory, 2015 | 5 | 2015 |
Approximate Max-Flow Min-Multicut Theorem for Graphs of Bounded Treewidth T Friedrich, D Issac, N Kumar, N Mallek, Z Zeif STOC 2023, 2022 | 4 | 2022 |
A Primal-Dual Algorithm for Multicommodity Flows and Multicuts in Treewidth-2 Graphs T Friedrich, D Issac, N Kumar, N Mallek, Z Zeif APPROX 2022, 2022 | 3 | 2022 |
Integer Plane Multiflow Maximisation: One-Quarter-Approximation and Gaps N Garg, N Kumar, A Sebő Mathematical Programming, 2021 | 3 | 2021 |
A Constant Factor Approximation for Capacitated Min-Max Tree Cover S Das, L Jain, N Kumar APPROX 2020, 2019 | 3 | 2019 |
Multicommodity Flows in Planar Graphs with Demands on Faces N Kumar ISAAC 2020, 2020 | 2 | 2020 |
Optimal Padded Decomposition For Bounded Treewidth Graphs A Filtser, T Friedrich, D Issac, N Kumar, H Le, N Mallek, Z Zeif arXiv preprint arXiv:2407.12230, 2024 | 1 | 2024 |
Nearly-Tight Bounds for Flow Sparsifiers in Quasi-Bipartite Graphs S Das, N Kumar, D Vaz MFCS 2024, 2024 | 1 | 2024 |
Skeletons and Minimum Energy Scheduling A Antoniadis, G Kumar, N Kumar ISAAC 2021, 2021 | 1 | 2021 |
Some Problems Concerning the Frobenius Number for Extensions of an Arithmetic Progression SS Batra, N Kumar, A Tripathi The Ramanujan Journal, 2019 | 1 | 2019 |
Multicommodity Flows in Planar Graphs N Kumar IIT Delhi, 2021 | | 2021 |