selected publications

• article

  • The complexity of computing the cylindrical and the t-circle crossing number of a graph.  Electronic Journal of Combinatorics.  25:-. 2018-01-01
  • On the Pseudolinear Crossing Number.  Journal of Graph Theory.  84:297-310. 2017-01-01
  • On the Decay of Crossing Numbers of Sparse Graphs.  Journal of Graph Theory.  80:226-251. 2015-01-01
  • The Erdos-Sós conjecture for geometric graphs.  Discrete Mathematics and Theoretical Computer Science.  15:93-100. 2013-01-01
  • 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
  • There is a unique crossing-minimal rectilinear drawing of K18.  Electronic Notes in Discrete Mathematics.  38:547-552. 2011-01-01
  • 3-symmetric and 3-decomposable geometric drawings of Kn.  Discrete Applied Mathematics.  158:1240-1258. 2010-01-01
  • A central approach to bound the number of crossings in a generalized configuration.  Electronic Notes in Discrete Mathematics.  30:273-278. 2008-01-01
  • An extended lower bound on the number of (≤ k)-edges to generalized configurations of points and the pseudolinear crossing number of Kn.  Journal of Combinatorial Theory. Series A.  115:1257-1264. 2008-01-01
  • On the additivity of crossing numbers of graphs.  Journal of Knot Theory and its Ramifications.  17:1043-1050. 2008-01-01
  • The crossing number of a projective graph is quadratic in the face - Width.  Electronic Journal of Combinatorics.  15:-. 2008-01-01
  • The maximum number of halving lines and the rectilinear crossing number of Kn for n ≤ 27.  Electronic Notes in Discrete Mathematics.  30:261-266. 2008-01-01
  • Simple Euclidean arrangements with no (≥ 5)-gons.  Discrete and Computational Geometry.  38:595-603. 2007-01-01
  • The convex hull of every optimal pseudolinear drawing of kn is a triangle.  Australasian Journal of Combinatorics.  38:155-162. 2007-01-01
  • The crossing number of a projective graph is quadratic in the face-width.  Electronic Notes in Discrete Mathematics.  29:219-223. 2007-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
  • Spanning trees of multicoloured point sets with few intersections.  Lecture Notes in Computer Science. 113-122. 2005-01-01