Author:
Hong Seok-Hee,Nagamochi Hiroshi
Funder
ARC (Australian Research Council)
ARC
Subject
Applied Mathematics,Discrete Mathematics and Combinatorics
Reference28 articles.
1. On the maximum number of edges in topological graphs with no four pairwise crossing edges;Ackerman;Discrete Comput. Geom.,2009
2. Quasi-planar graphs have a linear number of edges;Agarwal;Combinatorica,1997
3. The straight-line RAC drawing problem is NP-hard;Argyriou;J. Graph Algorithms Appl.,2012
4. M.J. Bannister, S. Cabello, D. Eppstein, Parameterized complexity of 1-planarity, in: Proc. of WADS 2013, 2013, pp. 97–108.
5. M.A. Bekos, S. Cornelsen, L. Grilli, S. Hong, M. Kaufmann, On the recognition of fan-planar and maximal outer-fan-planar graphs, in: Proc. of Graph Drawing 2014, 2015, pp. 198–209.
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献