Neeraj Kumar
Ph.D from UC Santa Barbara
17.neeraj.s [at] gmail.com
NOTE: My UCSB email neeraj at cs.ucsb.edu is no longer active, please use my gmail

I graduated from UC Santa Barbara with a PhD in Computer Science in March 2020. These days I work for Meta.

At UCSB, I was fortunate to work with Prof. Subhash Suri on some shortest path problems involving graphs and geometry. Please see the list of papers below for more details on my research. Prior to joining UCSB, I spent two amazing years at School of Computer Science, University of Waterloo (Link to Master's thesis) In past (2010-13), I have worked as a software Engineer at Emulation Division of Mentor Graphics. In distant past (2010), I had recieved my bachelors degree in Computer Science from IIT(BHU), Varanasi.

Publications

1. Point Separation and Obstacle Removal by Finding and Hitting Odd Cycles [ Paper | Slides ]
   
   with Daniel Lokshtanov, Saket Saurabh, Subhash Suri and Jie Xue
   In Symposium on Computational Geometry(SoCG'22) .
   
    
2. A Constant Factor Approximation for Navigating Through Connected Obstacles in the Plane [ Paper | Slides ]
   
   with Daniel Lokshtanov, Saket Saurabh and Subhash Suri
   In Symposium on Discrete Algorithms (SODA'21) .
   
    
3. The Maximum Exposure Problem [ Paper | Slides ]
   
   with Stavros Sintos and Subhash Suri
   In 22nd International Conference on Approximation Algorithms for Combinatorial Optimization Problems (APPROX'2019) , MIT, USA.
   
   Full version appeared in journal Computational Geometry: Theory and Applications
    
4. Computing a Minimum Color Path in Edge-Colored Graphs [ Paper | Slides ]
   
   In 18th International Symposium on Experimental Algorithms (SEA 2019) , Kalamata, Greece.
   
    
5. Improved Approximation Bounds for the Minimum Constraint Removal Problem [ Paper | Slides ]
   
   with Sayan Bandyapadhyaya, Subhash Suri and Kasturi Varadrajan
   In 21st International Conference on Approximation Algorithms for Combinatorial Optimization Problems (APPROX'2018) , Princeton, USA.
   
   Full version appeared in Computational Geometry: Theory and Applications.
   
    
6. Computing Shortest Paths in the Plane with Removable Obstacles [ Paper | Slides ]
   
   with Pankaj Agarwal, Stavros Sintos and Subhash Suri
   In Scandinavian Symposium and Workshops on Algorithm Theory (SWAT), 2018 , Malmö, Sweden.
   
    
7. Shortest Paths in the Plane with Obstacle Violations [ Paper | Slides ]
   
   with John Hershberger and Subhash Suri
   In European Symposium on Algorithms (ESA), 2017 , Vienna, Austria.
   
   Full version appeared in Algorithmica.
   
    
8. Counting Convex k-gons in an Arrangement of Line Segments [ Paper | Slides ]
   
   with Martin Fink and Subhash Suri
   In 28th Canadian Conference on Computational Geometry (CCCG '16), Vancouver, Canada.
   
    
9. SiPTA: Signal processing for trace-based anomaly detection [ Link to Paper ]
   
   MMZ Zadeh, M Salem, N Kumar, G Cutulenco and S Fischmeister, In EMSOFT, New Delhi, India, 2014.

Here is a link to my profile on Google Scholar.

Some more information on my past projects (and papers) can be found here.

Please also have a look at some linux tips I have compiled, or deviate a bit to see this.