No. Title Author Year
1 Listing Induced Steiner Subgraphs as a Compact Way to Discover Steiner Trees in Graphs Conte, Alessio et al. 2019
2 More Applications of the d-Neighbor Equivalence: Connectivity and Acyclicity Constraints Bergougnoux, Benjamin et al. 2019
3 Enumerating Minimal Transversals of Hypergraphs without Small Holes Kanté, Mamadou M. et al. 2018
4 On Maximal Cliques with Connectivity Constraints in Directed Graphs Conte, Alessio et al. 2017
5 An FPT Algorithm and a Polynomial Kernel for Linear Rankwidth-1 Vertex Deletion Kanté, Mamadou Moustapha et al. 2015
Current Page :
Number of result pages: 1
Number of documents: 5


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI