  |
Items where Author is "Rubin, Natan"
Group by: Item Type | No Grouping Jump to: Article | Book Section Number of items: 5. ArticlePach, János and Rubin, Natan and Tardos, Gábor (2021) Planar Point Sets Determine Many Pairwise Crossing Segments. ADVANCES IN MATHEMATICS. pp. 1-17. ISSN 0001-8708 (print); 1090-2082 (online) Pach, János and Rubin, Natan and Tardos, Gábor (2018) A Crossing Lemma for Jordan curves. ADVANCES IN MATHEMATICS, 331. pp. 908-940. ISSN 0001-8708 Pach, János and Rubin, Natan and Tardos, Gábor (2016) On the Richter-Thomassen Conjecture about Pairwise Intersecting Closed Curves. COMBINATORICS PROBABILITY & COMPUTING, 25 (6). pp. 941-958. ISSN 0963-5483 Book SectionPach, János and Rubin, Natan and Tardos, Gábor (2019) Planar point sets determine many pairwise crossing segments. In: STOC 2019 Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing. Association for Computing Machinery (ACM), New York, pp. 1158-1166. ISBN 9781450367059 Pach, János and Rubin, Natan and Tardos, Gábor (2016) Beyond the Richter-Thomassen conjecture. In: 27th Annual ACM-SIAM Symposium on Discrete Algorithms. Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms (3). Association for Computing Machinery, Red Hook NY, pp. 957-968. ISBN 978-1-5108-1967-2 |
