Stabbing pairwise intersecting disks by five points-Reference-Cited by-同舟云学术

Stabbing pairwise intersecting disks by five points

Published:2021-07 Issue:7 Volume:344 Page:112403
ISSN:0012-365X
Container-title:Discrete Mathematics
language:en
Short-container-title:Discrete Mathematics

Author:

Har-Peled Sariel^ORCID,Kaplan Haim,Mulzer Wolfgang,Roditty Liam,Seiferth Paul,Sharir Micha^ORCID,Willert Max

Funder

German Israeli Foundation for Scientific Research and Development

Israeli Centers for Research Excellence

European Research Council

Israel Science Foundation

German Research Foundation

National Science Foundation

Blavatnik Family Foundation

Publisher

Elsevier BV

Subject

Discrete Mathematics and Combinatorics,Theoretical Computer Science

Reference22 articles.

1. Piercing convex sets and the Hadwiger-Debrunner (p,q)-problem;Alon;Adv. Math.,1992

2. The clique problem in intersection graphs of ellipses and triangles;Ambühl;Theory Comput. Syst.,2005

3. M. Bonamy, E. Bonnet, N. Bousquet, P. Charbit, S. Thomassé, EPTAS for max clique on disks and unit balls, in: Proc. 59th Annu. IEEE Sympos. Found. Comput. Sci. (FOCS), 2018, pp. 568–579.

4. Stabbing pairwise intersecting disks by four points;Carmi,2018

5. T.M. Chan, An optimal randomized algorithm for maximum Tukey depth, in: Proc. 15th Annu. ACM-SIAM Sympos. Discrete Algorithms (SODA), 2004, pp. 430–436.

Cited by 6 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Algorithms and Turing Kernels for Detecting and Counting Small Patterns in Unit Disk Graphs;Lecture Notes in Computer Science;2024

2. Stabbing Pairwise Intersecting Disks by Four Points;Discrete & Computational Geometry;2023-10-05

3. Simple linear time algorithms for piercing pairwise intersecting disks;Computational Geometry;2023-10

4. Piercing pairwise intersecting geodesic disks by five points;Computational Geometry;2023-02

5. Piercing Diametral Disks Induced by Edges of Maximum Spanning Trees;WALCOM: Algorithms and Computation;2023