Pages that link to "Item:Q860874"

The following pages link to On product covering in 3-tier supply chain models: natural complete problems for W[3] and W[4] (Q860874):

Displayed 7 items.

• On the parameterised complexity of string morphism problems (Q315525) ‎ (← links)
• Efficiently enumerating hitting sets of hypergraphs arising in data profiling (Q2051864) ‎ (← links)
• The complexity of dependency detection and discovery in relational databases (Q2062133) ‎ (← links)
• On the complexity of solution extension of optimization problems (Q2072063) ‎ (← links)
• A multi-parameter analysis of hard problems on deterministic finite automata (Q2256724) ‎ (← links)
• Invited talks (Q2692717) ‎ (← links)
• Synchronizing words and monoid factorization, yielding a new parameterized complexity class? (Q5048011) ‎ (← links)