The following pages link to (Q3455032):
Displaying 26 items.
- Local linear set on graphs with bounded twin cover number (Q2032157) (← links)
- Measuring what matters: a hybrid approach to dynamic programming with treewidth (Q2040028) (← links)
- Coloring a dominating set without conflicts: \(q\)-subset square coloring (Q2097209) (← links)
- Parameterized algorithms for book embedding problems (Q2206870) (← links)
- Computing \(L(p, 1)\)-labeling with combined parameters (Q2232248) (← links)
- Refined notions of parameterized enumeration kernels with applications to matching cut enumeration (Q2237892) (← links)
- Optimal data reduction for graph coloring using low-degree polynomials (Q2272594) (← links)
- Partitioning graphs into induced subgraphs (Q2283104) (← links)
- Computing the largest bond and the maximum connected cut of a graph (Q2663713) (← links)
- Computing densest \(k\)-subgraph with structural parameters (Q2680362) (← links)
- Vertex cover: Further observations and further improvements (Q2775891) (← links)
- On Structural Parameterizations of Graph Motif and Chromatic Number (Q2971640) (← links)
- (Q4625695) (← links)
- Computing L(p,1)-Labeling with Combined Parameters (Q5049996) (← links)
- (Q5092394) (← links)
- Parameterized Algorithms for Book Embedding Problems (Q5141644) (← links)
- Subgraph isomorphism on graph classes that exclude a substructure (Q5919029) (← links)
- Parameterized algorithms for the happy set problem (Q5919103) (← links)
- On structural parameterizations of firefighting (Q5920210) (← links)
- Colouring a dominating set without conflicts: \(q\)-subset square colouring (Q6077071) (← links)
- Structural parameterizations for equitable coloring: complexity, FPT algorithms, and kernelization (Q6107887) (← links)
- Grouped domination parameterized by vertex cover, twin cover, and beyond (Q6131196) (← links)
- Offensive alliances in graphs (Q6201327) (← links)
- On Structural Parameterizations of the Harmless Set Problem (Q6492087) (← links)
- Slim tree-cut width (Q6586668) (← links)
- The parameterized complexity of maximum betweenness centrality (Q6636087) (← links)
