| No. |
Title |
Author |
Year |
| 1 |
Efficient Algorithms and Hardness Results for the Weighted k-Server Problem |
Gupta, Anupam et al. |
2023 |
| 2 |
Bag-Of-Tasks Scheduling on Related Machines |
Gupta, Anupam et al. |
2021 |
| 3 |
FPT Approximation for Constrained Metric k-Median/Means |
Goyal, Dishant et al. |
2020 |
| 4 |
On Sampling Based Algorithms for k-Means |
Bhattacharya, Anup et al. |
2020 |
| 5 |
Online Carpooling Using Expander Decompositions |
Gupta, Anupam et al. |
2020 |
| 6 |
Non-Clairvoyant Precedence Constrained Scheduling |
Garg, Naveen et al. |
2019 |
| 7 |
Tight FPT Approximations for k-Median and k-Means |
Cohen-Addad, Vincent et al. |
2019 |
| 8 |
A Local-Search Algorithm for Steiner Forest |
Groß, Martin et al. |
2018 |
| 9 |
Approximate Clustering with Same-Cluster Queries |
Ailon, Nir et al. |
2018 |
| 10 |
Approximating Airports and Railways |
Adamaszek, Anna et al. |
2018 |
| 11 |
Fully-Dynamic Bin Packing with Little Repacking |
Feldkord, Björn et al. |
2018 |
| 12 |
Non-Preemptive Flow-Time Minimization via Rejections |
Gupta, Anupam et al. |
2018 |
| 13 |
Faster Algorithms for the Constrained k-Means Problem |
Bhattacharya, Anup et al. |
2016 |
| 14 |
Minimizing Weighted lp-Norm of Flow-Time in the Rejection Model |
Roy Choudhury, Anamitra et al. |
2015 |
| 15 |
LIPIcs, Volume 13, FSTTCS'11, Complete Volume |
Chakraborthy, Supratik et al. |
2013 |
| 16 |
Approximation Algorithms for the Unsplittable Flow Problem on Paths and Trees |
Elbassioni, Khaled et al. |
2012 |
| 17 |
Efficient on-line algorithm for maintaining k-cover of sparse bit-strings |
Kumar, Amit et al. |
2012 |
| 18 |
Author Index |
Chakraborty, Supratik et al. |
2011 |
| 19 |
Frontmatter, Table of Contents, Preface, Conference Organization, External Reviewers |
Chakraborty, Supratik et al. |
2011 |
| 20 |
All-Norms and All-L_p-Norms Approximation Algorithms |
Golovin, Daniel et al. |
2008 |
