Nikhil Kumar

Orcid: 0000-0001-8634-6237

Affiliations:
  • University of Waterloo, ON, Canada
  • University of Potsdam, Hasso Plattner Institute, Germany (former)
  • Indian Institute of Technology Delhi, India (former)


According to our database1, Nikhil Kumar authored at least 13 papers between 2015 and 2024.

Collaborative distances:

Timeline

2015
2016
2017
2018
2019
2020
2021
2022
2023
2024
0
1
2
3
4
5
6
1
1
1
1
1
2
1
5

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Optimal Padded Decomposition For Bounded Treewidth Graphs.
CoRR, 2024

Nearly-Tight Bounds for Flow Sparsifiers in Quasi-Bipartite Graphs.
Proceedings of the 49th International Symposium on Mathematical Foundations of Computer Science, 2024

2023
Approximate Max-Flow Min-Multicut Theorem for Graphs of Bounded Treewidth.
Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023

2022
Integer plane multiflow maximisation: one-quarter-approximation and gaps.
Math. Program., 2022

An Approximate Generalization of the Okamura-Seymour Theorem.
Proceedings of the 63rd IEEE Annual Symposium on Foundations of Computer Science, 2022

A Primal-Dual Algorithm for Multicommodity Flows and Multicuts in Treewidth-2 Graphs.
Proceedings of the Approximation, 2022

2021
Skeletons and Minimum Energy Scheduling.
Proceedings of the 32nd International Symposium on Algorithms and Computation, 2021

2020
Parallel Machine Scheduling to Minimize Energy Consumption.
Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

Multicommodity Flows in Planar Graphs with Demands on Faces.
Proceedings of the 31st International Symposium on Algorithms and Computation, 2020

Integer Plane Multiflow Maximisation: Flow-Cut Gap and One-Quarter-Approximation.
Proceedings of the Integer Programming and Combinatorial Optimization, 2020

Dual Half-Integrality for Uncrossable Cut Cover and Its Application to Maximum Half-Integral Flow.
Proceedings of the 28th Annual European Symposium on Algorithms, 2020

A Constant Factor Approximation for Capacitated Min-Max Tree Cover.
Proceedings of the Approximation, 2020

2015
On a Linear Diophantine Problem Involving the Fibonacci and Lucas Sequences.
Integers, 2015


  Loading...