Timothy M. Chan

Bing Citeseer DBLP Google Google Scholar Kosmix Wikipedia Yahoo!
Loading Google Thumbnails...
2011
35Orthogonal Range Searching on the RAM, Revisited. Timothy M. Chan, Kasper Green Larsen, Mihai Patrascu. CoRR (abs/1103.5510) (2011). Web SearchBibTeXDownload
34Dynamic Connectivity: Connecting to Networks and Geometry. Timothy M. Chan, Mihai Patrascu, Liam Roditty. SIAM J. Comput. (40): 333-349 (2011). Web SearchBibTeXDownload
33Stochastic minimum spanning trees in euclidean spaces. Pegah Kamousi, Timothy M. Chan, Subhash Suri. Symposium on Computational Geometry 2011, 65-74. Web SearchBibTeXDownload
32Orthogonal range searching on the RAM, revisited. Timothy M. Chan, Kasper Green Larsen, Mihai Patrascu. Symposium on Computational Geometry 2011, 1-10. Web SearchBibTeXDownload
31Closest Pair and the Post Office Problem for Stochastic Points. Pegah Kamousi, Timothy M. Chan, Subhash Suri. WADS 2011, 548-559. Web SearchBibTeXDownload
2010
30Transdichotomous Results in Computational Geometry, II: Offline Search. Timothy M. Chan, Mihai Patrascu. CoRR (abs/1010.1948) (2010). Web SearchBibTeXDownload
29Counting Inversions, Offline Orthogonal Range Counting, and Related Problems. Timothy M. Chan, Mihai Patrascu. SODA 2010, 161-173. Web SearchBibTeXDownload
2009
28Dynamic Connectivity for Axis-Parallel Rectangles. Peyman Afshani, Timothy M. Chan. Algorithmica (53): 474-487 (2009). Web SearchBibTeXDownload
27Dynamic ham-sandwich cuts in the plane. Timothy G. Abbott, Michael Burr, Timothy M. Chan, Erik D. Demaine, Martin L. Demaine, John Hugg, Daniel M. Kane, Stefan Langerman, Jelani Nelson, Eynat Rafalin, Kathryn Seyboth, Vincent Yeung. Comput. Geom. (42): 419-428 (2009). Web SearchBibTeXDownload
26On Approximate Range Counting and Depth. Peyman Afshani, Timothy M. Chan. Discrete & Computational Geometry (42): 3-21 (2009). Web SearchBibTeXDownload
25Instance-Optimal Geometric Algorithms. Peyman Afshani, Jérémy Barbay, Timothy M. Chan. FOCS 2009, 129-138. Web SearchBibTeXDownload
24Transdichotomous Results in Computational Geometry, I: Point Location in Sublogarithmic Time. Timothy M. Chan, Mihai Patrascu. SIAM J. Comput. (39): 703-729 (2009). Web SearchBibTeXDownload
23Optimal halfspace range reporting in three dimensions. Peyman Afshani, Timothy M. Chan. SODA 2009, 180-186. Web SearchBibTeXDownload
2008
22Dynamic Connectivity: Connecting to Networks and Geometry. Timothy M. Chan, Mihai Patrascu, Liam Roditty. FOCS (abs/0808.1128): 95-104 (2008). Web SearchBibTeXDownload
2007
21Voronoi diagrams in n·2osqrt(lg lg n) time. Timothy M. Chan, Mihai Patrascu. STOC 2007, 31-39. Web SearchBibTeXDownload
20On approximate range counting and depth. Peyman Afshani, Timothy M. Chan. Symposium on Computational Geometry 2007, 337-343. Web SearchBibTeXDownload
2006
19Space-efficient algorithms for computing the convex hull of a simple polygonal line in linear time. Hervé Brönnimann, Timothy M. Chan. Comput. Geom. (34): 75-82 (2006). Web SearchBibTeXDownload
18Dynamic Connectivity for Axis-Parallel Rectangles. Peyman Afshani, Timothy M. Chan. ESA 2006, 16-27. Web SearchBibTeXDownload
17Necklaces, Convolutions, and X + Y. David Bremner, Timothy M. Chan, Erik D. Demaine, Jeff Erickson, Ferran Hurtado, John Iacono, Stefan Langerman, Perouz Taslakian. ESA 2006, 160-171. Web SearchBibTeXDownload
2005
16Approximation Algorithms for Maximum Cliques in 3D Unit-Disk Graphs. Peyman Afshani, Timothy M. Chan. CCCG 2005, 19-22. Web SearchBibTeXDownload
2004
15Fun-Sort--or the chaos of unordered binary search. Therese C. Biedl, Timothy M. Chan, Erik D. Demaine, Rudolf Fleischer, Mordecai J. Golin, James A. King, J. Ian Munro. Discrete Applied Mathematics (144): 231-236 (2004). Web SearchBibTeXDownload
14Space-E.cient Algorithms for Computing the Convex Hull of a Simple Polygonal Line in Linear Time. Hervé Brönnimann, Timothy M. Chan. LATIN 2004, 162-171. Web SearchBibTeXDownload
13Towards in-place geometric algorithms and data structures. Hervé Brönnimann, Timothy M. Chan, Eric Y. Chen. Symposium on Computational Geometry 2004, 239-246. Web SearchBibTeXDownload
2003
12Curves of width one and the river shore problem. Timothy M. Chan, Alexander Golynski, Alejandro López-Ortiz, Claude-Guy Quimper. CCCG 2003, 73-75. Web SearchBibTeX
11Drawing K2, n: A lower bound. Therese C. Biedl, Timothy M. Chan, Alejandro López-Ortiz. Inf. Process. Lett. (85): 303-305 (2003). Web SearchBibTeXDownload
10the asteroid surveying problem and other puzzles. Timothy M. Chan, Alexander Golynski, Alejandro López-Ortiz, Claude-Guy Quimper. Symposium on Computational Geometry 2003, 372-373. Web SearchBibTeXDownload
2002
9Drawing k2, n: A lower bound. Therese C. Biedl, Timothy M. Chan, Alejandro López-Ortiz. CCCG 2002, 146-148. Web SearchBibTeXDownload
8Tighter bounds on the genus of nonorthogonal polyhedra built from rectangles. Therese C. Biedl, Timothy M. Chan, Erik D. Demaine, Martin L. Demaine, Paul Nijjar, Ryuhei Uehara, Ming-wei Wang. CCCG 2002, 105-108. Web SearchBibTeXDownload
7Optimizing area and aspect ration in straight-line orthogonal tree drawings. Timothy M. Chan, Michael T. Goodrich, S. Rao Kosaraju, Roberto Tamassia. Comput. Geom. (23): 153-162 (2002). Web SearchBibTeXDownload
6Balanced k-colorings. Therese C. Biedl, Eowyn Cenek, Timothy M. Chan, Erik D. Demaine, Martin L. Demaine, Rudolf Fleischer, Ming-wei Wang. Discrete Mathematics (254): 19-32 (2002). Web SearchBibTeXDownload
2000
5Balanced k-Colorings. Therese C. Biedl, Eowyn Cenek, Timothy M. Chan, Erik D. Demaine, Martin L. Demaine, Rudolf Fleischer, Ming-wei Wang. MFCS 2000, 202-211. Web SearchBibTeXDownload
1998
4On Levels in Arrangements of Lines, Segments, Planes, and Triangles%. Pankaj K. Agarwal, Boris Aronov, Timothy M. Chan, Micha Sharir. Discrete & Computational Geometry (19): 315-331 (1998). Web SearchBibTeXDownload
1997
3Primal Dividing and Dual Pruning: Output-Sensitive Construction of Four-Dimensional Polytopes and Three-Dimensional Voronoi Diagrams. Timothy M. Chan, Jack Snoeyink, Chee-Keng Yap. Discrete & Computational Geometry (18): 433-454 (1997). Web SearchBibTeXDownload
1996
2Optimizing Area and Aspect Ratio in Straight-Line Orthogonal Tree Drawings. Timothy M. Chan, Michael T. Goodrich, S. Rao Kosaraju, Roberto Tamassia. Graph Drawing 1996, 63-75. Web SearchBibTeXDownload
1995
1Output-Sensitive Construction of Polytopes in Four Dimensions and Clipped Voronoi Diagrams in Three. Timothy M. Chan, Jack Snoeyink, Chee-Keng Yap. SODA 1995, 282-291. Web SearchBibTeXDownload
from DBLP and Google Scholar
Developed by the Database Group at the University of Wisconsin and Yahoo! Research