Pages that link to "Item:Q5311124"
From MaRDI portal
The following pages link to Mathematical Foundations of Computer Science 2004 (Q5311124):
Displaying 5 items.
- Structure of polynomial-time approximation (Q692893) (← links)
- Parameterized algorithmics for linear arrangement problems (Q1003461) (← links)
- Fixed-parameter approximation: conceptual framework and approximability results (Q2379929) (← links)
- On the computational hardness based on linear fpt-reductions (Q2498987) (← links)
- Parameterized computation and complexity: a new approach dealing with NP-hardness (Q2576825) (← links)
