Author:
Cygan Marek,Pilipczuk Marcin,Pilipczuk Michał,van Leeuwen Erik Jan,Wrochna Marcin
Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Theoretical Computer Science
Reference28 articles.
1. Beineke, L.W.: Characterizations of derived graphs. J. Comb. Theory 9(2), 129–135 (1970)
2. Bliznets, I., Fomin, F.V., Pilipczuk, M., Pilipczuk, M.: A subexponential parameterized algorithm for proper interval completion. SIAM J. Discrete Math. 29(4), 1961–1987 (2015). doi: 10.1137/140988565
3. Bliznets, I., Fomin, F.V., Pilipczuk, M., Pilipczuk, M.: Subexponential parameterized algorithm for interval completion. In: Krauthgamer, R. (ed.) Proceedings of the 27th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2016, pp. 1116–1131. SIAM, Arlington (2016). doi: 10.1137/1.9781611974331.ch78
4. Brügmann, D., Komusiewicz, C., Moser, H.: On generating triangle-free graphs. Electron. Notes Discrete Math. 32, 51–58 (2009). doi: 10.1016/j.endm.2009.02.008
5. Cai, L.: Fixed-parameter tractability of graph modification problems for hereditary properties. Inf. Process. Lett. 58(4), 171–176 (1996)
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献