No. Title Author Year
1 Finding a Small Number of Colourful Components Bulteau, Laurent et al. 2019
2 On the Maximum Colorful Arborescence Problem and Color Hierarchy Graph Structure Fertin, Guillaume et al. 2018
3 Beyond Adjacency Maximization: Scaffold Filling for New String Distances Bulteau, Laurent et al. 2017
4 Graph Motif Problems Parameterized by Dual Fertin, Guillaume et al. 2016
Current Page :
Number of result pages: 1
Number of documents: 4


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