List of Publications

Michael Houle

Journal publications

Conference publications

Journal publications

Note: Links are to the final version submitted for publication, which is NOT necessarily identical to the published version. All publications have been refereed.

  1. C. Hernando, M. E. Houle and F. Hurtado.
    On local transformation of polygons with visibility properties.
    Theoretical Computer Science, to appear.

  2. P. Bose, M. E. Houle and G. T. Toussaint.
    Every set of disjoint line segments admits a binary tree.
    Discrete & Computational Geometry, to appear.

  3. V. Estivill-Castro and M. E. Houle.
    Robust distance-based clustering with applications to spatial data mining.
    Algorithmica (special issue on algorithms for geographical information), to appear.

  4. M. E. Houle, E. Tempero, and G. Turner.
    Optimal dimension-exchange token distribution on complete binary trees.
    Theoretical Computer Science 220, 1999, pp. 363-376.

  5. P. Bose, H. Everett, S. Fekete, M. E. Houle, A. Lubiw, H. Meijer, K. Romanik, G. Rote, T. C. Shermer, S. Whitesides and C. Zelle.
    A visibility representation for graphs in three dimensions.
    J. Graph Algorithms and Applications 2(3), 1998, pp. 1-16.

  6. M. E. Houle and G. Turner.
    Dimension-exchange token distribution on the mesh and the torus.
    Parallel Computing 24(2), 1998, pp. 247-265.

  7. D. Avis and M. E. Houle.
    Computational aspects of Helly's theorem and its relatives.
    International Journal of Computational Geometry & Appl. 5(4), 1995, pp. 357-367.

  8. G.-H. Chen, M. E. Houle and M.-T. Kuo.
    The Steiner problem in distributed computing systems.
    Information Sciences 74(1), Oct. 1993, pp. 73-96.

  9. M. E. Houle.
    Algorithms for weak and wide separation of sets.
    Discrete Applied Mathematics 45(2), Aug. 1993, pp. 139-159.

  10. M. E. Houle, H. Imai, K. Imai, J.-M. Robert and P. Yamamoto.
    Orthogonal weighted linear L-1 and L-infinity approximation and applications.
    Discrete Applied Mathematics 43(3), June 1993, pp. 217-232.

  11. M. E. Houle.
    Theorems on the existence of separating surfaces.
    Discrete & Computational Geometry 6(1), Jan. 1991, pp. 49-56.

  12. M. E. Houle and G. T. Toussaint.
    Computing the width of a set.
    IEEE Transactions on Pattern Analysis and Machine Intelligence 10(5), Sept. 1988, pp. 761-765.

Conference publications

Note: Links are to the final version submitted for publication, which is NOT necessarily identical to the published version. All publications have been refereed.

  1. T. Menzies, J. Powell and M. E. Houle.
    Fast formal analysis of requirements via topoi diagrams.
    In Proc. 23rd International Conference on Software Engineering (ICSE 2001), Toronto, Canada, to appear.

  2. V. Estivill-Castro and M. E. Houle.
    Fast randomized algorithms for robust estimation of location.
    In Lecture Notes in Artificial Intelligence (Proc. International Workshop on Temporal, Spatial and Spatio-Temporal Data Mining (TSDM2000), Lyon), Springer-Verlag, 2000, to appear.

  3. C. Hernando, M. E. Houle and F. Hurtado.
    On local transformation of polygons with visibility properties.
    In Lecture Notes in Computer Science 1858 (Proc. 6th International Computing and Combinatorics Conference (COCOON'00), Sydney), Springer-Verlag, 2000, pp. 54-63.

  4. B. K. Bhattacharya and M. E. Houle.
    Generalized maximum independent sets for trees in subquadratic time.
    In Lecture Notes in Computer Science 1741 (Proc. 10th International Symposium on Algorithms and Computation (ISAAC'99), Chennai, India), Springer-Verlag, 1999, pp. 435-445.

  5. V. Estivill-Castro and M. E. Houle.
    Robust clustering of large geo-referenced data sets.
    In Lecture Notes in Computer Science 1574 (Proc. 3rd Pacific-Asia Conference on Knowledge Discovery and Data Mining (PAKDD'99), Beijing), Springer-Verlag, 1999, pp. 327-337.

  6. V. Estivill-Castro and M. E. Houle.
    Robust clustering of large data sets with categorical attributes.
    In Australian Computer Science Communications 21(2) (Proc. 10th Australasian Database Conference (ADC'99), Auckland), Springer-Verlag, 1999, pp. 165-176.

  7. M. E. Houle and R. Webber.
    Approximation algorithms for finding best viewpoints.
    In Lecture Notes in Computer Science 1547 (Proc. 6th Symposium on Graph Drawing '98, Montreal), Springer-Verlag, 1998, pp. 210-223.

  8. S. Fekete, M. E. Houle and S. Whitesides.
    The wobbly logic engine: proving hardness of non-rigid geometric graph representation problems.
    In Lecture Notes in Computer Science 1353 (Proc. 5th Symposium on Graph Drawing '97, Rome), Springer-Verlag, 1997, pp. 272-283.

  9. P. Eades, M. E. Houle and R. Webber.
    Finding best viewpoints for three-dimensional graph drawings.
    In Lecture Notes in Computer Science 1353 (Proc. 5th Symposium on Graph Drawing '97, Rome), Springer-Verlag, 1997, pp. 87-98.

  10. M. E. Houle and Simon.
    Social and ethical education in computing using virtual environments.
    In Proc. 2nd Australasian Computer Science Education Conference, Melbourne, July 1997, pp. 24-31.

  11. M. E. Houle and Simon.
    Ethics, programming, and virtual environments.
    In Proc. ACM SIGCSE/CUE Conference on Integrating Technology into Computer Science Education, Uppsala, Sweden, June 1997, pp. 91-93.

  12. B. K. Bhattacharya and M. E. Houle.
    Generalized maximum independent sets for trees.
    In Proc. Computing: the Australasian Theory Symposium (CATS'97), Sydney, Feb. 1997, pp. 17-25.

  13. M. E. Houle and G. Turner.
    Dimension-exchange token distribution on the mesh and the torus.
    In Lecture Notes in Computer Science 1178 (Proc. 7th International Symposium on Algorithms and Computation (ISAAC'96), Osaka), Springer-Verlag, 1996, pp. 233-232.

  14. M. E. Houle.
    On local transformations of simple polygons.
    Australian Computer Science Communications 18(3), (Proceedings of Computing: the Australasian Theory Symposium (CATS'96), Melbourne), Jan. 1996, pp. 64-71.

  15. S. P. Fekete, M. E. Houle, S. Whitesides.
    New results on a visibility representation of graphs in 3D.
    In Lecture Notes in Computer Science 1027 (Proc. 3rd Symposium on Graph Drawing '95, Passau, Germany), Springer-Verlag, 1995, pp. 234-241.

  16. P. Bose, M. E. Houle, G. Toussaint.
    Every set of disjoint line segments admits a binary tree.
    In Lecture Notes in Computer Science 834 (Proc. 5th International Symposium on Algorithms and Computation (ISAAC'94), Beijing), Springer-Verlag, 1994, pp. 20-28.

  17. H. ElGindy, M. E. Houle, W. Lenhart, M. Miller, D. Rappaport and S. Whitesides.
    Dominance drawings of bipartite graphs.
    In Proc. 5th Canadian Conference on Computational Geometry, Waterloo, Canada, Aug. 1993, pp. 187-191.

  18. D. Avis and M. E. Houle.
    Computational aspects of Helly's theorem and its relatives.
    In Proc. 3rd Canadian Conference on Computational Geometry, Vancouver, Canada, Aug. 1991, pp. 11-14.

  19. Te. Asano, M. E. Houle, H. Imai, and K. Imai.
    Linear-space solutions to hashing-related geometric minimax problems.
    In Proc. 2nd Canadian Conference on Computational Geometry, Ottawa, Canada, Aug. 1990, pp. 20-23.

  20. M. E. Houle.
    Algorithms for weak and wide separation of sets.
    In Proc. International Workshop on Discrete Algorithms and Complexity, Fukuoka, Japan, Nov. 1989, pp. 61-68.

  21. M. E. Houle, H. Imai, K. Imai and J.-M. Robert.
    Weighted orthogonal linear L-infinity approximation and applications.
    In Lecture Notes in Computer Science 382 (Proc. 1989 Workshop on Algorithms and Data Structures, Carleton Univ., Ottawa, Canada), Springer-Verlag, 1989, pp. 183-191.

Back to top

Michael Houle
1 August 2000