No. Title Author Year
1 Obstructions for Matroids of Path-Width at most k and Graphs of Linear Rank-Width at most k Kanté, Mamadou Moustapha et al. 2022
2 A Linear Fixed Parameter Tractable Algorithm for Connected Pathwidth Kanté, Mamadou Moustapha et al. 2020
3 Listing Induced Steiner Subgraphs as a Compact Way to Discover Steiner Trees in Graphs Conte, Alessio et al. 2019
4 More Applications of the d-Neighbor Equivalence: Connectivity and Acyclicity Constraints Bergougnoux, Benjamin et al. 2019
5 On Maximal Cliques with Connectivity Constraints in Directed Graphs Conte, Alessio et al. 2017
6 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: 6


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