Henk G. Meijer

From MaRDI portal
Revision as of 12:48, 8 December 2023 by AuthorDisambiguator (talk | contribs) (AuthorDisambiguator moved page Henk G. Meijer to Henk G. Meijer: Duplicate)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:1379022

Available identifiers

zbMath Open meijer.henk-gMaRDI QIDQ1379022

List of research outcomes





PublicationDate of PublicationType
Polyline Drawings with Topological Constraints2022-07-21Paper
Packing Trees into 1-planar Graphs2022-06-28Paper
Line and plane cover numbers revisited2020-10-26Paper
Colored anchored visibility representations in 2D and 3D space2020-10-23Paper
https://portal.mardi4nfdi.de/entity/Q51157972020-08-18Paper
Packing trees into 1-planar graphs2020-07-22Paper
Polyline drawings with topological constraints2020-01-29Paper
Coordinated Motion Planning: Reconfiguring a Swarm of Labeled Robots with Bounded Stretch2019-12-09Paper
Visibility representations of boxes in 2.5 dimensions2018-10-31Paper
Ortho-polygon visibility representations of embedded graphs2018-07-25Paper
New results on edge partitions of 1-plane graphs2018-02-06Paper
Separating point sets in polygonal environments2017-09-29Paper
Ortho-polygon visibility representations of embedded graphs2017-02-21Paper
Visibility representations of boxes in 2.5 dimensions2017-02-21Paper
Alternating Paths and Cycles of Minimum Length2017-02-10Paper
Alternating paths and cycles of minimum length2016-11-14Paper
Toward the True Random Cipher: On Expected Linear Probability Values for SPNS with Randomly Selected S-Boxes2015-10-27Paper
https://portal.mardi4nfdi.de/entity/Q55018192015-08-14Paper
https://portal.mardi4nfdi.de/entity/Q55012902015-08-03Paper
The approximate rectangle of influence drawability problem2015-07-10Paper
Point-Set Embedding in Three Dimensions2015-05-18Paper
Planar and Quasi Planar Simultaneous Geometric Embedding2015-01-07Paper
On Planar Supports for Hypergraphs2013-11-28Paper
Proximity graphs inside large weighted graphs2013-08-06Paper
PROXIMITY GRAPHS: E, δ, Δ, χ AND ω2013-06-24Paper
Approximate proximity drawings2013-04-29Paper
The Approximate Rectangle of Influence Drawability Problem2013-04-03Paper
Universal Point Subsets for Planar Graphs2013-03-21Paper
Universal point sets for 2-coloured trees2012-07-20Paper
Drawing a tree as a minimum spanning tree approximation2012-05-11Paper
Approximate Proximity Drawings2012-03-09Paper
Area, curve complexity, and crossing resolution of non-planar graph drawings2011-11-30Paper
COMPUTING SIGNED PERMUTATIONS OF POLYGONS2011-06-17Paper
Geometric Simultaneous Embeddings of a Graph and a Matching2011-04-19Paper
Universal Pointsets for 2-Coloured Trees2011-02-11Paper
CONSTRAINED POINT-SET EMBEDDABILITY OF PLANAR GRAPHS2010-12-15Paper
Drawing a Tree as a Minimum Spanning Tree Approximation2010-12-09Paper
An algorithm for computing simple \(k\)-factors2010-08-16Paper
Matched drawability of graph pairs and of graph triples2010-07-28Paper
Planar tree transformation: results and counterexample2010-06-09Paper
Geometric Simultaneous Embeddings of a Graph and a Matching2010-04-27Paper
On Planar Supports for Hypergraphs2010-04-27Paper
Area, Curve Complexity, and Crossing Resolution of Non-planar Graph Drawings2010-04-27Paper
Algorithms and Data Structures2010-04-20Paper
On planar path transformation2010-03-24Paper
Graph Drawing2009-08-11Paper
Not being (super)thin or solid is hard: A study of grid Hamiltonicity2009-07-27Paper
Point-set embeddings of trees with given partial drawings2009-07-27Paper
Bounds for point recolouring in geometric graphs2009-07-27Paper
Volume requirements of 3D upward drawings2009-04-09Paper
Minimizing the stabbing number of matchings, trees, and triangulations2009-03-24Paper
Constrained Point-Set Embeddability of Planar Graphs2009-03-03Paper
Matched Drawability of Graph Pairs and of Graph Triples2009-02-24Paper
Computing Radial Drawings on the Minimum Number of Circles2009-01-19Paper
k-colored Point-set Embeddability of Outerplanar Graphs2009-01-19Paper
Realizing partitions respecting full and partial order information2008-11-18Paper
On the probabilistic behaviour of a heuristic algorithm for maximal Hamiltonian tours2008-05-16Paper
Communication-aware processor allocation for supercomputers: Finding point sets of small average distance2008-04-03Paper
Point-Set Embedding of Trees with Edge Constraints2008-03-25Paper
ASYMPTOTICS AND ZEROS OF SYMMETRICALLY COHERENT PAIRS OF HERMITE TYPE2007-11-27Paper
k-Colored Point-Set Embeddability of Outerplanar Graphs2007-08-28Paper
Efficient many-to-Many point matching in one dimension2007-07-19Paper
Graph Drawing2006-11-13Paper
Algorithms and Data Structures2006-10-25Paper
Graph Drawing2005-12-07Paper
SEPARATING POINT SETS IN POLYGONAL ENVIRONMENTS2005-09-29Paper
Computing straight-line 3D grid drawings of graphs in linear volume2005-09-02Paper
Solving a "Hard" problem to approximate an "Easy" one2005-08-04Paper
The one-round Voronoi game replayed2005-01-31Paper
Maximum dispersion and geometric maximum weight cliques2004-09-22Paper
https://portal.mardi4nfdi.de/entity/Q47364262004-08-09Paper
https://portal.mardi4nfdi.de/entity/Q44278582003-09-14Paper
Optimal and suboptimal robust algorithms for proximity graphs2003-05-19Paper
Long proteins with unique optimal foldings in the H-P model2003-05-19Paper
Voronoi drawings of trees2003-04-28Paper
Solving a “Hard” Problem to Approximate an “Easy” One: Heuristics for Maximum Matchings and Maximum Traveling Salesman Problems2003-04-07Paper
A generating function for Laguerre-Sobolev orthogonal polynomials.2003-04-02Paper
Flipturning Polygons2003-03-17Paper
Zeros of Sobolev orthogonal polynomials of Hermite type2003-01-28Paper
https://portal.mardi4nfdi.de/entity/Q31496742002-12-03Paper
https://portal.mardi4nfdi.de/entity/Q47785382002-11-18Paper
On the visibility graph of convex translates2002-10-28Paper
https://portal.mardi4nfdi.de/entity/Q49493282002-09-11Paper
Zeros of Sobolev orthogonal polynomials following from coherent pairs2002-05-21Paper
https://portal.mardi4nfdi.de/entity/Q27537332001-11-11Paper
Asymptotics of Sobolev orthogonal polynomials for coherent pairs of Laguerre type2001-07-25Paper
Minimum convex partition of a constrained point set2001-06-14Paper
Computing the Angularity Tolerance2000-11-07Paper
RECTANGLE AND BOX VISIBILITY GRAPHS IN 3D2000-11-07Paper
Decision Trees for Geometric Models2000-11-07Paper
https://portal.mardi4nfdi.de/entity/Q45017142000-09-04Paper
On minimum stars and maximum matchings.2000-04-26Paper
Asymptotics of Sobolev orthogonal polynomials for coherent pairs of Jacobi type2000-02-03Paper
Evolutionary trees and ordinal assertions1999-12-06Paper
A Visibility Representation for Graphs in Three Dimensions1998-07-05Paper
The rectangle of influence drawability problem1998-06-08Paper
Algorithms for Cluster Busting in Anchored Graph Drawing1998-04-28Paper
An asymptotic result for Laguerre-Sobolev orthogonal polynomials1998-04-13Paper
Reconstructing polygons from X-rays1997-11-04Paper
https://portal.mardi4nfdi.de/entity/Q48434681995-08-13Paper
Symmetric orthogonal polynomials for Sobolev-type inner products1995-03-30Paper
An optimal systolic algorithm for generating permutations in lexicographic order1995-03-01Paper
Sobolev orthogonal polynomials with a small number of real zeros1995-02-20Paper
https://portal.mardi4nfdi.de/entity/Q43043981994-11-27Paper
On real and complex zeros of orthogonal polynomials in a discrete Sobolev space1994-08-01Paper
A q-Analogue of the Wronskian and a Second Solution of the Hahn-Exton q-Bessel Difference Equation1994-05-05Paper
Coherent pairs and zeros of Sobolev-type orthogonal polynomials1993-12-06Paper
Laguerre polynomials generalized to a certain discrete Sobolev inner product space1993-09-27Paper
Zero distribution of orthogonal polynomials in a certain discrete Sobolev space1993-08-19Paper
A Generalization of Laguerre Polynomials1993-08-09Paper
Computing the minimum weight triangulation of a set of linearly ordered points1993-01-16Paper
Decomposing a star graph into disjoint cycles1992-06-27Paper
https://portal.mardi4nfdi.de/entity/Q39746941992-06-25Paper
On orthogonal polynomials with respect to an inner product involving derivatives: Zeros and recurrence relations1990-01-01Paper
A note on diameter of acyclic directed hypercubes1990-01-01Paper
PARALLEL BINARY SEARCH WITH DELAYED READ CONFLICTS1990-01-01Paper
Orthogonal polynomials with respect to a symmetric inner product involving derivatives1989-01-01Paper
Bit serial addition trees and their applications1988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38148041988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38282901988-01-01Paper
Optimal computation of prefix sums on a binary tree of processors1987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36945211985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37127451985-01-01Paper
On the average-case complexity of “bucketing” algorithms1982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39594381982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36910711981-01-01Paper
The design and analysis of a new hybrid sorting algorithm1980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41084231977-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41457811977-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40949361976-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41062861976-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40522251975-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40635281975-01-01Paper
Sets of Primes with Intermediate Density.1974-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47773881974-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47773891974-01-01Paper
On the upper asymptotic density of (0, r)-primitive sequences1974-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40506801974-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40506811974-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40522201974-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56615871973-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56484321972-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56507531972-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56081541970-01-01Paper
On uniform distribution of sequences in \(GF[q,x\) and \(GF\{q,x\}\)]1970-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55796551969-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55367341968-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55593591967-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56073201967-01-01Paper
https://portal.mardi4nfdi.de/entity/Q53327001963-01-01Paper

Research outcomes over time

This page was built for person: Henk G. Meijer