Pages that link to "Item:Q2891355"
From MaRDI portal
The following pages link to Twin-Cover: Beyond Vertex Cover in Parameterized Algorithmics (Q2891355):
Displaying 22 items.
- Structural parameterizations for boxicity (Q289935) (← links)
- Between treewidth and clique-width (Q300479) (← links)
- Kernelization using structural parameters on sparse graph classes (Q340583) (← links)
- Preprocessing subgraph and minor problems: when does a small vertex cover help? (Q386050) (← links)
- Practical algorithms for MSO model-checking on tree-decomposable graphs (Q473216) (← links)
- Refined notions of parameterized enumeration kernels with applications to matching cut enumeration (Q2237892) (← links)
- Computing the chromatic number using graph decompositions via matrix rank (Q2330132) (← links)
- The graph motif problem parameterized by the structure of the input graph (Q2403795) (← links)
- Complexity and approximability of parameterized MAX-CSPs (Q2408203) (← links)
- Open Problems on Graph Coloring for Special Graph Classes (Q2827799) (← links)
- Between Treewidth and Clique-Width (Q2945207) (← links)
- (Q5002765) (← links)
- Computing the Chromatic Number Using Graph Decompositions via Matrix Rank (Q5009610) (← links)
- Algorithmic Applications of Tree-Cut Width (Q5048301) (← links)
- Target Set Selection in Dense Graph Classes (Q5062113) (← links)
- (Q5092394) (← links)
- (Q5111886) (← links)
- Graph Motif Problems Parameterized by Dual (Q5119384) (← links)
- Finer Tight Bounds for Coloring on Clique-Width (Q5130905) (← links)
- Exploring the gap between treedepth and vertex cover through vertex integrity (Q5918674) (← links)
- Imbalance parameterized by twin cover revisited (Q5925526) (← links)
- Extended MSO model checking via small vertex integrity (Q6185940) (← links)
