The following pages link to (Q3396557):
Displaying 10 items.
- On a binary distance model for the minimum linear arrangement problem (Q458974) (← links)
- Confronting intractability via parameters (Q465686) (← links)
- On families of categorial grammars of bounded value, their learnability and related complexity questions (Q714784) (← links)
- Graph parameters measuring neighbourhoods in graphs-bounds and applications (Q944739) (← links)
- Fixed-parameter complexity of minimum profile problems (Q958202) (← links)
- Parameterized algorithmics for linear arrangement problems (Q1003461) (← links)
- Derivation of algorithms for cutwidth and related graph layout parameters (Q1015810) (← links)
- The mixed page number of graphs (Q2167907) (← links)
- Alternative parameterizations of \textsc{Metric Dimension} (Q2285127) (← links)
- Linear layouts measuring neighbourhoods in graphs (Q2502893) (← links)
