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