A. Aazami, J. Cheriyan, and K. R. Jampani, Approximation Algorithms and Hardness Results for Packing Element-Disjoint Steiner Trees in Planar Graphs, Algorithmica, vol.63, issue.1-2, pp.425-456, 2012.

, 24th International Symposium, pp.144-160, 2017.

N. Derhy and C. Picouleau, Finding induced trees, Discrete Applied Mathematics, vol.157, issue.17, pp.3552-3557, 2009.
URL : https://hal.archives-ouvertes.fr/hal-01125590

, Graph Theory, vol.173, 2012.

, DIMACS. 11th DIMACS Implementation Challenge, 2014.

C. Mitre, R. A. Dourado, F. Oliveira, and . Protti, Algorithmic aspects of Steiner convexity and enumeration of Steiner trees, Annals of Operations Research, vol.223, issue.1, pp.155-171, 2014.

T. Eiter, K. Makino, and G. Gottlob, Computational Aspects of Monotone Dualization: A Brief Survey, Discrete Appl. Math, vol.156, issue.11, pp.2035-2049, 2008.

S. Guha and S. Khuller, Improved Methods for Approximating Node Weighted Steiner Trees and Connected Dominating Sets. Information and Computation, vol.150, pp.57-74, 1999.

M. Hauptmann and M. Karpinski, A Compendium on Steiner Tree Problems, 2018.

D. Hoshika and E. Miyano, Approximation Algorithms for Packing Element-Disjoint Steiner Trees on Bounded Terminal Nodes, IEICE Transactions, issue.6, pp.1059-1066, 2016.

J. Hu, X. Wu, R. Cheng, S. Luo, and Y. Fang, On Minimal Steiner Maximum-Connected Subgraph Queries, IEEE Trans. Knowl. Data Eng, vol.29, issue.11, pp.2455-2469, 2017.

L. Khachiyan, E. Boros, K. Elbassioni, V. Gurvich, and K. Makino, On the Complexity of Some Enumeration Problems for Matroids, SIAM Journal on Discrete Mathematics, vol.19, issue.4, pp.966-984, 2005.

, The parametrized Algorithms and Computational Experiments Challenge, 2018.

J. , A. Telle, and Y. Villanger, Connecting Terminals and 2-Disjoint Connected Subgraphs, Graph-Theoretic Concepts in Computer Science, pp.418-428, 2013.

T. Uno, An Output Linear Time Algorithm for Enumerating Chordless Cycles, IPSJ SIG Notes, issue.110, pp.47-53, 2003.