How Fast Is the k-Means Method? - Sariel Har-Peled; Bardia Sadri (Algorithmica, 2005)

Surface and Medial Axis Topology Through Distance Flows Induced by Discrete Samples - Bardia Sadri (2006)

Geometric and topological guarantees for the WRAP reconstruction algorithm. - Edgar A. Ramos; Bardia Sadri (SODA, 2007)

I/o-efficient efficient algorithms for computing contours on a terrain. - Pankaj K. Agarwal; Lars Arge; Thomas Mølhave; Bardia Sadri (SCG, 2008)

Untangling triangulations through local explorations. - Pankaj K. Agarwal; Bardia Sadri; Hai Yu 005 (SCG, 2008)

Critical Points of Distance to an epsilon-Sampling of a Surface and Flow-Complex-Based Surface Reconstruction. - Tamal K. Dey; Joachim Giesen; Edgar A. Ramos; Bardia Sadri (Int. J. Comput. Geom. Appl., 2008)

Medial Axis Approximation and Unstable Flow Complex. - Joachim Giesen; Edgar A. Ramos; Bardia Sadri (Int. J. Comput. Geom. Appl., 2008)

Manifold Homotopy via the Flow Complex. - Bardia Sadri (Comput. Graph. Forum, 2009)

Lipschitz Unimodal and Isotonic Regression on Paths and Trees. - Pankaj K. Agarwal; Jeff M. Phillips; Bardia Sadri (LATIN, 2010)

I/O-Efficient Contour Queries on Terrains. - Pankaj K. Agarwal; Thomas Mølhave; Bardia Sadri (SODA, 2011)

Flow-complex-based shape reconstruction from 3D curves. - Bardia Sadri; Karan Singh (ACM Trans. Graph., 2014)