Author:
Asinowski Andrei,Keszegh Balázs,Miltzow Tillmann
Funder
ESF EUROCORES programme EuroGIGA, CRP ‘ComPoSe’, Deutsche Forschungsgemeinschaft
Hungarian National Science Fund
János Bolyai Research Scholarship of the Hungarian Academy of Sciences
ERC grant PARAMTIGHT: “Parameterized complexity and the search for tight complexity results”
Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference19 articles.
1. Pareto optimality in house allocation problems;Abraham,2005
2. Computational Complexity: A Modern Approach;Arora,2009
3. The computational complexity of random serial dictatorship;Aziz;Econom. Lett.,2013
4. Parametrized algorithms for random serial dictatorship;Aziz;Math. Social Sci.,2014
5. Minimum partial-matching and Hausdorff RMS-distance under translation: Combinatorics and algorithms;Ben-Avraham,2014
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献