Pages that link to "Item:Q627124"
From MaRDI portal
The following pages link to On the complexity of some colorful problems parameterized by treewidth (Q627124):
Displaying 10 items.
- Structural parameterizations of budgeted graph coloring (Q5925707) (← links)
- Computations by fly-automata beyond monadic second-order logic (Q5964015) (← links)
- On the complexity of coloring ‐graphs (Q6092550) (← links)
- Structural parameterizations for equitable coloring: complexity, FPT algorithms, and kernelization (Q6107887) (← links)
- Fair division with minimal withheld information in social networks (Q6113835) (← links)
- Fair division with minimal withheld information in social networks (Q6122612) (← links)
- Parameterized complexity for iterated type partitions and modular-width (Q6126724) (← links)
- Extended MSO model checking via small vertex integrity (Q6185940) (← links)
- SAT-boosted tabu search for coloring massive graphs (Q6579769) (← links)
- Parameterized problems complete for nondeterministic FPT time and logarithmic space (Q6614886) (← links)