On a Linear Diophantine Problem Involving the Fibonacci and Lucas Sequences. - Sanjit Singh Batra; Nikhil Kumar 001; Amitabha Tripathi (Integers, 2015)

A Constant Factor Approximation for Capacitated Min-Max Tree Cover. - Syamantak Das; Lavina Jain; Nikhil Kumar 001 (APPROX-RANDOM, 2020)

Dual Half-Integrality for Uncrossable Cut Cover and Its Application to Maximum Half-Integral Flow. - Naveen Garg 001; Nikhil Kumar 001 (ESA, 2020)

Integer Plane Multiflow Maximisation: Flow-Cut Gap and One-Quarter-Approximation. - Naveen Garg 001; Nikhil Kumar 001; András Sebö (IPCO, 2020)

Multicommodity Flows in Planar Graphs with Demands on Faces. - Nikhil Kumar 001 (ISAAC, 2020)

Parallel Machine Scheduling to Minimize Energy Consumption. - Antonios Antoniadis 001; Naveen Garg 001; Gunjan Kumar; Nikhil Kumar 001 (SODA, 2020)

Skeletons and Minimum Energy Scheduling. - Antonios Antoniadis 001; Gunjan Kumar; Nikhil Kumar 001 (ISAAC, 2021)

A Primal-Dual Algorithm for Multicommodity Flows and Multicuts in Treewidth-2 Graphs. - Tobias Friedrich 001; Davis Issac; Nikhil Kumar 001; Nadym Mallek; Ziena Zeif (APPROX/RANDOM, 2022)

An Approximate Generalization of the Okamura-Seymour Theorem. - Nikhil Kumar 001 (FOCS, 2022)

Integer plane multiflow maximisation: one-quarter-approximation and gaps. - Naveen Garg 001; Nikhil Kumar 001; András Sebö (Math. Program., 2022)

Approximate Max-Flow Min-Multicut Theorem for Graphs of Bounded Treewidth. - Tobias Friedrich 001; Davis Issac; Nikhil Kumar 001; Nadym Mallek; Ziena Zeif (STOC, 2023)

Nearly-Tight Bounds for Flow Sparsifiers in Quasi-Bipartite Graphs. - Syamantak Das; Nikhil Kumar 001; Daniel Vaz 001 (MFCS, 2024)

Optimal Padded Decomposition For Bounded Treewidth Graphs. - Arnold Filtser; Tobias Friedrich 001; Davis Issac; Nikhil Kumar 001; Hung Le 001; Nadym Mallek; Ziena Zeif (CoRR, 2024)