Pages that link to "Item:Q533417"

The following pages link to Deconstructing intractability-A multivariate complexity analysis of interval constrained coloring (Q533417):

Displaying 11 items.

• Aspects of a multivariate complexity analysis for rectangle tiling (Q408398) (← links)
• Exploiting a hypergraph model for finding Golomb rulers (Q471187) (← links)
• Complexity of splits reconstruction for low-degree trees (Q476307) (← links)
• Parameterizing by the number of numbers (Q692894) (← links)
• Bivariate complexity analysis of \textsc{Almost Forest Deletion} (Q1686068) (← links)
• The effect of homogeneity on the computational complexity of combinatorial data anonymization (Q2435706) (← links)
• The complexity of routing problems in forbidden-transition graphs and edge-colored graphs (Q2701383) (← links)
• Studies in Computational Aspects of Voting (Q2908543) (← links)
• The Effect of Homogeneity on the Complexity of k-Anonymity (Q3088269) (← links)
• Bivariate Complexity Analysis of Almost Forest Deletion (Q3196379) (← links)
• NP-Hardness and Fixed-Parameter Tractability of Realizing Degree Sequences with Directed Acyclic Graphs (Q5891702) (← links)