Steven Bitner's Home Page

Me at Shiraikaigen Cliffs; Iwate Prefecture, Japan

Resume  /  CV

Education

  • Doctor of Philosophy in Computer Science from the University of Texas at Dallas, August 2010
  • Master of Science in Computer Science from The University of Texas at Dallas, May 2008
  • Bachelor of Science in Computer Science from Texas State University - San Marcos, May 2006

Research interests

  • Computational Geometry
  • Algorithms and Optimization

Publications

  1. "Minimum separating circle for bichromatic points in the plane", S. Bitner, Y. K. Cheung, O. Daescu. 7th Annual Symposium on Voronoi Diagrams, pp. 50-55, June 2010.
  2. "Visiting a Sequence of Points with a Bevel-Tip Needle", S. Bitner, Y. K. Cheung, A. F. Cook IV, O. Daescu, A. Kurdia and C. Wenk. 9th Latin American Theoretical Informatics Symposium, pp.492-502, April 2010.
  3. "Finding a minimum-sum dipolar spanning tree in R3 ", S. Bitner and O. Daescu. Computational Geometry: Theory & Applications, accepted, March 2010.
  4. "Farthest Segments and Extremal Triangles Spanned by Points in R3 ", S. Bitner and O. Daescu. Information Processing Letters, Vol. 109, Issue 20, pp. 1167-1171, September 2009
  5. "Finding a minimum-sum dipolar spanning tree in R3 ", S. Bitner and O. Daescu. Proceedings of the 41st Annual Hawaii International Conference on System Sciences, pp.469-474, January 2008.
  6. "Minimum-sum dipolar spanning tree for points in R3 ", S. Bitner and O. Daescu. Proceedings of the 19th Annual Canadian Conference on Computational Geometry, pp. 81-84, August 2007.
  7. "Finding segments and triangles spanned by points in R3 ", S. Bitner and O. Daescu. Proceedings of the 19th Annual Canadian Conference on Computational Geometry, pp.17-20, August 2007.

Other interests

Contact information

Email: stevenbitner@gmail.com