Author:
Lokshtanov Daniel,Saurabh Saket,Zehavi Meirav
Publisher
Springer International Publishing
Reference61 articles.
1. Adler, I.: List of open problems. In: 6th Workshop on Graph Classes, Optimization, and Width Parameters (2013). http://www.cs.upc.edu/~sedthilk/grow/Open_Problems_GROW_2013.pdf
2. Adler, I., Dorn, F., Fomin, F.V., Sau, I., Thilikos, D.M.: Faster parameterized algorithms for minor containment. Theor. Comput. Sci. 412(50), 7018–7028 (2011). https://doi.org/10.1016/j.tcs.2011.09.015
3. Adler, I., Dorn, F., Fomin, F.V., Sau, I., Thilikos, D.M.: Fast minor testing in planar graphs. Algorithmica 64(1), 69–84 (2012). https://doi.org/10.1007/s00453-011-9563-9
4. Lecture Notes in Computer Science;I Adler,2011
5. Adler, I., Kolliopoulos, S.G., Krause, P.K., Lokshtanov, D., Saurabh, S., Thilikos, D.M.: Irrelevant vertices for the planar disjoint paths problem. J. Comb. Theory Ser. B 122, 815–843 (2017). https://doi.org/10.1016/j.jctb.2016.10.001
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Planar Disjoint Paths, Treewidth, and Kernels;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06