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 Efficient Enumeration of Dominating Sets for Sparse Graphs Kurita, Kazuhiro et al. 2018
3 On Maximal Cliques with Connectivity Constraints in Directed Graphs Conte, Alessio et al. 2017
4 Approximation and Hardness of Token Swapping Miltzow, Tillmann et al. 2016
Current Page :
Number of result pages: 1
Number of documents: 4


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