Carsten Grimm
Carsten Grimm
Computational Geometry Lab, School of Computer Science, Carleton University
Email verificata su ovgu.de
Titolo
Citata da
Citata da
Anno
Minimizing the continuous diameter when augmenting paths and cycles with shortcuts
JL De Carufel, C Grimm, A Maheshwari, M Smid
arXiv preprint arXiv:1512.02257, 2015
152015
A Note on the Unsolvability of the Weighted Region Shortest Path Problem
JL De Carufel, C Grimm, A Maheshwari, M Owen, M Smid
Computational Geometry: Theory and Applications 47 (7), 724--727, 2014
152014
Network farthest-point diagrams
P Bose, K Dannies, JL De Carufel, C Doell, C Grimm, A Maheshwari, ...
arXiv preprint arXiv:1304.1909, 2013
92013
Unsolvability of the Weighted Region Shortest Path Problem
JL De Carufel, C Grimm, A Maheshwari, M Owen, M Smid
28th European Workshop on Computational Geometry, 65-68, 2012
92012
Minimizing the continuous diameter when augmenting a tree with a shortcut
JL De Carufel, C Grimm, S Schirra, M Smid
Workshop on Algorithms and Data Structures, 301-312, 2017
82017
Survey on the fate of digital footprints after death
C Grimm, S Chiasson
Workshop on Usable Security (USEC 2014), 2014
72014
Optimal Data Structures for Farthest-Point Queries in Cactus Networks
P Bose, JL De Carufel, C Grimm, A Maheshwari, M Smid
CCCG 2013, 175--180, 2013
42013
Realizing Farthest-Point Voronoi Diagrams.
TC Biedl, C Grimm, L Palios, JR Shewchuk, S Verdonschot
22016
On Farthest-Point Information in Networks
P Bose, JL De Carufel, C Grimm, A Maheshwari, M Smid
24th Canadian Conference on Computational Geometry, 199-204, 2012
22012
Invited talk
A Agarwal, P Bose, V Dujmovic, N Hoda, P Morin, T Shirakawa, R Uehara, ...
CLEO 2007, 0
2
Minimizing the continuous diameter when augmenting a tree with a shortcut
JLD Carufel, C Grimm, S Schirra, M Smid
arXiv preprint arXiv:1612.01370, 2016
12016
Efficient Farthest-Point Queries in Two-terminal Series-parallel Networks
C Grimm
International Workshop on Graph-Theoretic Concepts in Computer Science, 122-137, 2015
12015
On two problems regarding farthest distances in continuous networks
CU Grimm
Carleton University, 2018
2018
A Lower Bound on Supporting Predecessor Search in sorted Arrays
C Grimm
arXiv preprint arXiv:1507.03823, 2015
2015
Optimal Data Structures for Farthest-Point
P Bose, JL De Carufel, C Grimm, A Maheshwari, M Smid
2014
Il sistema al momento non pu eseguire l'operazione. Riprova pi tardi.
Articoli 1–15