default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNikhil Kumar 0001
Person information
- affiliation: University of Waterloo, ON, Canada
- affiliation (former): University of Potsdam, Hasso Plattner Institute, Germany
- affiliation (former): Indian Institute of Technology Delhi, India
Other persons with the same name
- Nikhil Kumar — disambiguation page
- Nikhil Kumar 0002
![[0000-0002-7677-6038]](https://dblp1.uni-trier.de/img/orcid-mark.12x12.png "0000-0002-7677-6038")
— Shiv Nadar University, Department of Computer Science and Engineering, India - Nikhil Kumar 0003 — Defence Research and Development Organization, Dehradun, India
- Nikhil Kumar 0004 — Eindhoven University of Technology, Department of Mathematics and Computer Science, The Netherlands
- Nikhil Kumar 0005 — Birla Institute of Technology and Science, Department of Computer Science, Pilani, India
- Nikhil Kumar 0006 — Arizona State University, Tempe, AZ, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c10]Syamantak Das, Nikhil Kumar, Daniel Vaz:
Nearly-Tight Bounds for Flow Sparsifiers in Quasi-Bipartite Graphs. MFCS 2024: 45:1-45:17- [i10]Syamantak Das, Nikhil Kumar, Daniel Vaz:
Nearly-Tight Bounds for Flow Sparsifiers in Quasi-Bipartite Graphs. CoRR abs/2407.09433 (2024) - [i9]Arnold Filtser, Tobias Friedrich, Davis Issac, Nikhil Kumar, Hung Le, Nadym Mallek, Ziena Zeif:
Optimal Padded Decomposition For Bounded Treewidth Graphs. CoRR abs/2407.12230 (2024) - 2023
- [c9]Tobias Friedrich, Davis Issac, Nikhil Kumar, Nadym Mallek, Ziena Zeif:
Approximate Max-Flow Min-Multicut Theorem for Graphs of Bounded Treewidth. STOC 2023: 1325-1334 - 2022
- [j2]Naveen Garg, Nikhil Kumar, András Sebö:
Integer plane multiflow maximisation: one-quarter-approximation and gaps. Math. Program. 195(1): 403-419 (2022) - [c8]Tobias Friedrich, Davis Issac, Nikhil Kumar, Nadym Mallek, Ziena Zeif:
A Primal-Dual Algorithm for Multicommodity Flows and Multicuts in Treewidth-2 Graphs. APPROX/RANDOM 2022: 55:1-55:18 - [c7]Nikhil Kumar:
An Approximate Generalization of the Okamura-Seymour Theorem. FOCS 2022: 1093-1101 - [i8]Nikhil Kumar:
An Approximate Generalization of the Okamura-Seymour Theorem. CoRR abs/2208.00795 (2022) - [i7]Tobias Friedrich, Davis Issac, Nikhil Kumar, Nadym Mallek, Ziena Zeif:
Approximate Max-Flow Min-Multicut Theorem for Graphs of Bounded Treewidth. CoRR abs/2211.06267 (2022) - 2021
- [c6]Antonios Antoniadis, Gunjan Kumar, Nikhil Kumar:
Skeletons and Minimum Energy Scheduling. ISAAC 2021: 51:1-51:16 - [i6]Antonios Antoniadis, Gunjan Kumar, Nikhil Kumar:
Skeletons and Minimum Energy Scheduling. CoRR abs/2107.07800 (2021) - 2020
- [c5]Syamantak Das, Lavina Jain, Nikhil Kumar:
A Constant Factor Approximation for Capacitated Min-Max Tree Cover. APPROX-RANDOM 2020: 55:1-55:13 - [c4]Naveen Garg, Nikhil Kumar:
Dual Half-Integrality for Uncrossable Cut Cover and Its Application to Maximum Half-Integral Flow. ESA 2020: 55:1-55:13 - [c3]Naveen Garg, Nikhil Kumar, András Sebö:
Integer Plane Multiflow Maximisation: Flow-Cut Gap and One-Quarter-Approximation. IPCO 2020: 144-157 - [c2]Nikhil Kumar:
Multicommodity Flows in Planar Graphs with Demands on Faces. ISAAC 2020: 41:1-41:11 - [c1]Antonios Antoniadis, Naveen Garg, Gunjan Kumar, Nikhil Kumar:
Parallel Machine Scheduling to Minimize Energy Consumption. SODA 2020: 2758-2769 - [i5]Naveen Garg, Nikhil Kumar, András Sebö:
Integer Plane Multiflow Maximisation: Flow-Cut Gap and One-Quarter-Approximation. CoRR abs/2002.10927 (2020) - [i4]Nikhil Kumar:
Multicommodity Flows in Planar Graphs with Demands on Faces. CoRR abs/2007.01280 (2020) - [i3]Naveen Garg, Nikhil Kumar:
Dual Half-integrality for Uncrossable Cut Cover and its Application to Maximum Half-Integral Flow. CoRR abs/2007.14156 (2020)
2010 – 2019
- 2019
- [i2]Syamantak Das, Lavina Jain, Nikhil Kumar:
A Constant Factor Approximation for Capacitated Min-Max Tree Cover. CoRR abs/1907.08304 (2019) - [i1]Antonios Antoniadis, Naveen Garg, Gunjan Kumar, Nikhil Kumar:
Parallel Machine Scheduling to Minimize Energy Consumption. CoRR abs/1909.13345 (2019) - 2015
- [j1]Sanjit Singh Batra, Nikhil Kumar, Amitabha Tripathi:
On a Linear Diophantine Problem Involving the Fibonacci and Lucas Sequences. Integers 15: A26 (2015)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-10 22:19 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
