×

Found 157 Documents (Results 1–100)

Newest Citations Relevance
Chan, Timothy M.

Minimum \(L_\infty\) Hausdorff distance of point sets under translation: g eneralizing Klee’s measure problem. (English) Zbl 07927881

Chambers, Erin W. (ed.) et al., 39th international symposium on computational geometry, SoCG 2023, Dallas, Texas, USA, June 12–15, 2023. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 258, Article 24, 13 p. (2023).
MSC:  68U05
Cite Review PDF
Full Text: DOI arXiv
Chan, Timothy M.; Huang, Zhengcheng

Constant-hop spanners for more geometric intersection graphs, with even smaller size. (English) Zbl 07927880

Chambers, Erin W. (ed.) et al., 39th international symposium on computational geometry, SoCG 2023, Dallas, Texas, USA, June 12–15, 2023. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 258, Article 23, 16 p. (2023).
MSC:  68U05
Cite Review PDF
Full Text: DOI arXiv
Chan, Timothy M.; Zheng, Da Wei

Simplex range searching revisited: how to shave logs in multi-level data structures. (English) Zbl 07848014

Bansal, Nikhil (ed.) et al., Proceedings of the 34th annual ACM-SIAM symposium on discrete algorithms, SODA 2023, Florence, Italy, January 22–25, 2023. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 1493-1511 (2023).
MSC:  68Wxx
Cite Review PDF
Full Text: DOI arXiv
Chan, Timothy M.; Har-Peled, Sariel

On the number of incidences when avoiding an induced biclique in geometric settings. (English) Zbl 07848010

Bansal, Nikhil (ed.) et al., Proceedings of the 34th annual ACM-SIAM symposium on discrete algorithms, SODA 2023, Florence, Italy, January 22–25, 2023. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 1398-1413 (2023).
MSC:  68Wxx
Cite Review PDF
Full Text: DOI arXiv
Chan, Timothy M.; He, Qizheng; Suri, Subhash; Xue, Jie

Dynamic geometric set cover, revisited. (English) Zbl 07883720

Naor, Joseph (Seffi) (ed.) et al., Proceedings of the 33rd annual ACM-SIAM symposium on discrete algorithms, SODA 2022, Alexandria, VA, USA, both virtually and physically, January 9–12, 2022. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 3496-3528 (2021).
MSC:  68U05 68P05
Cite Review PDF
Full Text: DOI arXiv
Chan, Timothy M.

Near-optimal randomized algorithms for selection in totally monotone matrices. (English) Zbl 07788427

Marx, Dániel (ed.), Proceedings of the 32nd annual ACM-SIAM symposium on discrete algorithms, SODA 2021, Alexandria, VA, USA, virtual, January 10–13, 2021. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 1483-1495 (2021).
MSC:  68Wxx
Cite Review PDF
Full Text: DOI
Chan, Timothy M.

(Near-)linear-time randomized algorithms for row minima in Monge partial matrices and related problems. (English) Zbl 07788426

Marx, Dániel (ed.), Proceedings of the 32nd annual ACM-SIAM symposium on discrete algorithms, SODA 2021, Alexandria, VA, USA, virtual, January 10–13, 2021. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 1465-1482 (2021).
MSC:  68Wxx
Cite Review PDF
Full Text: DOI
Chan, Timothy M.; He, Qizheng; Nekrich, Yakov

Further results on colored range searching. (English) Zbl 07760157

Cabello, Sergio (ed.) et al., 36th international symposium on computational geometry, SoCG 2020, Zürich, Switzerland (virtual conference), June 23–26, 2020. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 164, Article 28, 15 p. (2020).
MSC:  68Q87 68U05
Cite Review PDF
Full Text: DOI arXiv
Chan, Timothy M.; He, Qizheng

Faster approximation algorithms for geometric set cover. (English) Zbl 1533.68354

Cabello, Sergio (ed.) et al., 36th international symposium on computational geometry, SoCG 2020, Zürich, Switzerland (virtual conference), June 23–26, 2020. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 164, Article 27, 14 p. (2020).
MSC:  68U05 68P05 68W20 68W25
Cite Review PDF
Full Text: DOI arXiv
Chan, Timothy M.; Har-Peled, Sariel; Jones, Mitchell

On locality-sensitive orderings and their applications. (English) Zbl 1542.68248

Blum, Avrim (ed.), 10th innovations in theoretical computer science conference, ITCS 2019, January 10–12, 2019, San Diego, CA, USA. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 124, Article 21, 17 p. (2019).
MSC:  68W25 68P05 68U05
Cite Review PDF
Full Text: DOI
Chan, Timothy M.; van Dijk, Thomas C.; Fleszar, Krzysztof; Spoerhase, Joachim; Wolff, Alexander

Stabbing rectangles by line segments – how decomposition reduces the shallow-cell complexity. (English) Zbl 1533.68355

Hsu, Wen-Lian (ed.) et al., 29th international symposium on algorithms and computation, ISAAC 2018, December 16–19, 2018, Jiaoxi, Yilan, Taiwan. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 123, Article 61, 13 p. (2018).
MSC:  68U05 68W25
Cite Review PDF
Full Text: DOI arXiv
Chan, Timothy M.; Nekrich, Yakov; Rahul, Saladi; Tsakalidis, Konstantinos

Orthogonal point location and rectangle stabbing queries in 3-d. (English) Zbl 1502.68091

Chatzigiannakis, Ioannis (ed.) et al., 45th international colloquium on automata, languages, and programming. ICALP 2018, Prague, Czech Republic, July 9–13, 2018. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 107, Article 31, 14 p. (2018).
MSC:  68P05 68U05
Cite Review PDF
Full Text: DOI arXiv
Chan, Timothy M.; Skrepetos, Dimitrios

Approximate shortest paths and distance oracles in weighted unit-disk graphs. (English) Zbl 1489.68185

Speckmann, Bettina (ed.) et al., 34th international symposium on computational geometry, SoCG 2018, June 11–14, 2018, Budapest, Hungary. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 99, Article 24, 13 p. (2018).
MSC:  68R10 05C10 05C62 68U05 68W25
Cite Review PDF
Full Text: DOI
Chan, Timothy M.

Tree drawings revisited. (English) Zbl 1489.68184

Speckmann, Bettina (ed.) et al., 34th international symposium on computational geometry, SoCG 2018, June 11–14, 2018, Budapest, Hungary. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 99, Article 23, 15 p. (2018).
MSC:  68R10
Cite Review PDF
Full Text: DOI
Cardinal, Jean; Chan, Timothy M.; Iacono, John; Langerman, Stefan; Ooms, Aurélien

Subquadratic encodings for point configurations. (English) Zbl 1489.68058

Speckmann, Bettina (ed.) et al., 34th international symposium on computational geometry, SoCG 2018, June 11–14, 2018, Budapest, Hungary. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 99, Article 20, 14 p. (2018).
MSC:  68P05 68U05
Cite Review PDF
Full Text: DOI
Biedl, Therese; Chan, Timothy M.; Derka, Martin; Jain, Kshitij; Lubiw, Anna

Improved bounds for drawing trees on fixed points with L-shaped edges. (English) Zbl 1503.68207

Frati, Fabrizio (ed.) et al., Graph drawing and network visualization. 25th international symposium, GD 2017, Boston, MA, USA, September 25–27, 2017. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 10692, 305-317 (2018).
MSC:  68R10 05C05 68U05
Cite Review PDF
Full Text: DOI arXiv
Chan, Timothy M.

More logarithmic-factor speedups for 3SUM, (median,+)-convolution, and some geometric 3SUM-hard problems. (English) Zbl 1403.68378

Czumaj, Artur (ed.), Proceedings of the 29th annual ACM-SIAM symposium on discrete algorithms, SODA 2018, New Orleans, LA, USA, January 7–10, 2018. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-61197-503-1/ebook). 881-897 (2018).
MSC:  68W40 68U05
Cite Review PDF
Full Text: Link
Chan, Timothy M.

Orthogonal range searching in moderate dimensions: \(k\)-\(d\) trees and range trees strike back. (English) Zbl 1433.68484

Aronov, Boris (ed.) et al., 33rd international symposium on computational geometry. SoCG 2017, Brisbane, Australia, July 4–7, 2017. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 77, Article 27, 15 p. (2017).
MSC:  68U05 68P05
Cite Review PDF
Full Text: DOI
Chan, Timothy M.

Applications of Chebyshev polynomials to low-dimensional computational geometry. (English) Zbl 1417.68232

Aronov, Boris (ed.) et al., 33rd international symposium on computational geometry. SoCG 2017, Brisbane, Australia, July 4–7, 2017. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 77, Article 26, 15 p. (2017).
MSC:  68U05 68P05 68W25
Cite Review PDF
Full Text: DOI
Biedl, Therese; Chan, Timothy M.; Lee, Stephanie; Mehrabi, Saeed; Montecchiani, Fabrizio; Vosoughpour, Hamideh

On guarding orthogonal polygons with sliding cameras. (English) Zbl 1485.68262

Poon, Sheung-Hung (ed.) et al., WALCOM: algorithms and computation. 11th international conference and workshops, WALCOM 2017, Hsinchu, Taiwan, March 29–31, 2017. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 10167, 54-65 (2017).
MSC:  68U05 68Q25
Cite Review PDF
Full Text: DOI arXiv
Chan, Timothy M.; Skrepetos, Dimitrios

All-pairs shortest paths in unit-disk graphs in slightly subquadratic time. (English) Zbl 1398.05074

Seok-Hee Hong (ed.), 27th international symposium on algorithms and computation, ISAAC 2016, Sydney, Australia, December 12–14, 2016. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-026-2). LIPIcs – Leibniz International Proceedings in Informatics 64, Article 24, 13 p. (2016).
MSC:  05C12 05C38 68Q25
Cite Review PDF
Full Text: DOI
Chan, Timothy M.; Pratt, Simon

Two approaches to building time-windowed geometric data structures. (English) Zbl 1387.68080

Fekete, Sándor (ed.) et al., 32nd international symposium on computational geometry, SoCG’16, Boston, MA, USA, June 14–17, 2016. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-009-5). LIPIcs – Leibniz International Proceedings in Informatics 51, Article 28, 15 p. (2016).
MSC:  68P05 68U05
Cite Review PDF
Full Text: DOI
Chan, Timothy M.

Dynamic streaming algorithms for \(\varepsilon\)-kernels. (English) Zbl 1388.68283

Fekete, Sándor (ed.) et al., 32nd international symposium on computational geometry, SoCG’16, Boston, MA, USA, June 14–17, 2016. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-009-5). LIPIcs – Leibniz International Proceedings in Informatics 51, Article 27, 11 p. (2016).
MSC:  68U05 68W20 68W25
Cite Review PDF
Full Text: DOI
Chan, Timothy M.; Rahmati, Zahed

A clustering-based approach to kinetic closest pair. (English) Zbl 1378.68029

Pagh, Rasmus (ed.), 15th Scandinavian symposium and workshops on algorithm theory, SWAT 2016, Reykjavik, Iceland, June 22–24, 2016. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-011-8). LIPIcs – Leibniz International Proceedings in Informatics 53, Article 28, 13 p. (2016).
MSC:  68P05 68U05
Cite Review PDF
Full Text: DOI
Chan, Timothy M.

A simpler linear-time algorithm for intersecting two convex polyhedra in three dimensions. (English) Zbl 1378.68164

Arge, Lars (ed.) et al., 31st international symposium on computational geometry, SoCG’15, Eindhoven, Netherlands, June 22–25, 2015. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-83-5). LIPIcs – Leibniz International Proceedings in Informatics 34, 733-738 (2015).
MSC:  68U05 52B55
Cite Review PDF
Full Text: DOI
Chan, Timothy M.; Tsakalidis, Konstantinos

Optimal deterministic algorithms for 2-d and 3-d shallow cuttings. (English) Zbl 1378.68165

Arge, Lars (ed.) et al., 31st international symposium on computational geometry, SoCG’15, Eindhoven, Netherlands, June 22–25, 2015. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-83-5). LIPIcs – Leibniz International Proceedings in Informatics 34, 719-732 (2015).
MSC:  68U05 52C30 68Q25
Cite Review PDF
Full Text: DOI
Arya, Sunil; Chan, Timothy M.

Better \(\varepsilon\)-dependencies for offline approximate nearest neighbor search, Euclidean minimum spanning trees, and \(\varepsilon\)-kernels. (English) Zbl 1395.68278

Proceedings of the 30th annual symposium on computational geometry, SoCG ’14, Kyoto, Japan, June 8–11, 2014. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-2594-3). 416-425 (2014).
MSC:  68U05 68W20 68W25 68W40
Cite Review PDF
Full Text: DOI
Alamdari, Soroush; Angelini, Patrizio; Chan, Timothy M.; Di Battista, Giuseppe; Frati, Fabrizio; Lubiw, Anna; Patrignani, Maurizio; Roselli, Vincenzo; Singla, Sahil; Wilkinson, Bryan T.

Morphing planar graph drawings with a polynomial number of steps. (English) Zbl 1422.68177

Khanna, Sanjeev (ed.), Proceedings of the 24th annual ACM-SIAM symposium on discrete algorithms, SODA 2013, New Orleans, LA, USA, January 6–8, 2013. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 1656-1667 (2013).
MSC:  68R10 05C10 05C62 05C85 68U05
Cite Review PDF
Full Text: DOI Link
Chan, Timothy M.; Wilkinson, Bryan T.

Adaptive and approximate orthogonal range counting. (English) Zbl 1421.68018

Khanna, Sanjeev (ed.), Proceedings of the 24th annual ACM-SIAM symposium on discrete algorithms, SODA 2013, New Orleans, LA, USA, January 6–8, 2013. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 241-251 (2013).
MSC:  68P05 68Q25 68U05
Cite Review PDF
Full Text: DOI Link
Chan, Timothy M.; Hoffmann, Hella-Franziska; Kiazyk, Stephen; Lubiw, Anna

Minimum length embedding of planar graphs at fixed vertex locations. (English) Zbl 1406.68069

Wismath, Stephen (ed.) et al., Graph drawing. 21st international symposium, GD 2013, Bordeaux, France, September 23–25, 2013. Revised selected papers. Berlin: Springer (ISBN 978-3-319-03840-7/pbk). Lecture Notes in Computer Science 8242, 376-387 (2013).
MSC:  68R10 05C10 68U05 68W25
Cite Review PDF
Full Text: DOI
Alamdari, Soroush; Chan, Timothy M.; Grant, Elyot; Lubiw, Anna; Pathak, Vinayak

Self-approaching graphs. (English) Zbl 1377.68158

Didimo, Walter (ed.) et al., Graph drawing. 20th international symposium, GD 2012, Redmond, WA, USA, September 19–21, 2012. Revised selected papers. Berlin: Springer (ISBN 978-3-642-36762-5/pbk). Lecture Notes in Computer Science 7704, 260-271 (2013).
MSC:  68R10 05C62 05C85 68Q25 68U05
Cite Review PDF
Full Text: DOI arXiv
Chan, Timothy M.; Grant, Elyot; Könemann, Jochen; Sharpe, Malcolm

Weighted capacitated, priority, and geometric set cover via improved quasi-uniform sampling. (English) Zbl 1421.68198

Rabani, Yuval (ed.), Proceedings of the 23rd annual ACM-SIAM symposium on discrete algorithms, SODA 2012, Kyoto, Japan, January 17–19, 2012. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 1576-1585 (2012).
MSC:  68W25 68W20 90C27 90C59
Cite Review PDF
Full Text: Link
Chan, Timothy M.

Persistent predecessor search and orthogonal point location on the word RAM. (English) Zbl 1373.68192

Randall, Dana (ed.), Proceedings of the 22nd annual ACM-SIAM symposium on discrete algorithms, SODA 2011, San Francisco, CA, USA, January 23–25, 2011. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 1131-1145 (2011).
MSC:  68P05 68P10 68Q25 68U05
Cite Review PDF
Full Text: Link
Afshani, Peyman; Chan, Timothy M.

Optimal halfspace range reporting in three dimensions. (English) Zbl 1422.68230

Mathieu, Claire (ed.), Proceedings of the 20th annual ACM-SIAM symposium on discrete algorithms, SODA 2009, New York, NY, USA, January 4–6, 2009. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 180-186 (2009).
MSC:  68U05 68P05 68Q25
Cite Review PDF
Full Text: Link

Filter Results by …

Access

Document Type

all top 5

Author

all top 5

Serial

all top 5

Year of Publication

all top 3

Main Field

Software