هندسه_ی_محاسباتی_پیشرفته:نیم_سال_دوم_۹۲-۹۳

هندسه‌ی محاسباتی پیشرفته

نیم‌سال دوم ۹۲-۹۳

فهرست پروژه‌های پژوهشی

  • Sepideh Aghamolaie: Net and prune: a linear time algorithm for Euclidean distance problems. By Sariel Har-Peled and Benjamin Adam Raichel. STOC 2013.
  • Sattar Sattari: Linear-Time Algorithms for Geometric Graphs with Sublinearly Many Crossings. By Eppstein et al. SODA 2009.
  • Mohammad Abooei: (1 + ε)-Approximation for Facility Location in Data Streams. By A. Czumaj, C. Lammersen, M. Monemizadeh, and C. Sohler. SODA 2013.
  • Sima Aghai: Better ε-dependencies for offline approximate nearest neighbor search, Euclidean minimum spanning trees, and ε-kernels. By Sunil Arya and Timothy M. Chan. SoCG 2014.
  • Navid Assadian: Approximation algorithms for bipartite matching with metric and geometric costs. By Pankaj Agarwal and R. Sharathkumar. STOC 2014.
  • Mirmahdi Rahgoshai: Conflict-free coloring of points with respect to rectangles and approximation algorithms for discrete independent set. By Timothy M. Chan. SoCG 2012.
  • Saeid Haratian: Klee's measure problem made easy. By Timothy Chan. FOCS 2013.
  • Behnam Hatami: A Dynamic Data Structure for Approximate Range Searching. By David Mount and Eunhui Park. SoCG 2010.
  • Masood Seddighin: Diverse Near Neighbor Problem. By Sofiane Abbar, Sihem Amer-YahiaCNRS, Piotr Indyk, Sepideh Mahabadi, and Kasturi R. Varadarajan. SoCG 2013.
  • Mohammadamin Beiruti: A Constant-Factor Approximation for Multi-Covering with Disks. By Santanu Bhowmick, Kasturi Varadarajan, and Shi-Ke Xue. SoCG 2013.
  • Farzaneh Siampour: Streaming algorithms for extent problems in high dimensions. By Pankaj Agarwal and R. Sharathkumar. SODA 2010.
  • Mehrdad Jafari Giv: An optimal randomized algorithm for maximum Tukey depth. By Timothy Chan. SODA 2004.
  • Amir hossein Shahriari: Well-separated pair decomposition in linear time? By Timothy Chan. IPL 2008.
هندسه_ی_محاسباتی_پیشرفته/نیم_سال_دوم_۹۲-۹۳.txt · آخرین ویرایش: 2020/03/02 02:54 (ویرایش خارجی)