Parameterized complexity of stable roommates with ties and incomplete lists through the lens of graph parameters (Q2105427): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Rolf Niedermeier / rank
Normal rank
 
Property / author
 
Property / author: Rolf Niedermeier / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2990125763 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized algorithms for stable matching with ties and incomplete lists / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear-time algorithm for testing the truth of certain quantified Boolean formulas / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stable matching with preferences derived from a psychological model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bribery and Control in Stable Marriage / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fine-grained view on stable many-to-one matching problems with lower and upper quotas / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Complexity of Stable Roommates with Ties and Incomplete Lists Through the Lens of Graph Parameters / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multidimensional stable roommates with master list / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a generalization of the stable roommates problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight lower bounds for certain parameterized NP-hard problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: How hard is it to satisfy (almost) all roommates / rank
 
Normal rank
Property / cites work
 
Property / cites work: The stable marriage problem with ties and restricted edges / rank
 
Normal rank
Property / cites work
 
Property / cites work: The stable roommates problem with short lists / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new fixed point approach for stable networks and stable marriages / rank
 
Normal rank
Property / cites work
 
Property / cites work: College Admissions and the Stability of Marriage / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic Applications of Tree-Cut Width / rank
 
Normal rank
Property / cites work
 
Property / cites work: On structural parameterizations of the bounded-degree vertex deletion problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: SAT-Encodings for Treecut Width and Treedepth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lean Tree-Cut Decompositions: Obstructions and Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Balanced stable marriage: how close is close enough? / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Treewidth and Stable Marriage: Parameterized Algorithms and Hardness Results (Complete Characterization) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3995616 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of \(k\)-SAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient algorithm for the “stable roommates” problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4938640 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An FPT 2-approximation for tree-cut decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Treewidth. Computations and approximations / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Races in Parameterized Algorithmics / rank
 
Normal rank
Property / cites work
 
Property / cites work: The structure of stable marriage with indifference / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hard variants of stable marriage. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmics of Matching Under Preferences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized complexity and local search approaches for the stable marriage problem with ties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Immersions in Highly Edge Connected Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stable assignment with couples: parameterized complexity and local search / rank
 
Normal rank
Property / cites work
 
Property / cites work: A 3/2-Approximation Algorithm for General Stable Marriage / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving hard stable matching problems involving groups of similar agents / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stable matchings with covering constraints: a complete computational trichotomy / rank
 
Normal rank
Property / cites work
 
Property / cites work: NP-complete stable matching problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pairwise kidney exchange / rank
 
Normal rank
Property / cites work
 
Property / cites work: The structure of graphs not admitting a fixed immersion / rank
 
Normal rank

Latest revision as of 01:54, 31 July 2024

scientific article
Language Label Description Also known as
English
Parameterized complexity of stable roommates with ties and incomplete lists through the lens of graph parameters
scientific article

    Statements

    Parameterized complexity of stable roommates with ties and incomplete lists through the lens of graph parameters (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    8 December 2022
    0 references
    stable matching
    0 references
    fixed-parameter tractability
    0 references
    W[1]-hardness
    0 references
    tree-cut width
    0 references
    disjoint path modulator
    0 references
    0 references
    0 references

    Identifiers