Cited By
View all- Boehmer NKoana T(2024)The Complexity of Finding Fair Many-to-One MatchingsACM Transactions on Algorithms10.1145/364922020:2(1-37)Online publication date: 24-Feb-2024
- Zhang ZLu YZheng WLin X(2024)A Comprehensive Survey and Experimental Study of Subgraph Matching: Trends, Unbiasedness, and InteractionProceedings of the ACM on Management of Data10.1145/36393152:1(1-29)Online publication date: 26-Mar-2024
- Hirahara SIlango RWilliams RMohar BShinkar IO'Donnell R(2024)Beating Brute Force for Compression ProblemsProceedings of the 56th Annual ACM Symposium on Theory of Computing10.1145/3618260.3649778(659-670)Online publication date: 10-Jun-2024
- Show More Cited By