( en | de | ru )

 

Disambiguation of "Meijer, Henk"

Author of the publication

copydeleteadd this publication to your clipboard
Biclique Edge Cover Graphs and Confluent Drawings.

, , and . GD, volume 4372 of Lecture Notes in Computer Science, page 405-416. Springer, (2006)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Jan Meijer

Heinrich Meijer

Helmut Meijer

Meijer Hond

Gerard Meijer

 

Other publications of authors with the same name

The Largest Empty Annulus Problem., , , , and . International Conference on Computational Science (3), volume 2331 of Lecture Notes in Computer Science, page 46-54. Springer, (2002)Completion of Computation of Improved Upper Bound on the Maximum Average Linear Hull Probabilty for Rijndael., , and . IACR Cryptology ePrint Archive, (2004)Point-Set Embedding in Three Dimensions., and . CCCG, page 223-228. (2012)Minimizing the Stabbing Number of Matchings, Trees, and Triangulations., , and . Discret. Comput. Geom., 40 (4): 595-621 (2008)Modeling Linear Characteristics of Substitution-Permutation Networks., , and . Selected Areas in Cryptography, volume 1758 of Lecture Notes in Computer Science, page 78-91. Springer, (1999)Packing Trees into 1-Planar Graphs., , , , , , , , and . WALCOM, volume 12049 of Lecture Notes in Computer Science, page 81-93. Springer, (2020)Voronoi drawings of trees., and . Comput. Geom., 24 (3): 147-178 (2003)Motivating lazy guards., , and . CCCG, page 121-126. Carleton University, Ottawa, Canada, (1995)Hamilton Circuits in Hexagonal Grid Graphs., , , , and . CCCG, page 85-88. Carleton University, Ottawa, Canada, (2007)Optimal Nearly-Similar Polygon Stabbers of Convex Polygons., , and . CCCG, page 269-274. University of Saskatchewan, (1994)