Pages that link to "Item:Q3057621"
From MaRDI portal
The following pages link to Kernelization Hardness of Connectivity Problems in d-Degenerate Graphs (Q3057621):
Displayed 7 items.
- Vertex cover kernelization revisited. Upper and lower bounds for a refined parameter (Q372970) (← links)
- Parameterized complexity of Min-power multicast problems in wireless ad hoc networks (Q388087) (← links)
- Kernel bounds for path and cycle problems (Q392032) (← links)
- Confronting intractability via parameters (Q465686) (← links)
- The kernelization complexity of connected domination in graphs with (no) small cycles (Q476436) (← links)
- Kernel Bounds for Path and Cycle Problems (Q2891344) (← links)
- On the Kernelization Complexity of Colorful Motifs (Q3058688) (← links)