Flow map layout via spiral trees K Buchin, B Speckmann, K Verbeek IEEE transactions on visualization and computer graphics 17 (12), 2536-2544, 2011 | 155 | 2011 |

Area-universal and constrained rectangular layouts D Eppstein, E Mumford, B Speckmann, K Verbeek SIAM Journal on Computing 41 (3), 537-564, 2012 | 75* | 2012 |

Necklace maps. B Speckmann, K Verbeek IEEE Trans. Vis. Comput. Graph. 16 (6), 881-889, 2010 | 63 | 2010 |

Metric embedding, hyperbolic space, and social networks K Verbeek, S Suri Proceedings of the thirtieth annual symposium on Computational geometry, 501-510, 2014 | 62 | 2014 |

On Planar Supports for Hypergraphs. K Buchin, MJ van Kreveld, H Meijer, B Speckmann, K Verbeek J. Graph Algorithms Appl. 15 (4), 533-549, 2011 | 55 | 2011 |

On the most likely convex hull of uncertain points S Suri, K Verbeek, H Yıldız European Symposium on Algorithms, 791-802, 2013 | 53 | 2013 |

Angle-restricted Steiner arborescences for flow map layout K Buchin, B Speckmann, K Verbeek Algorithmica 72 (2), 656-685, 2015 | 30* | 2015 |

Stable treemaps via local moves M Sondag, B Speckmann, K Verbeek IEEE Transactions on Visualization and Computer Graphics 24 (1), 729-738, 2017 | 26 | 2017 |

Table cartogram W Evans, S Felsner, M Kaufmann, SG Kobourov, D Mondal, RI Nishat, ... Computational Geometry 68, 174-185, 2018 | 24* | 2018 |

Combinatorial and geometric properties of planar Laman graphs S Kobourov, T Ueckerdt, K Verbeek Proceedings of the twenty-fourth annual ACM-SIAM symposium on Discrete …, 2013 | 23 | 2013 |

On the most likely voronoi diagram and nearest neighbor searching S Suri, K Verbeek International Journal of Computational Geometry & Applications 26 (03n04 …, 2016 | 21 | 2016 |

Geometric simultaneous Embeddings of a graph and a matching. S Cabello, MJ van Kreveld, G Liotta, H Meijer, B Speckmann, K Verbeek J. Graph Algorithms Appl. 15 (1), 79-96, 2011 | 17 | 2011 |

Strict confluent drawing D Eppstein, D Holten, M Löffler, M Nöllenburg, B Speckmann, K Verbeek Journal of Computational Geometry 7 (1), 22-46, 2016 | 16 | 2016 |

Balanced partitions of 3-colored geometric sets in the plane S Bereg, F Hurtado, M Kano, M Korman, D Lara, C Seara, RI Silveira, ... Discrete Applied Mathematics 181, 21-32, 2015 | 14 | 2015 |

Homotopic C-oriented routing with few links and thick edges B Speckmann, K Verbeek Computational Geometry 67, 11-28, 2018 | 13* | 2018 |

Geometric *k* Shortest PathsS Eriksson-Bique, J Hershberger, V Polishchuk, B Speckmann, S Suri, ... Proceedings of the twenty-sixth annual ACM-SIAM symposium on Discrete …, 2014 | 11 | 2014 |

Tight bounds for conflict-free chromatic guarding of orthogonal art galleries F Hoffmann, K Kriegel, S Suri, K Verbeek, M Willert Computational Geometry 73, 24-34, 2018 | 10 | 2018 |

Computing representative networks for braided rivers M Kleinhans, M van Kreveld, T Ophelders, W Sonke, B Speckmann, ... Journal of Computational Geometry 10 (1), 423-443, 2019 | 9 | 2019 |

Simultaneous visualization of language endangerment and language description H Hammarström, T Castermans, R Forkel, K Verbeek, MA Westenberg, ... University of Hawaii Press, 2018 | 9 | 2018 |

Mapping polygons to the grid with small Hausdorff and Fr\'echet distance QW Bouts, I Kostitsyna, M van Kreveld, W Meulemans, W Sonke, ... arXiv preprint arXiv:1606.06660, 2016 | 9 | 2016 |