Author:
Dallard Clément,Milanič Martin,Štorgel Kenny
Publisher
Springer International Publishing
Reference49 articles.
1. Belmonte, R., Otachi, Y., Schweitzer, P.: Induced minor free graphs: isomorphism and clique-width. Algorithmica 80(1), 29–47 (2016). https://doi.org/10.1007/s00453-016-0234-8
2. Błasiok, J., Kamiński, M., Raymond, J.F., Trunck, T.: Induced minors and well-quasi-ordering. J. Comb. Theor. Ser. B 134, 110–142 (2019). https://doi.org/10.1016/j.jctb.2018.05.005
3. Bodlaender, H., Gustedt, J., Telle, J.A.: Linear-time register allocation for a fixed number of registers. In: Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, San Francisco, CA, pp. 574–583. ACM, New York (1998)
4. Bodlaender, H.L.: A linear-time algorithm for finding tree-decompositions of small treewidth. SIAM J. Comput. 25(6), 1305–1317 (1996). https://doi.org/10.1137/S0097539793251219
5. Bodlaender, H.L., Ono, H., Otachi, Y.: Degree-constrained orientation of maximum satisfaction: graph classes and parameterized complexity. In: 27th International Symposium on Algorithms and Computation, LIPIcs. LeibnizInt. Proc. Inform., vol. 64, pp. Art. No. 20, 12. Schloss Dagstuhl. Leibniz-Zent. Inform., Wadern (2016). https://doi.org/10.1007/s00453-017-0399-9
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献