13 citations · 46 across the 31 of their papers we have counts for
Showing 2018 · cs.CCShow all
2 papers · 2 filters
cs.CC2018
Parameterized Orientable Deletion
Tesshu Hanaka, Ioannis Katsikarelis, Michael Lampis +2
A graph is -orientable if its edges can be oriented so that the maximum in-degree of the resulting digraph is at most . -orientability is a well-studied concept with close…
cs.CC2018
Finer Tight Bounds for Coloring on Clique-Width
Michael Lampis
We revisit the complexity of the classical -Coloring problem parameterized by clique-width. This is a very well-studied problem that becomes highly intractable when the number o…