2009 | ||
---|---|---|
97 | EE | Timothy M. Chan: Comparison-based time-space lower bounds for selection. SODA 2009: 140-149 |
96 | EE | Peyman Afshani, Timothy M. Chan: Optimal halfspace range reporting in three dimensions. SODA 2009: 180-186 |
2008 | ||
95 | EE | Timothy M. Chan, Mihai Patrascu, Liam Roditty: Dynamic Connectivity: Connecting to Networks and Geometry. FOCS 2008: 95-104 |
94 | EE | Timothy M. Chan: On the bichromatic k-set problem. SODA 2008: 561-570 |
93 | EE | Timothy M. Chan, Eric Y. Chen: In-place 2-d nearest neighbor search. SODA 2008: 904-911 |
92 | EE | Timothy M. Chan: Dynamic coresets. Symposium on Computational Geometry 2008: 1-9 |
91 | EE | Timothy M. Chan: On levels in arrangements of curves, iii: further improvements. Symposium on Computational Geometry 2008: 85-93 |
90 | EE | Timothy M. Chan: A (slightly) faster algorithm for klee's measure problem. Symposium on Computational Geometry 2008: 94-100 |
89 | EE | Timothy M. Chan: All-Pairs Shortest Paths with Real Weights in O ( n 3/log n ) Time. Algorithmica 50(2): 236-243 (2008) |
88 | EE | Timothy M. Chan, Mihai Patrascu, Liam Roditty: Dynamic Connectivity: Connecting to Networks and Geometry CoRR abs/0808.1128: (2008) |
87 | EE | Timothy M. Chan: Well-separated pair decomposition in linear time? Inf. Process. Lett. 107(5): 138-141 (2008) |
2007 | ||
86 | EE | Hamid Zarrabi-Zadeh, Timothy M. Chan: An Improved Algorithm for Online Unit Clustering. COCOON 2007: 383-393 |
85 | EE | Timothy M. Chan, Mihai Patrascu: Voronoi diagrams in n·2osqrt(lg lg n) time. STOC 2007: 31-39 |
84 | EE | Timothy M. Chan: More algorithms for all-pairs shortest paths in weighted graphs. STOC 2007: 590-598 |
83 | EE | Peyman Afshani, Timothy M. Chan: On approximate range counting and depth. Symposium on Computational Geometry 2007: 337-343 |
82 | EE | Timothy M. Chan, Eric Y. Chen: Multi-Pass Geometric Algorithms. Discrete & Computational Geometry 37(1): 79-102 (2007) |
2006 | ||
81 | EE | Hamid Zarrabi-Zadeh, Timothy M. Chan: A Simple Streaming Algorithm for Minimum Enclosing Balls. CCCG 2006 |
80 | EE | Peyman Afshani, Timothy M. Chan: Dynamic Connectivity for Axis-Parallel Rectangles. ESA 2006: 16-27 |
79 | EE | David Bremner, Timothy M. Chan, Erik D. Demaine, Jeff Erickson, Ferran Hurtado, John Iacono, Stefan Langerman, Perouz Taslakian: Necklaces, Convolutions, and X + Y. ESA 2006: 160-171 |
78 | EE | Timothy M. Chan: Point Location in o(log n) Time, Voronoi Diagrams in o(n log n) Time, and Other Transdichotomous Results in Computational Geometry. FOCS 2006: 333-344 |
77 | EE | Timothy M. Chan: A dynamic data structure for 3-d convex hulls and 2-d nearest neighbor queries. SODA 2006: 1196-1202 |
76 | EE | Timothy M. Chan: All-pairs shortest paths for unweighted undirected graphs in o(mn) time. SODA 2006: 514-523 |
75 | EE | Timothy M. Chan, Hamid Zarrabi-Zadeh: A Randomized Algorithm for Online Unit Clustering. WAOA 2006: 121-131 |
74 | EE | Hervé Brönnimann, Timothy M. Chan: Space-efficient algorithms for computing the convex hull of a simple polygonal line in linear time. Comput. Geom. 34(2): 75-82 (2006) |
73 | EE | Timothy M. Chan: Faster core-set constructions and data-stream algorithms in fixed dimensions. Comput. Geom. 35(1-2): 20-35 (2006) |
72 | EE | Timothy M. Chan: Three problems about simple polygons. Comput. Geom. 35(3): 209-217 (2006) |
71 | EE | Timothy M. Chan, Bashir S. Sadjad: Geometric Optimization Problems over Sliding Windows. Int. J. Comput. Geometry Appl. 16(2-3): 145-158 (2006) |
70 | EE | Timothy M. Chan: Dynamic Subgraph Connectivity with Geometric Applications. SIAM J. Comput. 36(3): 681-694 (2006) |
2005 | ||
69 | EE | Timothy M. Chan, Abdullah-Al Mahmood: Approximating the piercing number for unit-height rectangles. CCCG 2005: 15-18 |
68 | EE | Peyman Afshani, Timothy M. Chan: Approximation Algorithms for Maximum Cliques in 3D Unit-Disk Graphs. CCCG 2005: 19-22 |
67 | EE | Eric Y. Chen, Timothy M. Chan: Space-Efficient Algorithms for Klee's Measure Problem. CCCG 2005: 27-30 |
66 | EE | Timothy M. Chan: On levels in arrangements of surfaces in three dimensions. SODA 2005: 232-240 |
65 | EE | Timothy M. Chan: Finding the shortest bottleneck edge in a parametric minimum spanning tree. SODA 2005: 917-918 |
64 | EE | Timothy M. Chan, Eric Y. Chen: Multi-pass geometric algorithms. Symposium on Computational Geometry 2005: 180-189 |
63 | EE | Timothy M. Chan: All-Pairs Shortest Paths with Real Weights in O(n3/log n) Time. WADS 2005: 318-324 |
62 | EE | Timothy M. Chan: On Levels in Arrangements of Curves, II: A Simple Inequality and Its Consequences. Discrete & Computational Geometry 34(1): 11-24 (2005) |
61 | EE | Therese C. Biedl, Timothy M. Chan, Yashar Ganjali, Mohammad Taghi Hajiaghayi, David R. Wood: Balanced vertex-orderings of graphs. Discrete Applied Mathematics 148(1): 27-48 (2005) |
60 | EE | Therese C. Biedl, Timothy M. Chan: A note on 3D orthogonal graph drawing. Discrete Applied Mathematics 148(2): 189-193 (2005) |
59 | EE | Timothy M. Chan: Low-Dimensional Linear Programming with Violations. SIAM J. Comput. 34(4): 879-893 (2005) |
2004 | ||
58 | EE | Timothy M. Chan, Bashir S. Sadjad: Geometric Optimization Problems Over Sliding Windows. ISAAC 2004: 246-258 |
57 | EE | Hervé Brönnimann, Timothy M. Chan: Space-E.cient Algorithms for Computing the Convex Hull of a Simple Polygonal Line in Linear Time. LATIN 2004: 162-171 |
56 | EE | Timothy M. Chan: An optimal randomized algorithm for maximum Tukey depth. SODA 2004: 430-436 |
55 | EE | Timothy M. Chan: Faster core-set constructions and data stream algorithms in fixed dimensions. Symposium on Computational Geometry 2004: 152-159 |
54 | EE | Hervé Brönnimann, Timothy M. Chan, Eric Y. Chen: Towards in-place geometric algorithms and data structures. Symposium on Computational Geometry 2004: 239-246 |
53 | EE | Timothy M. Chan: Euclidean Bounded-Degree Spanning Tree Ratios. Discrete & Computational Geometry 32(2): 177-194 (2004) |
52 | EE | Therese C. Biedl, Timothy M. Chan, Erik D. Demaine, Rudolf Fleischer, Mordecai J. Golin, James A. King, J. Ian Munro: Fun-Sort--or the chaos of unordered binary search. Discrete Applied Mathematics 144(3): 231-236 (2004) |
51 | EE | Timothy M. Chan: A note on maximum independent sets in rectangle intersection graphs. Inf. Process. Lett. 89(1): 19-23 (2004) |
2003 | ||
50 | Eric Y. Chen, Timothy M. Chan: A Space-Efficient Algorithm for Segment Intersection. CCCG 2003: 68-71 | |
49 | Timothy M. Chan, Alexander Golynski, Alejandro López-Ortiz, Claude-Guy Quimper: Curves of width one and the river shore problem. CCCG 2003: 73-75 | |
48 | EE | Timothy M. Chan: On Levels in Arrangements of Curves, II: A Simple Inequality and Its Consequences. FOCS 2003: 544- |
47 | EE | Timothy M. Chan: Euclidean bounded-degree spanning tree ratios. Symposium on Computational Geometry 2003: 11-19 |
46 | EE | Timothy M. Chan, Alexander Golynski, Alejandro López-Ortiz, Claude-Guy Quimper: the asteroid surveying problem and other puzzles. Symposium on Computational Geometry 2003: 372-373 |
45 | EE | Timothy M. Chan: On Levels in Arrangements of Curves. Discrete & Computational Geometry 29(3): 375-393 (2003) |
44 | EE | Timothy M. Chan: A Fully Dynamic Algorithm for Planar Width. Discrete & Computational Geometry 30(1): 17-24 (2003) |
43 | EE | Therese C. Biedl, Timothy M. Chan, Alejandro López-Ortiz: Drawing K2, n: A lower bound. Inf. Process. Lett. 85(6): 303-305 (2003) |
42 | EE | Timothy M. Chan: Polynomial-time approximation schemes for packing and piercing fat objects. J. Algorithms 46(2): 178-189 (2003) |
41 | EE | Timothy M. Chan: Semi-Online Maintenance of Geometric Optima and Measures. SIAM J. Comput. 32(3): 700-716 (2003) |
2002 | ||
40 | EE | Therese C. Biedl, Timothy M. Chan, Erik D. Demaine, Martin L. Demaine, Paul Nijjar, Ryuhei Uehara, Ming-wei Wang: Tighter bounds on the genus of nonorthogonal polyhedra built from rectangles. CCCG 2002: 105-108 |
39 | EE | Therese C. Biedl, Timothy M. Chan, Alejandro López-Ortiz: Drawing k2, n: A lower bound. CCCG 2002: 146-148 |
38 | EE | Timothy M. Chan: Low-Dimensional Linear Programming with Violations. FOCS 2002: 570- |
37 | EE | Timothy M. Chan: Closest-point problems simplified on the RAM. SODA 2002: 472-473 |
36 | EE | Timothy M. Chan: Semi-online maintenance of geometric optima and measures. SODA 2002: 474-483 |
35 | EE | Timothy M. Chan: Dynamic subgraph connectivity with geometric applications. STOC 2002: 7-13 |
34 | EE | Timothy M. Chan: A Near-Linear Area Bound for Drawing Binary Trees. Algorithmica 34(1): 1-13 (2002) |
33 | Timothy M. Chan, Michael T. Goodrich, S. Rao Kosaraju, Roberto Tamassia: Optimizing area and aspect ration in straight-line orthogonal tree drawings. Comput. Geom. 23(2): 153-162 (2002) | |
32 | EE | Therese C. Biedl, Eowyn Cenek, Timothy M. Chan, Erik D. Demaine, Martin L. Demaine, Rudolf Fleischer, Ming-wei Wang: Balanced k-colorings. Discrete Mathematics 254(1-3): 19-32 (2002) |
31 | Timothy M. Chan: Approximating the Diameter, Width, Smallest Enclosing Cylinder, and Minimum-Width Annulus. Int. J. Comput. Geometry Appl. 12(1-2): 67-85 (2002) | |
2001 | ||
30 | EE | Timothy M. Chan: A fully dynamic algorithm for planar. Symposium on Computational Geometry 2001: 172-176 |
29 | Timothy M. Chan: On Enumerating and Selecting Distances. Int. J. Comput. Geometry Appl. 11(3): 291-304 (2001) | |
28 | EE | Timothy M. Chan: Dynamic planar convex hull operations in near-logarithmaic amortized time. J. ACM 48(1): 1-12 (2001) |
27 | EE | Timothy M. Chan, Alon Efrat: Fly Cheaply: On the Minimum Fuel Consumption Problem. J. Algorithms 41(2): 330-337 (2001) |
2000 | ||
26 | Timothy M. Chan: On Levels in Arrangements of Curves. FOCS 2000: 219-227 | |
25 | EE | Therese C. Biedl, Eowyn Cenek, Timothy M. Chan, Erik D. Demaine, Martin L. Demaine, Rudolf Fleischer, Ming-wei Wang: Balanced k-Colorings. MFCS 2000: 202-211 |
24 | EE | Timothy M. Chan: Approximating the diameter, width, smallest enclosing cylinder, and minimum-width annulus. Symposium on Computational Geometry 2000: 300-309 |
23 | Timothy M. Chan: Reporting curve segment intersections using restricted predicates. Comput. Geom. 16(4): 245-256 (2000) | |
22 | Timothy M. Chan: Random Sampling, Halfspace Range Reporting, and Construction of (<= k)-Levels in Three Dimensions. SIAM J. Comput. 30(2): 561-575 (2000) | |
1999 | ||
21 | EE | Timothy M. Chan: Dynamic Planar Convex Hull Operations in Near-Logarithmic Amortized Time. FOCS 1999: 92-99 |
20 | EE | Timothy M. Chan: A Near-Linear Area Bound for Drawing Binary Trees. SODA 1999: 161-168 |
19 | Timothy M. Chan: More planar two-center algorithms. Comput. Geom. 13(3): 189-198 (1999) | |
18 | EE | Timothy M. Chan: Geometric Applications of a Randomized Optimization Technique. Discrete & Computational Geometry 22(4): 547-567 (1999) |
1998 | ||
17 | EE | Timothy M. Chan: Sampling, Halfspace Range Reporting, and Construction of (<= k)-Levels in Three Dimensions. FOCS 1998: 586-595 |
16 | EE | Timothy M. Chan: Geometric Applications of a Randomized Optimization Technique. Symposium on Computational Geometry 1998: 269-278 |
15 | EE | Timothy M. Chan: On Enumerating and Selecting Distances. Symposium on Computational Geometry 1998: 279-286 |
14 | EE | Pankaj K. Agarwal, Boris Aronov, Timothy M. Chan, Micha Sharir: On Levels in Arrangements of Lines, Segments, Planes, and Triangles%. Discrete & Computational Geometry 19(3): 315-331 (1998) |
13 | EE | Timothy M. Chan: Approximate Nearest Neighbor Queries Revisited. Discrete & Computational Geometry 20(3): 359-373 (1998) |
12 | EE | Timothy M. Chan: Backwards Analysis of the Karger-Klein-Tarjan Algorithm for Minimum Spanning. Inf. Process. Lett. 67(6): 303-304 (1998) |
11 | Timothy M. Chan: Deterministic Algorithms for 2-d Convex Programming and 3-d Online Linear Programming. J. Algorithms 27(1): 147-166 (1998) | |
1997 | ||
10 | Timothy M. Chan: Deterministic Algorithms for 2-d Convex Programming and 3-d Online Linear Programming. SODA 1997: 464-472 | |
9 | EE | Timothy M. Chan: Approximate Nearest Neighbor Queries Revisited. Symposium on Computational Geometry 1997: 352-358 |
8 | EE | Timothy M. Chan, Jack Snoeyink, Chee-Keng Yap: Primal Dividing and Dual Pruning: Output-Sensitive Construction of Four-Dimensional Polytopes and Three-Dimensional Voronoi Diagrams. Discrete & Computational Geometry 18(4): 433-454 (1997) |
1996 | ||
7 | Timothy M. Chan, Michael T. Goodrich, S. Rao Kosaraju, Roberto Tamassia: Optimizing Area and Aspect Ratio in Straight-Line Orthogonal Tree Drawings. Graph Drawing 1996: 63-75 | |
6 | EE | Timothy M. Chan: Fixed-Dimensional Linear Programming Queries Made Easy. Symposium on Computational Geometry 1996: 284-290 |
5 | EE | Timothy M. Chan: Optimal Output-Sensitive Convex Hull Algorithms in Two and Three Dimensions. Discrete & Computational Geometry 16(4): 361-368 (1996) |
4 | EE | Timothy M. Chan: Output-Sensitive Results on Convex Hulls, Extreme Points, and Related Problems. Discrete & Computational Geometry 16(4): 369-387 (1996) |
1995 | ||
3 | Timothy M. Chan, Jack Snoeyink, Chee-Keng Yap: Output-Sensitive Construction of Polytopes in Four Dimensions and Clipped Voronoi Diagrams in Three. SODA 1995: 282-291 | |
2 | EE | Timothy M. Chan: Output-Sensitive Results on Convex Hulls, Extreme Points, and Related Problems. Symposium on Computational Geometry 1995: 10-19 |
1994 | ||
1 | Timothy M. Chan: A Simple Trapezoid Sweep Algorithm for Reporting Red/Blue Segment Intersections. CCCG 1994: 263-268 |