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
34 2014 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
23 2015 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
16 * 2017 Survey on the fate of digital footprints after death C Grimm, S Chiasson
Workshop on Usable Security (USEC 2014), 2014
16 2014 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
12 2012 Network farthest-point diagrams P Bose, K Dannies, JL De Carufel, C Doell, C Grimm, A Maheshwari, ...
arXiv preprint arXiv:1304.1909, 2013
9 2013 Realizing Farthest-Point Voronoi Diagrams. TC Biedl, C Grimm, L Palios, JR Shewchuk, S Verdonschot
4 2016 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
4 2013 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
2 2012 Efficient Farthest-Point Queries in Two-terminal Series-parallel Networks C Grimm
International Workshop on Graph-Theoretic Concepts in Computer Science, 122-137, 2015
1 2015 On two problems regarding farthest distances in continuous networks C Grimm
Dissertation, Magdeburg, Universität, 2017, 2017
2017 A Lower Bound on Supporting Predecessor Search in 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 
Prosenjit BoseCarleton UniversityBestätigte E-Mail-Adresse bei scs.carleton.ca
