Carsten Grimm

17 papers B 2Journal 11Unranked 4
YearRankTypeTitle / Venue / Authors
2020 J jnl
Minimizing the continuous diameter when augmenting a geometric tree with a shortcut.
Comput. Geom.
Jean-Lou De Carufel, Carsten Grimm, Anil Maheshwari, Stefan Schirra, Michiel H. M. Smid
2017 B conf
Minimizing the Continuous Diameter When Augmenting a Tree with a Shortcut.
WADS
Jean-Lou De Carufel, Carsten Grimm, Stefan Schirra, Michiel H. M. Smid
2016 — conf
Minimizing the Continuous Diameter when Augmenting Paths and Cycles with Shortcuts.
SWAT
Jean-Lou De Carufel, Carsten Grimm, Anil Maheshwari, Michiel H. M. Smid
2016 J jnl
Minimizing the Continuous Diameter when Augmenting a Tree with a Shortcut.
CoRR
Jean-Lou De Carufel, Carsten Grimm, Stefan Schirra, Michiel H. M. Smid
2016 — conf
Realizing Farthest-Point Voronoi Diagrams.
CCCG
Therese Biedl, Carsten Grimm, Leonidas Palios, Jonathan Richard Shewchuk, Sander Verdonschot
2015 J jnl
A Lower Bound on Supporting Predecessor Search in k sorted Arrays.
CoRR
Carsten Grimm
2015 J jnl
Efficient Farthest-Point Queries in Two-Terminal Series-Parallel Networks.
CoRR
Carsten Grimm
2015 B conf
Efficient Farthest-Point Queries in Two-terminal Series-parallel Networks.
WG
Carsten Grimm
2015 J jnl
Minimizing the Continuous Diameter when Augmenting Paths and Cycles with Shortcuts.
CoRR
Jean-Lou De Carufel, Carsten Grimm, Anil Maheshwari, Michiel H. M. Smid
2015 J jnl
Optimal Data Structures for Farthest-Point Queries in Cactus Networks.
J. Graph Algorithms Appl.
Prosenjit Bose, Jean-Lou De Carufel, Carsten Grimm, Anil Maheshwari, Michiel H. M. Smid
2014 J jnl
A note on the unsolvability of the weighted region shortest path problem.
Comput. Geom.
Jean-Lou De Carufel, Carsten Grimm, Anil Maheshwari, Megan Owen, Michiel H. M. Smid
2014 J jnl
Optimal Data Structures for Farthest-Point Queries in Cactus Networks.
CoRR
Prosenjit Bose, Jean-Lou De Carufel, Carsten Grimm, Anil Maheshwari, Michiel H. M. Smid
2013 J jnl
A Note on the Unsolvability of the Weighted Region Shortest Path Problem
CoRR
Jean-Lou De Carufel, Carsten Grimm, Anil Maheshwari, Megan Owen, Michiel H. M. Smid
2013 J jnl
Network Farthest-Point Diagrams
CoRR
Prosenjit Bose, Kai Dannies, Jean-Lou De Carufel, Christoph Doell, Carsten Grimm, Anil Maheshwari, Stefan Schirra, Michiel H. M. Smid
2013 J jnl
Network Farthest-Point Diagrams.
J. Comput. Geom.
Prosenjit Bose, Kai Dannies, Jean-Lou De Carufel, Christoph Doell, Carsten Grimm, Anil Maheshwari, Stefan Schirra, Michiel H. M. Smid
2013 — conf
Optimal Data Structures for Farthest-Point Queries in Cactus Networks.
CCCG
Prosenjit Bose, Jean-Lou De Carufel, Carsten Grimm, Anil Maheshwari, Michiel H. M. Smid
2012 — conf
On Farthest-Point Information in Networks.
CCCG
Prosenjit Bose, Jean-Lou De Carufel, Carsten Grimm, Anil Maheshwari, Michiel H. M. Smid