Sepideh Aghamolaei: Fault Tolerant Clustering Revisited. By Kumar and Raichel. CCCG 2013.
Sattar Sattari: On k-Enclosing Objects in a Coloured Point Set. By Luis Barba et al. CCCG 2013.
Navid Jalalmanesh: Maximum-Weight Planer Boxes in O(n^2). By Barbay, Chan, Navarro, and Lantero. CCCG 2013.
Nazanin Alipour: The Unified Segment Tree and its Application to the Rectangle Intersection Problem. By Wagner. CCCG 2013.
Khadijeh Mashayekh: Connecting two trees with optimal routing cost. By Kao, Katz, Krug, and Lee. CCCG 2011.
Mehrdad Jafari Giv: One Round Discrete Voronoi Game in R^2 in Presence of existing facilities. By Banik, Bhattacharya, Das, and Mukherjee. CCCG 2013.
Mehdi Kharrati-Zadeh: Set-Difference Range Queries. By Eppstein, Goodrich and Simons. CCCG 2013.
Mohammad Abouei: Optimal Data Structures for Farthest-Point Queries in Cactus Networks. By Bose, de Carufel, Grimm, Maheshwari and Smid. CCCG 2013.
Soheil Behnezhad and Mahsa Derakhshan: Geometric Red-Blue Set Cover for Unit Squares and Related Problems. By Chan and Hu. CCCG 2013.
Mohammadamin Beiruti: An Efficient Exact Algorithm for the Natural Wireless Localization Problem, By Crepaldi, de Rezende and de Souza. CCCG 2013.
Saeed Haratian: Bounding the Locus of the Center of Mass for a Part with Shape Variation. By Panahi and van der Stappen. CCCG 2013.
Seyed Amir Hosseini Baghayi: Faster approximation for Symmetric Min-Power Broadcast. By Calinescu. CCCG 2013.
Fatemeh Bahari: Theta-3 is connected. By Aichholzer et al., CCCG 2013.
Farzaneh Siampour: Convexifying Polygons Without Losing Visibilities. by Aichholzer, Aloupis and Demaine. CCCG 2011.
Hassan Hafez: Minimum Many-to-Many Matchings for Computing the Distance Between Two Sequences. By Mohamad, Rappaport, and Toussaint. CCCG 2011.
Khadije Sheikhan and Arya Rezaie: Map Folding. By Nishat and Whitesides. CCCG 2013.
Ahmad AsghariyanRezayi: An Optimal Algorithm Computing Edge-to-Edge Visibility in a Simple Polygon. By Abrahamsen. CCCG 2013.
Mirmahdi Rahgoshai: Staying Close to Curve. By Maneshwari, Sack, Shahbaz, and Zarrabi-Zadeh. CCCG 2011.
Saeed Karimi: Memory-constrained Algorithms for shortest path problems. By Asano and Doerr. CCCG 2011.
Behnam Hatami: Planar Convex Hull Range Query and Related Problems. By Jatin, Agarwal, and Kothapalli. CCCG 2013.
Saeid Mahloujifar and Ashkan Bashardoost: xy-Monotone Path Existence Queries in a Rectilinear Environment. By Bint, Maheshwari and Smid. CCCG 2012.
Davood Mohammadifar: Spanning Colored Points with Intervals. By Khanteimouri, Mohades, Abam, and Kazemi. CCCG 2013.
Sadegh Ramezanpour: Approximation Algorithms for a Triangle Enclosure Problem. By Douieb, Eastman, Maheshwari and Smid. CCCG 2011.
Rahim Fereydooni: Divide-and-Conquer 3D Convex Hulls on the GPU. By White and Wortman. CCCG 2012.
Amir-Hossein Shahriari: Cell-Paths in Mono- and Bichromatic Line Arrangements in the Plane. By Aichholzer et al. CCCG 2013.