Computing radial drawings on the minimum number of circles. Di Giacomo, Emilio; Didimo, Walter; Liotta, Giuseppe; Meijer, Henk — 2005 Journal of Graph Algorithms and Applications
Algorithms for cluster busting in anchored graph drawing. Lyons, Kelly A.; Meijer, Henk; Rappaport, David — 1998 Journal of Graph Algorithms and Applications
Geometric simultaneous embeddings of a graph and a matching. Cabello, Sergio; Van Kreveld, Marc; Liotta, Giuseppe; Meijer, Henk; Speckmann, Bettina; Verbeek, Kevin — 2011 Journal of Graph Algorithms and Applications
k -colored point-set embeddability of outerplanar graphs. Di Giacomo, Emilio; Didimo, Walter; Liotta, Giuseppe; Meijer, Henk; Trotta, Francesco; Wismath, Stephen K. — 2008 Journal of Graph Algorithms and Applications
A visibility representation for graphs in three dimensions. Bose, Prosenjit; Everett, Hazel; Fekete, Sándor P.; Houle, Michael E.; Lubiw, Anna; Meijer, Henk; Romanik, Kathleen; Rote, Günter; Shermer, Thomas C.; Whitesides, Sue; Zelle, Christian — 1998 Journal of Graph Algorithms and Applications