The SCEAS System
| |||||||

## Search the dblp DataBase
Timothy M. Chan:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Timothy M. Chan
**Fixed-Dimensional Linear Programming Queries Made Easy.**[Citation Graph (1, 0)][DBLP] Symposium on Computational Geometry, 1996, pp:284-290 [Conf] - Timothy M. Chan
**Approximate Nearest Neighbor Queries Revisited.**[Citation Graph (1, 0)][DBLP] Symposium on Computational Geometry, 1997, pp:352-358 [Conf] - Peyman Afshani, Timothy M. Chan
**Approximation Algorithms for Maximum Cliques in 3D Unit-Disk Graphs.**[Citation Graph (0, 0)][DBLP] CCCG, 2005, pp:19-22 [Conf] - 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.**[Citation Graph (0, 0)][DBLP] CCCG, 2002, pp:105-108 [Conf] - Therese C. Biedl, Timothy M. Chan, Alejandro López-Ortiz
**Drawing**[Citation Graph (0, 0)][DBLP]*k*_{2},*n*: A lower bound. CCCG, 2002, pp:146-148 [Conf] - Timothy M. Chan
**A Simple Trapezoid Sweep Algorithm for Reporting Red/Blue Segment Intersections.**[Citation Graph (0, 0)][DBLP] CCCG, 1994, pp:263-268 [Conf] - Timothy M. Chan, Alexander Golynski, Alejandro López-Ortiz, Claude-Guy Quimper
**Curves of width one and the river shore problem.**[Citation Graph (0, 0)][DBLP] CCCG, 2003, pp:73-75 [Conf] - Timothy M. Chan, Abdullah-Al Mahmood
**Approximating the piercing number for unit-height rectangles.**[Citation Graph (0, 0)][DBLP] CCCG, 2005, pp:15-18 [Conf] - Eric Y. Chen, Timothy M. Chan
**A Space-Efficient Algorithm for Segment Intersection.**[Citation Graph (0, 0)][DBLP] CCCG, 2003, pp:68-71 [Conf] - Eric Y. Chen, Timothy M. Chan
**Space-Efficient Algorithms for Klee's Measure Problem.**[Citation Graph (0, 0)][DBLP] CCCG, 2005, pp:27-30 [Conf] - Hervé Brönnimann, Timothy M. Chan, Eric Y. Chen
**Towards in-place geometric algorithms and data structures.**[Citation Graph (0, 0)][DBLP] Symposium on Computational Geometry, 2004, pp:239-246 [Conf] - Timothy M. Chan
**Approximating the diameter, width, smallest enclosing cylinder, and minimum-width annulus.**[Citation Graph (0, 0)][DBLP] Symposium on Computational Geometry, 2000, pp:300-309 [Conf] - Timothy M. Chan
**A fully dynamic algorithm for planar.**[Citation Graph (0, 0)][DBLP] Symposium on Computational Geometry, 2001, pp:172-176 [Conf] - Timothy M. Chan
**Euclidean bounded-degree spanning tree ratios.**[Citation Graph (0, 0)][DBLP] Symposium on Computational Geometry, 2003, pp:11-19 [Conf] - Timothy M. Chan
**Faster core-set constructions and data stream algorithms in fixed dimensions.**[Citation Graph (0, 0)][DBLP] Symposium on Computational Geometry, 2004, pp:152-159 [Conf] - Timothy M. Chan
**Output-Sensitive Results on Convex Hulls, Extreme Points, and Related Problems.**[Citation Graph (0, 0)][DBLP] Symposium on Computational Geometry, 1995, pp:10-19 [Conf] - Timothy M. Chan
**Geometric Applications of a Randomized Optimization Technique.**[Citation Graph (0, 0)][DBLP] Symposium on Computational Geometry, 1998, pp:269-278 [Conf] - Timothy M. Chan
**On Enumerating and Selecting Distances.**[Citation Graph (0, 0)][DBLP] Symposium on Computational Geometry, 1998, pp:279-286 [Conf] - Timothy M. Chan, Eric Y. Chen
**Multi-pass geometric algorithms.**[Citation Graph (0, 0)][DBLP] Symposium on Computational Geometry, 2005, pp:180-189 [Conf] - Timothy M. Chan, Alexander Golynski, Alejandro López-Ortiz, Claude-Guy Quimper
**the asteroid surveying problem and other puzzles.**[Citation Graph (0, 0)][DBLP] Symposium on Computational Geometry, 2003, pp:372-373 [Conf] - Peyman Afshani, Timothy M. Chan
**On approximate range counting and depth.**[Citation Graph (0, 0)][DBLP] Symposium on Computational Geometry, 2007, pp:337-343 [Conf] - Peyman Afshani, Timothy M. Chan
**Dynamic Connectivity for Axis-Parallel Rectangles.**[Citation Graph (0, 0)][DBLP] ESA, 2006, pp:16-27 [Conf] - David Bremner, Timothy M. Chan, Erik D. Demaine, Jeff Erickson, Ferran Hurtado, John Iacono, Stefan Langerman, Perouz Taslakian
**Necklaces, Convolutions, and**[Citation Graph (0, 0)][DBLP]*X*+*Y*. ESA, 2006, pp:160-171 [Conf] - Timothy M. Chan
**On Levels in Arrangements of Curves.**[Citation Graph (0, 0)][DBLP] FOCS, 2000, pp:219-227 [Conf] - Timothy M. Chan
**Low-Dimensional Linear Programming with Violations.**[Citation Graph (0, 0)][DBLP] FOCS, 2002, pp:570-0 [Conf] - Timothy M. Chan
**On Levels in Arrangements of Curves, II: A Simple Inequality and Its Consequences.**[Citation Graph (0, 0)][DBLP] FOCS, 2003, pp:544-0 [Conf] - Timothy M. Chan
**Sampling, Halfspace Range Reporting, and Construction of (<= k)-Levels in Three Dimensions.**[Citation Graph (0, 0)][DBLP] FOCS, 1998, pp:586-595 [Conf] - Timothy M. Chan
**Dynamic Planar Convex Hull Operations in Near-Logarithmic Amortized Time.**[Citation Graph (0, 0)][DBLP] FOCS, 1999, pp:92-99 [Conf] - 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.**[Citation Graph (0, 0)][DBLP] FOCS, 2006, pp:333-344 [Conf] - Timothy M. Chan, Michael T. Goodrich, S. Rao Kosaraju, Roberto Tamassia
**Optimizing Area and Aspect Ratio in Straight-Line Orthogonal Tree Drawings.**[Citation Graph (0, 0)][DBLP] Graph Drawing, 1996, pp:63-75 [Conf] - Timothy M. Chan, Bashir S. Sadjad
**Geometric Optimization Problems Over Sliding Windows.**[Citation Graph (0, 0)][DBLP] ISAAC, 2004, pp:246-258 [Conf] - Hervé Brönnimann, Timothy M. Chan
**Space-E.cient Algorithms for Computing the Convex Hull of a Simple Polygonal Line in Linear Time.**[Citation Graph (0, 0)][DBLP] LATIN, 2004, pp:162-171 [Conf] - Therese C. Biedl, Eowyn Cenek, Timothy M. Chan, Erik D. Demaine, Martin L. Demaine, Rudolf Fleischer, Ming-wei Wang
**Balanced**[Citation Graph (0, 0)][DBLP]*k*-Colorings. MFCS, 2000, pp:202-211 [Conf] - Timothy M. Chan
**Closest-point problems simplified on the RAM.**[Citation Graph (0, 0)][DBLP] SODA, 2002, pp:472-473 [Conf] - Timothy M. Chan
**Semi-online maintenance of geometric optima and measures.**[Citation Graph (0, 0)][DBLP] SODA, 2002, pp:474-483 [Conf] - Timothy M. Chan
**An optimal randomized algorithm for maximum Tukey depth.**[Citation Graph (0, 0)][DBLP] SODA, 2004, pp:430-436 [Conf] - Timothy M. Chan
**On levels in arrangements of surfaces in three dimensions.**[Citation Graph (0, 0)][DBLP] SODA, 2005, pp:232-240 [Conf] - Timothy M. Chan
**Finding the shortest bottleneck edge in a parametric minimum spanning tree.**[Citation Graph (0, 0)][DBLP] SODA, 2005, pp:917-918 [Conf] - Timothy M. Chan
**All-pairs shortest paths for unweighted undirected graphs in**[Citation Graph (0, 0)][DBLP]*o(mn)*time. SODA, 2006, pp:514-523 [Conf] - Timothy M. Chan
**A dynamic data structure for 3-d convex hulls and 2-d nearest neighbor queries.**[Citation Graph (0, 0)][DBLP] SODA, 2006, pp:1196-1202 [Conf] - Timothy M. Chan
**Deterministic Algorithms for 2-d Convex Programming and 3-d Online Linear Programming.**[Citation Graph (0, 0)][DBLP] SODA, 1997, pp:464-472 [Conf] - Timothy M. Chan
**A Near-Linear Area Bound for Drawing Binary Trees.**[Citation Graph (0, 0)][DBLP] SODA, 1999, pp:161-168 [Conf] - Timothy M. Chan, Jack Snoeyink, Chee-Keng Yap
**Output-Sensitive Construction of Polytopes in Four Dimensions and Clipped Voronoi Diagrams in Three.**[Citation Graph (0, 0)][DBLP] SODA, 1995, pp:282-291 [Conf] - Timothy M. Chan
**Dynamic subgraph connectivity with geometric applications.**[Citation Graph (0, 0)][DBLP] STOC, 2002, pp:7-13 [Conf] - Timothy M. Chan
**All-Pairs Shortest Paths with Real Weights in**[Citation Graph (0, 0)][DBLP]*O*(*n*^{3}/log*n*) Time. WADS, 2005, pp:318-324 [Conf] - Timothy M. Chan, Hamid Zarrabi-Zadeh
**A Randomized Algorithm for Online Unit Clustering.**[Citation Graph (0, 0)][DBLP] WAOA, 2006, pp:121-131 [Conf] - Timothy M. Chan
**A Near-Linear Area Bound for Drawing Binary Trees.**[Citation Graph (0, 0)][DBLP] Algorithmica, 2002, v:34, n:1, pp:1-13 [Journal] - Hervé Brönnimann, Timothy M. Chan
**Space-efficient algorithms for computing the convex hull of a simple polygonal line in linear time.**[Citation Graph (0, 0)][DBLP] Comput. Geom., 2006, v:34, n:2, pp:75-82 [Journal] - Timothy M. Chan
**Reporting curve segment intersections using restricted predicates.**[Citation Graph (0, 0)][DBLP] Comput. Geom., 2000, v:16, n:4, pp:245-256 [Journal] - Timothy M. Chan
**Faster core-set constructions and data-stream algorithms in fixed dimensions.**[Citation Graph (0, 0)][DBLP] Comput. Geom., 2006, v:35, n:1-2, pp:20-35 [Journal] - Timothy M. Chan
**More planar two-center algorithms.**[Citation Graph (0, 0)][DBLP] Comput. Geom., 1999, v:13, n:3, pp:189-198 [Journal] - Timothy M. Chan, Michael T. Goodrich, S. Rao Kosaraju, Roberto Tamassia
**Optimizing area and aspect ration in straight-line orthogonal tree drawings.**[Citation Graph (0, 0)][DBLP] Comput. Geom., 2002, v:23, n:2, pp:153-162 [Journal] - Timothy M. Chan
**Three problems about simple polygons.**[Citation Graph (0, 0)][DBLP] Comput. Geom., 2006, v:35, n:3, pp:209-217 [Journal] - Therese C. Biedl, Timothy M. Chan, Yashar Ganjali, Mohammad Taghi Hajiaghayi, David R. Wood
**Balanced vertex-orderings of graphs.**[Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2005, v:148, n:1, pp:27-48 [Journal] - 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.**[Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2004, v:144, n:3, pp:231-236 [Journal] - Therese C. Biedl, Timothy M. Chan
**A note on 3D orthogonal graph drawing.**[Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2005, v:148, n:2, pp:189-193 [Journal] - Pankaj K. Agarwal, Boris Aronov, Timothy M. Chan, Micha Sharir
**On Levels in Arrangements of Lines, Segments, Planes, and Triangles%.**[Citation Graph (0, 0)][DBLP] Discrete & Computational Geometry, 1998, v:19, n:3, pp:315-331 [Journal] - Timothy M. Chan
**On Levels in Arrangements of Curves.**[Citation Graph (0, 0)][DBLP] Discrete & Computational Geometry, 2003, v:29, n:3, pp:375-393 [Journal] - Timothy M. Chan
**A Fully Dynamic Algorithm for Planar Width.**[Citation Graph (0, 0)][DBLP] Discrete & Computational Geometry, 2003, v:30, n:1, pp:17-24 [Journal] - Timothy M. Chan
**Euclidean Bounded-Degree Spanning Tree Ratios.**[Citation Graph (0, 0)][DBLP] Discrete & Computational Geometry, 2004, v:32, n:2, pp:177-194 [Journal] - Timothy M. Chan
**On Levels in Arrangements of Curves, II: A Simple Inequality and Its Consequences.**[Citation Graph (0, 0)][DBLP] Discrete & Computational Geometry, 2005, v:34, n:1, pp:11-24 [Journal] - Timothy M. Chan
**Optimal Output-Sensitive Convex Hull Algorithms in Two and Three Dimensions.**[Citation Graph (0, 0)][DBLP] Discrete & Computational Geometry, 1996, v:16, n:4, pp:361-368 [Journal] - Timothy M. Chan
**Output-Sensitive Results on Convex Hulls, Extreme Points, and Related Problems.**[Citation Graph (0, 0)][DBLP] Discrete & Computational Geometry, 1996, v:16, n:4, pp:369-387 [Journal] - Timothy M. Chan
**Approximate Nearest Neighbor Queries Revisited.**[Citation Graph (0, 0)][DBLP] Discrete & Computational Geometry, 1998, v:20, n:3, pp:359-373 [Journal] - Timothy M. Chan
**Geometric Applications of a Randomized Optimization Technique.**[Citation Graph (0, 0)][DBLP] Discrete & Computational Geometry, 1999, v:22, n:4, pp:547-567 [Journal] - 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.**[Citation Graph (0, 0)][DBLP] Discrete & Computational Geometry, 1997, v:18, n:4, pp:433-454 [Journal] - Therese C. Biedl, Eowyn Cenek, Timothy M. Chan, Erik D. Demaine, Martin L. Demaine, Rudolf Fleischer, Ming-wei Wang
**Balanced**[Citation Graph (0, 0)][DBLP]*k*-colorings. Discrete Mathematics, 2002, v:254, n:1-3, pp:19-32 [Journal] - Timothy M. Chan
**On Enumerating and Selecting Distances.**[Citation Graph (0, 0)][DBLP] Int. J. Comput. Geometry Appl., 2001, v:11, n:3, pp:291-304 [Journal] - Timothy M. Chan
**Approximating the Diameter, Width, Smallest Enclosing Cylinder, and Minimum-Width Annulus.**[Citation Graph (0, 0)][DBLP] Int. J. Comput. Geometry Appl., 2002, v:12, n:1-2, pp:67-85 [Journal] - Timothy M. Chan, Bashir S. Sadjad
**Geometric Optimization Problems over Sliding Windows.**[Citation Graph (0, 0)][DBLP] Int. J. Comput. Geometry Appl., 2006, v:16, n:2-3, pp:145-158 [Journal] - Therese C. Biedl, Timothy M. Chan, Alejandro López-Ortiz
**Drawing K**[Citation Graph (0, 0)][DBLP]_{2, n}: A lower bound. Inf. Process. Lett., 2003, v:85, n:6, pp:303-305 [Journal] - Timothy M. Chan
**A note on maximum independent sets in rectangle intersection graphs.**[Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2004, v:89, n:1, pp:19-23 [Journal] - Timothy M. Chan
**Backwards Analysis of the Karger-Klein-Tarjan Algorithm for Minimum Spanning.**[Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1998, v:67, n:6, pp:303-304 [Journal] - Timothy M. Chan
**Dynamic planar convex hull operations in near-logarithmaic amortized time.**[Citation Graph (0, 0)][DBLP] J. ACM, 2001, v:48, n:1, pp:1-12 [Journal] - Timothy M. Chan
**Polynomial-time approximation schemes for packing and piercing fat objects.**[Citation Graph (0, 0)][DBLP] J. Algorithms, 2003, v:46, n:2, pp:178-189 [Journal] - Timothy M. Chan
**Deterministic Algorithms for 2-d Convex Programming and 3-d Online Linear Programming.**[Citation Graph (0, 0)][DBLP] J. Algorithms, 1998, v:27, n:1, pp:147-166 [Journal] - Timothy M. Chan, Alon Efrat
**Fly Cheaply: On the Minimum Fuel Consumption Problem.**[Citation Graph (0, 0)][DBLP] J. Algorithms, 2001, v:41, n:2, pp:330-337 [Journal] - Timothy M. Chan
**Random Sampling, Halfspace Range Reporting, and Construction of (<= k)-Levels in Three Dimensions.**[Citation Graph (0, 0)][DBLP] SIAM J. Comput., 2000, v:30, n:2, pp:561-575 [Journal] - Timothy M. Chan
**Semi-Online Maintenance of Geometric Optima and Measures.**[Citation Graph (0, 0)][DBLP] SIAM J. Comput., 2003, v:32, n:3, pp:700-716 [Journal] - Timothy M. Chan
**Low-Dimensional Linear Programming with Violations.**[Citation Graph (0, 0)][DBLP] SIAM J. Comput., 2005, v:34, n:4, pp:879-893 [Journal] - Timothy M. Chan
**Dynamic Subgraph Connectivity with Geometric Applications.**[Citation Graph (0, 0)][DBLP] SIAM J. Comput., 2006, v:36, n:3, pp:681-694 [Journal] - Hamid Zarrabi-Zadeh, Timothy M. Chan
**A Simple Streaming Algorithm for Minimum Enclosing Balls.**[Citation Graph (0, 0)][DBLP] CCCG, 2006, pp:- [Conf] - Hamid Zarrabi-Zadeh, Timothy M. Chan
**An Improved Algorithm for Online Unit Clustering.**[Citation Graph (0, 0)][DBLP] COCOON, 2007, pp:383-393 [Conf] - Timothy M. Chan
**More algorithms for all-pairs shortest paths in weighted graphs.**[Citation Graph (0, 0)][DBLP] STOC, 2007, pp:590-598 [Conf] - Timothy M. Chan, Mihai Patrascu
**Voronoi diagrams in n·2**[Citation Graph (0, 0)][DBLP]^{osqrt(lg lg n)}time. STOC, 2007, pp:31-39 [Conf] - Timothy M. Chan, Eric Y. Chen
**Multi-Pass Geometric Algorithms.**[Citation Graph (0, 0)][DBLP] Discrete & Computational Geometry, 2007, v:37, n:1, pp:79-102 [Journal] **On levels in arrangements of curves, iii: further improvements.**[Citation Graph (, )][DBLP]**Dynamic coresets.**[Citation Graph (, )][DBLP]**A (slightly) faster algorithm for klee's measure problem.**[Citation Graph (, )][DBLP]**Approximation algorithms for maximum independent set of pseudo-disks.**[Citation Graph (, )][DBLP]**Optimal in-place algorithms for 3-D convex hulls and 2-D segment intersection.**[Citation Graph (, )][DBLP]**Optimal partition trees.**[Citation Graph (, )][DBLP]**Dynamic Connectivity: Connecting to Networks and Geometry.**[Citation Graph (, )][DBLP]**Instance-Optimal Geometric Algorithms.**[Citation Graph (, )][DBLP]**In-place 2-d nearest neighbor search.**[Citation Graph (, )][DBLP]**On the bichromatic**[Citation Graph (, )][DBLP]*k*-set problem.**Comparison-based time-space lower bounds for selection.**[Citation Graph (, )][DBLP]**Optimal halfspace range reporting in three dimensions.**[Citation Graph (, )][DBLP]**Counting Inversions, Offline Orthogonal Range Counting, and Related Problems.**[Citation Graph (, )][DBLP]**All-Pairs Shortest Paths with Real Weights in**[Citation Graph (, )][DBLP]*O*(*n*^{3}/log*n*) Time.**Dynamic Connectivity for Axis-Parallel Rectangles.**[Citation Graph (, )][DBLP]**An Improved Algorithm for Online Unit Clustering.**[Citation Graph (, )][DBLP]**Dynamic ham-sandwich cuts in the plane.**[Citation Graph (, )][DBLP]**A (slightly) faster algorithm for Klee's measure problem.**[Citation Graph (, )][DBLP]**Optimal in-place and cache-oblivious algorithms for 3-d convex hulls and 2-d segment intersection.**[Citation Graph (, )][DBLP]**Dynamic Connectivity: Connecting to Networks and Geometry**[Citation Graph (, )][DBLP]**On Approximate Range Counting and Depth.**[Citation Graph (, )][DBLP]**Dynamic Coresets.**[Citation Graph (, )][DBLP]
Search in 0.544secs, Finished in 0.552secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |