Showing 1–20 of 34 results
/ Date/ Name
Oct 8, 2020A Matroid Generalization of the Super-Stable Matching ProblemFeb 19, 2024Modifying an Instance of the Super-Stable Matching ProblemMar 24, 2026Structure-Aware Optimization of Decision Diagrams for Health Guidance via Integer ProgrammingNov 29, 2024On Connectedness of Solutions to Integer Linear SystemsSep 18, 2025Minimum Sum Coloring with Bundles in Trees and Bipartite GraphsSep 21, 2022On Reachable Assignments under Dichotomous PreferencesDec 23, 2010A Relation between the Protocol Partition Number and the Quasi-Additive BoundFeb 20, 2008Covering Directed Graphs by In-treesAug 24, 2022Strongly Stable Matchings under Matroid ConstraintsOct 18, 2022A Note on Robust Subsets of Transversal MatroidsMay 19, 2025A Necessary Condition for Connectedness of Solutions to Integer Linear SystemsOct 18, 2025The Strongly Stable Roommates Problem and Linear ProgrammingJan 5, 2024The Strongly Stable Matching Problem with ClosuresAug 29, 2024Non-uniformly Stable MatchingsMay 1, 2024The Set of Stable Matchings and the Core in a Matching Market with Ties and Matroid ConstraintsMar 20, 2025A Linear Programming Approach to the Super-Stable Roommates ProblemJan 16, 2026Non-uniformly Stable Common Independent SetsMay 12, 2023Reconfiguration of Time-Respecting ArborescencesMay 6, 2022NP-hardness of Computing Uniform Nash Equilibria on Planar Bimatrix GamesSep 28, 2025Two-Sided Fairness in Many-to-One Matching