The following pages link to Henk G. Meijer (Q1379022):
Displaying 50 items.
- (Q170486) (redirect page) (← links)
- (Q340544) (redirect page) (← links)
- Alternating paths and cycles of minimum length (Q340546) (← links)
- Drawing a tree as a minimum spanning tree approximation (Q414909) (← links)
- Universal point sets for 2-coloured trees (Q436323) (← links)
- Area, curve complexity, and crossing resolution of non-planar graph drawings (Q649108) (← links)
- The one-round Voronoi game replayed (Q705543) (← links)
- Ortho-polygon visibility representations of embedded graphs (Q724238) (← links)
- Packing trees into 1-planar graphs (Q782163) (← links)
- (Q916950) (redirect page) (← links)
- On orthogonal polynomials with respect to an inner product involving derivatives: Zeros and recurrence relations (Q916951) (← links)
- A note on diameter of acyclic directed hypercubes (Q918653) (← links)
- Not being (super)thin or solid is hard: A study of grid Hamiltonicity (Q924074) (← links)
- Point-set embeddings of trees with given partial drawings (Q924086) (← links)
- Bounds for point recolouring in geometric graphs (Q924089) (← links)
- On the probabilistic behaviour of a heuristic algorithm for maximal Hamiltonian tours (Q924547) (← links)
- Realizing partitions respecting full and partial order information (Q954955) (← links)
- Planar tree transformation: results and counterexample (Q975528) (← links)
- Matched drawability of graph pairs and of graph triples (Q982951) (← links)
- An algorithm for computing simple \(k\)-factors (Q987840) (← links)
- Minimizing the stabbing number of matchings, trees, and triangulations (Q1006396) (← links)
- Volume requirements of 3D upward drawings (Q1011762) (← links)
- Bit serial addition trees and their applications (Q1099602) (← links)
- Optimal computation of prefix sums on a binary tree of processors (Q1099947) (← links)
- Evolutionary trees and ordinal assertions (Q1125445) (← links)
- The design and analysis of a new hybrid sorting algorithm (Q1146524) (← links)
- Decomposing a star graph into disjoint cycles (Q1182082) (← links)
- Computing the minimum weight triangulation of a set of linearly ordered points (Q1198019) (← links)
- Coherent pairs and zeros of Sobolev-type orthogonal polynomials (Q1309343) (← links)
- On real and complex zeros of orthogonal polynomials in a discrete Sobolev space (Q1318406) (← links)
- An optimal systolic algorithm for generating permutations in lexicographic order (Q1328114) (← links)
- Symmetric orthogonal polynomials for Sobolev-type inner products (Q1332213) (← links)
- Sobolev orthogonal polynomials with a small number of real zeros (Q1332305) (← links)
- Zeros of Sobolev orthogonal polynomials following from coherent pairs (Q1349153) (← links)
- An asymptotic result for Laguerre-Sobolev orthogonal polynomials (Q1379023) (← links)
- The rectangle of influence drawability problem (Q1388129) (← links)
- Asymptotics of Sobolev orthogonal polynomials for coherent pairs of Laguerre type (Q1570215) (← links)
- Visibility representations of boxes in 2.5 dimensions (Q1615673) (← links)
- New results on edge partitions of 1-plane graphs (Q1694686) (← links)
- Laguerre polynomials generalized to a certain discrete Sobolev inner product space (Q1801569) (← links)
- Asymptotics of Sobolev orthogonal polynomials for coherent pairs of Jacobi type (Q1807795) (← links)
- Zeros of Sobolev orthogonal polynomials of Hermite type (Q1855823) (← links)
- Flipturning Polygons (Q1864190) (← links)
- A generating function for Laguerre-Sobolev orthogonal polynomials. (Q1867263) (← links)
- Voronoi drawings of trees (Q1869748) (← links)
- Optimal and suboptimal robust algorithms for proximity graphs (Q1873154) (← links)
- Long proteins with unique optimal foldings in the H-P model (Q1873159) (← links)
- Maximum dispersion and geometric maximum weight cliques (Q1879248) (← links)
- Reconstructing polygons from X-rays (Q1919271) (← links)
- Approximate proximity drawings (Q1947972) (← links)
