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

1 |
A Local-Search Algorithm for Steiner Forest |
Groß, Martin et al. |
2018 |

2 |
Approximate Clustering with Same-Cluster Queries |
Ailon, Nir et al. |
2018 |

3 |
Faster Algorithms for the Constrained k-Means Problem |
Bhattacharya, Anup et al. |
2016 |

4 |
Minimizing Weighted lp-Norm of Flow-Time in the Rejection Model |
Roy Choudhury, Anamitra et al. |
2015 |

5 |
LIPIcs, Volume 13, FSTTCS'11, Complete Volume |
Chakraborthy, Supratik et al. |
2013 |

6 |
Approximation Algorithms for the Unsplittable Flow Problem on Paths and Trees |
Elbassioni, Khaled et al. |
2012 |

7 |
Efficient on-line algorithm for maintaining k-cover of sparse bit-strings |
Kumar, Amit et al. |
2012 |

8 |
Author Index |
Chakraborty, Supratik et al. |
2011 |

9 |
Frontmatter, Table of Contents, Preface, Conference Organization, External Reviewers |
Chakraborty, Supratik et al. |
2011 |

10 |
All-Norms and All-L_p-Norms Approximation Algorithms |
Golovin, Daniel et al. |
2008 |