Henk Meijer

ORCID

Publication Activity (10 Years)

Years Active: 1980-2024
Publications (10 Years): 23

Top Venues

CoRR

Graph Drawing

Comput. Geom.

J. Graph Algorithms Appl.

Publications

Mirela Damian, Henk Meijer
Edge-Unfolding Polycubes with Orthogonally Convex Layers. CoRR (2024)
Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Henk Meijer, Fabrizio Montecchiani, Stephen K. Wismath
New Bounds on the Local and Global Edge-length Ratio of Planar Graphs. CoRR (2023)
Felice De Luca, Emilio Di Giacomo, Seok-Hee Hong, Stephen G. Kobourov, William Lenhart, Giuseppe Liotta, Henk Meijer, Alessandra Tappini, Stephen K. Wismath
Packing Trees into 1-planar Graphs. J. Graph Algorithms Appl. 25 (2) (2021)
Carla Binucci, Emilio Di Giacomo, Seok-Hee Hong, Giuseppe Liotta, Henk Meijer, Vera Sacristán, Stephen K. Wismath
Colored anchored visibility representations in 2D and 3D space. Comput. Geom. 89 (2020)
Felice De Luca, Emilio Di Giacomo, Seok-Hee Hong, Stephen G. Kobourov, William Lenhart, Giuseppe Liotta, Henk Meijer, Alessandra Tappini, Stephen K. Wismath
Packing Trees into 1-Planar Graphs. WALCOM (2020)
Emilio Di Giacomo, Peter Eades, Giuseppe Liotta, Henk Meijer, Fabrizio Montecchiani
Polyline drawings with topological constraints. Theor. Comput. Sci. 809 (2020)
Therese C. Biedl, Stefan Felsner, Henk Meijer, Alexander Wolff
Line and Plane Cover Numbers Revisited. CoRR (2019)
Felice De Luca, Emilio Di Giacomo, Seok-Hee Hong, Stephen G. Kobourov, William Lenhart, Giuseppe Liotta, Henk Meijer, Alessandra Tappini, Stephen K. Wismath
Packing Trees into 1-planar Graphs. CoRR (2019)
Therese C. Biedl, Stefan Felsner, Henk Meijer, Alexander Wolff
Line and Plane Cover Numbers Revisited. Graph Drawing (2019)
Erik D. Demaine, Sándor P. Fekete, Phillip Keldenich, Henk Meijer, Christian Scheffer
Coordinated Motion Planning: Reconfiguring a Swarm of Labeled Robots with Bounded Stretch. SIAM J. Comput. 48 (6) (2019)
Emilio Di Giacomo, Walter Didimo, William S. Evans, Giuseppe Liotta, Henk Meijer, Fabrizio Montecchiani, Stephen K. Wismath
Ortho-polygon Visibility Representations of Embedded Graphs. Algorithmica 80 (8) (2018)
Emilio Di Giacomo, Walter Didimo, William S. Evans, Giuseppe Liotta, Henk Meijer, Fabrizio Montecchiani, Stephen K. Wismath
New results on edge partitions of 1-plane graphs. Theor. Comput. Sci. 713 (2018)
Emilio Di Giacomo, Peter Eades, Giuseppe Liotta, Henk Meijer, Fabrizio Montecchiani
Polyline Drawings with Topological Constraints. CoRR (2018)
Alessio Arleo, Carla Binucci, Emilio Di Giacomo, William S. Evans, Luca Grilli, Giuseppe Liotta, Henk Meijer, Fabrizio Montecchiani, Sue Whitesides, Stephen K. Wismath
Visibility representations of boxes in 2.5 dimensions. Comput. Geom. 72 (2018)
Erik D. Demaine, Sándor P. Fekete, Phillip Keldenich, Christian Scheffer, Henk Meijer
Coordinated Motion Planning: Reconfiguring a Swarm of Labeled Robots with Bounded Stretch. SoCG (2018)
Erik D. Demaine, Sándor P. Fekete, Phillip Keldenich, Henk Meijer, Christian Scheffer
Coordinated Motion Planning: Reconfiguring a Swarm of Labeled Robots with Bounded Stretch. CoRR (2018)
Emilio Di Giacomo, Peter Eades, Giuseppe Liotta, Henk Meijer, Fabrizio Montecchiani
Polyline Drawings with Topological Constraints. ISAAC (2018)
Emilio Di Giacomo, Walter Didimo, William S. Evans, Giuseppe Liotta, Henk Meijer, Fabrizio Montecchiani, Stephen K. Wismath
New Results on Edge Partitions of 1-plane Graphs. CoRR (2017)
Alessio Arleo, Carla Binucci, Emilio Di Giacomo, William S. Evans, Luca Grilli, Giuseppe Liotta, Henk Meijer, Fabrizio Montecchiani, Sue Whitesides, Stephen K. Wismath
Visibility Representations of Boxes in 2.5 Dimensions. CoRR (2016)
William S. Evans, Giuseppe Liotta, Henk Meijer, Stephen K. Wismath
Alternating paths and cycles of minimum length. Comput. Geom. 58 (2016)
Alessio Arleo, Carla Binucci, Emilio Di Giacomo, William S. Evans, Luca Grilli, Giuseppe Liotta, Henk Meijer, Fabrizio Montecchiani, Sue Whitesides, Stephen K. Wismath
Visibility Representations of Boxes in 2.5 Dimensions. Graph Drawing (2016)
Emilio Di Giacomo, Walter Didimo, William S. Evans, Giuseppe Liotta, Henk Meijer, Fabrizio Montecchiani, Stephen K. Wismath
Ortho-Polygon Visibility Representations of Embedded Graphs. Graph Drawing (2016)
Emilio Di Giacomo, Walter Didimo, William S. Evans, Giuseppe Liotta, Henk Meijer, Fabrizio Montecchiani, Stephen K. Wismath
Ortho-polygon Visibility Representations of Embedded Graphs. CoRR (2016)
Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Henk Meijer, Stephen K. Wismath
Planar and Quasi-Planar Simultaneous Geometric Embedding. Comput. J. 58 (11) (2015)
William S. Evans, Giuseppe Liotta, Henk Meijer, Stephen K. Wismath
Alternating Paths and Cycles of Minimum Length. Graph Drawing (2015)
Emilio Di Giacomo, Giuseppe Liotta, Henk Meijer
The Approximate Rectangle of Influence Drawability Problem. Algorithmica 72 (2) (2015)
Henk Meijer, Stephen K. Wismath
Point Set Embedding in 3D. J. Graph Algorithms Appl. 19 (1) (2015)
Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Henk Meijer, Stephen K. Wismath
Planar and Quasi Planar Simultaneous Geometric Embedding. Graph Drawing (2014)
Bernardo M. Ábrego, Ruy Fabila Monroy, Silvia Fernández-Merchant, David Flores-Peñaloza, Ferran Hurtado, Henk Meijer, Vera Sacristán, Maria Saumell
Proximity graphs inside large weighted graphs. Networks 61 (1) (2013)
William S. Evans, Emden R. Gansner, Michael Kaufmann, Giuseppe Liotta, Henk Meijer, Andreas Spillner
Approximate proximity drawings. Comput. Geom. 46 (6) (2013)
Emilio Di Giacomo, Giuseppe Liotta, Henk Meijer
The Approximate Rectangle of Influence Drawability Problem. Graph Drawing (2012)
Prosenjit Bose, Vida Dujmovic, Ferran Hurtado, John Iacono, Stefan Langerman, Henk Meijer, Vera Sacristán Adinolfi, Maria Saumell, David R. Wood
PROXIMITY GRAPHS: E, δ, Δ, χ AND ω. Int. J. Comput. Geom. Appl. 22 (5) (2012)
Patrizio Angelini, Carla Binucci, William S. Evans, Ferran Hurtado, Giuseppe Liotta, Tamara Mchedlidze, Henk Meijer, Yoshio Okamoto
Universal Point Subsets for Planar Graphs. ISAAC (2012)
Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Henk Meijer
Drawing a tree as a minimum spanning tree approximation. J. Comput. Syst. Sci. 78 (2) (2012)
Mereke van Garderen, Giuseppe Liotta, Henk Meijer
Universal point sets for 2-coloured trees. Inf. Process. Lett. 112 (8-9) (2012)
Stephen K. Wismath, Henk Meijer
Point-Set Embedding in Three Dimensions. CCCG (2012)
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) (2011)
William S. Evans, Emden R. Gansner, Michael Kaufmann, Giuseppe Liotta, Henk Meijer, Andreas Spillner
Approximate Proximity Drawings. Graph Drawing (2011)
Kevin Buchin, Marc J. van Kreveld, Henk Meijer, Bettina Speckmann, Kevin Verbeek
On Planar Supports for Hypergraphs. J. Graph Algorithms Appl. 15 (4) (2011)
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) (2011)
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. Geom. Appl. 21 (1) (2011)
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) (2010)
Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Henk Meijer, Stephen K. Wismath
Constrained Point-Set Embeddability of Planar Graphs. Int. J. Comput. Geom. Appl. 20 (5) (2010)
Mereke van Garderen, Giuseppe Liotta, Henk Meijer
Universal Pointsets for 2-Coloured Trees. Graph Drawing (2010)
Henk Meijer, Yurai Núñez Rodríguez, David Rappaport
Fault Recovery in Wireless Networks: The Geometric Recolouring Approach. SEA (2010)
Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Henk Meijer
Drawing a Tree as a Minimum Spanning Tree Approximation. ISAAC (2) (2010)
Henk Meijer, David Rappaport
Editorial CCCG 2006. Comput. Geom. 42 (5) (2009)
Kevin Buchin, Marc J. van Kreveld, Henk Meijer, Bettina Speckmann, Kevin Verbeek
On Planar Supports for Hypergraphs. Graph Drawing (2009)
Henk Meijer, Yurai Núñez Rodríguez, David Rappaport
An algorithm for computing simple k-factors. Inf. Process. Lett. 109 (12) (2009)
Kamrul Islam, Selim G. Akl, Henk Meijer
Distributed Generation of a Family of Connected Dominating Sets in Wireless Sensor Networks. DCOSS (2009)
Luca Grilli, Seok-Hee Hong, Giuseppe Liotta, Henk Meijer, Stephen K. Wismath
Matched Drawability of Graph Pairs and of Graph Triples. WALCOM (2009)
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) (2009)
Emilio Di Giacomo, Giuseppe Liotta, Henk Meijer, Stephen K. Wismath
Volume requirements of 3D upward drawings. Discret. Math. 309 (7) (2009)
Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Henk Meijer
Area, Curve Complexity, and Crossing Resolution of Non-planar Graph Drawings. Graph Drawing (2009)
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) (2009)
Henk Meijer, Yurai Núñez Rodríguez, David Rappaport
Bounds for point recolouring in geometric graphs. Comput. Geom. 42 (6-7) (2009)
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) (2009)
Kamrul Islam, Selim G. Akl, Henk Meijer
Maximizing the lifetime of wireless sensor networks through domatic partition. LCN (2009)
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)
Selim G. Akl, Kamrul Islam, Henk Meijer
Direct Planar Tree Transformation and Counterexample. CCCG (2008)
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) (2008)
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) (2008)
Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Henk Meijer, Stephen K. Wismath
Constrained Point-Set Embeddability of Planar Graphs. Graph Drawing (2008)
Henk Meijer, Yurai Núñez Rodríguez, David Rappaport
On the Complexity of Point Recolouring in Geometric Graphs. CCCG (2008)
Kamrul Islam, Selim G. Akl, Henk Meijer
A Constant Factor Localized Algorithm for Computing Connected Dominating Sets in Wireless Sensor Networks. ICPADS (2008)
Sándor P. Fekete, Marco E. Lübbecke, Henk Meijer
Minimizing the Stabbing Number of Matchings, Trees, and Triangulations. Discret. Comput. Geom. 40 (4) (2008)
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) (2008)
Selim G. Akl, Kamrul Islam, Henk Meijer
Planar tree transformation: Results and counterexample. Inf. Process. Lett. 109 (1) (2008)
Selim G. Akl, Kamrul Islam, Henk Meijer
On planar path transformation. Inf. Process. Lett. 104 (2) (2007)
Marco Martens, Henk Meijer
On the probabilistic behaviour of a heuristic algorithm for maximal Hamiltonian tours. J. Discrete Algorithms 5 (1) (2007)
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 (2007)
Justin Colannino, Mirela Damian, Ferran Hurtado, Stefan Langerman, Henk Meijer, Suneeta Ramaswami, Diane L. Souvaine, Godfried Toussaint
Efficient Many-To-Many Point Matching in One Dimension. Graphs Comb. 23 (Supplement-1) (2007)
Kamrul Islam, Henk Meijer, Yurai Núñez Rodríguez, David Rappaport, Henry Xiao
Hamilton Circuits in Hexagonal Grid Graphs. CCCG (2007)
Giuseppe Liotta, Henk Meijer
Advances in graph drawing: The 11th International Symposium on Graph Drawing. Discret. Appl. Math. 155 (9) (2007)
Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Henk Meijer, Stephen K. Wismath
Point-Set Embedding of Trees with Edge Constraints. Graph Drawing (2007)
Justin Colannino, Mirela Damian, Ferran Hurtado, John Iacono, Henk Meijer, Suneeta Ramaswami, Godfried T. Toussaint
)-Time Algorithm for the Restriction Scaffold Assignment Problem. J. Comput. Biol. 13 (4) (2006)
Michael Hirsch, Henk Meijer, David Rappaport
Biclique Edge Cover Graphs and Confluent Drawings. Graph Drawing (2006)
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)
Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Henk Meijer, Francesco Trotta, Stephen K. Wismath
-Colored Point-Set Embeddability of Outerplanar Graphs. Graph Drawing (2006)
Kamrul Islam, Selim G. Akl, Henk Meijer
On Planar Path Transformation. CCCG (2006)
Henk Meijer, David Rappaport
Guest Editors' Foreword. Int. J. Comput. Geom. Appl. 15 (6) (2005)
Emilio Di Giacomo, Giuseppe Liotta, Henk Meijer
Computing straight-line 3D grid drawings of graphs in linear volume. Comput. Geom. 32 (1) (2005)
Magdalene Grantson, Henk Meijer, David Rappaport
Bi-chromatic minimum spanning trees. EuroCG (2005)
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)
Sándor P. Fekete, Henk Meijer
The one-round Voronoi game replayed. Comput. Geom. 30 (2) (2005)
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. Geom. Appl. 15 (4) (2005)
Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Henk Meijer
Computing Radial Drawings on the Minimum Number of Circles. J. Graph Algorithms Appl. 9 (3) (2005)
Emilio Di Giacomo, Giuseppe Liotta, Henk Meijer, Stephen K. Wismath
Volume Requirements of 3D Upward Drawings. Graph Drawing (2005)
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)
Kathryn Duffy, Chris McAloney, Henk Meijer, David Rappaport
Closest Segments. CCCG (2005)
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 (2005)
Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Henk Meijer
Computing Radial Drawings on the Minimum Number of Circles. Graph Drawing (2004)
Sándor P. Fekete, Henk Meijer
Maximum Dispersion and Geometric Maximum Weight Cliques. Algorithmica 38 (3) (2004)
Erik D. Demaine, Jeff Erickson, Ferran Hurtado, John Iacono, Stefan Langerman, Henk Meijer, Mark H. Overmars, Sue Whitesides
Separating point sets in polygonal environments. SCG (2004)
Liam Keliher, Henk Meijer, Stafford E. Tavares
Completion of Computation of Improved Upper Bound on the Maximum Average Linear Hull Probabilty for Rijndael. IACR Cryptol. ePrint Arch. 2004 (2004)
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 (2004)
Henk Meijer, David Rappaport
Simultaneous edge flips for convex subdivisions. CCCG (2004)
Sándor P. Fekete, Marco E. Lübbecke, Henk Meijer
Minimizing the stabbing number of matchings, trees, and triangulations. SODA (2004)
Sándor P. Fekete, Henk Meijer
The one-round Voronoi game replayed CoRR (2003)
Sándor P. Fekete, Henk Meijer
Maximum dispersion and geometric maximum weight cliques CoRR (2003)

Henk Meijer.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Henk Meijer