Funder
Swiss National Science Foundation
ESF Eurogiga
NSERC
NSF
Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference27 articles.
1. Small point sets for simply-nested planar graphs;Angelini,2012
2. Superpatterns and universal point sets;Bannister,2013
3. Small drawings of outerplanar graphs, series-parallel graphs, and other planar graphs;Biedl;Discrete Comput. Geom.,2011
4. The point-set embeddability problem for plane graphs;Biedl;Int. J. Comput. Geom. Appl.,2013
5. On embedding an outer-planar graph in a point set;Bose;Comput. Geom.,2002
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Universal geometric graphs;Combinatorics, Probability and Computing;2023-05-15
2. Universal Geometric Graphs;Graph-Theoretic Concepts in Computer Science;2020
3. On Point Set Embeddings for k-Planar Graphs with Few Bends per Edge;SOFSEM 2019: Theory and Practice of Computer Science;2019
4. A Note on Universal Point Sets for Planar Graphs;Lecture Notes in Computer Science;2019
5. Small Universal Point Sets for k-Outerplanar Graphs;Discrete & Computational Geometry;2018-05-29