scientific article
From MaRDI portal
Publication:3304104
DOI10.4230/LIPICS.STACS.2018.10zbMath1487.68134arXiv1801.03879MaRDI QIDQ3304104
Michael Lampis, Rémy Belmonte, Valia Mitsou
Publication date: 5 August 2020
Full work available at URL: https://arxiv.org/abs/1801.03879
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25) Parameterized complexity, tractability and kernelization (68Q27)
Related Items (4)
Grundy Distinguishes Treewidth from Pathwidth ⋮ Degree-constrained 2-partitions of graphs ⋮ Unnamed Item ⋮ On fixed-order book thickness parameterized by the pathwidth of the vertex ordering
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Fundamentals of parameterized complexity
- On 1-improper 2-coloring of sparse graphs
- Improper coloring of sparse graphs with a given girth. I: \((0,1)\)-colorings of triangle-free graphs
- On minimal triangle-free graphs with prescribed \(k\)-defective chromatic number
- On the complexity of some colorful problems parameterized by treewidth
- Bounds and fixed-parameter algorithms for weighted improper coloring
- Extremal results on defective colorings of graphs
- Which problems have strongly exponential complexity?
- Algorithmic meta-theorems for restrictions of treewidth
- Weighted improper colouring
- Linear time solvable optimization problems on graphs of bounded clique-width
- Directed weighted improper coloring for cellular channel allocation
- Vertex coloring edge-weighted digraphs
- Parametrized complexity theory.
- Tree-depth, subgraph coloring and homomorphism bounds
- Improper Coloring of Sparse Graphs with a Given Girth, II: Constructions
- Parameterized Algorithms for Modular-Width
- Vertex-Coloring with Defects
- Improper coloring of unit disk graphs
- IMPROPER COLORING OF WEIGHTED GRID AND HEXAGONAL GRAPHS
- Defective coloring revisited
- Parameterized Power Vertex Cover
- Fractional, Circular, and Defective Coloring of Series-Parallel Graphs
- The t-Improper Chromatic Number of Random Graphs
- Defective colorings of graphs in surfaces: Partitions into subgraphs of bounded valency
- A note on defective colorings of graphs in surfaces
- Parallel Algorithms with Optimal Speedup for Bounded Treewidth
- Parameterized Approximation Schemes Using Graph Widths
- Improper choosability of graphs and maximum average degree
- Parameterized Algorithms
This page was built for publication:
