( en | de | ru )

 

Disambiguation of "Chan, Timothy M."

Author of the publication

copydeleteadd this publication to your clipboard
All-pairs shortest paths for unweighted undirected graphs in o(mn) time.

. SODA, page 514-523. ACM Press, (2006)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Timothy Saunders

Timothy Sulo

Timothy Leung

Timothy Creech

Wilhelm Chan

 

Other publications of authors with the same name

Approximating the piercing number for unit-height rectangles., and . CCCG, page 15-18. (2005)Space-Efficient Algorithms for Klee's Measure Problem., and . CCCG, page 27-30. (2005)The complexity of a single face of a minkowski sum., , , , and . CCCG, page 91-96. Carleton University, Ottawa, Canada, (1995)Time-Windowed Closest Pair., and . CCCG, Queen's University, Ontario, Canada, (2015)Faster Approximate Diameter and Distance Oracles in Planar Graphs., and . ESA, volume 87 of LIPIcs, page 25:1-25:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Guest Editors' Foreword., and . Discret. Comput. Geom., 52 (3): 425-426 (2014)Bichromatic Line Segment Intersection Counting in O(n sqrt(log n)) Time., and . CCCG, (2011)Dynamic Orthogonal Range Searching on the RAM, Revisited., and . SoCG, volume 77 of LIPIcs, page 28:1-28:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Better ϵ-Dependencies for Offline Approximate Nearest Neighbor Search, Euclidean Minimum Spanning Trees, and ϵ-Kernels., and . SoCG, page 416. ACM, (2014)Approximating the diameter, width, smallest enclosing cylinder, and minimum-width annulus.. SCG, page 300-309. ACM, (2000)