Fine-Grained Parameterized Complexity Analysis of Graph Coloring Problems (Q5283380)

scientific article; zbMATH DE number 6751074

Language	Label	Description	Also known as
English	Fine-Grained Parameterized Complexity Analysis of Graph Coloring Problems	scientific article; zbMATH DE number 6751074

Statements

instance of

scholarly article

0 references

title

Fine-Grained Parameterized Complexity Analysis of Graph Coloring Problems (English)

0 references

0 references

0 references

Lecture Notes in Computer Science

0 references

publication date

21 July 2017

0 references

full work available at URL

https://arxiv.org/abs/1701.06985

0 references

MaRDI profile type

MaRDI publication profile

0 references

cites work

Set Partitioning via Inclusion-Exclusion

0 references

Parameterized complexity of vertex colouring

0 references

Parameterized Algorithms

0 references

Fundamentals of parameterized complexity

0 references

Towards fully multivariate algorithmics: parameter ecology and the deconstruction of computational complexity

0 references

On the complexity of \(k\)-SAT

0 references

Which problems have strongly exponential complexity?

0 references

Fine-Grained Parameterized Complexity Analysis of Graph Coloring Problems

0 references

Data reduction for graph coloring problems

0 references

Q5365080

0 references

Hardness of Easy Problems: Basing Hardness on Popular Conjectures such as the Strong Exponential Time Hypothesis (Invited Talk)

0 references

Identifiers

zbMATH Open document ID

1486.68083

0 references

DOI

10.1007/978-3-319-57586-5_29

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5283380