Author:
Rextin Aimal,Healy Patrick
Publisher
Springer Berlin Heidelberg
Reference14 articles.
1. Lecture Notes in Computer Science;S. Abbasi,2009
2. Bertolazzi, P., Battista, G.D., Liotta, G., Mannino, C.: Upward drawings of triconnected digraphs. Algorithmica 12(6), 476–497 (1994)
3. 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)
4. Binucci, C., Didimo, W., Giordano, F.: On the complexity of finding maximum upward planar subgraph of an embedded planar digraph. Technical Report RT001-07, University of Perugia (Febuary 2007)
5. Lecture Notes in Computer Science;C. Binucci,2008