Author:
Angelini Patrizio,Di Battista Giuseppe,Frati Fabrizio,Patrignani Maurizio,Rutter Ignaz
Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference20 articles.
1. P. Angelini, G. Di Battista, F. Frati, V. Jelínek, J. Kratochvíl, M. Patrignani, I. Rutter, Testing planarity of partially embedded graphs, in: Symposium on Discrete Algorithms (SODAʼ10), 2010, pp. 202–221.
2. On a tree and a path with no geometric simultaneous embedding;Angelini,2011
3. A linear-time algorithm for testing the truth of certain quantified boolean formulas;Aspvall;Information Processing Letters,1979
4. On simultaneous planar graph embeddings;Braß;Computational Geometry,2007
5. On-line maintenance of triconnected components with SPQR-trees;Di Battista;Algorithmica,1996
Cited by
33 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献