No. Title Author Year
1 Recoloring Interval Graphs with Limited Recourse Budget Bosek, Bartłomiej et al. 2020
2 Improved Bounds for Open Online Dial-a-Ride on the Line Birx, Alexander et al. 2019
3 Tight Analysis of the Smartstart Algorithm for Online Dial-a-Ride on the Line Birx, Alexander et al. 2019
4 Distance-Preserving Graph Contractions Bernstein, Aaron et al. 2018
5 Energy-Efficient Delivery by Heterogeneous Mobile Agents Bärtschi, Andreas et al. 2017
6 General Bounds for Incremental Maximization Bernstein, Aaron et al. 2017
7 Robust and Adaptive Search Disser, Yann et al. 2017
8 Packing a Knapsack of Unknown Capacity Disser, Yann et al. 2014
9 Telling convex from reflex allows to map a polygon Chalopin, Jeremie et al. 2011
Current Page :
Number of result pages: 1
Number of documents: 9


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI