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

1 |
An Approximation Algorithm for Distance-Constrained Vehicle Routing on Trees |
Dufay, Marc et al. |
2023 |

2 |
Unsplittable Euclidean Capacitated Vehicle Routing: A (2+ε)-Approximation Algorithm |
Grandoni, Fabrizio et al. |
2023 |

3 |
A PTAS for Capacitated Vehicle Routing on Trees |
Mathieu, Claire et al. |
2022 |

4 |
A Simple Algorithm for Graph Reconstruction |
Mathieu, Claire et al. |
2021 |

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

6 |
Probabilistic Analysis of Euclidean Capacitated Vehicle Routing |
Mathieu, Claire et al. |
2021 |

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

8 |
Covering Clients with Types and Budgets |
Fotakis, Dimitris et al. |
2018 |

9 |
Combinatorics of Local Search: An Optimal 4-Local Hall's Theorem for Planar Graphs |
Antunes, Daniel et al. |
2017 |

10 |
Dynamic Clustering to Minimize the Sum of Radii |
Henzinger, Monika et al. |
2017 |

11 |
Probabilistic Methods in the Design and Analysis of Algorithms (Dagstuhl Seminar 17141) |
Manthey, Bodo et al. |
2017 |

12 |
Algorithms for Optimization Problems in Planar Graphs (Dagstuhl Seminar 16221) |
Erickson, Jeff et al. |
2016 |

13 |
Carpooling in Social Networks |
Fiat, Amos et al. |
2016 |

14 |
Front Matter, Table of Contents, Preface, Program Committees, External Reviewers, List of Authors |
Jansen, Klaus et al. |
2016 |

15 |
LIPIcs, Volume 60, APPROX/RANDOM'16, Complete Volume |
Jansen, Klaus et al. |
2016 |

16 |
Correlation Clustering and Two-edge-connected Augmentation for Planar Graphs |
Klein, Philip N. et al. |
2015 |

17 |
Effectiveness of Local Search for Geometric Optimization |
Cohen-Addad, Vincent et al. |
2015 |

18 |
Algorithms for Optimization Problems in Planar Graphs (Dagstuhl Seminar 13421) |
Borradaile, Glencora et al. |
2014 |

19 |
Online Correlation Clustering |
Mathieu, Claire et al. |
2010 |