The Design and Analysis of a New Hybrid Sorting Algorithm. - Henk Meijer; Selim G. Akl (Inf. Process. Lett., 1980)

Digital Signature Scheme for Computer Communication Networks. - Henk Meijer; Selim G. Akl (CRYPTO, 1981)

Digital signature schemes for computer communication networks. - Henk Meijer; Selim G. Akl (SIGCOMM, 1981)

More on Master Keys for Group Sharing. - Dorothy E. Denning; Henk Meijer; Fred B. Schneider (Inf. Process. Lett., 1981)

A Note on 'A Cryptosystem for Multiple Communication'. - Henk Meijer (Inf. Process. Lett., 1981)

Digital Signature Schemes. - Henk Meijer; Selim G. Akl (Cryptologia, 1982)

On the Average-Case Complexity of "Bucketing" Algorithms. - Selim G. Akl; Henk Meijer (J. Algorithms, 1982)

Remarks on a Digital Signature Scheme. - Henk Meijer; Selim G. Akl (Cryptologia, 1983)

A Fast Pseudo Random Permutation Generator With Applications to Cryptology. - Selim G. Akl; Henk Meijer (CRYPTO, 1984)

Two New Secret Key Cryptosystems. - Henk Meijer; Selim G. Akl (EUROCRYPT, 1985)

A note on the method of puzzles for key distribution. - Becky Chan; Henk Meijer (Int. J. Parallel Program., 1985)

An Optimal Algorithm for Assigning Cryptographic Keys to Control Access in a Hierarchy. - Stephen J. MacKinnon; Peter D. Taylor; Henk Meijer; Selim G. Akl (IEEE Trans. Computers, 1985)

Optimal computation of prefix sums on a binary tree of processors. - Henk Meijer; Selim G. Akl (Int. J. Parallel Program., 1987)

Fault Tolerant Networks of Specified Diameter. - Henk Meijer; R. Dawes (WG, 1988)

Bit serial addition trees and their applications. - Henk Meijer; Selim G. Akl (Computing, 1988)

On the bit complexity of parallel computations. - Selim G. Akl; Henk Meijer (Integr., 1988)

Expressing parallel algorithms in Nial. - Janice I. Glasgow; Michael A. Jenkins; Henk Meijer; Carl McCrosky (Parallel Comput., 1989)

Security-related comments regarding McEliece's public-key cryptosystem. - Carlisle M. Adams; Henk Meijer (IEEE Trans. Inf. Theory, 1989)

Parallel Binary Search with Delayed Read Conflicts. - Henk Meijer; Selim G. Akl (Int. J. High Speed Comput., 1990)

A Note on Diameter of Acyclic Directed Hypercubes. - Ke Qiu 001; Henk Meijer (Inf. Process. Lett., 1990)

Parallel Binary Search. - Selim G. Akl; Henk Meijer (IEEE Trans. Parallel Distributed Syst., 1990)

Parallel Routing and Sorting of the Pancake Network. - Ke Qiu 001; Henk Meijer; Selim G. Akl (ICCI, 1991)

Decomposing a Star Graph Into Disjoint Cycles. - Ke Qiu 001; Henk Meijer; Selim G. Akl (Inf. Process. Lett., 1991)

Computing the Minimum Weight Triangulation of a Set of Linearly Ordered Points. - Henk Meijer; David Rappaport (Inf. Process. Lett., 1992)

Properties of the voronoi diagram cluster buster. - Kelly A. Lyons; Henk Meijer; David Rappaport (CASCON, 1993)

Reconstructing Polygons From X-Rays. - Henk Meijer; Steven Skiena (CCCG, 1993)

Optimal Nearly-Similar Polygon Stabbers of Convex Polygons. - Paul Colley; Henk Meijer; David Rappaport (CCCG, 1994)

Recognizing Rectangle of Influence Drawable Graphs. - Hossam A. ElGindy; Giuseppe Liotta; Anna Lubiw; Henk Meijer; Sue Whitesides (GD, 1994)

An Optimal Systolic Algorithm for Generating Permutations in Lexicographic Order. - Selim G. Akl; Henk Meijer; Ivan Stojmenovic (J. Parallel Distributed Comput., 1994)

On Some Properties and Algorithms for the Star and Pancake Interconnection Networks. - Ke Qiu 001; Selim G. Akl; Henk Meijer (J. Parallel Distributed Comput., 1994)

Motivating lazy guards. - Paul Colley; Henk Meijer; David Rappaport (CCCG, 1995)

Optimal Communication Primitives on the Generalized Hypercube Network. - Paraskevi Fragopoulou; Selim G. Akl; Henk Meijer (J. Parallel Distributed Comput., 1996)

Inferring Evolutionary Trees from Ordinal Data. - Paul E. Kearney; Ryan Hayward; Henk Meijer (SODA, 1997)

The rectangle of influence drawability problem. - Giuseppe Liotta; Anna Lubiw; Henk Meijer; Sue Whitesides (Comput. Geom., 1998)

Decision trees for geometric models. - Esther M. Arkin; Henk Meijer; Joseph S. B. Mitchell; David Rappaport; Steven Skiena (Int. J. Comput. Geom. Appl., 1998)

Computing the Angularity Tolerance. - Mark de Berg; Henk Meijer; Mark H. Overmars; Gordon T. Wilfong (Int. J. Comput. Geom. Appl., 1998)

A Visibility Representation for Graphs in Three Dimensions. - Prosenjit Bose; Hazel Everett; Sándor P. Fekete; Michael E. Houle; Anna Lubiw; Henk Meijer; Kathleen Romanik; Günter Rote; Thomas C. Shermer; Sue Whitesides; Christian Zelle (J. Graph Algorithms Appl., 1998)

Algorithms for Cluster Busting in Anchored Graph Drawing. - Kelly A. Lyons; Henk Meijer; David Rappaport (J. Graph Algorithms Appl., 1998)

On Minimum Stars, Minimum Steiner Stars, and Maximum Matchings. - Sándor P. Fekete; Henk Meijer (SCG, 1999)

Rectangle of Influence Drawings of Graphs without Filled 3-Cycles. - Therese Biedl; Anna Bretscher; Henk Meijer (GD, 1999)

Modeling Linear Characteristics of Substitution-Permutation Networks. - Liam Keliher; Henk Meijer; Stafford E. Tavares (Selected Areas in Cryptography, 1999)

Evolutionary Trees and Ordinal Assertions. - Paul E. Kearney; Ryan Hayward; Henk Meijer (Algorithmica, 1999)

Rectangle and Box Visibility Graphs in 3D. - Sándor P. Fekete; Henk Meijer (Int. J. Comput. Geom. Appl., 1999)

On Minimum Stars and Maximum Matchings. - Sándor P. Fekete; Henk Meijer (Discret. Comput. Geom., 2000)

New Method for Upper Bounding the Maximum Average Linear Hull Probability for SPNs. - Liam Keliher; Henk Meijer; Stafford E. Tavares (EUROCRYPT, 2001)

Improving the Upper Bound on the Maximum Average Linear Hull Probability for Rijndael. - Liam Keliher; Henk Meijer; Stafford E. Tavares (Selected Areas in Cryptography, 2001)

Optimal, Suboptimal, and Robust Algorithms for Proximity Graphs. - Ferran Hurtado; Giuseppe Liotta; Henk Meijer (WADS, 2001)

Minimum convex partition of a constrained point set. - Thomas Fevens; Henk Meijer; David Rappaport (Discret. Appl. Math., 2001)

On the visibility graph of convex translates. - Kiyoshi Hosono; Henk Meijer; David Rappaport (Discret. Appl. Math., 2001)

Dual of New Method for Upper Bounding the Maximum Average Linear Hull Probability for SPNs. - Liam Keliher; Henk Meijer; Stafford E. Tavares (IACR Cryptol. ePrint Arch., 2001)

On flat-state connectivity of chains with fixed acute angles. - Greg Aloupis; Erik D. Demaine; Henk Meijer; Joseph O'Rourke; Ileana Streinu; Godfried T. Toussaint (CCCG, 2002)

Flat-State Connectivity of Linkages under Dihedral Motions. - Greg Aloupis; Erik D. Demaine; Vida Dujmovic; Jeff Erickson 001; Stefan Langerman; Henk Meijer; Joseph O'Rourke; Mark H. Overmars; Michael A. Soss; Ileana Streinu; Godfried T. Toussaint (ISAAC, 2002)

Flipturning Polygons. - Oswin Aichholzer; Carmen Cortés; Erik D. Demaine; Vida Dujmovic; Jeff Erickson 001; Henk Meijer; Mark H. Overmars; Belén Palop; Suneeta Ramaswami; Godfried T. Toussaint (Discret. Comput. Geom., 2002)

Solving a "Hard" Problem to Approximate an "Easy" One: Heuristics for Maximum Matchings and Maximum Traveling Salesman Problems. - Sándor P. Fekete; Henk Meijer; André Rohe; Walter Tietze (ACM J. Exp. Algorithmics, 2002)

Finding Specified Sections of Arrangements: 2D Results. - Prosenjit Bose; Ferran Hurtado; Henk Meijer; Suneeta Ramaswami; David Rappaport; Vera Sacristán; Thomas C. Shermer; Godfried T. Toussaint (J. Math. Model. Algorithms, 2002)

Track Drawings of Graphs with Constant Queue Number. - Emilio Di Giacomo; Henk Meijer (GD, 2003)

Long proteins with unique optimal foldings in the H-P model. - Oswin Aichholzer; David Bremner; Erik D. Demaine; Henk Meijer; Vera Sacristán; Michael A. Soss (Comput. Geom., 2003)

Optimal and suboptimal robust algorithms for proximity graphs. - Ferran Hurtado; Giuseppe Liotta; Henk Meijer (Comput. Geom., 2003)

Voronoi drawings of trees. - Giuseppe Liotta; Henk Meijer (Comput. Geom., 2003)

The Largest Empty Annulus Problem. - José Miguel Díaz-Báñez; Ferran Hurtado; Henk Meijer; David Rappaport; Joan Antoni Sellarès (Int. J. Comput. Geom. Appl., 2003)

Simultaneous edge flips for convex subdivisions. - Henk Meijer; David Rappaport (CCCG, 2004)

Maximum Dispersion and Geometric Maximum Weight Cliques. - Sándor P. Fekete; Henk Meijer (Algorithmica, 2004)

Completion of Computation of Improved Upper Bound on the Maximum Average Linear Hull Probabilty for Rijndael. - Liam Keliher; Henk Meijer; Stafford E. Tavares (IACR Cryptol. ePrint Arch., 2004)

The Distance Geometry of Deep Rhythms and Scales. - Erik D. Demaine; Francisco Gomez-Martin; Henk Meijer; David Rappaport; Perouz Taslakian; Godfried T. Toussaint; Terry Winograd; David R. Wood (CCCG, 2005)

Closest Segments. - Kathryn Duffy; Chris McAloney; Henk Meijer; David Rappaport (CCCG, 2005)

Bi-chromatic minimum spanning trees. - Magdalene Grantson; Henk Meijer; David Rappaport (EuroCG, 2005)

Communication-Aware Processor Allocation for Supercomputers. - Michael A. Bender; David P. Bunde; Erik D. Demaine; Sándor P. Fekete; Vitus J. Leung; Henk Meijer; Cynthia A. Phillips (WADS, 2005)

The one-round Voronoi game replayed. - Sándor P. Fekete; Henk Meijer (Comput. Geom., 2005)

Computing straight-line 3D grid drawings of graphs in linear volume. - Emilio Di Giacomo; Giuseppe Liotta; Henk Meijer (Comput. Geom., 2005)

An O(n log n)-Time Algorithm for the Restricted Scaffold Assignment - Justin Colannino; Mirela Damian; Ferran Hurtado; John Iacono; Henk Meijer; Suneeta Ramaswami; Godfried T. Toussaint (CoRR, 2005)

Separating Point Sets in Polygonal Environments. - Erik D. Demaine; Jeff Erickson 001; Ferran Hurtado; John Iacono; Stefan Langerman; Henk Meijer; Mark H. Overmars; Sue Whitesides (Int. J. Comput. Geom. Appl., 2005)

Guest Editors' Foreword. - Henk Meijer; David Rappaport (Int. J. Comput. Geom. Appl., 2005)

Computing Radial Drawings on the Minimum Number of Circles. - Emilio Di Giacomo; Walter Didimo; Giuseppe Liotta; Henk Meijer (J. Graph Algorithms Appl., 2005)

Curves in the Sand: Algorithmic Drawing. - Mirela Damian; Erik D. Demaine; Martin L. Demaine; Vida Dujmovic; Dania El-Khechen; Robin Y. Flatland; John Iacono; Stefan Langerman; Henk Meijer; Suneeta Ramaswami; Diane L. Souvaine; Perouz Taslakian; et al. (CCCG, 2006)

k -Colored Point-Set Embeddability of Outerplanar Graphs. - Emilio Di Giacomo; Walter Didimo; Giuseppe Liotta; Henk Meijer; Francesco Trotta; Stephen K. Wismath (GD, 2006)

Biclique Edge Cover Graphs and Confluent Drawings. - Michael Hirsch; Henk Meijer; David Rappaport (GD, 2006)

An O(n log n)-Time Algorithm for the Restriction Scaffold Assignment Problem. - Justin Colannino; Mirela Damian; Ferran Hurtado; John Iacono; Henk Meijer; Suneeta Ramaswami; Godfried T. Toussaint (J. Comput. Biol., 2006)

Hamilton Circuits in Hexagonal Grid Graphs. - Kamrul Islam 001; Henk Meijer; Yurai Núñez Rodríguez; David Rappaport; Henry Xiao (CCCG, 2007)

Point-Set Embedding of Trees with Edge Constraints. - Emilio Di Giacomo; Walter Didimo; Giuseppe Liotta; Henk Meijer; Stephen K. Wismath (GD, 2007)

Advances in graph drawing: The 11th International Symposium on Graph Drawing. - Giuseppe Liotta; Henk Meijer (Discret. Appl. Math., 2007)

Efficient Many-To-Many Point Matching in One Dimension. - Justin Colannino; Mirela Damian; Ferran Hurtado; Stefan Langerman; Henk Meijer; Suneeta Ramaswami; Diane L. Souvaine; Godfried Toussaint (Graphs Comb., 2007)

On planar path transformation. - Selim G. Akl; Kamrul Islam 001; Henk Meijer (Inf. Process. Lett., 2007)

On the probabilistic behaviour of a heuristic algorithm for maximal Hamiltonian tours. - Marco Martens; Henk Meijer (J. Discrete Algorithms, 2007)

Direct Planar Tree Transformation and Counterexample. - Selim G. Akl; Kamrul Islam 001; Henk Meijer (CCCG, 2008)

On the Complexity of Point Recolouring in Geometric Graphs. - Henk Meijer; Yurai Núñez Rodríguez; David Rappaport (CCCG, 2008)

A Constant Factor Localized Algorithm for Computing Connected Dominating Sets in Wireless Sensor Networks. - Kamrul Islam 001; Selim G. Akl; Henk Meijer (ICPADS, 2008)

Communication-Aware Processor Allocation for Supercomputers: Finding Point Sets of Small Average Distance. - Michael A. Bender; David P. Bunde; Erik D. Demaine; Sándor P. Fekete; Vitus J. Leung; Henk Meijer; Cynthia A. Phillips (Algorithmica, 2008)

Minimizing the Stabbing Number of Matchings, Trees, and Triangulations. - Sándor P. Fekete; Marco E. Lübbecke; Henk Meijer (Discret. Comput. Geom., 2008)

Planar tree transformation: Results and counterexample. - Selim G. Akl; Kamrul Islam 001; Henk Meijer (Inf. Process. Lett., 2008)

Realizing partitions respecting full and partial order information. - Erik D. Demaine; Jeff Erickson 001; Danny Krizanc; Henk Meijer; Pat Morin; Mark H. Overmars; Sue Whitesides (J. Discrete Algorithms, 2008)

k-colored Point-set Embeddability of Outerplanar Graphs. - Emilio Di Giacomo; Walter Didimo; Giuseppe Liotta; Henk Meijer; Francesco Trotta; Stephen K. Wismath (J. Graph Algorithms Appl., 2008)

Distributed Generation of a Family of Connected Dominating Sets in Wireless Sensor Networks. - Kamrul Islam 001; Selim G. Akl; Henk Meijer (DCOSS, 2009)

Maximizing the lifetime of wireless sensor networks through domatic partition. - Kamrul Islam 001; Selim G. Akl; Henk Meijer (LCN, 2009)

Not being (super)thin or solid is hard: A study of grid Hamiltonicity. - Esther M. Arkin; Sándor P. Fekete; Kamrul Islam 001; Henk Meijer; Joseph S. B. Mitchell; Yurai Núñez Rodríguez; Valentin Polishchuk; David Rappaport; Henry Xiao (Comput. Geom., 2009)

The distance geometry of music. - Erik D. Demaine; Francisco Gomez-Martin; Henk Meijer; David Rappaport; Perouz Taslakian; Godfried T. Toussaint; Terry Winograd; David R. Wood (Comput. Geom., 2009)

Point-set embeddings of trees with given partial drawings. - Emilio Di Giacomo; Walter Didimo; Giuseppe Liotta; Henk Meijer; Stephen K. Wismath (Comput. Geom., 2009)

Editorial CCCG 2006. - Henk Meijer; David Rappaport (Comput. Geom., 2009)

Bounds for point recolouring in geometric graphs. - Henk Meijer; Yurai Núñez Rodríguez; David Rappaport (Comput. Geom., 2009)

Volume requirements of 3D upward drawings. - Emilio Di Giacomo; Giuseppe Liotta; Henk Meijer; Stephen K. Wismath (Discret. Math., 2009)

An algorithm for computing simple k-factors. - Henk Meijer; Yurai Núñez Rodríguez; David Rappaport (Inf. Process. Lett., 2009)

Universal Pointsets for 2-Coloured Trees. - Mereke van Garderen; Giuseppe Liotta; Henk Meijer (GD, 2010)

Fault Recovery in Wireless Networks: The Geometric Recolouring Approach. - Henk Meijer; Yurai Núñez Rodríguez; David Rappaport (SEA, 2010)

Matched drawability of graph pairs and of graph triples. - Luca Grilli 001; Seok-Hee Hong 001; Giuseppe Liotta; Henk Meijer; Stephen K. Wismath (Comput. Geom., 2010)

Constrained Point-Set Embeddability of Planar Graphs. - Emilio Di Giacomo; Walter Didimo; Giuseppe Liotta; Henk Meijer; Stephen K. Wismath (Int. J. Comput. Geom. Appl., 2010)

Computing Signed Permutations of Polygons. - Greg Aloupis; Prosenjit Bose; Erik D. Demaine; Stefan Langerman; Henk Meijer; Mark H. Overmars; Godfried T. Toussaint (Int. J. Comput. Geom. Appl., 2011)

On Planar Supports for Hypergraphs. - Kevin Buchin; Marc J. van Kreveld; Henk Meijer; Bettina Speckmann; Kevin Verbeek (J. Graph Algorithms Appl., 2011)

Geometric Simultaneous Embeddings of a Graph and a Matching. - Sergio Cabello; Marc J. van Kreveld; Giuseppe Liotta; Henk Meijer; Bettina Speckmann; Kevin Verbeek (J. Graph Algorithms Appl., 2011)

Area, Curve Complexity, and Crossing Resolution of Non-Planar Graph Drawings. - Emilio Di Giacomo; Walter Didimo; Giuseppe Liotta; Henk Meijer (Theory Comput. Syst., 2011)

Point-Set Embedding in Three Dimensions. - Stephen K. Wismath; Henk Meijer (CCCG, 2012)

Universal Point Subsets for Planar Graphs. - Patrizio Angelini; Carla Binucci; William S. Evans; Ferran Hurtado; Giuseppe Liotta; Tamara Mchedlidze; Henk Meijer; Yoshio Okamoto (ISAAC, 2012)

PROXIMITY GRAPHS: E, δ, Δ, χ AND ω. - Prosenjit Bose; Vida Dujmovic; Ferran Hurtado; John Iacono; Stefan Langerman; Henk Meijer; Vera Sacristán Adinolfi; Maria Saumell; David R. Wood (Int. J. Comput. Geom. Appl., 2012)

Universal point sets for 2-coloured trees. - Mereke van Garderen; Giuseppe Liotta; Henk Meijer (Inf. Process. Lett., 2012)

Drawing a tree as a minimum spanning tree approximation. - Emilio Di Giacomo; Walter Didimo; Giuseppe Liotta; Henk Meijer (J. Comput. Syst. Sci., 2012)

Approximate proximity drawings. - William S. Evans; Emden R. Gansner; Michael Kaufmann 001; Giuseppe Liotta; Henk Meijer; Andreas Spillner 001 (Comput. Geom., 2013)

Proximity graphs inside large weighted graphs. - Bernardo M. Ábrego; Ruy Fabila Monroy; Silvia Fernández-Merchant; David Flores-Peñaloza; Ferran Hurtado; Henk Meijer; Vera Sacristán; Maria Saumell (Networks, 2013)

The Approximate Rectangle of Influence Drawability Problem. - Emilio Di Giacomo; Giuseppe Liotta; Henk Meijer (Algorithmica, 2015)

Planar and Quasi-Planar Simultaneous Geometric Embedding. - Emilio Di Giacomo; Walter Didimo; Giuseppe Liotta; Henk Meijer; Stephen K. Wismath (Comput. J., 2015)

Point Set Embedding in 3D. - Henk Meijer; Stephen K. Wismath (J. Graph Algorithms Appl., 2015)

Alternating paths and cycles of minimum length. - William S. Evans; Giuseppe Liotta; Henk Meijer; Stephen K. Wismath (Comput. Geom., 2016)

Ortho-polygon Visibility Representations of Embedded Graphs. - Emilio Di Giacomo; Walter Didimo; William S. Evans; Giuseppe Liotta; Henk Meijer; Fabrizio Montecchiani; Stephen K. Wismath (Algorithmica, 2018)

Visibility representations of boxes in 2.5 dimensions. - Alessio Arleo; Carla Binucci; Emilio Di Giacomo; William S. Evans; Luca Grilli 001; Giuseppe Liotta; Henk Meijer; Fabrizio Montecchiani; Sue Whitesides; Stephen K. Wismath (Comput. Geom., 2018)

New results on edge partitions of 1-plane graphs. - Emilio Di Giacomo; Walter Didimo; William S. Evans; Giuseppe Liotta; Henk Meijer; Fabrizio Montecchiani; Stephen K. Wismath (Theor. Comput. Sci., 2018)

Line and Plane Cover Numbers Revisited. - Therese Biedl; Stefan Felsner; Henk Meijer; Alexander Wolff 001 (GD, 2019)

Coordinated Motion Planning: Reconfiguring a Swarm of Labeled Robots with Bounded Stretch. - Erik D. Demaine; Sándor P. Fekete; Phillip Keldenich; Henk Meijer; Christian Scheffer (SIAM J. Comput., 2019)

Colored anchored visibility representations in 2D and 3D space. - Carla Binucci; Emilio Di Giacomo; Seok-Hee Hong 001; Giuseppe Liotta; Henk Meijer; Vera Sacristán; Stephen K. Wismath (Comput. Geom., 2020)

Polyline drawings with topological constraints. - Emilio Di Giacomo; Peter Eades; Giuseppe Liotta; Henk Meijer; Fabrizio Montecchiani (Theor. Comput. Sci., 2020)

Packing Trees into 1-planar Graphs. - Felice De Luca; Emilio Di Giacomo; Seok-Hee Hong 001; Stephen G. Kobourov; William J. Lenhart; Giuseppe Liotta; Henk Meijer; Alessandra Tappini; Stephen K. Wismath (J. Graph Algorithms Appl., 2021)

New Bounds on the Local and Global Edge-length Ratio of Planar Graphs. - Emilio Di Giacomo; Walter Didimo; Giuseppe Liotta; Henk Meijer; Fabrizio Montecchiani; Stephen K. Wismath (CoRR, 2023)

Edge-Unfolding Polycubes with Orthogonally Convex Layers. - Mirela Damian; Henk Meijer (COCOA (2), 2024)

Bounds on the edge-length ratio of 2-outerplanar graphs. - Emilio Di Giacomo; Walter Didimo; Giuseppe Liotta; Henk Meijer; Fabrizio Montecchiani; Stephen K. Wismath (Comput. Geom., 2025)