Pages that link to "Item:Q1026227"
From MaRDI portal
The following pages link to Parameterized complexity of finding regular induced subgraphs (Q1026227):
Displaying 8 items.
- Exploiting c-Closure in Kernelization Algorithms for Graph Problems (Q5874537) (← links)
- Finding large degree-anonymous subgraphs is hard (Q5964077) (← links)
- Disconnected matchings (Q5972267) (← links)
- Streaming deletion problems Parameterized by vertex cover (Q6057830) (← links)
- A survey of parameterized algorithms and the complexity of edge modification (Q6158862) (← links)
- An improved kernel and parameterized algorithm for almost induced matching (Q6636070) (← links)
- Parameterized results on acyclic matchings with implications for related problems (Q6655671) (← links)
- Maximum locally irregular induced subgraphs via minimum irregulators (Q6671395) (← links)