Author:
Auer Christopher,Bachmaier Christian,Brandenburg Franz J.,Hanauer Kathrin
Publisher
Springer Berlin Heidelberg
Reference23 articles.
1. Lecture Notes in Computer Science;C. Auer,2012
2. Lecture Notes in Computer Science;C. Auer,2011
3. Bachmaier, C., Brandenburg, F.J., Brunner, W., Fülöp, R.: Drawing recurrent hierarchies. J. Graph Alg. App. 16(2), 151–198 (2012)
4. Bang-Jensen, J., Gutin, G.: Digraphs: Theory, Algorithms and Applications, 1st edn. Springer (2000)
5. Bertolazzi, P., Battista, G.D., Mannino, C., Tamassia, R.: Optimal upward planarity testing of single-source digraphs. SIAM J. Comput. 27(1), 132–169 (1998)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. A Characterization of Horoidal Digraphs;Topics in Theoretical Computer Science;2017
2. Upward planar graphs and their duals;Theoretical Computer Science;2015-03