No. |
Title |
Author |
Year |
---|

1 |
Approximation Algorithms for Network Design in Non-Uniform Fault Models |
Chekuri, Chandra et al. |
2023 |

2 |
Bicriteria Approximation Algorithms for Priority Matroid Median |
Bajpai, Tanvi et al. |
2023 |

3 |
Convergence to Lexicographically Optimal Base in a (Contra)Polymatroid and Applications to Densest Subgraph and Tree Packing |
Harb, Elfarouk et al. |
2023 |

4 |
Independent Sets in Elimination Graphs with a Submodular Objective |
Chekuri, Chandra et al. |
2023 |

5 |
Approximate Representation of Symmetric Submodular Functions via Hypergraph Cut Functions |
Beideman, Calvin et al. |
2022 |

6 |
Fast Approximation Algorithms for Bounded Degree and Crossing Spanning Tree Problems |
Chekuri, Chandra et al. |
2021 |

7 |
Faster Algorithms for Rooted Connectivity in Directed Graphs |
Chekuri, Chandra et al. |
2021 |

8 |
Front Matter, Table of Contents, Preface, Conference Organization |
Bojańczyk, Mikołaj et al. |
2021 |

9 |
Isolating Cuts, (Bi-)Submodularity, and Faster Algorithms for Connectivity |
Chekuri, Chandra et al. |
2021 |

10 |
LIPIcs, Volume 213, FSTTCS 2021, Complete Volume |
Bojańczyk, Mikołaj et al. |
2021 |

11 |
Revisiting Priority k-Center: Fairness and Outliers |
Bajpai, Tanvi et al. |
2021 |

12 |
A Note on Iterated Rounding for the Survivable Network Design Problem |
Chekuri, Chandra et al. |
2018 |

13 |
Congestion Minimization for Multipath Routing via Multiroute Flows |
Chekuri, Chandra et al. |
2018 |

14 |
LP Relaxation and Tree Packing for Minimum k-cuts |
Chekuri, Chandra et al. |
2018 |

15 |
Perturbation Resilient Clustering for k-Center and Related Problems via LP Relaxations |
Chekuri, Chandra et al. |
2018 |

16 |
Constant Congestion Routing of Symmetric Demands in Planar Directed Graphs |
Chekuri, Chandra et al. |
2016 |

17 |
Pruning 2-Connected Graphs |
Chekuri, Chandra et al. |
2008 |

18 |
Single-Sink Network Design with Vertex Connectivity Requirements |
Chekuri, Chandra et al. |
2008 |