scientific article; zbMATH DE number 7378721
From MaRDI portal
Publication:5009615
DOI10.4230/LIPIcs.ESA.2018.51MaRDI QIDQ5009615
Christian Komusiewicz, Erik Jan van Leeuwen, Manuel Sorge, Iyad A. Kanj
Publication date: 4 August 2021
Full work available at URL: https://arxiv.org/abs/1808.08772
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Unnamed Item ⋮ Solving Partition Problems Almost Always Requires Pushing Many Vertices Around ⋮ Approximation algorithms for the maximally balanced connected graph tripartition problem
Cites Work
- Fundamentals of parameterized complexity
- More about subcolorings
- The complexity of partitioning into disjoint cliques and a triangle-free graph
- Infeasibility of instance compression and succinct PCPs for NP
- Solving partition problems with colour-bipartitions
- On the parameterized complexity of multiple-interval graph problems
- About recognizing (\(\alpha\) ,\(\beta\) ) classes of polar graphs
- The complexity of \(G\)-free colourability
- Subcolorings and the subchromatic number of a graph
- Parameterized algorithms for recognizing monopolar and 2-subcolorable graphs
- Vertex-partitioning into fixed additive induced-hereditary properties is NP-hard
- Partitioning a graph into disjoint cliques and a triangle-free graph
- Complexity and algorithms for recognizing polar and monopolar graphs
- Graph Theory
- On the computational complexity of (O,P)-partition problems
- Graph Subcolorings: Complexity and Algorithms
- Parameterized Algorithms on Perfect Graphs for Deletion to (r,l)-Graphs
- Kernelization Lower Bounds by Cross-Composition
- On the Polarity and Monopolarity of Graphs
- On 2-Subcolourings of Chordal Graphs
- Parameterized Algorithms
- Unnamed Item
