Cited By
View all- Künnemann MMoeller DPaturi RSchneider S(2019)Subquadratic Algorithms for Succinct Stable MatchingAlgorithmica10.1007/s00453-019-00564-x81:7(2991-3024)Online publication date: 1-Jul-2019
- Karlin AGharan SWeber RDiakonikolas IKempe DHenzinger M(2018)A simply exponential upper bound on the maximum number of stable matchingsProceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing10.1145/3188745.3188848(920-925)Online publication date: 20-Jun-2018
- Moeller DPaturi RSchneider S(2016)Subquadratic Algorithms for Succinct Stable MatchingProceedings of the 11th International Computer Science Symposium on Computer Science --- Theory and Applications - Volume 969110.1007/978-3-319-34171-2_21(294-308)Online publication date: 9-Jun-2016
- Show More Cited By