Henk Meijer - RankMe

176 papers A* 9A 21B 16C 2Misc 1Journal 104Unranked 23

Year	Rank	Type	Title / Venue / Authors
2025	J	`jnl`	Bounds on the edge-length ratio of 2-outerplanar graphs. Comput. Geom. Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Henk Meijer, Fabrizio Montecchiani, Stephen K. Wismath
2024	—	`conf`	Edge-Unfolding Polycubes with Orthogonally Convex Layers. COCOA (2) Mirela Damian, Henk Meijer
2024	J	`jnl`	Edge-Unfolding Polycubes with Orthogonally Convex Layers. CoRR Mirela Damian, Henk Meijer
2023	J	`jnl`	New Bounds on the Local and Global Edge-length Ratio of Planar Graphs. CoRR Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Henk Meijer, Fabrizio Montecchiani, Stephen K. Wismath
2021	J	`jnl`	Packing Trees into 1-planar Graphs. J. Graph Algorithms Appl. Felice De Luca, Emilio Di Giacomo, Seok-Hee Hong, Stephen G. Kobourov, William J. Lenhart, Giuseppe Liotta, Henk Meijer, Alessandra Tappini, Stephen K. Wismath
2020	J	`jnl`	Colored anchored visibility representations in 2D and 3D space. Comput. Geom. Carla Binucci, Emilio Di Giacomo, Seok-Hee Hong, Giuseppe Liotta, Henk Meijer, Vera Sacristán, Stephen K. Wismath
2020	B	`conf`	Packing Trees into 1-Planar Graphs. WALCOM Felice De Luca, Emilio Di Giacomo, Seok-Hee Hong, Stephen G. Kobourov, William J. Lenhart, Giuseppe Liotta, Henk Meijer, Alessandra Tappini, Stephen K. Wismath
2020	J	`jnl`	Polyline drawings with topological constraints. Theor. Comput. Sci. Emilio Di Giacomo, Peter Eades, Giuseppe Liotta, Henk Meijer, Fabrizio Montecchiani
2019	J	`jnl`	Coordinated Motion Planning: Reconfiguring a Swarm of Labeled Robots with Bounded Stretch. SIAM J. Comput. Erik D. Demaine, Sándor P. Fekete, Phillip Keldenich, Henk Meijer, Christian Scheffer
2019	A	`conf`	Line and Plane Cover Numbers Revisited. GD Therese Biedl, Stefan Felsner, Henk Meijer, Alexander Wolff
2019	J	`jnl`	Line and Plane Cover Numbers Revisited. CoRR Therese Biedl, Stefan Felsner, Henk Meijer, Alexander Wolff
2019	J	`jnl`	Packing Trees into 1-planar Graphs. CoRR Felice De Luca, Emilio Di Giacomo, Seok-Hee Hong, Stephen G. Kobourov, William J. Lenhart, Giuseppe Liotta, Henk Meijer, Alessandra Tappini, Stephen K. Wismath
2018	A*	`conf`	Coordinated Motion Planning: Reconfiguring a Swarm of Labeled Robots with Bounded Stretch. SoCG Erik D. Demaine, Sándor P. Fekete, Phillip Keldenich, Christian Scheffer, Henk Meijer
2018	J	`jnl`	Coordinated Motion Planning: Reconfiguring a Swarm of Labeled Robots with Bounded Stretch. CoRR Erik D. Demaine, Sándor P. Fekete, Phillip Keldenich, Henk Meijer, Christian Scheffer
2018	J	`jnl`	New results on edge partitions of 1-plane graphs. Theor. Comput. Sci. Emilio Di Giacomo, Walter Didimo, William S. Evans, Giuseppe Liotta, Henk Meijer, Fabrizio Montecchiani, Stephen K. Wismath
2018	J	`jnl`	Ortho-polygon Visibility Representations of Embedded Graphs. Algorithmica Emilio Di Giacomo, Walter Didimo, William S. Evans, Giuseppe Liotta, Henk Meijer, Fabrizio Montecchiani, Stephen K. Wismath
2018	B	`conf`	Polyline Drawings with Topological Constraints. ISAAC Emilio Di Giacomo, Peter Eades, Giuseppe Liotta, Henk Meijer, Fabrizio Montecchiani
2018	J	`jnl`	Polyline Drawings with Topological Constraints. CoRR Emilio Di Giacomo, Peter Eades, Giuseppe Liotta, Henk Meijer, Fabrizio Montecchiani
2018	J	`jnl`	Visibility representations of boxes in 2.5 dimensions. Comput. Geom. Alessio Arleo, Carla Binucci, Emilio Di Giacomo, William S. Evans, Luca Grilli, Giuseppe Liotta, Henk Meijer, Fabrizio Montecchiani, Sue Whitesides, Stephen K. Wismath
2017	J	`jnl`	New Results on Edge Partitions of 1-plane Graphs. CoRR Emilio Di Giacomo, Walter Didimo, William S. Evans, Giuseppe Liotta, Henk Meijer, Fabrizio Montecchiani, Stephen K. Wismath
2016	J	`jnl`	Alternating paths and cycles of minimum length. Comput. Geom. William S. Evans, Giuseppe Liotta, Henk Meijer, Stephen K. Wismath
2016	A	`conf`	Ortho-Polygon Visibility Representations of Embedded Graphs. GD Emilio Di Giacomo, Walter Didimo, William S. Evans, Giuseppe Liotta, Henk Meijer, Fabrizio Montecchiani, Stephen K. Wismath
2016	J	`jnl`	Ortho-polygon Visibility Representations of Embedded Graphs. CoRR Emilio Di Giacomo, Walter Didimo, William S. Evans, Giuseppe Liotta, Henk Meijer, Fabrizio Montecchiani, Stephen K. Wismath
2016	A	`conf`	Visibility Representations of Boxes in 2.5 Dimensions. GD Alessio Arleo, Carla Binucci, Emilio Di Giacomo, William S. Evans, Luca Grilli, Giuseppe Liotta, Henk Meijer, Fabrizio Montecchiani, Sue Whitesides, Stephen K. Wismath
2016	J	`jnl`	Visibility Representations of Boxes in 2.5 Dimensions. CoRR Alessio Arleo, Carla Binucci, Emilio Di Giacomo, William S. Evans, Luca Grilli, Giuseppe Liotta, Henk Meijer, Fabrizio Montecchiani, Sue Whitesides, Stephen K. Wismath
2015	A	`conf`	Alternating Paths and Cycles of Minimum Length. GD William S. Evans, Giuseppe Liotta, Henk Meijer, Stephen K. Wismath
2015	J	`jnl`	Planar and Quasi-Planar Simultaneous Geometric Embedding. Comput. J. Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Henk Meijer, Stephen K. Wismath
2015	J	`jnl`	Point Set Embedding in 3D. J. Graph Algorithms Appl. Henk Meijer, Stephen K. Wismath
2015	J	`jnl`	The Approximate Rectangle of Influence Drawability Problem. Algorithmica Emilio Di Giacomo, Giuseppe Liotta, Henk Meijer
2014	A	`conf`	Planar and Quasi Planar Simultaneous Geometric Embedding. GD Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Henk Meijer, Stephen K. Wismath
2013	J	`jnl`	Approximate proximity drawings. Comput. Geom. William S. Evans, Emden R. Gansner, Michael Kaufmann, Giuseppe Liotta, Henk Meijer, Andreas Spillner
2013	J	`jnl`	Proximity graphs inside large weighted graphs. Networks Bernardo M. Ábrego, Ruy Fabila-Monroy, Silvia Fernández-Merchant, David Flores-Peñaloza, Ferran Hurtado, Henk Meijer, Vera Sacristán, Maria Saumell
2012	J	`jnl`	Drawing a tree as a minimum spanning tree approximation. J. Comput. Syst. Sci. Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Henk Meijer
2012	J	`jnl`	PROXIMITY GRAPHS: E, δ, Δ, χ AND ω. Int. J. Comput. Geom. Appl. Prosenjit Bose, Vida Dujmovic, Ferran Hurtado, John Iacono, Stefan Langerman, Henk Meijer, Vera Sacristán Adinolfi, Maria Saumell, David R. Wood
2012	—	`conf`	Point-Set Embedding in Three Dimensions. CCCG Stephen K. Wismath, Henk Meijer
2012	A	`conf`	The Approximate Rectangle of Influence Drawability Problem. GD Emilio Di Giacomo, Giuseppe Liotta, Henk Meijer
2012	B	`conf`	Universal Point Subsets for Planar Graphs. ISAAC Patrizio Angelini, Carla Binucci, William S. Evans, Ferran Hurtado, Giuseppe Liotta, Tamara Mchedlidze, Henk Meijer, Yoshio Okamoto
2012	J	`jnl`	Universal point sets for 2-coloured trees. Inf. Process. Lett. Mereke van Garderen, Giuseppe Liotta, Henk Meijer
2011	A	`conf`	Approximate Proximity Drawings. GD William S. Evans, Emden R. Gansner, Michael Kaufmann, Giuseppe Liotta, Henk Meijer, Andreas Spillner
2011	J	`jnl`	Area, Curve Complexity, and Crossing Resolution of Non-Planar Graph Drawings. Theory Comput. Syst. Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Henk Meijer
2011	J	`jnl`	Computing Signed Permutations of Polygons. Int. J. Comput. Geom. Appl. Greg Aloupis, Prosenjit Bose, Erik D. Demaine, Stefan Langerman, Henk Meijer, Mark H. Overmars, Godfried T. Toussaint
2011	J	`jnl`	Geometric Simultaneous Embeddings of a Graph and a Matching. J. Graph Algorithms Appl. Sergio Cabello, Marc J. van Kreveld, Giuseppe Liotta, Henk Meijer, Bettina Speckmann, Kevin Verbeek
2011	J	`jnl`	On Planar Supports for Hypergraphs. J. Graph Algorithms Appl. Kevin Buchin, Marc J. van Kreveld, Henk Meijer, Bettina Speckmann, Kevin Verbeek
2010	J	`jnl`	Constrained Point-Set Embeddability of Planar Graphs. Int. J. Comput. Geom. Appl. Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Henk Meijer, Stephen K. Wismath
2010	—	`conf`	Drawing a Tree as a Minimum Spanning Tree Approximation. ISAAC (2) Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Henk Meijer
2010	B	`conf`	Fault Recovery in Wireless Networks: The Geometric Recolouring Approach. SEA Henk Meijer, Yurai Núñez Rodríguez, David Rappaport
2010	J	`jnl`	Matched drawability of graph pairs and of graph triples. Comput. Geom. Luca Grilli, Seok-Hee Hong, Giuseppe Liotta, Henk Meijer, Stephen K. Wismath
2010	A	`conf`	Universal Pointsets for 2-Coloured Trees. GD Mereke van Garderen, Giuseppe Liotta, Henk Meijer
2009	J	`jnl`	An algorithm for computing simple k-factors. Inf. Process. Lett. Henk Meijer, Yurai Núñez Rodríguez, David Rappaport
2009	A	`conf`	Area, Curve Complexity, and Crossing Resolution of Non-planar Graph Drawings. GD Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Henk Meijer
2009	J	`jnl`	Bounds for point recolouring in geometric graphs. Comput. Geom. Henk Meijer, Yurai Núñez Rodríguez, David Rappaport
2009	B	`conf`	Distributed Generation of a Family of Connected Dominating Sets in Wireless Sensor Networks. DCOSS Kamrul Islam, Selim G. Akl, Henk Meijer
2009	J	`jnl`	Editorial CCCG 2006. Comput. Geom. Henk Meijer, David Rappaport
2009	A	`conf`	Geometric Simultaneous Embeddings of a Graph and a Matching. GD Sergio Cabello, Marc J. van Kreveld, Giuseppe Liotta, Henk Meijer, Bettina Speckmann, Kevin Verbeek
2009	B	`conf`	Matched Drawability of Graph Pairs and of Graph Triples. WALCOM Luca Grilli, Seok-Hee Hong, Giuseppe Liotta, Henk Meijer, Stephen K. Wismath
2009	B	`conf`	Maximizing the lifetime of wireless sensor networks through domatic partition. LCN Kamrul Islam, Selim G. Akl, Henk Meijer
2009	J	`jnl`	Not being (super)thin or solid is hard: A study of grid Hamiltonicity. Comput. Geom. 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
2009	A	`conf`	On Planar Supports for Hypergraphs. GD Kevin Buchin, Marc J. van Kreveld, Henk Meijer, Bettina Speckmann, Kevin Verbeek
2009	J	`jnl`	Point-set embeddings of trees with given partial drawings. Comput. Geom. Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Henk Meijer, Stephen K. Wismath
2009	J	`jnl`	The distance geometry of music. Comput. Geom. Erik D. Demaine, Francisco Gomez-Martin, Henk Meijer, David Rappaport, Perouz Taslakian, Godfried T. Toussaint, Terry Winograd, David R. Wood
2009	J	`jnl`	Volume requirements of 3D upward drawings. Discret. Math. Emilio Di Giacomo, Giuseppe Liotta, Henk Meijer, Stephen K. Wismath
2008	B	`conf`	A Constant Factor Localized Algorithm for Computing Connected Dominating Sets in Wireless Sensor Networks. ICPADS Kamrul Islam, Selim G. Akl, Henk Meijer
2008	J	`jnl`	Communication-Aware Processor Allocation for Supercomputers: Finding Point Sets of Small Average Distance. Algorithmica Michael A. Bender, David P. Bunde, Erik D. Demaine, Sándor P. Fekete, Vitus J. Leung, Henk Meijer, Cynthia A. Phillips
2008	A	`conf`	Constrained Point-Set Embeddability of Planar Graphs. GD Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Henk Meijer, Stephen K. Wismath
2008	—	`conf`	Direct Planar Tree Transformation and Counterexample. CCCG Selim G. Akl, Kamrul Islam, Henk Meijer
2008	J	`jnl`	Minimizing the Stabbing Number of Matchings, Trees, and Triangulations. Discret. Comput. Geom. Sándor P. Fekete, Marco E. Lübbecke, Henk Meijer
2008	—	`conf`	On the Complexity of Point Recolouring in Geometric Graphs. CCCG Henk Meijer, Yurai Núñez Rodríguez, David Rappaport
2008	J	`jnl`	Planar tree transformation: Results and counterexample. Inf. Process. Lett. Selim G. Akl, Kamrul Islam, Henk Meijer
2008	J	`jnl`	Realizing partitions respecting full and partial order information. J. Discrete Algorithms Erik D. Demaine, Jeff Erickson, Danny Krizanc, Henk Meijer, Pat Morin, Mark H. Overmars, Sue Whitesides
2008	J	`jnl`	k-colored Point-set Embeddability of Outerplanar Graphs. J. Graph Algorithms Appl. Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Henk Meijer, Francesco Trotta, Stephen K. Wismath
2007	J	`jnl`	Advances in graph drawing: The 11th International Symposium on Graph Drawing. Discret. Appl. Math. Giuseppe Liotta, Henk Meijer
2007	J	`jnl`	Efficient Many-To-Many Point Matching in One Dimension. Graphs Comb. Justin Colannino, Mirela Damian, Ferran Hurtado, Stefan Langerman, Henk Meijer, Suneeta Ramaswami, Diane L. Souvaine, Godfried Toussaint
2007	—	`conf`	Hamilton Circuits in Hexagonal Grid Graphs. CCCG Kamrul Islam, Henk Meijer, Yurai Núñez Rodríguez, David Rappaport, Henry Xiao
2007	J	`jnl`	On planar path transformation. Inf. Process. Lett. Selim G. Akl, Kamrul Islam, Henk Meijer
2007	J	`jnl`	On the probabilistic behaviour of a heuristic algorithm for maximal Hamiltonian tours. J. Discrete Algorithms Marco Martens, Henk Meijer
2007	A	`conf`	Point-Set Embedding of Trees with Edge Constraints. GD Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Henk Meijer, Stephen K. Wismath
2007	J	`jnl`	The Distance Geometry of Music CoRR Erik D. Demaine, Francisco Gomez-Martin, Henk Meijer, David Rappaport, Perouz Taslakian, Godfried T. Toussaint, Terry Winograd, David R. Wood
2006	J	`jnl`	An J. Comput. Biol. Justin Colannino, Mirela Damian, Ferran Hurtado, John Iacono, Henk Meijer, Suneeta Ramaswami, Godfried T. Toussaint
2006	A	`conf`	Biclique Edge Cover Graphs and Confluent Drawings. GD Michael Hirsch, Henk Meijer, David Rappaport
2006	—	`conf`	Curves in the Sand: Algorithmic Drawing. CCCG 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
2006	—	`conf`	On Planar Path Transformation. CCCG Kamrul Islam, Selim G. Akl, Henk Meijer
2005	J	`jnl`	An O(n log n)-Time Algorithm for the Restricted Scaffold Assignment CoRR Justin Colannino, Mirela Damian, Ferran Hurtado, John Iacono, Henk Meijer, Suneeta Ramaswami, Godfried T. Toussaint
2005	C	`conf`	Bi-chromatic minimum spanning trees. EuroCG Magdalene Grantson, Henk Meijer, David Rappaport
2005	—	`conf`	Closest Segments. CCCG Kathryn Duffy, Chris McAloney, Henk Meijer, David Rappaport
2005	B	`conf`	Communication-Aware Processor Allocation for Supercomputers. WADS Michael A. Bender, David P. Bunde, Erik D. Demaine, Sándor P. Fekete, Vitus J. Leung, Henk Meijer, Cynthia A. Phillips
2005	J	`jnl`	Computing Radial Drawings on the Minimum Number of Circles. J. Graph Algorithms Appl. Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Henk Meijer
2005	J	`jnl`	Computing straight-line 3D grid drawings of graphs in linear volume. Comput. Geom. Emilio Di Giacomo, Giuseppe Liotta, Henk Meijer
2005	J	`jnl`	Guest Editors' Foreword. Int. J. Comput. Geom. Appl. Henk Meijer, David Rappaport
2005	J	`jnl`	Separating Point Sets in Polygonal Environments. Int. J. Comput. Geom. Appl. Erik D. Demaine, Jeff Erickson, Ferran Hurtado, John Iacono, Stefan Langerman, Henk Meijer, Mark H. Overmars, Sue Whitesides
2005	—	`conf`	The Distance Geometry of Deep Rhythms and Scales. CCCG Erik D. Demaine, Francisco Gomez-Martin, Henk Meijer, David Rappaport, Perouz Taslakian, Godfried T. Toussaint, Terry Winograd, David R. Wood
2005	J	`jnl`	The one-round Voronoi game replayed. Comput. Geom. Sándor P. Fekete, Henk Meijer
2005	A	`conf`	Volume Requirements of 3D Upward Drawings. GD Emilio Di Giacomo, Giuseppe Liotta, Henk Meijer, Stephen K. Wismath
2004	J	`jnl`	Communication-Aware Processor Allocation for Supercomputers CoRR Michael A. Bender, David P. Bunde, Erik D. Demaine, Sándor P. Fekete, Vitus J. Leung, Henk Meijer, Cynthia A. Phillips
2004	J	`jnl`	Completion of Computation of Improved Upper Bound on the Maximum Average Linear Hull Probabilty for Rijndael. IACR Cryptol. ePrint Arch. Liam Keliher, Henk Meijer, Stafford E. Tavares
2004	A	`conf`	Computing Radial Drawings on the Minimum Number of Circles. GD Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Henk Meijer
2004	J	`jnl`	Maximum Dispersion and Geometric Maximum Weight Cliques. Algorithmica Sándor P. Fekete, Henk Meijer
2004	A*	`conf`	Minimizing the stabbing number of matchings, trees, and triangulations. SODA Sándor P. Fekete, Marco E. Lübbecke, Henk Meijer
2004	—	`conf`	Separating point sets in polygonal environments. SCG Erik D. Demaine, Jeff Erickson, Ferran Hurtado, John Iacono, Stefan Langerman, Henk Meijer, Mark H. Overmars, Sue Whitesides
2004	—	`conf`	Simultaneous edge flips for convex subdivisions. CCCG Henk Meijer, David Rappaport
2003	J	`jnl`	Long proteins with unique optimal foldings in the H-P model. Comput. Geom. Oswin Aichholzer, David Bremner, Erik D. Demaine, Henk Meijer, Vera Sacristán, Michael A. Soss
2003	J	`jnl`	Maximum dispersion and geometric maximum weight cliques CoRR Sándor P. Fekete, Henk Meijer
2003	J	`jnl`	Minimizing the stabbing number of matchings, trees, and triangulations CoRR Sándor P. Fekete, Marco E. Lübbecke, Henk Meijer
2003	J	`jnl`	Optimal and suboptimal robust algorithms for proximity graphs. Comput. Geom. Ferran Hurtado, Giuseppe Liotta, Henk Meijer
2003	J	`jnl`	The Largest Empty Annulus Problem. Int. J. Comput. Geom. Appl. José Miguel Díaz-Báñez, Ferran Hurtado, Henk Meijer, David Rappaport, Joan Antoni Sellarès
2003	B	`conf`	The One-Round Voronoi Game Replayed. WADS Sándor P. Fekete, Henk Meijer
2003	J	`jnl`	The one-round Voronoi game replayed CoRR Sándor P. Fekete, Henk Meijer
2003	A	`conf`	Track Drawings of Graphs with Constant Queue Number. GD Emilio Di Giacomo, Henk Meijer
2003	J	`jnl`	Voronoi drawings of trees. Comput. Geom. Giuseppe Liotta, Henk Meijer
2002	—	`conf`	Computing signed permutations of polygons. CCCG Greg Aloupis, Prosenjit Bose, Erik D. Demaine, Stefan Langerman, Henk Meijer, Mark H. Overmars, Godfried T. Toussaint
2002	J	`jnl`	Finding Specified Sections of Arrangements: 2D Results. J. Math. Model. Algorithms Prosenjit Bose, Ferran Hurtado, Henk Meijer, Suneeta Ramaswami, David Rappaport, Vera Sacristán, Thomas C. Shermer, Godfried T. Toussaint
2002	B	`conf`	Flat-State Connectivity of Linkages under Dihedral Motions. ISAAC 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
2002	J	`jnl`	Flipturning Polygons. Discret. Comput. Geom. 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
2002	J	`jnl`	Long Proteins with Unique Optimal Foldings in the H-P Model CoRR Oswin Aichholzer, David Bremner, Erik D. Demaine, Henk Meijer, Vera Sacristán, Michael A. Soss
2002	—	`conf`	On flat-state connectivity of chains with fixed acute angles. CCCG Greg Aloupis, Erik D. Demaine, Henk Meijer, Joseph O'Rourke, Ileana Streinu, Godfried T. Toussaint
2002	J	`jnl`	Solving a "Hard" Problem to Approximate an "Easy" One: Heuristics for Maximum Matchings and Maximum Traveling Salesman Problems CoRR Sándor P. Fekete, Henk Meijer, André Rohe, Walter Tietze
2002	J	`jnl`	Solving a "Hard" Problem to Approximate an "Easy" One: Heuristics for Maximum Matchings and Maximum Traveling Salesman Problems. ACM J. Exp. Algorithmics Sándor P. Fekete, Henk Meijer, André Rohe, Walter Tietze
2002	Misc	`conf`	The Largest Empty Annulus Problem. International Conference on Computational Science (3) José Miguel Díaz-Báñez, Ferran Hurtado, Henk Meijer, David Rappaport, Joan Antoni Sellarès
2001	J	`jnl`	Dual of New Method for Upper Bounding the Maximum Average Linear Hull Probability for SPNs. IACR Cryptol. ePrint Arch. Liam Keliher, Henk Meijer, Stafford E. Tavares
2001	B	`conf`	Improving the Upper Bound on the Maximum Average Linear Hull Probability for Rijndael. Selected Areas in Cryptography Liam Keliher, Henk Meijer, Stafford E. Tavares
2001	J	`jnl`	Minimum convex partition of a constrained point set. Discret. Appl. Math. Thomas Fevens, Henk Meijer, David Rappaport
2001	A*	`conf`	New Method for Upper Bounding the Maximum Average Linear Hull Probability for SPNs. EUROCRYPT Liam Keliher, Henk Meijer, Stafford E. Tavares
2001	J	`jnl`	On the visibility graph of convex translates. Discret. Appl. Math. Kiyoshi Hosono, Henk Meijer, David Rappaport
2001	B	`conf`	Optimal, Suboptimal, and Robust Algorithms for Proximity Graphs. WADS Ferran Hurtado, Giuseppe Liotta, Henk Meijer
2001	A	`conf`	Solving a "Hard" Problem to Approximate an "Easy" One: Heuristics for Maximum Matchings and Maximum Traveling Salesman Problems. ALENEX Sándor P. Fekete, Henk Meijer, André Rohe, Walter Tietze
2000	J	`jnl`	Flipturning polygons CoRR 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
2000	—	`conf`	Maximum dispersion and geometric maximum weight cliques. APPROX Sándor P. Fekete, Henk Meijer
2000	J	`jnl`	On Minimum Stars and Maximum Matchings. Discret. Comput. Geom. Sándor P. Fekete, Henk Meijer
1999	J	`jnl`	Evolutionary Trees and Ordinal Assertions. Algorithmica Paul E. Kearney, Ryan Hayward, Henk Meijer
1999	B	`conf`	Modeling Linear Characteristics of Substitution-Permutation Networks. Selected Areas in Cryptography Liam Keliher, Henk Meijer, Stafford E. Tavares
1999	—	`conf`	On Minimum Stars, Minimum Steiner Stars, and Maximum Matchings. SCG Sándor P. Fekete, Henk Meijer
1999	J	`jnl`	Rectangle and Box Visibility Graphs in 3D. Int. J. Comput. Geom. Appl. Sándor P. Fekete, Henk Meijer
1999	A	`conf`	Rectangle of Influence Drawings of Graphs without Filled 3-Cycles. GD Therese Biedl, Anna Bretscher, Henk Meijer
1999	B	`ed.`	Selected Areas in Cryptography '98, SAC'98, Kingston, Ontario, Canada, August 17-18, 1998, Proceedings Selected Areas in Cryptography Stafford E. Tavares, Henk Meijer
1999	A	`conf`	Voronoi Drawings of Trees. GD Giuseppe Liotta, Henk Meijer
1998	J	`jnl`	A Visibility Representation for Graphs in Three Dimensions. J. Graph Algorithms Appl. 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
1998	J	`jnl`	Algorithms for Cluster Busting in Anchored Graph Drawing. J. Graph Algorithms Appl. Kelly A. Lyons, Henk Meijer, David Rappaport
1998	J	`jnl`	Computing the Angularity Tolerance. Int. J. Comput. Geom. Appl. Mark de Berg, Henk Meijer, Mark H. Overmars, Gordon T. Wilfong
1998	J	`jnl`	Decision trees for geometric models. Int. J. Comput. Geom. Appl. Esther M. Arkin, Henk Meijer, Joseph S. B. Mitchell, David Rappaport, Steven Skiena
1998	—	`conf`	Finding specified sections of arrangements: 2d results. CCCG Prosenjit Bose, Ferran Hurtado, Henk Meijer, Suneeta Ramaswami, David Rappaport, Vera Sacristán, Thomas C. Shermer, Godfried T. Toussaint
1998	J	`jnl`	The rectangle of influence drawability problem. Comput. Geom. Giuseppe Liotta, Anna Lubiw, Henk Meijer, Sue Whitesides
1997	A*	`conf`	Inferring Evolutionary Trees from Ordinal Data. SODA Paul E. Kearney, Ryan Hayward, Henk Meijer
1996	—	`conf`	Computing the Angularity Tolerance. CCCG Mark de Berg, Henk Meijer, Mark H. Overmars, Gordon T. Wilfong
1996	J	`jnl`	Optimal Communication Primitives on the Generalized Hypercube Network. J. Parallel Distributed Comput. Paraskevi Fragopoulou, Selim G. Akl, Henk Meijer
1995	—	`conf`	Motivating lazy guards. CCCG Paul Colley, Henk Meijer, David Rappaport
1994	J	`jnl`	An Optimal Systolic Algorithm for Generating Permutations in Lexicographic Order. J. Parallel Distributed Comput. Selim G. Akl, Henk Meijer, Ivan Stojmenovic
1994	J	`jnl`	On Some Properties and Algorithms for the Star and Pancake Interconnection Networks. J. Parallel Distributed Comput. Ke Qiu, Selim G. Akl, Henk Meijer
1994	—	`conf`	Optimal Nearly-Similar Polygon Stabbers of Convex Polygons. CCCG Paul Colley, Henk Meijer, David Rappaport
1994	A	`conf`	Recognizing Rectangle of Influence Drawable Graphs. GD Hossam A. ElGindy, Giuseppe Liotta, Anna Lubiw, Henk Meijer, Sue Whitesides
1993	—	`conf`	Decision Trees for Geometric Models. SCG Esther M. Arkin, Henk Meijer, Joseph S. B. Mitchell, David Rappaport, Steven Skiena
1993	—	`conf`	Properties of the voronoi diagram cluster buster. CASCON Kelly A. Lyons, Henk Meijer, David Rappaport
1993	—	`conf`	Reconstructing Polygons From X-Rays. CCCG Henk Meijer, Steven Skiena
1992	J	`jnl`	Computing the Minimum Weight Triangulation of a Set of Linearly Ordered Points. Inf. Process. Lett. Henk Meijer, David Rappaport
1991	J	`jnl`	Decomposing a Star Graph Into Disjoint Cycles. Inf. Process. Lett. Ke Qiu, Henk Meijer, Selim G. Akl
1991	C	`conf`	Parallel Routing and Sorting of the Pancake Network. ICCI Ke Qiu, Henk Meijer, Selim G. Akl
1990	J	`jnl`	A Note on Diameter of Acyclic Directed Hypercubes. Inf. Process. Lett. Ke Qiu, Henk Meijer
1990	J	`jnl`	Parallel Binary Search with Delayed Read Conflicts. Int. J. High Speed Comput. Henk Meijer, Selim G. Akl
1990	J	`jnl`	Parallel Binary Search. IEEE Trans. Parallel Distributed Syst. Selim G. Akl, Henk Meijer
1989	J	`jnl`	Expressing parallel algorithms in Nial. Parallel Comput. Janice I. Glasgow, Michael A. Jenkins, Henk Meijer, Carl McCrosky
1989	J	`jnl`	Security-related comments regarding McEliece's public-key cryptosystem. IEEE Trans. Inf. Theory Carlisle M. Adams, Henk Meijer
1988	J	`jnl`	Bit serial addition trees and their applications. Computing Henk Meijer, Selim G. Akl
1988	B	`conf`	Fault Tolerant Networks of Specified Diameter. WG Henk Meijer, R. Dawes
1988	J	`jnl`	On the bit complexity of parallel computations. Integr. Selim G. Akl, Henk Meijer
1987	J	`jnl`	Optimal computation of prefix sums on a binary tree of processors. Int. J. Parallel Program. Henk Meijer, Selim G. Akl
1987	A*	`conf`	Security-Related Comments Regarding McEliece's Public-Key Cryptosystem. CRYPTO Carlisle M. Adams, Henk Meijer
1985	J	`jnl`	A note on the method of puzzles for key distribution. Int. J. Parallel Program. Becky Chan, Henk Meijer
1985	J	`jnl`	An Optimal Algorithm for Assigning Cryptographic Keys to Control Access in a Hierarchy. IEEE Trans. Computers Stephen J. MacKinnon, Peter D. Taylor, Henk Meijer, Selim G. Akl
1985	A*	`conf`	Two New Secret Key Cryptosystems. EUROCRYPT Henk Meijer, Selim G. Akl
1984	A*	`conf`	A Fast Pseudo Random Permutation Generator With Applications to Cryptology. CRYPTO Selim G. Akl, Henk Meijer
1983	J	`jnl`	Remarks on a Digital Signature Scheme. Cryptologia Henk Meijer, Selim G. Akl
1982	J	`jnl`	Digital Signature Schemes. Cryptologia Henk Meijer, Selim G. Akl
1982	J	`jnl`	On the Average-Case Complexity of "Bucketing" Algorithms. J. Algorithms Selim G. Akl, Henk Meijer
1981	J	`jnl`	A Note on 'A Cryptosystem for Multiple Communication'. Inf. Process. Lett. Henk Meijer
1981	A*	`conf`	Digital Signature Scheme for Computer Communication Networks. CRYPTO Henk Meijer, Selim G. Akl
1981	A*	`conf`	Digital signature schemes for computer communication networks. SIGCOMM Henk Meijer, Selim G. Akl
1981	J	`jnl`	More on Master Keys for Group Sharing. Inf. Process. Lett. Dorothy E. Denning, Henk Meijer, Fred B. Schneider
1980	J	`jnl`	The Design and Analysis of a New Hybrid Sorting Algorithm. Inf. Process. Lett. Henk Meijer, Selim G. Akl