| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Timothy M. Chan |
On Levels in Arrangements of Surfaces in Three Dimensions.  |
Discrete & Computational Geometry  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Timothy M. Chan |
Optimal Partition Trees. |
Discrete & Computational Geometry |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Timothy M. Chan, Elyot Grant, Jochen Könemann, Malcolm Sharpe |
Weighted capacitated, priority, and geometric set cover via improved quasi-uniform sampling. |
SODA |
2012 |
DBLP BibTeX RDF |
|
| 1 | Timothy M. Chan, Stephane Durocher, Kasper Green Larsen, Jason Morrison, Bryan T. Wilkinson |
Linear-Space Data Structures for Range Mode Query in Arrays. |
STACS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Timothy M. Chan, Kasper Green Larsen, Mihai Patrascu |
Orthogonal Range Searching on the RAM, Revisited |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Timothy M. Chan, Sariel Har-Peled |
Approximation Algorithms for Maximum Independent Set of Pseudo-Disks |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Timothy M. Chan, Mihai Patrascu, Liam Roditty |
Dynamic Connectivity: Connecting to Networks and Geometry. |
SIAM J. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Timothy M. Chan |
Persistent Predecessor Search and Orthogonal point Location on the Word RAM. |
SODA |
2011 |
DBLP BibTeX RDF |
|
| 1 | Timothy M. Chan, Kasper Green Larsen, Mihai Patrascu |
Orthogonal range searching on the RAM, revisited. |
Symposium on Computational Geometry |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Timothy M. Chan |
Three problems about dynamic convex hulls. |
Symposium on Computational Geometry |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Pegah Kamousi, Timothy M. Chan, Subhash Suri |
Stochastic minimum spanning trees in euclidean spaces. |
Symposium on Computational Geometry |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Elyot Grant, Timothy M. Chan |
Exact Algorithms and APX-Hardness Results for Geometric Set Cover. |
CCCG |
2011 |
DBLP BibTeX RDF |
|
| 1 | Timothy M. Chan, Bryan T. Wilkinson |
Bichromatic Line Segment Intersection Counting in O(n sqrt(log n)) Time. |
CCCG |
2011 |
DBLP BibTeX RDF |
|
| 1 | Timothy M. Chan, Vinayak Pathak |
Streaming and Dynamic Algorithms for Minimum Enclosing Balls in High Dimensions. |
WADS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Pegah Kamousi, Timothy M. Chan, Subhash Suri |
Closest Pair and the Post Office Problem for Stochastic Points. |
WADS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Timothy M. Chan |
Comparison-based time-space lower bounds for selection. |
ACM Transactions on Algorithms |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Timothy M. Chan |
On the bichromatic k-set problem. |
ACM Transactions on Algorithms |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Timothy M. Chan |
A dynamic data structure for 3-D convex hulls and 2-D nearest neighbor queries. |
J. ACM |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Timothy M. Chan, Mihai Patrascu |
Transdichotomous Results in Computational Geometry, II: Offline Search |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Timothy M. Chan |
A (slightly) faster algorithm for Klee's measure problem. |
Comput. Geom. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Timothy M. Chan, Eric Y. Chen |
Optimal in-place and cache-oblivious algorithms for 3-d convex hulls and 2-d segment intersection. |
Comput. Geom. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Timothy M. Chan |
More Algorithms for All-Pairs Shortest Paths in Weighted Graphs. |
SIAM J. Comput. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Timothy M. Chan, Mihai Patrascu |
Counting Inversions, Offline Orthogonal Range Counting, and Related Problems. |
SODA |
2010 |
DBLP BibTeX RDF |
|
| 1 | Timothy M. Chan |
Optimal partition trees. |
Symposium on Computational Geometry |
2010 |
DBLP DOI BibTeX RDF |
halfspace range searching, simplex range searching, geometric data structures |
| 1 | Peyman Afshani, Timothy M. Chan |
Dynamic Connectivity for Axis-Parallel Rectangles. |
Algorithmica |
2009 |
DBLP DOI BibTeX RDF |
Dynamic connectivity, Data structures, Computational geometry, Dynamic data structures |
| 1 | Hamid Zarrabi-Zadeh, Timothy M. Chan |
An Improved Algorithm for Online Unit Clustering. |
Algorithmica |
2009 |
DBLP DOI BibTeX RDF |
Unit clustering, Randomized algorithms, Online algorithms |
| 1 | Peyman Afshani, Timothy M. Chan |
On Approximate Range Counting and Depth. |
Discrete & Computational Geometry |
2009 |
DBLP DOI BibTeX RDF |
Statistical depth, Approximation algorithms, Data structures, Randomized algorithms, Range searching |
| 1 | Timothy M. Chan |
Dynamic Coresets. |
Discrete & Computational Geometry |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Timothy M. Chan, Hamid Zarrabi-Zadeh |
A Randomized Algorithm for Online Unit Clustering. |
Theory Comput. Syst. |
2009 |
DBLP DOI BibTeX RDF |
Unit clustering, Randomized algorithms, Online algorithms |
| 1 | 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 |
Dynamic ham-sandwich cuts in the plane. |
Comput. Geom. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Timothy M. Chan, Mihai Patrascu |
Transdichotomous Results in Computational Geometry, I: Point Location in Sublogarithmic Time. |
SIAM J. Comput. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Peyman Afshani, Timothy M. Chan |
Optimal halfspace range reporting in three dimensions. |
SODA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Timothy M. Chan |
Comparison-based time-space lower bounds for selection. |
SODA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Timothy M. Chan, Sariel Har-Peled |
Approximation algorithms for maximum independent set of pseudo-disks. |
Symposium on Computational Geometry |
2009 |
DBLP DOI BibTeX RDF |
approximation., local search |
| 1 | Timothy M. Chan, Eric Y. Chen |
Optimal in-place algorithms for 3-D convex hulls and 2-D segment intersection. |
Symposium on Computational Geometry |
2009 |
DBLP DOI BibTeX RDF |
in-place algorithms, segment intersection, voronoi diagrams, convex hulls, cache-oblivious algorithms |
| 1 | Peyman Afshani, Jérémy Barbay, Timothy M. Chan |
Instance-Optimal Geometric Algorithms. |
FOCS |
2009 |
DBLP DOI BibTeX RDF |
instance optimality, entropy-sensitive data structures, maxima, orthogonal segment intersection, computational geometry, lower bounds, decision trees, convex hull, adaptive algorithms, point location, output-sensitive algorithms |
| 1 | Timothy M. Chan |
Well-separated pair decomposition in linear time? |
Inf. Process. Lett. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Timothy M. Chan |
All-Pairs Shortest Paths with Real Weights in O ( n 3/log n ) Time. |
Algorithmica |
2008 |
DBLP DOI BibTeX RDF |
Shortest paths, Graph algorithms |
| 1 | Timothy M. Chan, Mihai Patrascu, Liam Roditty |
Dynamic Connectivity: Connecting to Networks and Geometry |
CoRR |
2008 |
DBLP BibTeX RDF |
|
| 1 | Timothy M. Chan, Eric Y. Chen |
In-place 2-d nearest neighbor search. |
SODA |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Timothy M. Chan |
On the bichromatic k-set problem. |
SODA |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Timothy M. Chan |
Dynamic coresets. |
Symposium on Computational Geometry |
2008 |
DBLP DOI BibTeX RDF |
approximation algorithms, randomization, dynamic data structures, geometric optimization, word ram |
| 1 | Timothy M. Chan |
On levels in arrangements of curves, iii: further improvements. |
Symposium on Computational Geometry |
2008 |
DBLP DOI BibTeX RDF |
k-levels, k-sets, arrangements, combinatorial geometry |
| 1 | Timothy M. Chan |
A (slightly) faster algorithm for klee's measure problem. |
Symposium on Computational Geometry |
2008 |
DBLP DOI BibTeX RDF |
union of geometric objects, data structures, boxes |
| 1 | Timothy M. Chan, Mihai Patrascu, Liam Roditty |
Dynamic Connectivity: Connecting to Networks and Geometry. |
FOCS |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Timothy M. Chan, Eric Y. Chen |
Multi-Pass Geometric Algorithms. |
Discrete & Computational Geometry |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Peyman Afshani, Timothy M. Chan |
On approximate range counting and depth. |
Symposium on Computational Geometry |
2007 |
DBLP DOI BibTeX RDF |
data depth, computational geometry, approximation, approximate counting |
| 1 | Hamid Zarrabi-Zadeh, Timothy M. Chan |
An Improved Algorithm for Online Unit Clustering. |
COCOON |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Timothy M. Chan |
More algorithms for all-pairs shortest paths in weighted graphs. |
STOC |
2007 |
DBLP DOI BibTeX RDF |
computational geometry, shortest paths, graph algorithms, matrix multiplication |
| 1 | Timothy M. Chan, Mihai Patrascu |
Voronoi diagrams in n·2osqrt(lg lg n) time. |
STOC |
2007 |
DBLP DOI BibTeX RDF |
segment intersection, word-RAM algorithms, computational geometry, sorting, convex hulls, point location |
| 1 | Hervé Brönnimann, Timothy M. Chan |
Space-efficient algorithms for computing the convex hull of a simple polygonal line in linear time. |
Comput. Geom. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Timothy M. Chan |
Three problems about simple polygons. |
Comput. Geom. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Timothy M. Chan |
Faster core-set constructions and data-stream algorithms in fixed dimensions. |
Comput. Geom. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Timothy M. Chan |
Dynamic Subgraph Connectivity with Geometric Applications. |
SIAM J. Comput. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Timothy M. Chan, Bashir S. Sadjad |
Geometric Optimization Problems over Sliding Windows. |
Int. J. Comput. Geometry Appl. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | Peyman Afshani, Timothy M. Chan |
Dynamic Connectivity for Axis-Parallel Rectangles. |
ESA |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Timothy M. Chan |
A dynamic data structure for 3-d convex hulls and 2-d nearest neighbor queries. |
SODA |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Timothy M. Chan |
All-pairs shortest paths for unweighted undirected graphs in o(mn) time. |
SODA |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Hamid Zarrabi-Zadeh, Timothy M. Chan |
A Simple Streaming Algorithm for Minimum Enclosing Balls. |
CCCG |
2006 |
DBLP BibTeX RDF |
|
| 1 | Timothy M. Chan, Hamid Zarrabi-Zadeh |
A Randomized Algorithm for Online Unit Clustering. |
WAOA |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | Timothy M. Chan |
On Levels in Arrangements of Curves, II: A Simple Inequality and Its Consequences. |
Discrete & Computational Geometry |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Therese C. Biedl, Timothy M. Chan, Yashar Ganjali, Mohammad Taghi Hajiaghayi, David R. Wood |
Balanced vertex-orderings of graphs. |
Discrete Applied Mathematics |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Therese C. Biedl, Timothy M. Chan |
A note on 3D orthogonal graph drawing. |
Discrete Applied Mathematics |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Timothy M. Chan |
Low-Dimensional Linear Programming with Violations. |
SIAM J. Comput. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Timothy M. Chan |
On levels in arrangements of surfaces in three dimensions. |
SODA |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Timothy M. Chan |
Finding the shortest bottleneck edge in a parametric minimum spanning tree. |
SODA |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Timothy M. Chan, Eric Y. Chen |
Multi-pass geometric algorithms. |
Symposium on Computational Geometry |
2005 |
DBLP DOI BibTeX RDF |
linear programming, convex hulls, streaming algorithms |
| 1 | Eric Y. Chen, Timothy M. Chan |
Space-Efficient Algorithms for Klee's Measure Problem. |
CCCG |
2005 |
DBLP BibTeX RDF |
|
| 1 | Peyman Afshani, Timothy M. Chan |
Approximation Algorithms for Maximum Cliques in 3D Unit-Disk Graphs. |
CCCG |
2005 |
DBLP BibTeX RDF |
|
| 1 | Timothy M. Chan, Abdullah-Al Mahmood |
Approximating the piercing number for unit-height rectangles. |
CCCG |
2005 |
DBLP BibTeX RDF |
|
| 1 | Timothy M. Chan |
All-Pairs Shortest Paths with Real Weights in O(n3/log n) Time. |
WADS |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Timothy M. Chan |
A note on maximum independent sets in rectangle intersection graphs. |
Inf. Process. Lett. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Timothy M. Chan |
Euclidean Bounded-Degree Spanning Tree Ratios. |
Discrete & Computational Geometry |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Timothy M. Chan |
An optimal randomized algorithm for maximum Tukey depth. |
SODA |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | Hervé Brönnimann, Timothy M. Chan, Eric Y. Chen |
Towards in-place geometric algorithms and data structures. |
Symposium on Computational Geometry |
2004 |
DBLP DOI BibTeX RDF |
in-lace algorithms, Voronoi diagrams, convex hulls, range searching |
| 1 | Timothy M. Chan |
Faster core-set constructions and data stream algorithms in fixed dimensions. |
Symposium on Computational Geometry |
2004 |
DBLP DOI BibTeX RDF |
geometric optimization problems, approximation algorithms, data streams |
| 1 | Timothy M. Chan, Bashir S. Sadjad |
Geometric Optimization Problems Over Sliding Windows. |
ISAAC |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Therese C. Biedl, Timothy M. Chan, Alejandro López-Ortiz |
Drawing K2, n: A lower bound. |
Inf. Process. Lett. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Timothy M. Chan |
Polynomial-time approximation schemes for packing and piercing fat objects. |
J. Algorithms |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Timothy M. Chan |
A Fully Dynamic Algorithm for Planar Width. |
Discrete & Computational Geometry |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Timothy M. Chan |
On Levels in Arrangements of Curves. |
Discrete & Computational Geometry |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Timothy M. Chan |
Semi-Online Maintenance of Geometric Optima and Measures. |
SIAM J. Comput. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Timothy M. Chan |
Euclidean bounded-degree spanning tree ratios. |
Symposium on Computational Geometry |
2003 |
DBLP DOI BibTeX RDF |
approximation, minimum spanning trees, discrete geometry |
| 1 | Timothy M. Chan, Alexander Golynski, Alejandro López-Ortiz, Claude-Guy Quimper |
the asteroid surveying problem and other puzzles. |
Symposium on Computational Geometry |
2003 |
DBLP DOI BibTeX RDF |
geometric constants, curves |
| 1 | Eric Y. Chen, Timothy M. Chan |
A Space-Efficient Algorithm for Segment Intersection. |
CCCG |
2003 |
DBLP BibTeX RDF |
|
| 1 | Timothy M. Chan, Alexander Golynski, Alejandro López-Ortiz, Claude-Guy Quimper |
Curves of width one and the river shore problem. |
CCCG |
2003 |
DBLP BibTeX RDF |
|
| 1 | Timothy M. Chan |
On Levels in Arrangements of Curves, II: A Simple Inequality and Its Consequences. |
FOCS |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Therese C. Biedl, Eowyn Cenek, Timothy M. Chan, Erik D. Demaine, Martin L. Demaine, Rudolf Fleischer, Ming-wei Wang |
Balanced k-colorings. |
Discrete Mathematics |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Timothy M. Chan |
A Near-Linear Area Bound for Drawing Binary Trees. |
Algorithmica |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Timothy M. Chan, Michael T. Goodrich, S. Rao Kosaraju, Roberto Tamassia |
Optimizing area and aspect ration in straight-line orthogonal tree drawings. |
Comput. Geom. |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Timothy M. Chan |
Approximating the Diameter, Width, Smallest Enclosing Cylinder, and Minimum-Width Annulus. |
Int. J. Comput. Geometry Appl. |
2002 |
DBLP BibTeX RDF |
|
| 1 | Timothy M. Chan |
Semi-online maintenance of geometric optima and measures. |
SODA |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Timothy M. Chan |
Closest-point problems simplified on the RAM. |
SODA |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP BibTeX RDF |
|
| 1 | Therese C. Biedl, Timothy M. Chan, Alejandro López-Ortiz |
Drawing k2, n: A lower bound. |
CCCG |
2002 |
DBLP BibTeX RDF |
|
| 1 | Timothy M. Chan |
Low-Dimensional Linear Programming with Violations. |
FOCS |
2002 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")