Author:
Straub Simon,Thierauf Thomas,Wagner Fabian
Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Theoretical Computer Science
Reference27 articles.
1. Barahona, F.: Balancing signed toroidal graphs in polynomial time. Technical report, University of Chile (1983)
2. Di Battista, G., Tamassia, R.: Incremental planarity testing. In: IEEE Symposium on Foundations of Computer Science (FOCS), pp. 436–441 (1989)
3. Di Battista, G., Tamassia, R.: On-line maintenance of triconnected components with SPQR-trees. Algorithmica 15(4), 302–318 (1996)
4. Cayley, A.: Sur les déterminants gauches. J. Pure Appl. Math. 38, 93–96 (1847)
5. Curticapean, R.: Counting perfect matchings in graphs that exclude a single-crossing minor. arXiv: 1406.4056 (2014)
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献