Kick the cliques

DOI10.4230/LIPICS.IPEC.2024.13MaRDI QIDQ7255449zbMATH OpenFDO

Authors Gaétan Berthe, Marin Bougeret, Daniel Gonçalves, Jean-Florent Raymond

Publication date 29 May 2026

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.IPEC.2024.13

zbMATH Keywords

geometric intersection graphssubexponential FPT algorithmsimplicit hitting set problems

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Algorithms in computer science (68Wxx) Parameterized complexity, tractability and kernelization (68Q27)

Cites work

• scientific article; zbMATH DE number 3865318 (Why is no real title available?)
• scientific article; zbMATH DE number 6783430 (Why is no real title available?)
• A Separator Theorem for Nonplanar Graphs
• An extremal function for contractions of graphs
• Arboricity and Subgraph Listing Algorithms
• Faster algorithms for cycle hitting problems on disk graphs
• Map graphs
• On the complexity of k-SAT
• On the maximum number of cliques in a graph
• Separators in region intersection graphs
• Subexponential Parameterized algorithms on disk graphs (extended abstract)
• Subexponential algorithms in geometric graphs via the subquadratic grid minor property: the role of local radius
• Subexponential parameterized algorithms on bounded-genus graphs and H-minor-free graphs
• The node-deletion problem for hereditary properties is NP-complete
• Treewidth of graphs with balanced separations

This page was built for publication: Kick the cliques

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7255449)