selected scholarly activity
-
conferences
- Towards Reliable Memory Management for Python Native Extensions. Proceedings of the 18th ACM International Workshop on Implementation, Compilation, Optimization of OO Languages, Programs and Systems. 15-26. 2023
- Approximate data depth revisited. Proceedings of the 30th Canadian Conference on Computational Geometry, CCCG 2018. 272-281. 2018
- Fusing method handle graphs for efficient dynamic JVM language implementations. Proceedings of the 9th ACM SIGPLAN International Workshop on Virtual Machines and Intermediate Languages. 18-27. 2017
- On the planar spherical depth and lens depth. CCCG 2017 - 29th Canadian Conference on Computational Geometry, Proceedings. 43-49. 2017
- MHDeS. Proceedings of the 11th Workshop on Implementation, Compilation, Optimization of Object-Oriented Languages, Programs and Systems. 1-10. 2016
- Monotone Simultaneous Embeddings of Paths in d Dimensions. Lecture Notes in Computer Science. 546-553. 2016
- Mining Method Handle Graphs for Efficient Dynamic JVM Languages. Proceedings of the Principles and Practices of Programming on The Java Platform. 159-169. 2015
- Metis. Proceedings of the 10th Workshop on Implementation, Compilation, Optimization of Object-Oriented Languages, Programs and Systems. 1-9. 2015
- A Java util concurrent park contention tool. Proceedings of the Sixth International Workshop on Programming Models and Applications for Multicores and Manycores. 106-111. 2015
- Monetary-and-QoS Aware Replica Placements in Cloud-Based Storage Systems. Proceedings of the International Conference on Cloud Computing Technology and Science, CloudCom. 672-675. 2014
- A Dynamic Moldable Job Scheduling Based Parallel SAT Solver. Proceedings of the International Conference on Parallel Processing Workshops. 110-119. 2013
- On Representing Graphs by Touching Cuboids. Lecture Notes in Computer Science. 187-198. 2013
- Basis enumeration of hyperplane arrangements up to symmetries. Proceedings of the 24th Canadian Conference on Computational Geometry, CCCG 2012. 143-148. 2012
- Pushing the boundaries of polytopal realizability. Proceedings of the 23rd Annual Canadian Conference on Computational Geometry, CCCG 2011. 2011
- A note on α-drawable k-trees. Proceedings of the 20th Annual Canadian Conference on Computational Geometry, CCCG 2008. 23-26. 2008
- Computing the tool path of an externally monotone polygon in linear time. Proceedings of the 18th Annual Canadian Conference on Computational Geometry, CCCG 2006. 85-88. 2006
- Necklaces, Convolutions, and X + Y. Lecture Notes in Computer Science. 160-171. 2006
- Small Strictly Convex Quadrilateral Meshes of Point Sets. Algorithmica. 317-339. 2004
- Long proteins with unique optimal foldings in the H-P model. Computational Geometry: Theory and Applications. 139-159. 2003
- Small Convex Quadrangulations of Point Sets. Lecture Notes in Computer Science. 623-635. 2001
- Computing constrained minimum-width annuli of point sets. Lecture Notes in Computer Science. 392-401. 1997
- Primal-dual methods for vertex and facet enumeration. Proceedings of the Annual Symposium on Computational Geometry. 49-56. 1997
- Incremental convex hull algorithms are not output sensitive. Lecture Notes in Computer Science. 26-35. 1996
- How good are convex hull algorithms?. Proceedings of the eleventh annual symposium on Computational geometry - SCG '95. 20-28. 1995
- Determining the castability of simple polyhedra. Proceedings of the tenth annual symposium on Computational geometry - SCG '94. 123-131. 1994
-
journal articles
- Sparktope: linear programs from algorithms. Optimization Methods and Software. 37:954-981. 2022
- Achieve privacy-preserving simplicial depth query over collaborative cloud servers. Peer-to-Peer Networking and Applications. 13:412-423. 2020
- Polynomial size linear programs for problems in P. Discrete Applied Mathematics. 265:22-39. 2019
- Monotone simultaneous paths embeddings in RD. Discrete Mathematics & Theoretical Computer Science. 20. 2018
- Toward cost‐effective replica placements in cloud storage systems with QoS‐awareness. Software - Practice and Experience. 47:813-829. 2017
- Necklaces, Convolutions, and X+Y. Algorithmica. 69:294-314. 2014
- Editorial. Computational Geometry: Theory and Applications. 47:111-111. 2014
- Computing symmetry groups of polyhedra. LMS Journal of Computation and Mathematics. 17:565-581. 2014
- Editorial. Computational Geometry: Theory and Applications. 46:493-493. 2013
- More bounds on the diameters of convex polytopes. Optimization Methods and Software. 28:442-450. 2013
- Matroid Enumeration for Incidence Geometry. Discrete and Computational Geometry. 47:17-43. 2012
- Edge-Graph Diameter Bounds for Convex Polytopes with Few Facets. Experimental Mathematics. 20:229-237. 2011
- Symmetric matroid polytopes and their generation. European Journal of Combinatorics. 30:1758-1777. 2009
- Foreword: selected papers from the Franco-Canadian workshop on combinatorial algorithms. Journal of Combinatorial Optimization. 16:323-323. 2008
- Output-sensitive algorithms for Tukey depth and related problems. Statistics and computing. 18:259-266. 2008
- The complexity of the envelope of line and plane arrangements 2007
- Games on triangulations. Theoretical Computer Science. 343:42-71. 2005
- Output-Sensitive Algorithms for Computing Nearest-Neighbour Decision Boundaries. Discrete and Computational Geometry. 33:593-604. 2005
- Output-Sensitive Algorithms for Computing Nearest-Neighbour Decision Boundaries. Lecture Notes in Computer Science. 2748:451-461. 2003
- Playing with Triangulations. Lecture Notes in Computer Science. 2866:22-37. 2003
- Editorial. Computational Geometry: Theory and Applications. 20:1-1. 2001
- POINT VISIBILITY GRAPHS AND ${\mathcal O}$-CONVEX COVER. International Journal of Computational Geometry and Applications. 10:55-71. 2000
- Inner Diagonals of Convex Polytopes. Journal of combinatorial theory. Series A. 87:175-197. 1999
- Incremental Convex Hull Algorithms Are Not Output Sensitive. Discrete and Computational Geometry. 21:57-68. 1999
- Primal—Dual Methods for Vertex and Facet Enumeration. Discrete and Computational Geometry. 20:333-357. 1998
- Computing constrained minimum-width annuli of point sets. Computer-Aided Design. 30:267-275. 1998
- Determining the Castability of Simple Polyhedra. Algorithmica. 19:84-113. 1997
- How good are convex hull algorithms?. Computational Geometry: Theory and Applications. 7:265-301. 1997
- Large convex hull problems. ZAMM Zeitschrift für Angewandte Mathematik und Mechanik. 76:179-182. 1996
- All convex polyhedra can be clamped with parallel jaw grippers. Computational Geometry: Theory and Applications. 6:291-302. 1996
-
preprints