Publications in collaboration with researchers from Graz University of Technology (18)

2018

  1. Bishellable drawings of K n

    SIAM Journal on Discrete Mathematics, Vol. 32, Núm. 4, pp. 2482-2492

  2. Holes in 2-convex point sets

    Computational Geometry: Theory and Applications, Vol. 74, pp. 38-49

  3. Holes in 2-convex point sets

    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

2015

  1. Empty Triangles in Good Drawings of the Complete Graph

    Graphs and Combinatorics, Vol. 31, Núm. 2, pp. 335-345

2014

  1. Non-shellable drawings of Kn with few crossings

    26th Canadian Conference on Computational Geometry, CCCG 2014

  2. On k-convex point sets

    Computational Geometry: Theory and Applications, Vol. 47, Núm. 8, pp. 809-832

  3. Shellable Drawings and the Cylindrical Crossing Number of Kn

    Discrete and Computational Geometry, Vol. 52, Núm. 4, pp. 743-753

2013

  1. Blocking Delaunay triangulations

    Computational Geometry: Theory and Applications

  2. Flip Graphs of Bounded Degree Triangulations

    Graphs and Combinatorics, Vol. 29, Núm. 6, pp. 1577-1593

  3. More on the crossing number of Kn: Monotone drawings

    Electronic Notes in Discrete Mathematics, Vol. 44, pp. 411-414

  4. The 2-Page Crossing Number of Kn

    Discrete and Computational Geometry, Vol. 49, Núm. 4, pp. 747-777

2012

  1. On k-convex polygons

    Computational Geometry: Theory and Applications, Vol. 45, Núm. 3, pp. 73-87

  2. The 2-page crossing number of K n

    Proceedings of the Annual Symposium on Computational Geometry

2010

  1. Blocking delaunay triangulations

    Proceedings of the 22nd Annual Canadian Conference on Computational Geometry, CCCG 2010

2009

  1. Flip Graphs of Bounded-Degree Triangulations

    Electronic Notes in Discrete Mathematics, Vol. 34, pp. 509-513

  2. New results on lower bounds for the number of (≤ k)-facets

    European Journal of Combinatorics, Vol. 30, Núm. 7, pp. 1568-1574

2007

  1. New lower bounds for the number of (≤ k)-edges and the rectilinear crossing number of Kn

    Discrete and Computational Geometry, Vol. 38, Núm. 1, pp. 1-14

  2. New results on lower bounds for the number of (≤ k)-facets. (extended abstract)

    Electronic Notes in Discrete Mathematics, Vol. 29, Núm. SPEC. ISS., pp. 189-193