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


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