Postdoctoral Researcher

Dept. of Combinatorics & Optimization

University of Waterloo, Canada

Office: MC 5467

E-mail: nikhil.kumar2@uwaterloo.ca

Research Interests

Theoretical Computer Science, Graph Theory, Combinatorial Optimization, Approximation Algorithms

Publications

- Approximate Max-Flow Min-Multicut Theorem for Graphs of Bounded Treewidth
with Davis Issac, Nadym Mallek and Ziena Zeif

**STOC 2023** - An Approximate Generalization of the Okamura-Seymour Theorem
**FOCS 2022** - A Primal-Dual Algorithm for Multicommodity Flows and Multicuts in Treewidth-2 Graphs
with Davis Issac, Nadym Mallek and Ziena Zeif

**APPROX 2022** - Skeletons and Minimum Energy Scheduling
with Antonios Antoniadis and Gunjan Kumar

**ISAAC 2021** - Multicommodity Flows in Planar Graphs with Demands on Faces
**ISAAC 2020** - Dual Half-Integrality for Uncrossable Cut Cover and Its Application to Maximum Half-Integral Flow
with Naveen Garg

**ESA 2020** - Integer Plane Multiflow Maximisation: One-Quarter-Approximation and Gaps
with Naveen Garg and András Sebő

**IPCO 2020**(Journal: Math Programming) - A Constant Factor Approximation for Capacitated Min-Max Tree Cover
with Syamantak Das and Lavina Jain

**APPROX 2020** -
Parallel Machine Scheduling to Minimize Energy Consumption
with Antonios Antoniadis, Naveen Garg and Gunjan Kumar

**SODA 2020** -
Some Problems Concerning the Frobenius Number for Extensions of an Arithmetic Progression
with Sanjit Singh Batra & Amitabha Tripathi

**The Ramanujan Journal** -
On a Linear Diophantine Problem Involving the Fibonacci and Lucas Sequences
with Sanjit Singh Batra and Amitabha Tripathi

**Integers: Electronic Journal of Combinatorial Number Theory**

Brief Bio

Last modified: September, 2023.