Neeraj Kumar

Orcid: 0000-0001-9356-526X

Affiliations:
  • University of California, Santa Barbara, CA, USA
  • University of Waterloo, Canada


According to our database1, Neeraj Kumar authored at least 11 papers between 2014 and 2022.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2022
The maximum exposure problem.
Comput. Geom., 2022

Point Separation and Obstacle Removal by Finding and Hitting Odd Cycles.
Proceedings of the 38th International Symposium on Computational Geometry, 2022

2021
A Constant Factor Approximation for Navigating Through Connected Obstacles in the Plane.
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

2020
Geometric Constraint Removal and Related Problems.
PhD thesis, 2020

Improved approximation bounds for the minimum constraint removal problem.
Comput. Geom., 2020

Shortest Paths in the Plane with Obstacle Violations.
Algorithmica, 2020

2019
Computing a Minimum Color Path in Edge-Colored Graphs.
Proceedings of the Analysis of Experimental Algorithms - Special Event, 2019

2018
Computing Shortest Paths in the Plane with Removable Obstacles.
Proceedings of the 16th Scandinavian Symposium and Workshops on Algorithm Theory, 2018

2016
Counting Convex k-gons in an Arrangement of Line Segments.
Proceedings of the 28th Canadian Conference on Computational Geometry, 2016

2015
DAG-width of Control Flow Graphs with Applications to Model Checking.
CoRR, 2015

2014
SiPTA: Signal processing for trace-based anomaly detection.
Proceedings of the 2014 International Conference on Embedded Software, 2014


  Loading...