selected publications

• article

  • Maximum rectilinear convex subsets.  SIAM Journal on Computing.  50:145-170. 2021-01-01
    
  • On k-gons and k-holes in point sets.  Computational Geometry: Theory and Applications.  48:528-537. 2015-01-01
    
  • 4-Holes in point sets.  Computational Geometry: Theory and Applications.  47:644-650. 2014-01-01
    
  • On the connectedness and diameter of a geometric Johnson Graph.  Discrete Mathematics and Theoretical Computer Science.  15:21-30. 2013-01-01
  • A note on harmonic subgraphs in labelled geometric graphs.  Information Processing Letters.  105:98-102. 2008-01-01
  Simple Euclidean arrangements with no (≥ 5)-gons.  Discrete and Computational Geometry.  38:595-603. 2007-01-01
  On the length of longest alternating paths for multicoloured point sets in convex position.  Discrete Mathematics.  306:1791-1797. 2006-01-01
  On the intersection number of matchings and minimum weight perfect matchings of multicolored point sets.  Graphs and Combinatorics.  21:333-341. 2005-01-01
  Morelia test: Improving the efficiency of the Gabriel test and face routing in ad-hoc networks.  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics).  3104:23-34. 2004-01-01
  ... more

• conference paper

  • Maximum Rectilinear Convex Subsets.  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 274-291. 2019-01-01
  • 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
  • On k-gons and k-holes in point sets.  Proceedings of the 23rd Annual Canadian Conference on Computational Geometry, CCCG 2011. -. 2011-01-01
  • Local 7-coloring for planar subgraphs of unit disk graphs.  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 170-181. 2008-01-01
  • Local algorithms for dominating and connected dominating sets of unit disk graphs with location aware nodes.  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 158-169. 2008-01-01
  Spanning trees of multicoloured point sets with few intersections.  Lecture Notes in Computer Science. 113-122. 2005-01-01
  ... more