Discrete Applied Mathematics - Combinatorics and complexity
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
Journal of Combinatorial Theory Series A
Which crossing number is it anyway?
Journal of Combinatorial Theory Series B
Journal of Combinatorial Theory Series A
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Lectures on Discrete Geometry
Crossing patterns of semi-algebraic sets
Journal of Combinatorial Theory Series A
A computational approach to Conway's thrackle conjecture
Computational Geometry: Theory and Applications
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 |
A curve γ in the plane is t-monotone if its interior has at most t−1 vertical tangent points. A family of t-monotone curves F is simple if any two members intersect at most once. It is shown that if F is a simple family of nt-monotone curves with at least εn2 intersecting pairs (disjoint pairs), then there exists two subfamilies F1,F2⊂F of size δn each, such that every curve in F1 intersects (is disjoint to) every curve in F2, where δ depends only on ε. We apply these results to find pairwise disjoint edges in simple topological graphs.