Deconstructing intractability-A multivariate complexity analysis of interval constrained coloring (Q533417): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.jda.2010.07.003 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2147091866 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the Interval Constrained Coloring Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: 3-coloring in time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kernelization: New Upper and Lower Bound Techniques / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Interval Constrained 3-Coloring Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Polynomial Delay Algorithm for Enumerating Approximate Solutions to the Interval Constrained Coloring Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3579403 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4393480 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards Fully Multivariate Algorithmics: Some New Results and Directions in Parameter Ecology / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Layout Problems Parameterized by Vertex Cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Complexity of Coloring Problems: Treewidth versus Vertex Cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametrized complexity theory. / rank
 
Normal rank
Property / cites work
 
Property / cites work: An application of simultaneous diophantine approximation in combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-parameter algorithms for CLOSEST STRING and related problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer Programming with a Fixed Number of Variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5710169 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reflections on Multivariate Algorithmics and Problem Parameterization / rank
 
Normal rank

Latest revision as of 23:55, 3 July 2024

scientific article
Language Label Description Also known as
English
Deconstructing intractability-A multivariate complexity analysis of interval constrained coloring
scientific article

    Statements

    Deconstructing intractability-A multivariate complexity analysis of interval constrained coloring (English)
    0 references
    0 references
    0 references
    0 references
    3 May 2011
    0 references
    interval constraint coloring
    0 references
    parametrized complexity
    0 references
    multivariate algorithmics
    0 references
    NP-hard problem
    0 references
    experiments
    0 references

    Identifiers