# Henk Meijer

Henk Meijer is a Professor of the
School of Computing
at Queen's University, Kingston, Canada. He is a member of the
Computational Geometry Laboratory.

## Current Address:

School of Computing
Queen's University
Kingston, Ontario, K7L 3N6
(613) 533 6057
(613) 533 6513 (FAX)
henk@cs.queensu.ca

## Research Interests

Henk Meijer works in the area of computational geometry, with an emphasis on
geometric visibility problems.

## Recent Publications

S.P. Fekete, H. Meijer,
Maximum Dispersion and Geometric Maximum Weight Cliques,
Algorithmica, 38 (3) (2004), pp. 501-511.
E.D. Demaine, J. Erickson, F. Hurtado, J. Iacono,
S. Langerman, H. Meijer, M. Overmars, S. Whitesides,
Separating Point Sets in Polygonal Environments,
to be presented at SOCG, June 2004, New York, U.S.A.
S. Fekete, M. Luebbecke, H. Meijer,
Minimizing the Stabbing Number of Matchings, Trees and Triangulations,
Symposium on Discrete Algorithms (SODA), New Orleans, U.S.A., 2004.
S. Fekete, H. Meijer,
The one-Round Voronoi Game replayed,
Proceedings of WADS 2003, Ottawa, August 2003,
Lecture Notes in Computer Science, Vol. 2748, pp. 150-161,
Springer Verlag 2003.
E. Di Giacomo, H. Meijer,
Track Drawing of Graphs with Small Queue Number,
Graph Drawing 2003, Perugia, Italy, September 2003;
Lecture Notes in Computer Science, No. 2912,
Springer Verlag, 2003, pp. 214 - 225.
F. Hurtado, G. Liotta, H. Meijer,
Optimal and Suboptimal Robust Algorithms for Proximity Graphs,
Computational Geometry: Theory and Applications,
Volume 25, Issues 1-2, May 2003, pp. 35-49.
O.Aichholzer, D. Bremner, E. Demaine, H. Meijer, V. Sacristan, M. Soss,
Long Proteins with Unique Optimal Foldings in the H-P-Model,
Computational Geometry: Theory and Applications,
Volume 25, Issues 1-2, May 2003, pp. 139-159.
G. Liotta, H. Meijer, Voronoi Drawing of Trees;
Computational Geometry: Theory and Applications,
Vol. 24, Nr. 3, April 2003, pp. 147-178.
J. M. Diaz-Banez, F. Hurtado, H. Meijer, D. Rappaport, T. Sellares,
The Largest Empty Annulus Problem,
International Journal of Computational Geometry and Applications,
Vol. 13, No. 4, August 2003.
L. Keliher, H. Meijer, S.E. Tavares,
Toward the true random cipher: On expected linear probability values for
SPNs with randomly selected s-boxes, chapter in
Communication, Information and Network Security,
V. Bhargava, H.V. Poor, V. Tarokh, and S. Yoon (Eds.),
G. Aloupis , E.D. Demaine , V. Dujmovic , J. Erickson ,
S, Langerman , H. Meijer ,
J. O'Rourke , M. Overmars , M. Soss , I. Streinu , G.T. Toussaint,
Flat-State Connectivity of Linkages under Dihedral Motions;
proceedings of ISAAC,
Vancouver, November 2002;
Spinger Verlag, LNCS 2518, pp 369-380, 2002.
P. Bose, F. Hurtado, H. Meijer, S. Ramaswami,
D. Rappaport, V. Sacristan, T. Shermer, G. Toussaint,
Finding specified sections of arrangements: 2D results,
The Journal of Mathematical Modelling and Algorithms;
Vol.1, Issue 1, 2002, pp. 3-16.
S.P. Fekete, H. Meijer, A. Rohe, W. Tietze,
Solving a ``hard'' problem to approximate and ``easy'' one:
good and fast heuristics for large geometric maximum matching and
maximum Traveling Salesman problems,
oournal of Experimental Algorithms, 7 (2002), article 11;