Personensuche
X
?
Proceedings of the Thirty-First Annual ACM-SIAM Symposium on Discrete Algorithms ,
9
A little charity guarantees almost envy-freeness:
, In:
?
Proceedings of the Thirty-First Annual ACM-SIAM Symposium on Discrete Algorithms ,
10
Quasi-popular matchings, optimality, and extended formulati..:
, In:
?
Integer Programming and Combinatorial Optimization; Lecture Notes in Computer Science ,
11
Popular Branchings and Their Dual Certificates:
, In:
?
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms ,
12
Popular matchings and limits to tractability:
, In:
?
Graph-Theoretic Concepts in Computer Science; Lecture Notes in Computer Science ,
14