Pages that link to "Item:Q5466496"
From MaRDI portal
The following pages link to Automata, Languages and Programming (Q5466496):
Displayed 13 items.
- Subexponential parameterized algorithms (Q458457) (← links)
- Branchwidth of chordal graphs (Q967314) (← links)
- Semi-nice tree-decompositions: the best of branchwidth, treewidth and pathwidth with one algorithm (Q967316) (← links)
- The parameterized complexity of the induced matching problem (Q1028465) (← links)
- On problems without polynomial kernels (Q1034099) (← links)
- Approximation algorithms via contraction decomposition (Q1945289) (← links)
- Twin-width and polynomial kernels (Q2093574) (← links)
- Parameters estimation in Ebola virus transmission dynamics model based on machine learning (Q2164308) (← links)
- Linear kernels for \(k\)-tuple and liar's domination in bounded genus graphs (Q2403794) (← links)
- Genus characterizes the complexity of certain graph problems: Some tight results (Q2641866) (← links)
- Kernelization: New Upper and Lower Bound Techniques (Q3656848) (← links)
- Polynomial Kernels and Faster Algorithms for the Dominating Set Problem on Graphs with an Excluded Minor (Q3656866) (← links)
- Dynamic programming for graphs on surfaces (Q5501962) (← links)