scientific article; zbMATH DE number 7559420
From MaRDI portal
Publication:5089217
DOI10.4230/LIPIcs.MFCS.2020.49MaRDI QIDQ5089217
Geevarghese Philip, Lars Jaffke, Paloma T. Lima
Publication date: 18 July 2022
Full work available at URL: https://arxiv.org/abs/2005.04733
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Fundamentals of parameterized complexity
- Complexity of clique coloring and related problems
- Clique-transversal sets of line graphs and complements of line graphs
- Perfect graphs of arbitrarily large clique-chromatic number
- Clique-width of graphs defined by one-vertex extensions
- Two-colouring all two-element maximal antichains
- The Grötzsch theorem for the hypergraph of maximal cliques
- Which problems have strongly exponential complexity?
- Upper bounds to the clique width of graphs
- Clique-transversal sets and clique-coloring in planar graphs
- Perfect Graphs with No Balanced Skew-Partition are 2-Clique-Colorable
- Clique-Coloring Circular-Arc Graphs
- Exact Algorithms to Clique-Colour Graphs
- Intractability of Clique-Width Parameterizations
- Clique-coloring some classes of odd-hole-free graphs
- Fourier meets M\"{o}bius: fast subset convolution
- Clique-width III
- Coloring the Maximal Cliques of Graphs
- On the complexity of bicoloring clique hypergraphs of graphs
- On Problems as Hard as CNF-SAT
- Fine-Grained Parameterized Complexity Analysis of Graph Coloring Problems
- Decomposing and Clique‐Coloring (Diamond, Odd‐Hole)‐Free Graphs
- Hardness of Easy Problems: Basing Hardness on Popular Conjectures such as the Strong Exponential Time Hypothesis (Invited Talk)
- Parameterized Algorithms
- Colouring clique-hypergraphs of circulant graphs
- On the complexity of \(k\)-SAT
This page was built for publication:
