scientific article
From MaRDI portal
Publication:3455032
zbMath1327.05321MaRDI QIDQ3455032
Publication date: 3 December 2015
Full work available at URL: https://www.dmtcs.org/dmtcs-ojs/index.php/dmtcs/article/view/2378/0.html
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (27)
Computing L(p,1)-Labeling with Combined Parameters ⋮ Computing the largest bond and the maximum connected cut of a graph ⋮ Edge-cut width: an algorithmically driven analogue of treewidth based on edge cuts ⋮ Grouped domination parameterized by vertex cover, twin cover, and beyond ⋮ Structural parameterization of cluster deletion ⋮ Colouring a dominating set without conflicts: \(q\)-subset square colouring ⋮ Computing densest \(k\)-subgraph with structural parameters ⋮ Grouped domination parameterized by vertex cover, twin cover, and beyond ⋮ Structural parameterizations for equitable coloring: complexity, FPT algorithms, and kernelization ⋮ On structural parameterizations of star coloring ⋮ Dominator coloring and CD coloring in almost cluster graphs ⋮ On Structural Parameterizations of Graph Motif and Chromatic Number ⋮ Parameterized algorithms for book embedding problems ⋮ Parameterized Algorithms for Book Embedding Problems ⋮ Computing \(L(p, 1)\)-labeling with combined parameters ⋮ Refined notions of parameterized enumeration kernels with applications to matching cut enumeration ⋮ Parameterized algorithms for the happy set problem ⋮ Optimal data reduction for graph coloring using low-degree polynomials ⋮ Unnamed Item ⋮ Partitioning graphs into induced subgraphs ⋮ Local linear set on graphs with bounded twin cover number ⋮ Measuring what matters: a hybrid approach to dynamic programming with treewidth ⋮ Subgraph isomorphism on graph classes that exclude a substructure ⋮ On structural parameterizations of firefighting ⋮ Unnamed Item ⋮ Coloring a dominating set without conflicts: \(q\)-subset square coloring ⋮ Offensive alliances in graphs
This page was built for publication:
