Timothy M. Chan - researchr alias

researchr

You are not signed in
Sign in
Sign up

2011

2010

On the bichromatic ::::k::::-set problemTimothy M. Chan. talg, 6(4), 2010. [doi]

Counting Inversions, Offline Orthogonal Range Counting, and Related ProblemsTimothy M. Chan, Mihai Patrascu. soda 2010: 161-173 [doi]

A (slightly) faster algorithm for Klee s measure problemTimothy M. Chan. comgeo, 43(3):243-250, 2010. [doi]

Optimal in-place and cache-oblivious algorithms for 3-d convex hulls and 2-d segment intersectionTimothy M. Chan, Eric Y. Chen. comgeo, 43(8):636-646, 2010. [doi]

Optimal partition treesTimothy M. Chan. compgeom 2010: 1-10 [doi]

Comparison-based time-space lower bounds for selectionTimothy M. Chan. talg, 6(2), 2010. [doi]

A dynamic data structure for 3-D convex hulls and 2-D nearest neighbor queriesTimothy M. Chan. JACM, 57(3), 2010. [doi]

More Algorithms for All-Pairs Shortest Paths in Weighted GraphsTimothy M. Chan. siamcomp, 39(5):2075-2089, 2010. [doi]

2009

Dynamic ham-sandwich cuts in the planeTimothy 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. comgeo, 42(5):419-428, 2009. [doi]

Dynamic Connectivity for Axis-Parallel RectanglesPeyman Afshani, Timothy M. Chan. algorithmica, 53(4):474-487, 2009. [doi]

Optimal halfspace range reporting in three dimensionsPeyman Afshani, Timothy M. Chan. soda 2009: 180-186 [doi]

On Approximate Range Counting and DepthPeyman Afshani, Timothy M. Chan. dcg, 42(1):3-21, 2009. [doi]

Instance-Optimal Geometric AlgorithmsPeyman Afshani, JÃ©rÃ©my Barbay, Timothy M. Chan. focs 2009: 129-138 [doi]

Dynamic CoresetsTimothy M. Chan. dcg, 42(3):469-488, 2009. [doi]

Transdichotomous Results in Computational Geometry, I: Point Location in Sublogarithmic TimeTimothy M. Chan, Mihai Patrascu. siamcomp, 39(2):703-729, 2009. [doi]

Approximation algorithms for maximum independent set of pseudo-disksTimothy M. Chan, Sariel Har-Peled. compgeom 2009: 333-340 [doi]

A Randomized Algorithm for Online Unit ClusteringTimothy M. Chan, Hamid Zarrabi-Zadeh. mst, 45(3):486-496, 2009. [doi]

Optimal in-place algorithms for 3-D convex hulls and 2-D segment intersectionTimothy M. Chan, Eric Y. Chen. compgeom 2009: 80-87 [doi]

Comparison-based time-space lower bounds for selectionTimothy M. Chan. soda 2009: 140-149 [doi]

An Improved Algorithm for Online Unit ClusteringHamid Zarrabi-Zadeh, Timothy M. Chan. algorithmica, 54(4):490-500, 2009. [doi]

2008

2007

2006

Dynamic Connectivity for Axis-Parallel RectanglesPeyman Afshani, Timothy M. Chan. esa 2006: 16-27 [doi]

Necklaces, 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 [doi]

Space-efficient algorithms for computing the convex hull of a simple polygonal line in linear timeHervé Brönnimann, Timothy M. Chan. comgeo, 34(2):75-82, 2006. [doi]

A Randomized Algorithm for Online Unit ClusteringTimothy M. Chan, Hamid Zarrabi-Zadeh. waoa 2006: 121-131 [doi]

Three problems about simple polygonsTimothy M. Chan. comgeo, 35(3):209-217, 2006. [doi]

Point Location in o(log n) Time, Voronoi Diagrams in o(n log n) Time, and Other Transdichotomous Results in Computational GeometryTimothy M. Chan. focs 2006: 333-344 [doi]

Dynamic Subgraph Connectivity with Geometric ApplicationsTimothy M. Chan. siamcomp, 36(3):681-694, 2006. [doi]

Geometric Optimization Problems over Sliding WindowsTimothy M. Chan, Bashir S. Sadjad. ijcga, 16(2-3):145-158, 2006. [doi]

A dynamic data structure for 3-d convex hulls and 2-d nearest neighbor queriesTimothy M. Chan. soda 2006: 1196-1202 [doi]

Faster core-set constructions and data-stream algorithms in fixed dimensionsTimothy M. Chan. comgeo, 35(1-2):20-35, 2006. [doi]

All-pairs shortest paths for unweighted undirected graphs in ::::o(mn):::: timeTimothy M. Chan. soda 2006: 514-523 [doi]

A Simple Streaming Algorithm for Minimum Enclosing BallsHamid Zarrabi-Zadeh, Timothy M. Chan. cccg 2006: [doi]

2005

Approximation Algorithms for Maximum Cliques in 3D Unit-Disk GraphsPeyman Afshani, Timothy M. Chan. cccg 2005: 19-22 [doi]

Balanced vertex-orderings of graphsTherese C. Biedl, Timothy M. Chan, Yashar Ganjali, Mohammad Taghi Hajiaghayi, David R. Wood. DAM, 148(1):27-48, 2005. [doi]

A note on 3D orthogonal graph drawingTherese C. Biedl, Timothy M. Chan. DAM, 148(2):189-193, 2005. [doi]

Approximating the piercing number for unit-height rectanglesTimothy M. Chan, Abdullah-Al Mahmood. cccg 2005: 15-18 [doi]

Multi-pass geometric algorithmsTimothy M. Chan, Eric Y. Chen. compgeom 2005: 180-189 [doi]

On levels in arrangements of surfaces in three dimensionsTimothy M. Chan. soda 2005: 232-240 [doi]

Finding the shortest bottleneck edge in a parametric minimum spanning treeTimothy M. Chan. soda 2005: 917-918 [doi]

All-Pairs Shortest Paths with Real Weights in ::::O::::(::::n:::::::3:::/log ::::n::::) TimeTimothy M. Chan. wads 2005: 318-324 [doi]

On Levels in Arrangements of Curves, II: A Simple Inequality and Its ConsequencesTimothy M. Chan. dcg, 34(1):11-24, 2005. [doi]

Low-Dimensional Linear Programming with ViolationsTimothy M. Chan. siamcomp, 34(4):879-893, 2005. [doi]

Space-Efficient Algorithms for Klee s Measure ProblemEric Y. Chen, Timothy M. Chan. cccg 2005: 27-30 [doi]

2004

Fun-Sort--or the chaos of unordered binary searchTherese C. Biedl, Timothy M. Chan, Erik D. Demaine, Rudolf Fleischer, Mordecai J. Golin, James A. King, J. Ian Munro. DAM, 144(3):231-236, 2004. [doi]

Space-E.cient Algorithms for Computing the Convex Hull of a Simple Polygonal Line in Linear TimeHervé Brönnimann, Timothy M. Chan. latin 2004: 162-171 [doi]

Towards in-place geometric algorithms and data structuresHervé Brönnimann, Timothy M. Chan, Eric Y. Chen. compgeom 2004: 239-246 [doi]

An optimal randomized algorithm for maximum Tukey depthTimothy M. Chan. soda 2004: 430-436 [doi]

Euclidean Bounded-Degree Spanning Tree RatiosTimothy M. Chan. dcg, 32(2):177-194, 2004. [doi]

Geometric Optimization Problems Over Sliding WindowsTimothy M. Chan, Bashir S. Sadjad. isaac 2004: 246-258 [doi]

Faster core-set constructions and data stream algorithms in fixed dimensionsTimothy M. Chan. compgeom 2004: 152-159 [doi]

A note on maximum independent sets in rectangle intersection graphsTimothy M. Chan. ipl, 89(1):19-23, 2004. [doi]

2003

Drawing K::2, n::: A lower boundTherese C. Biedl, Timothy M. Chan, Alejandro López-Ortiz. ipl, 85(6):303-305, 2003. [doi]

Curves of width one and the river shore problemTimothy M. Chan, Alexander Golynski, Alejandro López-Ortiz, Claude-Guy Quimper. cccg 2003: 73-75

Euclidean bounded-degree spanning tree ratiosTimothy M. Chan. compgeom 2003: 11-19 [doi]

On Levels in Arrangements of Curves, II: A Simple Inequality and Its ConsequencesTimothy M. Chan. focs 2003: 544 [doi]

A Fully Dynamic Algorithm for Planar WidthTimothy M. Chan. dcg, 30(1):17-24, 2003. [doi]

Polynomial-time approximation schemes for packing and piercing fat objectsTimothy M. Chan. jal, 46(2):178-189, 2003. [doi]

On Levels in Arrangements of CurvesTimothy M. Chan. dcg, 29(3):375-393, 2003. [doi]

Semi-Online Maintenance of Geometric Optima and MeasuresTimothy M. Chan. siamcomp, 32(3):700-716, 2003. [doi]

the asteroid surveying problem and other puzzlesTimothy M. Chan, Alexander Golynski, Alejandro López-Ortiz, Claude-Guy Quimper. compgeom 2003: 372-373 [doi]

A Space-Efficient Algorithm for Segment IntersectionEric Y. Chen, Timothy M. Chan. cccg 2003: 68-71

2002

Drawing ::::k::::::2::, ::::n::::: A lower boundTherese C. Biedl, Timothy M. Chan, Alejandro López-Ortiz. cccg 2002: 146-148 [doi]

Tighter bounds on the genus of nonorthogonal polyhedra built from rectanglesTherese C. Biedl, Timothy M. Chan, Erik D. Demaine, Martin L. Demaine, Paul Nijjar, Ryuhei Uehara, Ming-wei Wang. cccg 2002: 105-108 [doi]

Balanced ::::k::::-coloringsTherese C. Biedl, Eowyn Cenek, Timothy M. Chan, Erik D. Demaine, Martin L. Demaine, Rudolf Fleischer, Ming-wei Wang. DM, 254(1-3):19-32, 2002. [doi]

Approximating the Diameter, Width, Smallest Enclosing Cylinder, and Minimum-Width AnnulusTimothy M. Chan. ijcga, 12(1-2):67-85, 2002.

A Near-Linear Area Bound for Drawing Binary TreesTimothy M. Chan. algorithmica, 34(1):1-13, 2002. [doi]

Closest-point problems simplified on the RAMTimothy M. Chan. soda 2002: 472-473 [doi]

Dynamic subgraph connectivity with geometric applicationsTimothy M. Chan. stoc 2002: 7-13 [doi]

Semi-online maintenance of geometric optima and measuresTimothy M. Chan. soda 2002: 474-483 [doi]

Optimizing area and aspect ration in straight-line orthogonal tree drawingsTimothy M. Chan, Michael T. Goodrich, S. Rao Kosaraju, Roberto Tamassia. comgeo, 23(2):153-162, 2002.

Low-Dimensional Linear Programming with ViolationsTimothy M. Chan. focs 2002: 570 [doi]

2001

On Enumerating and Selecting DistancesTimothy M. Chan. ijcga, 11(3):291-304, 2001.

A fully dynamic algorithm for planarTimothy M. Chan. compgeom 2001: 172-176 [doi]

Fly Cheaply: On the Minimum Fuel Consumption ProblemTimothy M. Chan, Alon Efrat. jal, 41(2):330-337, 2001. [doi]

Dynamic planar convex hull operations in near-logarithmaic amortized timeTimothy M. Chan. JACM, 48(1):1-12, 2001. [doi]

2000

1999

More planar two-center algorithmsTimothy M. Chan. comgeo, 13(3):189-198, 1999.

PreviousNext