Pages that link to "Item:Q1714949"
From MaRDI portal
The following pages link to The parameterised complexity of counting even and odd induced subgraphs (Q1714949):
Displaying 17 items.
- Parameterized complexity of connected even/odd subgraph problems (Q395000) (← links)
- Parameterized complexity of even/odd subgraph problems (Q635735) (← links)
- The parameterized complexity of \(k\)-edge induced subgraphs (Q729817) (← links)
- Counting induced subgraphs: a topological approach to \#W[1]-hardness (Q786040) (← links)
- Compactors for parameterized counting problems (Q826317) (← links)
- Counting induced subgraphs: an algebraic approach to \(\#\)W[1]-hardness (Q832520) (← links)
- The parameterised complexity of counting connected subgraphs and graph motifs (Q2256721) (← links)
- Some hard families of parameterized counting problems (Q2832302) (← links)
- The Parameterized Complexity of k-Edge Induced Subgraphs (Q2843289) (← links)
- Counting problems in parameterized complexity (Q5009461) (← links)
- (Q5009487) (← links)
- Counting Small Induced Subgraphs Satisfying Monotone Properties (Q5071087) (← links)
- (Q5092385) (← links)
- On the complexity of finding large odd induced subgraphs and odd colorings (Q5918338) (← links)
- Parameterised counting in logspace (Q6093373) (← links)
- Counting Small Induced Subgraphs with Hereditary Properties (Q6154192) (← links)
- Parameterized Counting and Cayley Graph Expanders (Q6158357) (← links)