Subject
Computational Mathematics,Computational Theory and Mathematics,Control and Optimization,Geometry and Topology,Computer Science Applications
Reference46 articles.
1. An experimental study of a 1-planarity testing and embedding algorithm;Binucci,2020
2. Diameter and treewidth in minor-closed graph families;Eppstein;Algorithmica,2000
3. Crossing patterns in nonplanar road networks;Eppstein,2017
4. Listing all maximal cliques in large sparse real-world graphs;Eppstein;ACM J. Exp. Algorithmics,2013
5. Algorithms for graphs embeddable with few crossings per edge;Grigoriev;Algorithmica,2007