Neeraj Kumar
PhD Candidate at University of California, Santa Barbara
neeraj [at]

Currently, I am a PhD student at University of California, Santa Barbara working with Prof. Subhash Suri. My research interests lie in algorithms and complexity, specifically in problems involving graphs and/or geometry. 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.

  1. Computing a Minimum Color Path in Edge-Colored Graphs [ Paper | Slides ]

    In 18th International Symposium on Experimental Algorithms (SEA 2019) , Kalamata, Greece.

  2. 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.

  3. 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.

  4. 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.

  5. 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.  

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.