The $$\varepsilon $$-t-Net Problem-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

The $$\varepsilon $$-t-Net Problem

Published:2022-03-07 Issue:2 Volume:68 Page:618-644
ISSN:0179-5376
Container-title:Discrete & Computational Geometry
language:en
Short-container-title:Discrete Comput Geom

Author:

Alon Noga,Jartoux Bruno^ORCID,Keller Chaya,Smorodinsky Shakhar,Yuditsky Yelena

Funder

National Science Foundation

Israel Science Foundation

German-Israeli Foundation for Scientific Research and Development

Simons Foundation

European Research Council

Publisher

Springer Science and Business Media LLC

Subject

Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Geometry and Topology,Theoretical Computer Science

Link

https://link.springer.com/content/pdf/10.1007/s00454-022-00376-x.pdf

Reference49 articles.

1. Ackerman, E., Keszegh, B., Pálvölgyi, D.: Coloring Delaunay-edges and their generalizations. Comput. Geom. 96, # 101745 (2021)

2. Ackerman, E., Pinchasi, R.: On coloring points with respect to rectangles. J. Combin. Theory Ser. A 120(4), 811–815 (2013)

3. Agarwal, P.K., Pach, J., Sharir, M.: State of the union (of geometric objects). In: Surveys on Discrete and Computational Geometry (Snowbird 2006). Contemp. Math., vol. 453, pp. 9–48. American Mathematical Society, Providence (2008)

4. Alon, N., Brightwell, G., Kierstead, H.A., Kostochka, A.V., Winkler, P.: Dominating sets in $$k$$-majority tournaments. J. Combin. Theory Ser. B 96(3), 374–387 (2006)

5. Aronov, B., Donakonda, A., Ezra, E., Pinchasi, R.: On pseudo-disk hypergraphs. Comput. Geom. 92, # 101687 (2021)

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP