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

1 |
A Deterministic Construction of a Large Distance Code from the Wozencraft Ensemble |
Guruswami, Venkatesan et al. |
2023 |

2 |
Nearly-Linear Time LP Solvers and Rounding Algorithms for Scheduling Problems |
Li, Shi |
2023 |

3 |
Minimizing the Maximum Flow Time in the Online Food Delivery Problem |
Guo, Xiangyu et al. |
2022 |

4 |
Nested Active-Time Scheduling |
Cao, Nairen et al. |
2022 |

5 |
Impatient PPSZ - A Faster Algorithm for CSP |
Li, Shibo et al. |
2021 |

6 |
On Approximating Degree-Bounded Network Design Problems |
Guo, Xiangyu et al. |
2020 |

7 |
On the Facility Location Problem in Online and Dynamic Models |
Guo, Xiangyu et al. |
2020 |

8 |
Flow-time Optimization for Concurrent Open-Shop and Precedence Constrained Scheduling Models |
Kulkarni, Janardhan et al. |
2018 |

9 |
Constant Approximation for Capacitated k-Median with (1+epsilon)-Capacity Violation |
Demirci, GĂ¶kalp et al. |
2016 |

10 |
Dispersing Points on Intervals |
Li, Shimin et al. |
2016 |