
Search the dblp DataBase
Mark Lanthier:
[Publications]
[Author Rank by year]
[Coauthors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
 Mark Lanthier, Doron Nussbaum, TsuoJung Wang
Calculating the Meeting Point of Scattered Robots on Weighted Terrain Surfaces. [Citation Graph (0, 0)][DBLP] CATS, 2005, pp:107118 [Conf]
 Mark Lanthier, Anil Maheshwari, JörgRüdiger Sack
Approximating Weighted Shortest Paths on Polyhedral Surfaces. [Citation Graph (0, 0)][DBLP] Symposium on Computational Geometry, 1997, pp:274283 [Conf]
 Mark Lanthier, Anil Maheshwari, JörgRüdiger Sack
Approximating Weighted Shortest Paths on Polyhedral Surfaces. [Citation Graph (0, 0)][DBLP] Symposium on Computational Geometry, 1997, pp:485486 [Conf]
 David A. Hutchinson, Mark Lanthier, Anil Maheshwari, Doron Nussbaum, David Roytenberg, JörgRüdiger Sack
Parallel Neighbourhood Modelling. [Citation Graph (0, 0)][DBLP] ACMGIS, 1996, pp:2534 [Conf]
 Mark Lanthier, Anil Maheshwari, JörgRüdiger Sack
Shortest Anisotropic Paths on Terrains. [Citation Graph (0, 0)][DBLP] ICALP, 1999, pp:524533 [Conf]
 David A. Hutchinson, L. Küttner, Mark Lanthier, Anil Maheshwari, Doron Nussbaum, David Roytenberg, JörgRüdiger Sack
Parallel Neighborhood Modeling. [Citation Graph (0, 0)][DBLP] SPAA, 1996, pp:204207 [Conf]
 Lyudmil Aleksandrov, Mark Lanthier, Anil Maheshwari, JörgRüdiger Sack
An epsilonApproximation for Weighted Shortest Paths on Polyhedral Surfaces. [Citation Graph (0, 0)][DBLP] SWAT, 1998, pp:1122 [Conf]
 J. Chen, Mark Lanthier, Melissa Macpherson, Doron Nussbaum
Computing Tumour Coverage as a Result of Respiratory Motion during Radiotherapy Treatment. [Citation Graph (0, 0)][DBLP] ICITA (2), 2005, pp:107112 [Conf]
 Mark Lanthier, Anil Maheshwari, JörgRüdiger Sack
Approximating Shortest Paths on Weighted Polyhedral Surfaces. [Citation Graph (0, 0)][DBLP] Algorithmica, 2001, v:30, n:4, pp:527562 [Journal]
 Mark Lanthier, Doron Nussbaum, JörgRüdiger Sack
Parallel implementation of geometric shortest path algorithms. [Citation Graph (0, 0)][DBLP] Parallel Computing, 2003, v:29, n:10, pp:14451479 [Journal]
Search in 0.003secs, Finished in 0.004secs
