No. Title Author Year
1 How Hard Is It to Satisfy (Almost) All Roommates? Chen, Jiehua et al. 2018
2 Solving Partition Problems Almost Always Requires Pushing Many Vertices Around Kanj, Iyad et al. 2018
3 Finding Secluded Places of Special Interest in Graphs van Bevern, René et al. 2017
4 Parameterized Algorithms for Recognizing Monopolar and 2-Subcolorable Graphs Kanj, Iyad et al. 2016
5 Approximation Algorithms for Mixed, Windy, and Capacitated Arc Routing Problems van Bevern, René et al. 2015
6 On Kernelization and Approximation for the Vector Connectivity Problem Kratsch, Stefan et al. 2015
7 The Parameterized Complexity of the Minimum Shared Edges Problem Fluschnik, Till et al. 2015
Current Page :
Number of result pages: 1
Number of documents: 7


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