No. Title Author Year
1 Fast Approximation Algorithms for Bounded Degree and Crossing Spanning Tree Problems Chekuri, Chandra et al. 2021
2 Faster Algorithms for Rooted Connectivity in Directed Graphs Chekuri, Chandra et al. 2021
3 Front Matter, Table of Contents, Preface, Conference Organization Bojańczyk, Mikołaj et al. 2021
4 Isolating Cuts, (Bi-)Submodularity, and Faster Algorithms for Connectivity Chekuri, Chandra et al. 2021
5 LIPIcs, Volume 213, FSTTCS 2021, Complete Volume Bojańczyk, Mikołaj et al. 2021
6 Revisiting Priority k-Center: Fairness and Outliers Bajpai, Tanvi et al. 2021
7 A Note on Iterated Rounding for the Survivable Network Design Problem Chekuri, Chandra et al. 2018
8 Congestion Minimization for Multipath Routing via Multiroute Flows Chekuri, Chandra et al. 2018
9 LP Relaxation and Tree Packing for Minimum k-cuts Chekuri, Chandra et al. 2018
10 Perturbation Resilient Clustering for k-Center and Related Problems via LP Relaxations Chekuri, Chandra et al. 2018
11 Constant Congestion Routing of Symmetric Demands in Planar Directed Graphs Chekuri, Chandra et al. 2016
12 Pruning 2-Connected Graphs Chekuri, Chandra et al. 2008
13 Single-Sink Network Design with Vertex Connectivity Requirements Chekuri, Chandra et al. 2008
Current Page :
Number of result pages: 1
Number of documents: 13


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