Fixed-Parameter Algorithms for the Kneser and Schrijver Problems (Q6154195): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W4392776354 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A short proof of Kneser's conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: The relative complexity of NP search problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intersecting Families are Essentially Contained in Juntas / rank
 
Normal rank
Property / cites work
 
Property / cites work: INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Consensus halving is PPA-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of splitting necklaces and bisecting ham sandwiches / rank
 
Normal rank
Property / cites work
 
Property / cites work: Consensus-Halving: Does It Ever Get Easier? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kernelization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3236254 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Consensus halving for sets of items / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of finding fair independent sets in cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Moment Problem in L 1 Approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Diversity of uniform intersecting families / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kneser's conjecture, chromatic number, and homotopy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing a small agreeable set of indivisible items / rank
 
Normal rank
Property / cites work
 
Property / cites work: A combinatorical proof of Kneser's conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topological lower bounds for the chromatic number: a hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4226453 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On total functions, existence theorems and computational complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of the parity argument and other inefficient proofs of existence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3869375 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Consensus-halving via theorems of Borsuk-Ulam and Tucker / rank
 
Normal rank
Property / cites work
 
Property / cites work: INTERSECTING FAMILIES OF SEPARATED SETS / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 12:35, 28 August 2024

scientific article; zbMATH DE number 7820561
Language Label Description Also known as
English
Fixed-Parameter Algorithms for the Kneser and Schrijver Problems
scientific article; zbMATH DE number 7820561

    Statements

    Fixed-Parameter Algorithms for the Kneser and Schrijver Problems (English)
    0 references
    0 references
    19 March 2024
    0 references
    Kneser graphs
    0 references
    Schrijver graphs
    0 references
    agreeable set
    0 references
    fixed-parameter tractability
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references