Author:
Lokshtanov Daniel,Mouawad Amer E.,Panolan Fahad,Ramanujan M. S.,Saurabh Saket
Publisher
Springer International Publishing
Reference28 articles.
1. Alon, N., Gutner, S.: Linear time algorithms for finding a dominating set of fixed size in degenerated graphs. Algorithmica 54(4), 544–556 (2009)
2. Bonsma, P.: Rerouting shortest paths in planar graphs. In: Proceedings of the 32nd Annual Conference on Foundations of Software Technology and Theoretical Computer Science, pp. 337–349 (2012)
3. Bose, P., Hurtado, F.: Flips in planar graphs. Computational Geometry 42(1), 60–80 (2009)
4. Cereceda, L., van den Heuvel, J., Johnson, M.: Finding paths between 3-colorings. Journal of Graph Theory 67(1), 69–82 (2011)
5. Cleary, S., John, K.S.: Rotation distance is fixed-parameter tractable. Information Processing Letters 109(16), 918–922 (2009)
Cited by
15 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献