Planar Support for Non-piercing regions and Applications, with Saurabh Ray, submitted (2018).
Packing and Covering with Non-piercing regions, with Aniket Basu Roy, Satish Govindarajan and Saurabh Ray, Discrete and Computational Geometry, 2018. Preliminary version appeared in ESA 2016.
On the approximability of the maximum interval constrained coloring problem, with Stefan Canzar, Amr Elmasry, and Khaled , Discrete Optimization, 2018. Preliminary version appeared in ISAAC 2010.
Constant Factor Approximation for the Weighted Partial Degree Bounded Edge Packing Problem, with Pawan Aurora and Monalisa Jena, Journal of Combinatorial Optimization, 2018. Preliminary version appeared in COCOA 2016 (invited to special issue).
Quasi-Polynomial Time Approximation Scheme for Weighted Geometric Set Cover on Pseudodisks and Halfspaces, with Nabil Mustafa, and Saurabh Ray, SIAM Journal of Computing, 2015. Preliminary version appeared in FOCS 2014, and CCCG 2014.
An SDP Primal-Dual algorithm to compute the Lovasz-Theta Function, with T.H. Hubert Chan, and Kevin Chang, Algorithmica 2014. Preliminary version appeared in ISIT 2009.
Cardinality constrained graph partitioning into cliques with submodular costs, with Jose Correa, Nicole Megow and Karol Suchan, Preliminary version appeared in CTW 2009.
On approximability of the maximum feasible subsystem with 0/1 matrices, with Khaled Elbassioni, Rene Sitters and Saurabh Ray, Preliminary version in SODA 2009.
