Nikhil Kumar

Publication Activity (10 Years)

Years Active: 2015-2024
Publications (10 Years): 18

Top Topics

Monadic Datalog

Bounded Treewidth

Top Venues

Publications

Syamantak Das, Nikhil Kumar, Daniel Vaz
Nearly-Tight Bounds for Flow Sparsifiers in Quasi-Bipartite Graphs. CoRR (2024)
Syamantak Das, Nikhil Kumar, Daniel Vaz
Nearly-Tight Bounds for Flow Sparsifiers in Quasi-Bipartite Graphs. MFCS (2024)
Arnold Filtser, Tobias Friedrich, Davis Issac, Nikhil Kumar, Hung Le, Nadym Mallek, Ziena Zeif
Optimal Padded Decomposition For Bounded Treewidth Graphs. CoRR (2024)
Tobias Friedrich, Davis Issac, Nikhil Kumar, Nadym Mallek, Ziena Zeif
Approximate Max-Flow Min-Multicut Theorem for Graphs of Bounded Treewidth. STOC (2023)
Naveen Garg, Nikhil Kumar, András Sebö
Integer plane multiflow maximisation: one-quarter-approximation and gaps. Math. Program. 195 (1) (2022)
Tobias Friedrich, Davis Issac, Nikhil Kumar, Nadym Mallek, Ziena Zeif
Approximate Max-Flow Min-Multicut Theorem for Graphs of Bounded Treewidth. CoRR (2022)
Antonios Antoniadis, Gunjan Kumar, Nikhil Kumar
Skeletons and Minimum Energy Scheduling. CoRR (2021)
Antonios Antoniadis, Gunjan Kumar, Nikhil Kumar
Skeletons and Minimum Energy Scheduling. ISAAC (2021)
Naveen Garg, Nikhil Kumar, András Sebö
Integer Plane Multiflow Maximisation: Flow-Cut Gap and One-Quarter-Approximation. IPCO (2020)
Nikhil Kumar
Multicommodity Flows in Planar Graphs with Demands on Faces. CoRR (2020)
Naveen Garg, Nikhil Kumar
Dual Half-Integrality for Uncrossable Cut Cover and Its Application to Maximum Half-Integral Flow. ESA (2020)
Antonios Antoniadis, Naveen Garg, Gunjan Kumar, Nikhil Kumar
Parallel Machine Scheduling to Minimize Energy Consumption. SODA (2020)
Naveen Garg, Nikhil Kumar, András Sebö
Integer Plane Multiflow Maximisation: Flow-Cut Gap and One-Quarter-Approximation. CoRR (2020)
Naveen Garg, Nikhil Kumar
Dual Half-integrality for Uncrossable Cut Cover and its Application to Maximum Half-Integral Flow. CoRR (2020)
Syamantak Das, Lavina Jain, Nikhil Kumar
A Constant Factor Approximation for Capacitated Min-Max Tree Cover. APPROX-RANDOM (2020)
Nikhil Kumar
Multicommodity Flows in Planar Graphs with Demands on Faces. ISAAC (2020)
Antonios Antoniadis, Naveen Garg, Gunjan Kumar, Nikhil Kumar
Parallel Machine Scheduling to Minimize Energy Consumption. CoRR (2019)
Syamantak Das, Lavina Jain, Nikhil Kumar
A Constant Factor Approximation for Capacitated Min-Max Tree Cover. CoRR (2019)
Sanjit Singh Batra, Nikhil Kumar, Amitabha Tripathi
On a Linear Diophantine Problem Involving the Fibonacci and Lucas Sequences. Integers 15 (2015)