Discrete Applied Mathematics - Combinatorics and complexity
Quasi-optimal range searching in spaces of finite VC-dimension
Discrete & Computational Geometry - Selected papers from the fourth ACM symposium on computational geometry, Univ. of Illinois, Urbana-Champaign, June 6 8, 1988
Approximation schemes for covering and packing problems in image processing and VLSI
Journal of the ACM (JACM)
Label placement by maximum independent set in rectangles
WADS '97 Selected papers presented at the international workshop on Algorithms and data structure
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Coloring kk-free intersection graphs of geometric objects in the plane
Proceedings of the twenty-fourth annual symposium on Computational geometry
Computing the independence number of intersection graphs
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Disjoint edges in topological graphs
IJCCGGT'03 Proceedings of the 2003 Indonesia-Japan joint conference on Combinatorial Geometry and Graph Theory
Topological graphs: empty triangles and disjoint matchings
Proceedings of the twenty-ninth annual symposium on Computational geometry
| Hi-index | 0.00 |
It is shown that every complete $n$-vertex simple topological graph has at least Ω(n1/3) pairwise disjoint edges, and these edges can be found in polynomial time. This proves a conjecture of Pach and Toth, which appears as problem 5 from chapter 9.5 in Research Problems in Discrete Geometry by Brass, Moser, and Pach.