Author:
Pach János,Tardos Gábor,Tóth Géza
Funder
NKFIH
Nemzeti Kutatási Fejlesztési és Innovációs Hivatal
ERC
European Research Council
Ministry of Education and Science of the Russian Federation
Austrian Science Fund
Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference24 articles.
1. On topological graphs with at most four crossings per edge;Ackerman;Comput. Geom.,2019
2. Crossing-free subgraphs;Ajtai,1982
3. Counting curve types;Aougab;Am. J. Math.,2018
4. Improved bounds for planar k-sets and related problems;Dey;Discrete Comput. Geom.,1998
5. A combinatorial problem in geometry;Erdős;Compos. Math.,1935