default search action
Neeraj Kumar 0004
Person information
- affiliation: University of California, Santa Barbara, CA, USA
- affiliation: University of Waterloo, Canada
Other persons with the same name
- Neeraj Kumar — disambiguation page
- Neeraj Kumar 0001
(aka: Neeraj Kumar Nehra) — Thapar Institute of Engineering and Technology, Computer Science and Engineering Department, Patiala, India (and 1 more)
- Neeraj Kumar 0002
- Neeraj Kumar 0003 — SnappyData Inc, Pune, India
- Neeraj Kumar 0005
- Neeraj Kumar 0006 — University of Washington, Seattle, WA, USA (and 2 more)
- Neeraj Kumar 0008
- Neeraj Kumar 0009
- Neeraj Kumar 0010
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c10]Neeraj Kumar, Pol Mauri Ruiz, Vijay Menon, Igor Kabiljo, Mayank Pundir, Andrew Newell, Daniel Lee, Liyuan Wang, Chunqiang Tang:
Optimizing Resource Allocation in Hyperscale Datacenters: Scalability, Usability, and Experiences. OSDI 2024: 507-528 - 2023
- [i5]Chang-Lin Chen, Hanhan Zhou, Jiayu Chen, Mohammad Pedramfar, Vaneet Aggarwal, Tian Lan, Zheqing Zhu, Chi Zhou, Tim Gasser, Pol Mauri Ruiz, Vijay Menon, Neeraj Kumar, Hongbo Dong:
Two-tiered Online Optimization of Region-wide Datacenter Resource Allocation via Deep Reinforcement Learning. CoRR abs/2306.17054 (2023) - 2022
- [j3]Neeraj Kumar
The maximum exposure problem. Comput. Geom. 104: 101861 (2022) - [c9]Neeraj Kumar, Daniel Lokshtanov, Saket Saurabh, Subhash Suri, Jie Xue
Point Separation and Obstacle Removal by Finding and Hitting Odd Cycles. SoCG 2022: 52:1-52:14 - [i4]Neeraj Kumar, Daniel Lokshtanov, Saket Saurabh, Subhash Suri, Jie Xue:
Point Separation and Obstacle Removal by Finding and Hitting Odd Cycles. CoRR abs/2203.08193 (2022) - 2021
- [c8]Neeraj Kumar, Daniel Lokshtanov, Saket Saurabh, Subhash Suri:
A Constant Factor Approximation for Navigating Through Connected Obstacles in the Plane. SODA 2021: 822-839 - [i3]Neeraj Kumar, Stavros Sintos, Subhash Suri:
The Maximum Exposure Problem. CoRR abs/2102.03455 (2021) - 2020
- [b1]Neeraj Kumar:
Geometric Constraint Removal and Related Problems. University of California, Santa Barbara, USA, 2020 - [j2]John Hershberger, Neeraj Kumar
Shortest Paths in the Plane with Obstacle Violations. Algorithmica 82(7): 1813-1832 (2020) - [j1]Sayan Bandyapadhyay, Neeraj Kumar
Improved approximation bounds for the minimum constraint removal problem. Comput. Geom. 90: 101650 (2020) - [i2]Neeraj Kumar, Daniel Lokshtanov, Saket Saurabh, Subhash Suri:
A Constant Factor Approximation for Navigating Through Connected Obstacles in the Plane. CoRR abs/2011.14463 (2020)
2010 – 2019
- 2019
- [c7]Neeraj Kumar, Stavros Sintos, Subhash Suri:
The Maximum Exposure Problem. APPROX-RANDOM 2019: 19:1-19:20 - [c6]Neeraj Kumar:
Computing a Minimum Color Path in Edge-Colored Graphs. SEA² 2019: 35-50 - 2018
- [c5]Sayan Bandyapadhyay, Neeraj Kumar, Subhash Suri, Kasturi R. Varadarajan:
Improved Approximation Bounds for the Minimum Constraint Removal Problem. APPROX-RANDOM 2018: 2:1-2:19 - [c4]Pankaj K. Agarwal, Neeraj Kumar, Stavros Sintos, Subhash Suri:
Computing Shortest Paths in the Plane with Removable Obstacles. SWAT 2018: 5:1-5:15 - 2017
- [c3]John Hershberger, Neeraj Kumar, Subhash Suri:
Shortest Paths in the Plane with Obstacle Violations. ESA 2017: 49:1-49:14 - 2016
- [c2]Martin Fink, Neeraj Kumar, Subhash Suri:
Counting Convex k-gons in an Arrangement of Line Segments. CCCG 2016: 155-160 - 2015
- [i1]Therese Biedl, Sebastian Fischmeister, Neeraj Kumar:
DAG-width of Control Flow Graphs with Applications to Model Checking. CoRR abs/1503.00793 (2015) - 2014
- [c1]Mohammad Mehdi Zeinali Zadeh, Mahmoud Salem, Neeraj Kumar, Greta Cutulenco, Sebastian Fischmeister:
SiPTA: Signal processing for trace-based anomaly detection. EMSOFT 2014: 6:1-6:10
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-30 20:32 CET 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: