Author:
Akhoondian Amiri Saeed,Golshani Ali,Kreutzer Stephan,Siebertz Sebastian
Publisher
Springer International Publishing
Reference21 articles.
1. Bang-Jensen, J., Gutin, G.Z.: Digraphs - Theory, Algorithms and Applications, 2nd edn. Springer (2010)
2. Battista, G.D., Eades, P., Tamassia, R., Tollis, I.G.: Graph Drawing: Algorithms for the Visualization of Graphs. Prentice-Hall (1999)
3. Bertolazzi, P., Di Battista, G., Liotta, G., Mannino, C.: Upward drawings of triconnected digraphs. Algorithmica 12(6), 476–497 (1994)
4. Bertolazzi, P., Di Battista, G., Mannino, C., Tamassia, R.: Optimal upward planarity testing of single-source digraphs. SIAM J. Comput. 27(1), 132–169 (1998)
5. Cygan, M., Marx, D., Pilipczuk, M., Pilipczuk, M.: The planar directed k-vertex-disjoint paths problem is fixed-parameter tractable. In: 2013 IEEE 54th Annual Symposium on Foundations of Computer Science, pp. 197–206 (2013)
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Walking Through Waypoints;Algorithmica;2020-01-20
2. Routing with congestion in acyclic digraphs;Information Processing Letters;2019-11
3. Walking Through Waypoints;LATIN 2018: Theoretical Informatics;2018