Pages that link to "Item:Q5897992"
From MaRDI portal
The following pages link to SOFSEM 2006: Theory and Practice of Computer Science (Q5897992):
Displayed 7 items.
- Parameterized complexity dichotomy for \textsc{Steiner Multicut} (Q295637) (← links)
- On the complexity of the multicut problem in bounded tree-width graphs and digraphs (Q944745) (← links)
- Almost 2-SAT is fixed-parameter tractable (Q1034100) (← links)
- Solution methods for the vertex variant of the network system vulnerability analysis problem (Q2017536) (← links)
- A logical approach to multicut problems (Q2379958) (← links)
- Performing Multicut on Walkable Environments (Q2958325) (← links)
- Multicut Is FPT (Q4605273) (← links)