No. Title Author Year
1 Stochastic k-Server: How Should Uber Work? Dehghani, Sina et al. 2017
2 Beating Ratio 0.5 for Weighted Oblivious Matching Problems Abolhassani, Melika et al. 2016
3 Bidimensional Structures: Algorithms, Combinatorics and Logic (Dagstuhl Seminar 13121) Demaine, Erik D. et al. 2013
4 09511 Abstracts Collection -- Parameterized complexity and approximation algorithms Demaine, Erik D. et al. 2010
5 09511 Executive Summary -- Parameterized complexity and approximation algorithms Demaine, Erik D. et al. 2010
6 09511 Open Problems -- Parameterized complexity and approximation algorithms Demaine, Erik D. et al. 2010
7 The Price of Anarchy in Cooperative Network Creation Games Demaine, Erik D. et al. 2009
Current Page :
Number of result pages: 1
Number of documents: 7


DROPS-Home | Fulltext Search | Imprint Published by LZI