Pages that link to "Item:Q1877697"
From MaRDI portal
The following pages link to The Turing way to parameterized complexity (Q1877697):
Displayed 12 items.
- Parameterized proof complexity (Q451111) (← links)
- Chordless paths through three vertices (Q820149) (← links)
- On product covering in 3-tier supply chain models: natural complete problems for W[3] and W[4] (Q860874) (← links)
- Vertex and edge covers with clustering properties: Complexity and algorithms (Q1026225) (← links)
- Perfect Code is \(W[1]\)-complete (Q1603518) (← links)
- Facility location problems: a parameterized view (Q2275913) (← links)
- A parametric analysis of the state-explosion problem in model checking (Q2495399) (← links)
- Parameterized counting problems (Q2576944) (← links)
- A Parameterized Halting Problem (Q2908544) (← links)
- Finding Approximate and Constrained Motifs in Graphs (Q3011870) (← links)
- Facility Location Problems: A Parameterized View (Q3511428) (← links)
- R<scp>OMAN DOMINATION</scp>: a parameterized perspective† (Q5438692) (← links)