Pages that link to "Item:Q931733"
From MaRDI portal
The following pages link to Efficient algorithms for counting parameterized list \(H\)-colorings (Q931733):
Displaying 9 items.
- Confronting intractability via parameters (Q465686) (← links)
- Compactors for parameterized counting problems (Q826317) (← links)
- In praise of homomorphisms (Q826325) (← links)
- Quasi-polynomial algorithms for list-coloring of nearly intersecting hypergraphs (Q2067633) (← links)
- Parameterized algorithms for min-max multiway cut and list digraph homomorphism (Q2396830) (← links)
- Parameterized Algorithms for List K-Cycle (Q4636569) (← links)
- A Complexity Trichotomy for Approximately Counting List <i>H</i> -Colorings (Q4973886) (← links)
- (Q5091010) (← links)
- Algorithms – ESA 2004 (Q5464586) (← links)