( en | de | ru )

 

Disambiguation of "Chan, Timothy M."

Author of the publication

copydeleteadd this publication to your clipboard
Approximation Algorithms for Maximum Independent Set of Pseudo-Disks.

, and . Discret. Comput. Geom., 48 (2): 373-392 (2012)

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

Minimum Length Embedding of Planar Graphs at Fixed Vertex Locations., , , and . GD, volume 8242 of Lecture Notes in Computer Science, page 376-387. Springer, (2013)Improved Bounds for Drawing Trees on Fixed Points with L-Shaped Edges., , , , and . GD, volume 10692 of Lecture Notes in Computer Science, page 305-317. Springer, (2017)Towards in-place geometric algorithms and data structures., , and . SCG, page 239-246. ACM, (2004)Faster core-set constructions and data stream algorithms in fixed dimensions.. SCG, page 152-159. ACM, (2004)On Enumerating and Selecting Distances.. SCG, page 279-286. ACM, (1998)Geometric Applications of a Randomized Optimization Technique.. SCG, page 269-278. ACM, (1998)Two Approaches to Building Time-Windowed Geometric Data Structures., and . SoCG, volume 51 of LIPIcs, page 28:1-28:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)A (slightly) faster algorithm for klee's measure problem.. SCG, page 94-100. ACM, (2008)Approximate Shortest Paths and Distance Oracles in Weighted Unit-Disk Graphs., and . SoCG, volume 99 of LIPIcs, page 24:1-24:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)How to morph planar graph drawings., , , , , , , , , and 3 other author(s). CoRR, (2016)