Minkyoung Cho Ph.D. Computer Science Department University of Maryland College Park, MD 20742   Email : minkcho@cs.umd.edu

Publications

• Minkyoung Cho, David M. Mount, and Eunhui Park
  Maintaining Nets and Net Trees under Incremental Motion [presentation file]
  20th International Symposium Algorithms and Computation, ISAAC 2009, Hawaii, USA
  
• Minkyoung Cho and David M. Mount
  Embedding and Similarity Search for Point Sets under Translation, [presentation file]
  24th Annual Symposium on Computational Geometry, SoCG 2008, Maryland, USA
  
• Minkyoung Cho and David M. Mount
  Improved Approximation Bounds for Planar Point Pattern Matching
  Algorithmica, Volume 50, Number 2, February, 2008.
  
• Minkyoung Cho and David M. Mount
  Improved Approximation Bounds for Planar Point Pattern Matching, [presentation file]
  Proc. Workshop on Algorithms and Data Structures, WADS 2005, Waterloo, Canada

Education

• Ph.D, Computer Science, University of Maryland at College Park, USA, 2010
• B.S. Computer Engineering, Seoul National University, South Korea, 1999

Activities

• Capital Area Theory Seminar (CATS)
• KGSYS (Korean Graduate Students System Research Group in CS@UMD)
• KGVISA (Vision and AI Research Group Korean Graduate Students in CS@UMD)