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

1 |
Scheduling (Dagstuhl Seminar 23061) |
Megow, Nicole et al. |
2023 |

2 |
An Approximation Algorithm for the Matrix Tree Multiplication Problem |
Abo-Khamis, Mahmoud et al. |
2021 |

3 |
An Efficient Reduction of a Gammoid to a Partition Matroid |
Leichter, Marilena et al. |
2021 |

4 |
Learnable and Instance-Robust Predictions for Online Matching, Flows and Load Balancing |
Lavastida, Thomas et al. |
2021 |

5 |
Relational Algorithms for k-Means Clustering |
Moseley, Benjamin et al. |
2021 |

6 |
Structural Iterative Rounding for Generalized k-Median Problems |
Gupta, Anupam et al. |
2021 |

7 |
Matroid Coflow Scheduling |
Im, Sungjin et al. |
2019 |

8 |
Online Non-Preemptive Scheduling to Minimize Maximum Weighted Flow-Time on Related Machines |
Lucarelli, Giorgio et al. |
2019 |

9 |
Scheduling to Approximate Minimization Objectives on Identical Machines |
Moseley, Benjamin |
2019 |

10 |
Submodular Optimization with Contention Resolution Extensions |
Moseley, Benjamin et al. |
2019 |

11 |
Online Non-Preemptive Scheduling to Minimize Weighted Flow-time on Unrelated Machines |
Lucarelli, Giorgio et al. |
2018 |

12 |
Minimizing Maximum Flow Time on Related Machines via Dynamic Posted Pricing |
Im, Sungjin et al. |
2017 |

13 |
A Competitive Flow Time Algorithm for Heterogeneous Clusters Under Polytope Constraints |
Im, Sungjin et al. |
2016 |

14 |
Stochastic Scheduling of Heavy-tailed Jobs |
Im, Sungjin et al. |
2015 |