selected publications

• article

  • On ≤ k-Edges, Crossings, and Halving Lines of Geometric Drawings of K n.  Discrete and Computational Geometry.  48:192-215. 2012-01-01
  • Visibility-preserving convexifications using single-vertex moves.  Information Processing Letters.  112:161-163. 2012-01-01
  • Point sets that minimize (≤k)-edges, 3-decomposable drawings, and the rectilinear crossing number of K30.  Discrete Mathematics.  311:1646-1657. 2011-01-01
  • 3-symmetric and 3-decomposable geometric drawings of Kn.  Discrete Applied Mathematics.  158:1240-1258. 2010-01-01

• conference paper

  • Convexifying monotone polygons while maintaining internal visibility.  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 98-108. 2012-01-01