Funder
European Research Council
NKFIH
Nemzeti Kutatási Fejlesztési és Innovációs Hivatal
Subject
Computational Mathematics,Computational Theory and Mathematics,Control and Optimization,Geometry and Topology,Computer Science Applications
Reference18 articles.
1. On topological graphs with at most four crossings per edge;Ackerman;Comput. Geom.,2019
2. A crossing lemma for the pair-crossing number;Ackerman,2014
3. Proofs from the Book;Aigner,2004
4. Crossing-free subgraphs;Ajtai,1982
5. Crossing numbers and combinatorial characterization of monotone drawings of Kn;Balko;Discrete Comput. Geom.,2015