Home » About RA » Faculty and Staff » Science

Click to enlarge this picture  

Prof. Dr. Henk Meijer

Head of the Science Department
Professor of Computing Science
P.O. Box 94
NL-4330 AB Middelburg
Office hours: by appointment
Tel. 0118-655500 / fax 0118-655508
E-mail: hdotmeijeratroacdotnl

Profile

Henk Meijer was born and raised in Groningen, the Netherlands. He completed his high school studies at the Willem Lodewijk Gymnasium and graduated in Econometrics at the University of Groningen in 1977. In September 1977 he moved to Kingston, Ontario, Canada. He obtained his M.Sc. degree in Computing Science in 1979 and his Ph.D. in Mathematics in 1983, both at Queen’s University. Henk Meijer started to teach part-time in the Department of Computing Science in 1978. He became an assistant professor in 1981, was promoted to associate professor in 1986 and became Full Professor in 1999. During his years at Queen’s Henk Meijer has served on many departmental and university committees. Most notable are his terms as Undergraduate Chair, Graduate Chair, Appointments Committee Chair and Associate Head of the Department. In 1991 Henk Meijer took a leave of absence from Queen’s University and worked at the University of Papua New Guinea in Waigani, Port Moresby. In April of 2006 the undergraduate students of the School of Computing awarded Henk Meijer the first “Lifetime Teaching Award of the School of Computing”. In August 2006 Henk Meijer returned to the Netherlands to work at Roosevelt Academy in Middelburg, Zeeland. He is currently the Head of the Science Department.

Henk Meijer wrote a Ph.D. thesis entitled Cryptology, Computational Complexity and Applications. He remained active in the area of Cryptography until his stay in Papua New Guinea. In 1992 Henk Meijer started to do research in the area of Computational Geometry. His main interest lies in the area of Graph Drawing. Henk Meijer has published over 50 articles in journals and over 60 articles in conference proceedings. He has supervised or co-supervised over 30 Master’s and Ph.D. students and is currently co-supervising three Ph.D. students together with Professor David Rappaport from Queen’s University.

List of Publications (2009)

  • E.D. Demaine, F. Gomez, H. Meijer, D. Rappaport, P. Taslakian, G.T. Toussaint, T. Winograd, D. Wood, The Distance Geometry of Music, Computational Geometry, Theory and Applications,Vol. 42, 2009, pp. 429-454.
  • W. Didimo, E. Di Giacomo, G. Liotta, H. Meijer, S. Wismath, Volume Requirements of 3D Upwards Drawings Discrete Mathematics Vol. 309, Issue 7, 8 April 2009, Pages 1824-1837. 
  • H.Meijer, Y.Nunez-Rodriguez, D.Rappaport, An algorithm for computing simple k-factors, Information Processing Letters, Vol. 109, 2009, pp.620-625.
  • H.Meijer, Y.Nunez-Rodriguez, D.Rappaport, Bounds for Point Recolouring in Geometric Graphs, to appear in CGTA 2009.
  • L.Grilli, S.-H.Hong, G.Liotta, H.Meijer and S.Wismath, Matched drawability of graph pairs and of graph triples, Walcom, Kolkata, Indai, February 2009.

List of Publications (2008)

  • M.A. Bender, D.P. Bunde, E.D. Demaine, S.P. Fekete, V.J. Leung, H. Meijer, Communication-Aware Processor Allocation for Supercomputers: Finding Point Sets of Small Average Distance, Algorithmica, Vol. 50, No. 2, February 2008, pp. 279-298.
  • E. Di Giacomo, W. Didimo, G. Liotta, H. Meijer, F. Trotta, S. Wismath, k-Colored Point-Set Embeddability of Outerplanar Graphs, Journal of Graph Algorithms and Applications, Vol. 12, no. 1, pp. 29-49, 2008.
  • S. Fekete, M. Luebbecke, H. Meijer, Minimizing the Stabbing Number of Matchings, Trees and Triangulations, to appear in Discrete and Computational Geometry.
  • E. Di Giacomo, W. Didimo, G. Liotta, H. Meijer, S. Wismath, Constrained Point-Set Embeddability of Planar Graphs, Graph Drawing 2008, Krete, Greece; to appear in Lecture Notes in Computer Science, Springer Verlag.

List of Publications (2007)

  • W. Didimo, E. Di Giacomo, G. Liotta, H. Meijer, S. Wismath, Point-Set Embeddings of Trees with Edge Constraints, Graph Drawing 2007; to appear in Lecture Notes in Computer Science, Springer Verlag.
  • S.G. Akl, K. Islam, H. Meijer, On Planar Path Transformation, Information Processing Letters, Vol. 104, 2007, pp.59-64.
  • M. Martens, H. Meijer, On the expected time complexity of a heuristic maximal Hamiltonian Cycle algorithm, Journal of Discrete Algorithms, Vol. 5, No. 1, March 2007, pp. 102-114.
  • K. Islam, H. Meijer, Y. Nunez, D. Rappaport, H. Xiao, Hamiltonian Cycles in Hexagonal Grid Graphs, 19th Canadian Conference on Computational Geometry, Carleton University, August 2007.

List of Publications (2006)

  • J. Colannino, M.Damian, F. Hurtado, J. Iacono, H. Meijer, S. Ramaswami, G.T. Toussaint, "An O(n log n)-time Algorithm for the Restriction Scaffold Assignment Problem," Journal of Computational Biology, Vol. 13, No. 4, 2006.
  • E.D. Demaine, J. Erickson, D. Krizanc,  H. Meijer, P. Morin, M. Overmars, and S. Whitesides, Realizing partitions respecting full and partial order information, Journal of Discrete Algorithms, Vol. 6, 2008, pp.51-5.
  • J. Colannino, M. Damian, F. Hurtado, S. Langerman, H. Meijer, S. Ramaswami, D. Souvaine and G. Toussaint, Efficient Many-To-Many Point Matching in One Dimmension, Akiyama-Chvatal Festschrift, Graphs and Combinatorics.
  • M. Hirsch, H. Meijer, D.Rappaport, "Biclique Edge Cover Graphs and Confluent Drawings", Graph Drawing 2006; Karlsruhe, Germany, September 2006, Lecture Notes in Computer Science, No. 4372, Springer Verlag, 2006, pp. 405-416.
  • E. Di Giacomo, W. Didimo, G. Liotta, H. Meijer, F. Trotta, S. Wismath, "Drawing Coloured Graphs on Coloured Points, " Graph Drawing 2006; Karlsruhe, Germany, September 2006; Lecture Notes in Computer Science, No. 4372, Springer Verlag, 2006, pp. 318-329.
  • M. Damian, E.D. Demaine, M.L. Demaine, V. Dujmovic, D. El-Khechen, R. Flatland, J. Iacono, S. Langerman, H. Meijer, S. Ramaswami, D.L. Souvaine, P. Taslakian, G.T. Toussaint, "Curves in the Sand: Algorithmic Drawing," Proceedings of the 18th Canadian Conference on Computational Geometry, Queen's University, Kingston, Ontario, Canada, August, 2006.
  • G. Aloupis, H. Meijer, "Reconfiguring Planar Dihedral Chains," European Conference on Computational Geometry, Delphi, Greece, March 2006.

Courses

Back to the top of this page Back to top | Print page Print page | | Hide sidebar Hide sidebar