Carsten Grimm

According to our database¹, Carsten Grimm authored at least 10 papers between 2012 and 2020.

Collaborative distances:

Dijkstra number² of five.
Erdős number³ of three.

Timeline

Legend:

Book

In proceedings

Article

PhD thesis

Dataset

Other

Links

On csauthors.net:

Bibliography

2020

Minimizing the continuous diameter when augmenting a geometric tree with a shortcut.

[BibT_eX]

[DOI]

Comput. Geom., 2020

2017

Minimizing the Continuous Diameter When Augmenting a Tree with a Shortcut.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures - 15th International Symposium, 2017

2016

Minimizing the Continuous Diameter when Augmenting Paths and Cycles with Shortcuts.

[BibT_eX]

[DOI]

Proceedings of the 15th Scandinavian Symposium and Workshops on Algorithm Theory, 2016

Realizing Farthest-Point Voronoi Diagrams.

[BibT_eX]

Therese Biedl

Carsten Grimm

Leonidas Palios

Jonathan Richard Shewchuk

Sander Verdonschot

Proceedings of the 28th Canadian Conference on Computational Geometry, 2016

2015

A Lower Bound on Supporting Predecessor Search in k sorted Arrays.

[BibT_eX]

[DOI]

Carsten Grimm

CoRR, 2015

Efficient Farthest-Point Queries in Two-terminal Series-parallel Networks.

[BibT_eX]

[DOI]

Carsten Grimm

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2015

2014

A note on the unsolvability of the weighted region shortest path problem.

[BibT_eX]

[DOI]

Comput. Geom., 2014

2013

Network Farthest-Point Diagrams.

[BibT_eX]

[DOI]

J. Comput. Geom., 2013

Optimal Data Structures for Farthest-Point Queries in Cactus Networks.

[BibT_eX]

[DOI]

Proceedings of the 25th Canadian Conference on Computational Geometry, 2013

2012

On Farthest-Point Information in Networks.

[BibT_eX]

[DOI]

Proceedings of the 24th Canadian Conference on Computational Geometry, 2012

Carsten Grimm

Timeline

Legend:

Links

On csauthors.net:

Bibliography

Loading...