On Farthest-Point Information in Networks. - Prosenjit Bose; Jean-Lou De Carufel; Carsten Grimm; Anil Maheshwari; Michiel H. M. Smid (CCCG, 2012)

Network Farthest-Point Diagrams. - Prosenjit Bose; Kai Dannies; Jean-Lou De Carufel; Christoph Doell; Carsten Grimm; Anil Maheshwari; Stefan Schirra; Michiel H. M. Smid (J. Comput. Geom., 2013)

A note on the unsolvability of the weighted region shortest path problem. - Jean-Lou De Carufel; Carsten Grimm; Anil Maheshwari; Megan Owen; Michiel H. M. Smid (Comput. Geom., 2014)

Efficient Farthest-Point Queries in Two-terminal Series-parallel Networks. - Carsten Grimm (WG, 2015)

A Lower Bound on Supporting Predecessor Search in k sorted Arrays. - Carsten Grimm (CoRR, 2015)

Optimal Data Structures for Farthest-Point Queries in Cactus Networks. - Prosenjit Bose; Jean-Lou De Carufel; Carsten Grimm; Anil Maheshwari; Michiel H. M. Smid (J. Graph Algorithms Appl., 2015)

Realizing Farthest-Point Voronoi Diagrams. - Therese Biedl; Carsten Grimm; Leonidas Palios; Jonathan Richard Shewchuk; Sander Verdonschot (CCCG, 2016)

Minimizing the Continuous Diameter when Augmenting Paths and Cycles with Shortcuts. - Jean-Lou De Carufel; Carsten Grimm; Anil Maheshwari; Michiel H. M. Smid (SWAT, 2016)

Minimizing the Continuous Diameter When Augmenting a Tree with a Shortcut. - Jean-Lou De Carufel; Carsten Grimm; Stefan Schirra; Michiel H. M. Smid (WADS, 2017)

Minimizing the continuous diameter when augmenting a geometric tree with a shortcut. - Jean-Lou De Carufel; Carsten Grimm; Anil Maheshwari; Stefan Schirra; Michiel H. M. Smid (Comput. Geom., 2020)