- Compact linear programs for 2SATejc, 80:17-22, 2019. [doi]
- Polynomial size linear programs for problems in PDAM, 265:22-39, 2019. [doi]

- On the ℋ-free extension complexity of the TSPol, 11(3):445-455, 2017. [doi]
- Extension complexities of Cartesian products involving a pyramidipl, 128:11-13, 2017. [doi]

- On the extension complexity of combinatorial polytopesmp, 153(1):95-115, 2015. [doi]
- A generalization of extension complexity that captures Pipl, 115(6-8):588-593, 2015. [doi]

- A proof of the Oja depth conjecture in the planecomgeo, 47(6):668-674, 2014. [doi]
- On the largest convex subsets in Minkowski sumsipl, 114(8):405-407, 2014. [doi]

- Complexity of approximating the vertex centroid of a polyhedronTCS, 421:56-61, 2012. [doi]
- Extended Formulations, Nonnegative Factorizations, and Randomized Communication Protocolsiscopt 2012: 129-140 [doi]
- Extended Formulations for Polygonsdcg, 48(3):658-668, 2012. [doi]
- Linear vs. semidefinite extended formulations: exponential separation and strong lower boundsstoc 2012: 95-106 [doi]
- Largest inscribed rectangles in convex polygonsjda, 13:78-85, 2012. [doi]

- The negative cycles polyhedron and hardness of checking some polyhedral propertiesanor, 188(1):63-76, 2011. [doi]
- On a cone covering problemcomgeo, 44(3):129-134, 2011. [doi]

- On the Hardness of Computing Intersection, Union and Minkowski Sum of Polytopesdcg, 40(3):469-479, 2008. [doi]