Author:
Blin Guillaume,Fertin Guillaume,Rusu Irena,Sinoquet Christine
Publisher
Springer Berlin Heidelberg
Reference7 articles.
1. Bernhart, F., Kainen, P.C.: The book thickness of a graph. Journal of Combinatorial Theory, Series B 27(3), 320–331 (1979)
2. Biedl, T., Kant, G., Kaufmann, M.: On triangulating planar graphs under the four-connectivity constraint. Algorithmica 19, 427–446 (1997)
3. Lecture Notes in Computer Science;G. Blin,2006
4. Evans, P.A.: Algorithms and Complexity for Annotated Sequence Analysis. PhD thesis, University of Victoria (1999)
5. Lecture Notes in Computer Science;G.H. Lin,2001
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献