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

1 |
Approximating k-Edge-Connected Spanning Subgraphs via a Near-Linear Time LP Solver |
Chalermsook, Parinya et al. |
2022 |

2 |
Matroid-Constrained Maximum Vertex Cover: Approximate Kernels and Streaming Algorithms |
Huang, Chien-Chung et al. |
2022 |

3 |
Maximum Weight b-Matchings in Random-Order Streams |
Huang, Chien-Chung et al. |
2022 |

4 |
Approximating Maximum Integral Multiflows on Bounded Genus Graphs |
Huang, Chien-Chung et al. |
2021 |

5 |
Semi-Streaming Algorithms for Submodular Function Maximization Under b-Matching Constraint |
Huang, Chien-Chung et al. |
2021 |

6 |
Improved Multi-Pass Streaming Algorithms for Submodular Maximization with Matroid Constraints |
Huang, Chien-Chung et al. |
2020 |

7 |
Maximizing Covered Area in the Euclidean Plane with Connectivity Constraint |
Huang, Chien-Chung et al. |
2019 |

8 |
Streaming Algorithms for Maximizing Monotone Submodular Functions under a Knapsack Constraint |
Huang, Chien-Chung et al. |
2017 |

9 |
A Combinatorial Approximation Algorithm for Graph Balancing with Light Hyper Edges |
Huang, Chien-Chung et al. |
2016 |

10 |
A Tight Approximation Bound for the Stable Marriage Problem with Restricted Ties |
Huang, Chien-Chung et al. |
2015 |

11 |
Fair Matchings and Related Problems |
Huang, Chien-Chung et al. |
2013 |

12 |
Donation Center Location Problem |
Huang, Chien-Chung et al. |
2009 |