Pages that link to "Item:Q4979840"
From MaRDI portal
The following pages link to Kernelization Lower Bounds by Cross-Composition (Q4979840):
Displaying 29 items.
- A Tight Kernel for Computing the Tree Bisection and Reconnection Distance between Two Phylogenetic Trees (Q5233752) (← links)
- Graph Editing to a Given Degree Sequence (Q5740185) (← links)
- (Q5743381) (← links)
- (Q5874519) (← links)
- The Parameterized Complexity of Graph Cyclability (Q5891809) (← links)
- On the relation of strong triadic closure and cluster deletion (Q5915591) (← links)
- On the complexity of finding internally vertex-disjoint long directed paths (Q5918120) (← links)
- Your rugby mates don't need to know your colleagues: triadic closure with edge colors (Q5918315) (← links)
- Structural parameterizations of budgeted graph coloring (Q5918737) (← links)
- Fine-grained complexity of safety verification (Q5919003) (← links)
- The clever shopper problem (Q5919456) (← links)
- On structural parameterizations of firefighting (Q5920210) (← links)
- Structural parameterizations of budgeted graph coloring (Q5925707) (← links)
- Parameterized certificate dispersal and its variants (Q5964075) (← links)
- On data reduction for dynamic vector bin packing (Q6047700) (← links)
- Streaming deletion problems Parameterized by vertex cover (Q6057830) (← links)
- (Q6065467) (← links)
- Parameterized algorithms and data reduction for the short secluded <i>s</i>‐<i>t</i>‐path problem (Q6068532) (← links)
- Colouring a dominating set without conflicts: \(q\)-subset square colouring (Q6077071) (← links)
- Multistage s-t Path: Confronting Similarity with Dissimilarity in Temporal Graphs (Q6087215) (← links)
- Multistage \(s-t\) path: confronting similarity with dissimilarity (Q6107891) (← links)
- Computing dense and sparse subgraphs of weakly closed graphs (Q6107896) (← links)
- Parameterized complexity for iterated type partitions and modular-width (Q6126724) (← links)
- What Is Known About Vertex Cover Kernelization? (Q6163635) (← links)
- Preprocessing to reduce the search space: antler structures for feedback vertex set (Q6564613) (← links)
- Polynomial Turing compressions for some graph problems parameterized by modular-width (Q6591463) (← links)
- Minimum separator reconfiguration (Q6615312) (← links)
- Cluster editing for multi-layer and temporal graphs (Q6635696) (← links)
- Parameterized results on acyclic matchings with implications for related problems (Q6655671) (← links)
