![]() | ![]() |
| 2012 | ||
|---|---|---|
| 132 | Mereke van Garderen, Giuseppe Liotta, Henk Meijer: Universal point sets for 2-coloured trees. Inf. Process. Lett. 112(8-9): 346-350 (2012) | |
| 131 | Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Henk Meijer: Drawing a tree as a minimum spanning tree approximation. J. Comput. Syst. Sci. 78(2): 491-503 (2012) | |
| 2011 | ||
| 130 | William Evans, Emden R. Gansner, Michael Kaufmann, Giuseppe Liotta, Henk Meijer, Andreas Spillner: Approximate Proximity Drawings. Graph Drawing 2011: 166-178 | |
| 129 | Greg Aloupis, Prosenjit Bose, Erik D. Demaine, Stefan Langerman, Henk Meijer, Mark H. Overmars, Godfried T. Toussaint: Computing Signed Permutations of Polygons. Int. J. Comput. Geometry Appl. 21(1): 87-100 (2011) | |
| 128 | Sergio Cabello, Marc J. van Kreveld, Giuseppe Liotta, Henk Meijer, Bettina Speckmann, Kevin Verbeek: Geometric Simultaneous Embeddings of a Graph and a Matching. J. Graph Algorithms Appl. 15(1): 79-96 (2011) | |
| 127 | Kevin Buchin, Marc J. van Kreveld, Henk Meijer, Bettina Speckmann, Kevin Verbeek: On Planar Supports for Hypergraphs. J. Graph Algorithms Appl. 15(4): 533-549 (2011) | |
| 126 | Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Henk Meijer: Area, Curve Complexity, and Crossing Resolution of Non-Planar Graph Drawings. Theory Comput. Syst. 49(3): 565-575 (2011) | |
| 2010 | ||
| 125 | Mereke van Garderen, Giuseppe Liotta, Henk Meijer: Universal Pointsets for 2-Coloured Trees. Graph Drawing 2010: 365-370 | |
| 124 | Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Henk Meijer: Drawing a Tree as a Minimum Spanning Tree Approximation. ISAAC (2) 2010: 61-72 | |
| 123 | Henk Meijer, Yurai Núñez Rodríguez, David Rappaport: Fault Recovery in Wireless Networks: The Geometric Recolouring Approach. SEA 2010: 474-485 | |
| 122 | Luca Grilli, Seok-Hee Hong, Giuseppe Liotta, Henk Meijer, Stephen K. Wismath: Matched drawability of graph pairs and of graph triples. Comput. Geom. 43(6-7): 611-634 (2010) | |
| 121 | Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Henk Meijer, Stephen K. Wismath: Constrained Point-Set Embeddability of Planar Graphs. Int. J. Comput. Geometry Appl. 20(5): 577-600 (2010) | |
| 2009 | ||
| 120 | Kamrul Islam, Selim G. Akl, Henk Meijer: Distributed Generation of a Family of Connected Dominating Sets in Wireless Sensor Networks. DCOSS 2009: 343-355 | |
| 119 | Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Henk Meijer: Area, Curve Complexity, and Crossing Resolution of Non-planar Graph Drawings. Graph Drawing 2009: 15-20 | |
| 118 | Sergio Cabello, Marc J. van Kreveld, Giuseppe Liotta, Henk Meijer, Bettina Speckmann, Kevin Verbeek: Geometric Simultaneous Embeddings of a Graph and a Matching. Graph Drawing 2009: 183-194 | |
| 117 | Kevin Buchin, Marc J. van Kreveld, Henk Meijer, Bettina Speckmann, Kevin Verbeek: On Planar Supports for Hypergraphs. Graph Drawing 2009: 345-356 | |
| 116 | Kamrul Islam, Selim G. Akl, Henk Meijer: Maximizing the lifetime of wireless sensor networks through domatic partition. LCN 2009: 436-442 | |
| 115 | Luca Grilli, Seok-Hee Hong, Giuseppe Liotta, Henk Meijer, Stephen K. Wismath: Matched Drawability of Graph Pairs and of Graph Triples. WALCOM 2009: 322-333 | |
| 114 | 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. Comput. Geom. 42(5): 429-454 (2009) | |
| 113 | Henk Meijer, David Rappaport: Editorial CCCG 2006. Comput. Geom. 42(5): 463 (2009) | |
| 112 | Esther M. Arkin, Sándor P. Fekete, Kamrul Islam, Henk Meijer, Joseph S. B. Mitchell, Yurai Núñez Rodríguez, Valentin Polishchuk, David Rappaport, Henry Xiao: Not being (super)thin or solid is hard: A study of grid Hamiltonicity. Comput. Geom. 42(6-7): 582-605 (2009) | |
| 111 | Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Henk Meijer, Stephen K. Wismath: Point-set embeddings of trees with given partial drawings. Comput. Geom. 42(6-7): 664-676 (2009) | |
| 110 | Henk Meijer, Yurai Núñez Rodríguez, David Rappaport: Bounds for point recolouring in geometric graphs. Comput. Geom. 42(6-7): 690-703 (2009) | |
| 109 | Emilio Di Giacomo, Giuseppe Liotta, Henk Meijer, Stephen K. Wismath: Volume requirements of 3D upward drawings. Discrete Mathematics 309(7): 1824-1837 (2009) | |
| 108 | Henk Meijer, Yurai Núñez Rodríguez, David Rappaport: An algorithm for computing simple k-factors. Inf. Process. Lett. 109(12): 620-625 (2009) | |
| 2008 | ||
| 107 | Selim G. Akl, Kamrul Islam, Henk Meijer: Direct Planar Tree Transformation and Counterexample. CCCG 2008 | |
| 106 | Henk Meijer, Yurai Núñez Rodríguez, David Rappaport: On the Complexity of Point Recolouring in Geometric Graphs. CCCG 2008 | |
| 105 | Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Henk Meijer, Stephen K. Wismath: Constrained Point-Set Embeddability of Planar Graphs. Graph Drawing 2008: 360-371 | |
| 104 | Kamrul Islam, Selim G. Akl, Henk Meijer: A Constant Factor Localized Algorithm for Computing Connected Dominating Sets in Wireless Sensor Networks. ICPADS 2008: 559-566 | |
| 103 | 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) | |
| 102 | Sándor P. Fekete, Marco E. Lübbecke, Henk Meijer: Minimizing the Stabbing Number of Matchings, Trees, and Triangulations. Discrete & Computational Geometry 40(4): 595-621 (2008) | |
| 101 | Selim G. Akl, Kamrul Islam, Henk Meijer: Planar tree transformation: Results and counterexample. Inf. Process. Lett. 109(1): 61-67 (2008) | |
| 100 | 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) | |
| 99 | Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Henk Meijer, Francesco Trotta, Stephen K. Wismath: k-colored Point-set Embeddability of Outerplanar Graphs. J. Graph Algorithms Appl. 12(1): 29-49 (2008) | |
| 2007 | ||
| 98 | Kamrul Islam, Henk Meijer, Yurai Núñez Rodríguez, David Rappaport, Henry Xiao: Hamilton Circuits in Hexagonal Grid Graphs. CCCG 2007: 85-88 | |
| 97 | 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 | |
| 96 | 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) | |
| 95 | Giuseppe Liotta, Henk Meijer: Advances in graph drawing: The 11th International Symposium on Graph Drawing. Discrete Applied Mathematics 155(9): 1077 (2007) | |
| 94 | Selim G. Akl, Kamrul Islam, Henk Meijer: On planar path transformation. Inf. Process. Lett. 104(2): 59-64 (2007) | |
| 93 | 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 | ||
| 92 | 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 | |
| 91 | Kamrul Islam, Selim G. Akl, Henk Meijer: On Planar Path Transformation. CCCG 2006 | |
| 90 | 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 | |
| 89 | Michael Hirsch, Henk Meijer, David Rappaport: Biclique Edge Cover Graphs and Confluent Drawings. Graph Drawing 2006: 405-416 | |
| 88 | Justin Colannino, Mirela Damian, Ferran Hurtado, John Iacono, Henk Meijer, Suneeta Ramaswami, Godfried T. Toussaint: An O(n log n)-Time Algorithm for the Restriction Scaffold Assignment Problem. Journal of Computational Biology 13(4): 979-989 (2006) | |
| 2005 | ||
| 87 | 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 | |
| 86 | Kathryn Duffy, Chris McAloney, Henk Meijer, David Rappaport: Closest Segments. CCCG 2005: 232-234 | |
| 85 | Magdalene Grantson, Henk Meijer, David Rappaport: Bi-chromatic minimum spanning trees. EuroCG 2005: 199-202 | |
| 84 | Emilio Di Giacomo, Giuseppe Liotta, Henk Meijer, Stephen K. Wismath: Volume Requirements of 3D Upward Drawings. Graph Drawing 2005: 101-110 | |
| 83 | 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 | |
| 82 | 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) | |
| 81 | Sándor P. Fekete, Henk Meijer: The one-round Voronoi game replayed. Comput. Geom. 30(2): 81-94 (2005) | |
| 80 | 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) | |
| 79 | 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) | |
| 78 | Henk Meijer, David Rappaport: Guest Editors' Foreword. Int. J. Comput. Geometry Appl. 15(6): 545-546 (2005) | |
| 77 | Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Henk Meijer: Computing Radial Drawings on the Minimum Number of Circles. J. Graph Algorithms Appl. 9(3): 365-389 (2005) | |
| 2004 | ||
| 76 | Henk Meijer, David Rappaport: Simultaneous edge flips for convex subdivisions. CCCG 2004: 57-59 | |
| 75 | Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Henk Meijer: Computing Radial Drawings on the Minimum Number of Circles. Graph Drawing 2004: 251-261 | |
| 74 | Sándor P. Fekete, Marco E. Lübbecke, Henk Meijer: Minimizing the stabbing number of matchings, trees, and triangulations. SODA 2004: 437-446 | |
| 73 | 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 | |
| 72 | 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) | |
| 71 | Liam Keliher, Henk Meijer, Stafford E. Tavares: Completion of Computation of Improved Upper Bound on the Maximum Average Linear Hull Probabilty for Rijndael. IACR Cryptology ePrint Archive 2004: 74 (2004) | |
| 2003 | ||
| 70 | Emilio Di Giacomo, Henk Meijer: Track Drawings of Graphs with Constant Queue Number. Graph Drawing 2003: 214-225 | |
| 69 | Sándor P. Fekete, Henk Meijer: The One-Round Voronoi Game Replayed. WADS 2003: 150-171 | |
| 68 | Sándor P. Fekete, Henk Meijer: Maximum Dispersion and Geometric Maximum Weight Cliques. Algorithmica 38(3): 501-511 (2003) | |
| 67 | Sándor P. Fekete, Henk Meijer: The one-round Voronoi game replayed CoRR cs.CG/0305016: (2003) | |
| 66 | Sándor P. Fekete, Marco E. Lübbecke, Henk Meijer: Minimizing the stabbing number of matchings, trees, and triangulations CoRR cs.CG/0310034: (2003) | |
| 65 | Sándor P. Fekete, Henk Meijer: Maximum dispersion and geometric maximum weight cliques CoRR cs.DS/0310037: (2003) | |
| 64 | Giuseppe Liotta, Henk Meijer: Voronoi drawings of trees. Comput. Geom. 24(3): 147-178 (2003) | |
| 63 | 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) | |
| 62 | Ferran Hurtado, Giuseppe Liotta, Henk Meijer: Optimal and suboptimal robust algorithms for proximity graphs. Comput. Geom. 25(1-2): 35-49 (2003) | |
| 61 | 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 | ||
| 60 | 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 | |
| 59 | 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 | |
| 58 | 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 | |
| 57 | 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 | |
| 56 | 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 Algorithmics 7: 11 (2002) | |
| 55 | 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) | |
| 54 | 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) | |
| 53 | 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 | ||
| 52 | 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 | |
| 51 | Liam Keliher, Henk Meijer, Stafford E. Tavares: New Method for Upper Bounding the Maximum Average Linear Hull Probability for SPNs. EUROCRYPT 2001: 420-436 | |
| 50 | 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 | |
| 49 | Ferran Hurtado, Giuseppe Liotta, Henk Meijer: Optimal, Suboptimal, and Robust Algorithms for Proximity Graphs. WADS 2001: 2-13 | |
| 48 | Thomas Fevens, Henk Meijer, David Rappaport: Minimum convex partition of a constrained point set. Discrete Applied Mathematics 109(1-2): 95-107 (2001) | |
| 47 | Kiyoshi Hosono, Henk Meijer, David Rappaport: On the visibility graph of convex translates. Discrete Applied Mathematics 113(2-3): 195-210 (2001) | |
| 46 | Liam Keliher, Henk Meijer, Stafford E. Tavares: Dual of New Method for Upper Bounding the Maximum Average Linear Hull Probability for SPNs. IACR Cryptology ePrint Archive 2001: 33 (2001) | |
| 2000 | ||
| 45 | Sándor P. Fekete, Henk Meijer: Maximum dispersion and geometric maximum weight cliques. APPROX 2000: 132-143 | |
| 44 | 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) | |
| 43 | Sándor P. Fekete, Henk Meijer: On Minimum Stars and Maximum Matchings. Discrete & Computational Geometry 23(3): 389-407 (2000) | |
| 1999 | ||
| 42 | Stafford E. Tavares, Henk Meijer: Selected Areas in Cryptography '98, SAC'98, Kingston, Ontario, Canada, August 17-18, 1998, Proceedings Springer 1999 | |
| 41 | Therese C. Biedl, Anna Bretscher, Henk Meijer: Rectangle of Influence Drawings of Graphs without Filled 3-Cycles. Graph Drawing 1999: 359-368 | |
| 40 | Giuseppe Liotta, Henk Meijer: Voronoi Drawings of Trees. Graph Drawing 1999: 369-378 | |
| 39 | Liam Keliher, Henk Meijer, Stafford E. Tavares: Modeling Linear Characteristics of Substitution-Permutation Networks. Selected Areas in Cryptography 1999: 78-91 | |
| 38 | Sándor P. Fekete, Henk Meijer: On Minimum Stars, Minimum Steiner Stars, and Maximum Matchings. Symposium on Computational Geometry 1999: 217-226 | |
| 37 | Paul E. Kearney, Ryan Hayward, Henk Meijer: Evolutionary Trees and Ordinal Assertions. Algorithmica 25(2-3): 196-221 (1999) | |
| 36 | Sándor P. Fekete, Henk Meijer: Rectangle and Box Visibility Graphs in 3D. Int. J. Comput. Geometry Appl. 9(1): 1- (1999) | |
| 1998 | ||
| 35 | 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 | |
| 34 | Giuseppe Liotta, Anna Lubiw, Henk Meijer, Sue Whitesides: The rectangle of influence drawability problem. Comput. Geom. 10(1): 1-22 (1998) | |
| 33 | 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) | |
| 32 | Mark de Berg, Henk Meijer, Mark H. Overmars, Gordon T. Wilfong: Computing the Angularity Tolerance. Int. J. Comput. Geometry Appl. 8(4): 467- (1998) | |
| 31 | Kelly A. Lyons, Henk Meijer, David Rappaport: Algorithms for Cluster Busting in Anchored Graph Drawing. J. Graph Algorithms Appl. 2(1): (1998) | |
| 30 | 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 | ||
| 29 | Paul E. Kearney, Ryan Hayward, Henk Meijer: Inferring Evolutionary Trees from Ordinal Data. SODA 1997: 418-426 | |
| 1996 | ||
| 28 | Mark de Berg, Henk Meijer, Mark H. Overmars, Gordon T. Wilfong: Computing the Angularity Tolerance. CCCG 1996: 331-336 | |
| 27 | 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 | ||
| 26 | Paul Colley, Henk Meijer, David Rappaport: Optimal Nearly-Similar Polygon Stabbers of Convex Polygons. CCCG 1994: 269-274 | |
| 25 | Hossam A. ElGindy, Giuseppe Liotta, Anna Lubiw, Henk Meijer, Sue Whitesides: Recognizing Rectangle of Influence Drawable Graphs. Graph Drawing 1994: 352-363 | |
| 24 | 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) | |
| 23 | 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 | ||
| 22 | Kelly A. Lyons, Henk Meijer, David Rappaport: Properties of the voronoi diagram cluster buster. CASCON 1993: 1148-1163 | |
| 21 | Henk Meijer, Steven Skiena: Reconstructing Polygons From X-Rays. CCCG 1993: 381-386 | |
| 20 | 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 | ||
| 19 | 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 | ||
| 18 | Ke Qiu, Henk Meijer, Selim G. Akl: Parallel Routing and Sorting of the Pancake Network. ICCI 1991: 360-371 | |
| 17 | Ke Qiu, Henk Meijer, Selim G. Akl: Decomposing a Star Graph Into Disjoint Cycles. Inf. Process. Lett. 39(3): 125-129 (1991) | |
| 1990 | ||
| 16 | Selim G. Akl, Henk Meijer: Parallel Binary Search. IEEE Trans. Parallel Distrib. Syst. 1(2): 247-250 (1990) | |
| 15 | Ke Qiu, Henk Meijer: A Note on Diameter of Acyclic Directed Hypercubes. Inf. Process. Lett. 36(1): 51-52 (1990) | |
| 14 | Henk Meijer, Selim G. Akl: Parallel Binary Search with Delayed Read Conflicts. International Journal of High Speed Computing 2(1): 17-21 (1990) | |
| 1989 | ||
| 13 | 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 | ||
| 12 | Henk Meijer, R. Dawes: Fault Tolerant Networks of Specified Diameter. WG 1988: 74-86 | |
| 1987 | ||
| 11 | Carlisle M. Adams, Henk Meijer: Security-Related Comments Regarding McEliece's Public-Key Cryptosystem. CRYPTO 1987: 224-228 | |
| 10 | Henk Meijer, Selim G. Akl: Optimal computation of prefix sums on a binary tree of processors. International Journal of Parallel Programming 16(2): 127-136 (1987) | |
| 1985 | ||
| 9 | Henk Meijer, Selim G. Akl: Two New Secret Key Cryptosystems. EUROCRYPT 1985: 96-102 | |
| 8 | 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) | |
| 7 | Becky Chan, Henk Meijer: A note on the method of puzzles for key distribution. International Journal of Parallel Programming 14(4): 221-223 (1985) | |
| 1984 | ||
| 6 | 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) | |
Colors in the list of coauthors
Last update Sun Jun 3 16:06:10 2012 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page