| 2008 |
|---|
| 93 | EE | Michael A. Bender,
David P. Bunde,
Erik D. Demaine,
Sándor P. Fekete,
Vitus J. Leung,
Henk Meijer,
Cynthia A. Phillips:
Communication-Aware Processor Allocation for Supercomputers: Finding Point Sets of Small Average Distance.
Algorithmica 50(2): 279-298 (2008) |
| 92 | EE | Erik D. Demaine,
Jeff Erickson,
Danny Krizanc,
Henk Meijer,
Pat Morin,
Mark H. Overmars,
Sue Whitesides:
Realizing partitions respecting full and partial order information.
J. Discrete Algorithms 6(1): 51-58 (2008) |
| 2007 |
|---|
| 91 | | Kamrul Islam,
Henk Meijer,
Yurai Núñez Rodríguez,
David Rappaport,
Henry Xiao:
Hamilton Circuits in Hexagonal Grid Graphs.
CCCG 2007: 85-88 |
| 90 | EE | Emilio Di Giacomo,
Walter Didimo,
Giuseppe Liotta,
Henk Meijer,
Stephen K. Wismath:
Point-Set Embedding of Trees with Edge Constraints.
Graph Drawing 2007: 113-124 |
| 89 | EE | Erik D. Demaine,
Francisco Gomez-Martin,
Henk Meijer,
David Rappaport,
Perouz Taslakian,
Godfried T. Toussaint,
Terry Winograd,
David R. Wood:
The Distance Geometry of Music
CoRR abs/0705.4085: (2007) |
| 88 | EE | Giuseppe Liotta,
Henk Meijer:
Advances in graph drawing: The 11th International Symposium on Graph Drawing.
Discrete Applied Mathematics 155(9): 1077 (2007) |
| 87 | EE | Selim G. Akl,
Kamrul Islam,
Henk Meijer:
On planar path transformation.
Inf. Process. Lett. 104(2): 59-64 (2007) |
| 86 | EE | Marco Martens,
Henk Meijer:
On the probabilistic behaviour of a heuristic algorithm for maximal Hamiltonian tours.
J. Discrete Algorithms 5(1): 102-114 (2007) |
| 2006 |
|---|
| 85 | EE | 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,
Godfried T. Toussaint:
Curves in the Sand: Algorithmic Drawing.
CCCG 2006 |
| 84 | EE | Kamrul Islam,
Selim G. Akl,
Henk Meijer:
On Planar Path Transformation.
CCCG 2006 |
| 83 | EE | Emilio Di Giacomo,
Walter Didimo,
Giuseppe Liotta,
Henk Meijer,
Francesco Trotta,
Stephen K. Wismath:
k -Colored Point-Set Embeddability of Outerplanar Graphs.
Graph Drawing 2006: 318-329 |
| 82 | EE | Michael Hirsch,
Henk Meijer,
David Rappaport:
Biclique Edge Cover Graphs and Confluent Drawings.
Graph Drawing 2006: 405-416 |
| 2005 |
|---|
| 81 | EE | Erik D. Demaine,
Francisco Gomez-Martin,
Henk Meijer,
David Rappaport,
Perouz Taslakian,
Godfried T. Toussaint,
Terry Winograd,
David R. Wood:
The Distance Geometry of Deep Rhythms and Scales.
CCCG 2005: 163-166 |
| 80 | EE | Kathryn Duffy,
Chris McAloney,
Henk Meijer,
David Rappaport:
Closest Segments.
CCCG 2005: 232-234 |
| 79 | EE | Emilio Di Giacomo,
Giuseppe Liotta,
Henk Meijer,
Stephen K. Wismath:
Volume Requirements of 3D Upward Drawings.
Graph Drawing 2005: 101-110 |
| 78 | EE | Michael A. Bender,
David P. Bunde,
Erik D. Demaine,
Sándor P. Fekete,
Vitus J. Leung,
Henk Meijer,
Cynthia A. Phillips:
Communication-Aware Processor Allocation for Supercomputers.
WADS 2005: 169-181 |
| 77 | EE | Justin Colannino,
Mirela Damian,
Ferran Hurtado,
John Iacono,
Henk Meijer,
Suneeta Ramaswami,
Godfried T. Toussaint:
An O(n log n)-Time Algorithm for the Restricted Scaffold Assignment
CoRR abs/cs/0507013: (2005) |
| 76 | EE | Sándor P. Fekete,
Henk Meijer:
The one-round Voronoi game replayed.
Comput. Geom. 30(2): 81-94 (2005) |
| 75 | EE | Emilio Di Giacomo,
Giuseppe Liotta,
Henk Meijer:
Computing straight-line 3D grid drawings of graphs in linear volume.
Comput. Geom. 32(1): 26-58 (2005) |
| 74 | EE | Erik D. Demaine,
Jeff Erickson,
Ferran Hurtado,
John Iacono,
Stefan Langerman,
Henk Meijer,
Mark H. Overmars,
Sue Whitesides:
Separating Point Sets in Polygonal Environments.
Int. J. Comput. Geometry Appl. 15(4): 403-420 (2005) |
| 73 | EE | Henk Meijer,
David Rappaport:
Guest Editors' Foreword.
Int. J. Comput. Geometry Appl. 15(6): 545-546 (2005) |
| 2004 |
|---|
| 72 | EE | Henk Meijer,
David Rappaport:
Simultaneous edge flips for convex subdivisions.
CCCG 2004: 57-59 |
| 71 | EE | Emilio Di Giacomo,
Walter Didimo,
Giuseppe Liotta,
Henk Meijer:
Computing Radial Drawings on the Minimum Number of Circles.
Graph Drawing 2004: 251-261 |
| 70 | EE | Sándor P. Fekete,
Marco E. Lübbecke,
Henk Meijer:
Minimizing the stabbing number of matchings, trees, and triangulations.
SODA 2004: 437-446 |
| 69 | EE | Erik D. Demaine,
Jeff Erickson,
Ferran Hurtado,
John Iacono,
Stefan Langerman,
Henk Meijer,
Mark H. Overmars,
Sue Whitesides:
Separating point sets in polygonal environments.
Symposium on Computational Geometry 2004: 10-16 |
| 68 | EE | Michael A. Bender,
David P. Bunde,
Erik D. Demaine,
Sándor P. Fekete,
Vitus J. Leung,
Henk Meijer,
Cynthia A. Phillips:
Communication-Aware Processor Allocation for Supercomputers
CoRR cs.DS/0407058: (2004) |
| 2003 |
|---|
| 67 | EE | Emilio Di Giacomo,
Henk Meijer:
Track Drawings of Graphs with Constant Queue Number.
Graph Drawing 2003: 214-225 |
| 66 | EE | Sándor P. Fekete,
Henk Meijer:
The One-Round Voronoi Game Replayed.
WADS 2003: 150-171 |
| 65 | EE | Sándor P. Fekete,
Henk Meijer:
Maximum Dispersion and Geometric Maximum Weight Cliques.
Algorithmica 38(3): 501-511 (2003) |
| 64 | EE | Sándor P. Fekete,
Henk Meijer:
The one-round Voronoi game replayed
CoRR cs.CG/0305016: (2003) |
| 63 | EE | Sándor P. Fekete,
Marco E. Lübbecke,
Henk Meijer:
Minimizing the stabbing number of matchings, trees, and triangulations
CoRR cs.CG/0310034: (2003) |
| 62 | EE | Sándor P. Fekete,
Henk Meijer:
Maximum dispersion and geometric maximum weight cliques
CoRR cs.DS/0310037: (2003) |
| 61 | | Giuseppe Liotta,
Henk Meijer:
Voronoi drawings of trees.
Comput. Geom. 24(3): 147-178 (2003) |
| 60 | | Oswin Aichholzer,
David Bremner,
Erik D. Demaine,
Henk Meijer,
Vera Sacristan,
Michael A. Soss:
Long proteins with unique optimal foldings in the H-P model.
Comput. Geom. 25(1-2): 139-159 (2003) |
| 59 | | Ferran Hurtado,
Giuseppe Liotta,
Henk Meijer:
Optimal and suboptimal robust algorithms for proximity graphs.
Comput. Geom. 25(1-2): 35-49 (2003) |
| 58 | EE | José Miguel Díaz-Báñez,
Ferran Hurtado,
Henk Meijer,
David Rappaport,
Joan Antoni Sellarès:
The Largest Empty Annulus Problem.
Int. J. Comput. Geometry Appl. 13(4): 317-325 (2003) |
| 2002 |
|---|
| 57 | EE | Greg Aloupis,
Erik D. Demaine,
Henk Meijer,
Joseph O'Rourke,
Ileana Streinu,
Godfried T. Toussaint:
On flat-state connectivity of chains with fixed acute angles.
CCCG 2002: 27-30 |
| 56 | EE | Greg Aloupis,
Prosenjit Bose,
Erik D. Demaine,
Stefan Langerman,
Henk Meijer,
Mark H. Overmars,
Godfried T. Toussaint:
Computing signed permutations of polygons.
CCCG 2002: 68-71 |
| 55 | EE | Greg Aloupis,
Erik D. Demaine,
Vida Dujmovic,
Jeff Erickson,
Stefan Langerman,
Henk Meijer,
Joseph O'Rourke,
Mark H. Overmars,
Michael A. Soss,
Ileana Streinu,
Godfried T. Toussaint:
Flat-State Connectivity of Linkages under Dihedral Motions.
ISAAC 2002: 369-380 |
| 54 | EE | José Miguel Díaz-Báñez,
Ferran Hurtado,
Henk Meijer,
David Rappaport,
Joan Antoni Sellarès:
The Largest Empty Annulus Problem.
International Conference on Computational Science (3) 2002: 46-54 |
| 53 | EE | Sándor P. Fekete,
Henk Meijer,
André Rohe,
Walter Tietze:
Solving a "Hard" Problem to Approximate an "Easy" One: Heuristics for Maximum Matchings and Maximum Traveling Salesman Problems.
ACM Journal of Experimental Algorithms 7: 11 (2002) |
| 52 | EE | Oswin Aichholzer,
David Bremner,
Erik D. Demaine,
Henk Meijer,
Vera Sacristan,
Michael A. Soss:
Long Proteins with Unique Optimal Foldings in the H-P Model
CoRR cs.CG/0201018: (2002) |
| 51 | EE | Sándor P. Fekete,
Henk Meijer,
André Rohe,
Walter Tietze:
Solving a "Hard" Problem to Approximate an "Easy" One: Heuristics for Maximum Matchings and Maximum Traveling Salesman Problems
CoRR cs.DS/0212044: (2002) |
| 50 | | Prosenjit Bose,
Ferran Hurtado,
Henk Meijer,
Suneeta Ramaswami,
David Rappaport,
Vera Sacristan,
Thomas C. Shermer,
Godfried T. Toussaint:
Finding Specified Sections of Arrangements: 2D Results.
J. Math. Model. Algorithms 1(1): 3-16 (2002) |
| 2001 |
|---|
| 49 | EE | Sándor P. Fekete,
Henk Meijer,
André Rohe,
Walter Tietze:
Solving a "Hard" Problem to Approximate an "Easy" One: Heuristics for Maximum Matchings and Maximum Traveling Salesman Problems.
ALENEX 2001: 1-16 |
| 48 | EE | Liam Keliher,
Henk Meijer,
Stafford E. Tavares:
New Method for Upper Bounding the Maximum Average Linear Hull Probability for SPNs.
EUROCRYPT 2001: 420-436 |
| 47 | EE | Liam Keliher,
Henk Meijer,
Stafford E. Tavares:
Improving the Upper Bound on the Maximum Average Linear Hull Probability for Rijndael.
Selected Areas in Cryptography 2001: 112-128 |
| 46 | EE | Ferran Hurtado,
Giuseppe Liotta,
Henk Meijer:
Optimal, Suboptimal, and Robust Algorithms for Proximity Graphs.
WADS 2001: 2-13 |
| 45 | | Thomas Fevens,
Henk Meijer,
David Rappaport:
Minimum convex partition of a constrained point set.
Discrete Applied Mathematics 109(1-2): 95-107 (2001) |
| 44 | | Kiyoshi Hosono,
Henk Meijer,
David Rappaport:
On the visibility graph of convex translates.
Discrete Applied Mathematics 113(2-3): 195-210 (2001) |
| 2000 |
|---|
| 43 | EE | Sándor P. Fekete,
Henk Meijer:
Maximum dispersion and geometric maximum weight cliques.
APPROX 2000: 132-143 |
| 42 | EE | Oswin Aichholzer,
Carmen Cortés,
Erik D. Demaine,
Vida Dujmovic,
Jeff Erickson,
Henk Meijer,
Mark H. Overmars,
Belén Palop,
Suneeta Ramaswami,
Godfried T. Toussaint:
Flipturning polygons
CoRR cs.CG/0008010: (2000) |
| 41 | | Sándor P. Fekete,
Henk Meijer:
On Minimum Stars and Maximum Matchings.
Discrete & Computational Geometry 23(3): 389-407 (2000) |
| 1999 |
|---|
| 40 | | Stafford E. Tavares,
Henk Meijer:
Selected Areas in Cryptography '98, SAC'98, Kingston, Ontario, Canada, August 17-18, 1998, Proceedings
Springer 1999 |
| 39 | EE | Therese C. Biedl,
Anna Bretscher,
Henk Meijer:
Rectangle of Influence Drawings of Graphs without Filled 3-Cycles.
Graph Drawing 1999: 359-368 |
| 38 | EE | Giuseppe Liotta,
Henk Meijer:
Voronoi Drawings of Trees.
Graph Drawing 1999: 369-378 |
| 37 | EE | Liam Keliher,
Henk Meijer,
Stafford E. Tavares:
Modeling Linear Characteristics of Substitution-Permutation Networks.
Selected Areas in Cryptography 1999: 78-91 |
| 36 | EE | Sándor P. Fekete,
Henk Meijer:
On Minimum Stars, Minimum Steiner Stars, and Maximum Matchings.
Symposium on Computational Geometry 1999: 217-226 |
| 35 | EE | Paul E. Kearney,
Ryan Hayward,
Henk Meijer:
Evolutionary Trees and Ordinal Assertions.
Algorithmica 25(2-3): 196-221 (1999) |
| 34 | | Sándor P. Fekete,
Henk Meijer:
Rectangle and Box Visibility Graphs in 3D.
Int. J. Comput. Geometry Appl. 9(1): 1- (1999) |
| 1998 |
|---|
| 33 | EE | Prosenjit Bose,
Ferran Hurtado,
Henk Meijer,
Suneeta Ramaswami,
David Rappaport,
Vera Sacristan,
Thomas C. Shermer,
Godfried T. Toussaint:
Finding specified sections of arrangements: 2d results.
CCCG 1998 |
| 32 | | Giuseppe Liotta,
Anna Lubiw,
Henk Meijer,
Sue Whitesides:
The rectangle of influence drawability problem.
Comput. Geom. 10(1): 1-22 (1998) |
| 31 | | Esther M. Arkin,
Henk Meijer,
Joseph S. B. Mitchell,
David Rappaport,
Steven Skiena:
Decision trees for geometric models.
Int. J. Comput. Geometry Appl. 8(3): 343-364 (1998) |
| 30 | | Mark de Berg,
Henk Meijer,
Mark H. Overmars,
Gordon T. Wilfong:
Computing the Angularity Tolerance.
Int. J. Comput. Geometry Appl. 8(4): 467- (1998) |
| 29 | EE | Kelly A. Lyons,
Henk Meijer,
David Rappaport:
Algorithms for Cluster Busting in Anchored Graph Drawing.
J. Graph Algorithms Appl. 2(1): (1998) |
| 28 | EE | 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:
A Visibility Representation for Graphs in Three Dimensions.
J. Graph Algorithms Appl. 2(2): (1998) |
| 1997 |
|---|
| 27 | | Paul E. Kearney,
Ryan Hayward,
Henk Meijer:
Inferring Evolutionary Trees from Ordinal Data.
SODA 1997: 418-426 |
| 1996 |
|---|
| 26 | | Mark de Berg,
Henk Meijer,
Mark H. Overmars,
Gordon T. Wilfong:
Computing the Angularity Tolerance.
CCCG 1996: 331-336 |
| 25 | | Paraskevi Fragopoulou,
Selim G. Akl,
Henk Meijer:
Optimal Communication Primitives on the Generalized Hypercube Network.
J. Parallel Distrib. Comput. 32(2): 173-187 (1996) |
| 1994 |
|---|
| 24 | | Paul Colley,
Henk Meijer,
David Rappaport:
Optimal Nearly-Similar Polygon Stabbers of Convex Polygons.
CCCG 1994: 269-274 |
| 23 | | Hossam A. ElGindy,
Giuseppe Liotta,
Anna Lubiw,
Henk Meijer,
Sue Whitesides:
Recognizing Rectangle of Influence Drawable Graphs.
Graph Drawing 1994: 352-363 |
| 22 | | Selim G. Akl,
Henk Meijer,
Ivan Stojmenovic:
An Optimal Systolic Algorithm for Generating Permutations in Lexicographic Order.
J. Parallel Distrib. Comput. 20(1): 84-91 (1994) |
| 21 | | Ke Qiu,
Selim G. Akl,
Henk Meijer:
On Some Properties and Algorithms for the Star and Pancake Interconnection Networks.
J. Parallel Distrib. Comput. 22(1): 16-25 (1994) |
| 1993 |
|---|
| 20 | EE | Kelly A. Lyons,
Henk Meijer,
David Rappaport:
Properties of the voronoi diagram cluster buster.
CASCON 1993: 1148-1163 |
| 19 | | Henk Meijer,
Steven Skiena:
Reconstructing Polygons From X-Rays.
CCCG 1993: 381-386 |
| 18 | EE | Esther M. Arkin,
Henk Meijer,
Joseph S. B. Mitchell,
David Rappaport,
Steven Skiena:
Decision Trees for Geometric Models.
Symposium on Computational Geometry 1993: 369-378 |
| 1992 |
|---|
| 17 | | Henk Meijer,
David Rappaport:
Computing the Minimum Weight Triangulation of a Set of Linearly Ordered Points.
Inf. Process. Lett. 42(1): 35-38 (1992) |
| 1991 |
|---|
| 16 | | Ke Qiu,
Henk Meijer,
Selim G. Akl:
Parallel Routing and Sorting of the Pancake Network.
ICCI 1991: 360-371 |
| 15 | | Ke Qiu,
Henk Meijer,
Selim G. Akl:
Decomposing a Star Graph Into Disjoint Cycles.
Inf. Process. Lett. 39(3): 125-129 (1991) |
| 1990 |
|---|
| 14 | EE | Selim G. Akl,
Henk Meijer:
Parallel Binary Search.
IEEE Trans. Parallel Distrib. Syst. 1(2): 247-250 (1990) |
| 13 | | Ke Qiu,
Henk Meijer:
A Note on Diameter of Acyclic Directed Hypercubes.
Inf. Process. Lett. 36(1): 51-52 (1990) |
| 12 | EE | Henk Meijer,
Selim G. Akl:
Parallel Binary Search with Delayed Read Conflicts.
International Journal of High Speed Computing 2(1): 17-21 (1990) |
| 1989 |
|---|
| 11 | | Carlisle M. Adams,
Henk Meijer:
Security-related comments regarding McEliece's public-key cryptosystem.
IEEE Transactions on Information Theory 35(2): 454-455 (1989) |
| 1988 |
|---|
| 10 | | Henk Meijer,
R. Dawes:
Fault Tolerant Networks of Specified Diameter.
WG 1988: 74-86 |
| 1987 |
|---|
| 9 | EE | Carlisle M. Adams,
Henk Meijer:
Security-Related Comments Regarding McEliece's Public-Key Cryptosystem.
CRYPTO 1987: 224-228 |
| 1985 |
|---|
| 8 | EE | Henk Meijer,
Selim G. Akl:
Two New Secret Key Cryptosystems.
EUROCRYPT 1985: 96-102 |
| 7 | | Stephen J. MacKinnon,
Peter D. Taylor,
Henk Meijer,
Selim G. Akl:
An Optimal Algorithm for Assigning Cryptographic Keys to Control Access in a Hierarchy.
IEEE Trans. Computers 34(9): 797-802 (1985) |
| 1984 |
|---|
| 6 | EE | Selim G. Akl,
Henk Meijer:
A Fast Pseudo Random Permutation Generator With Applications to Cryptology.
CRYPTO 1984: 269-275 |
| 1982 |
|---|
| 5 | | Selim G. Akl,
Henk Meijer:
On the Average-Case Complexity of "Bucketing" Algorithms.
J. Algorithms 3(1): 9-13 (1982) |
| 1981 |
|---|
| 4 | | Henk Meijer,
Selim G. Akl:
Digital Signature Scheme for Computer Communication Networks.
CRYPTO 1981: 65-70 |
| 3 | | Henk Meijer:
A Note on `A Cryptosystem for Multiple Communication'.
Inf. Process. Lett. 12(4): 179-181 (1981) |
| 2 | | Dorothy E. Denning,
Henk Meijer,
Fred B. Schneider:
More on Master Keys for Group Sharing.
Inf. Process. Lett. 13(3): 125-126 (1981) |
| 1980 |
|---|
| 1 | | Henk Meijer,
Selim G. Akl:
The Design and Analysis of a New Hybrid Sorting Algorithm.
Inf. Process. Lett. 10(4/5): 213-218 (1980) |
