No. Title Author Year
1 Recoloring Interval Graphs with Limited Recourse Budget Bosek, Bartłomiej et al. 2020
2 FPT Inapproximability of Directed Cut and Connectivity Problems Chitnis, Rajesh et al. 2019
3 Parameterized Approximation Algorithms for Bidirected Steiner Network Problems Chitnis, Rajesh et al. 2018
4 Parameterized Approximation Schemes for Steiner Trees with Small Number of Steiner Vertices Dvorák, Pavel et al. 2018
5 The Parameterized Hardness of the k-Center Problem in Transportation Networks Feldmann, Andreas Emil et al. 2018
6 Fast Approximation Algorithms for the Generalized Survivable Network Design Problem Feldmann, Andreas Emil et al. 2016
7 The Complexity Landscape of Fixed-Parameter Directed Steiner Network Problems Feldmann, Andreas Emil et al. 2016
8 On the Equivalence of the Bidirected and Hypergraphic Relaxations for Steiner Tree Feldmann, Andreas Emil et al. 2014
9 Balanced Partitions of Trees and Applications Feldmann, Andreas Emil et al. 2012
Current Page :
Number of result pages: 1
Number of documents: 9


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