( en | de | ru )

 

Disambiguation of "Grimm, Carsten"

Author of the publication

copydeleteadd this publication to your clipboard
Minimizing the Continuous Diameter when Augmenting a Tree with a Shortcut.

, , , and . CoRR, (2016)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Herwig Grimm

Dörte Grimm

Andrea Grimm

Frauke Grimm

Anna Grimm

 

Other publications of authors with the same name

Minimizing the continuous diameter when augmenting a geometric tree with a shortcut., , , , and . Comput. Geom., (2020)Optimal Data Structures for Farthest-Point Queries in Cactus Networks., , , , and . CoRR, (2014)Minimizing the Continuous Diameter when Augmenting Paths and Cycles with Shortcuts., , , and . CoRR, (2015)Realizing Farthest-Point Voronoi Diagrams., , , , and . CCCG, page 48-56. Simon Fraser University, Vancouver, British Columbia, Canada, (2016)Minimizing the Continuous Diameter when Augmenting Paths and Cycles with Shortcuts., , , and . SWAT, volume 53 of LIPIcs, page 27:1-27:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)A Lower Bound on Supporting Predecessor Search in k sorted Arrays.. CoRR, (2015)A Note on the Unsolvability of the Weighted Region Shortest Path Problem, , , , and . CoRR, (2013)Optimal Data Structures for Farthest-Point Queries in Cactus Networks., , , , and . CCCG, Carleton University, Ottawa, Canada, (2013)Efficient Farthest-Point Queries in Two-terminal Series-parallel Networks.. WG, volume 9224 of Lecture Notes in Computer Science, page 122-137. Springer, (2015)Optimal Data Structures for Farthest-Point Queries in Cactus Networks., , , , and . J. Graph Algorithms Appl., 19 (1): 11-41 (2015)