Q6089666
type: Item
instance of: scholarly article
author: Ashwin Jacob
author: Fahad Panolan
author: Venkatesh Raman
author: Vibha Sahlot
publication date: 2023-11-13T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68Q27
Mathematics Subject Classification ID: 68Wxx
zbMATH DE Number: 7764110
zbMATH Keywords: parameterized complexity
zbMATH Keywords: chordal graph
zbMATH Keywords: tree decomposition
zbMATH Keywords: strong exponential time hypothesis
MaRDI profile type: Publication
cites work: Q5009491
cites work: A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
cites work: Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth
cites work: A \(c^k n\) 5-approximation algorithm for treewidth
cites work: Dominating Sets in Chordal Graphs
cites work: Q4782740
cites work: Unit disk graph recognition is NP-hard
cites work: Chordal editing is fixed-parameter tractable
cites work: Unit disk graphs
cites work: The complexity of generalized clique covering
cites work: On Problems as Hard as CNF-SAT
cites work: Parameterized Algorithms
cites work: On Multiway Cut Parameterized above Lower Bounds
cites work: Q3374865
cites work: Fundamentals of parameterized complexity
cites work: The Complexity Ecology of Parameters: An Illustration Using Bounded Max Leaf Number
cites work: Functional analysis
cites work: Towards fully multivariate algorithmics: parameter ecology and the deconstruction of computational complexity
cites work: Parameterized Single-Exponential Time Polynomial Space Algorithm for Steiner Tree
cites work: Large Induced Subgraphs via Triangulations and CMSO
cites work: Backdoors to Satisfaction
cites work: Algorithmic graph theory and perfect graphs
cites work: A simple linear time algorithm for cograph recognition
cites work: Parameterized complexity of vertex deletion into perfect graph classes
cites work: Vertex cover kernelization revisited. Upper and lower bounds for a refined parameter
cites work: Approximation and Kernelization for Chordal Vertex Deletion
cites work: Erd\H{o}s-P\'osa property of chordless cycles and its applications
cites work: Beyond classes of graphs with ``few'' minimal separators: FPT results through potential maximal cliques
cites work: Faster Parameterized Algorithms Using Linear Programming
cites work: Structural parameterizations of undirected feedback vertex set: FPT algorithms and kernelization
cites work: Polynomial kernels for vertex cover parameterized by small degree modulators
cites work: Algorithm Theory - SWAT 2004
cites work: Robust algorithms for restricted domains
cites work: Graph minors. XIII: The disjoint paths problem
cites work: Efficient graph representations
DOI: 10.4230/LIPICS.IPEC.2020.19
description: scientific article; zbMATH DE number 7764110