scholarly journals Correction to: Parameterized Complexity of Min-Power Asymmetric Connectivity

2021 ◽  
Author(s):  
Matthias Bentert ◽  
Roman Haag ◽  
Christian Hofer ◽  
Tomohiro Koana ◽  
André Nichterlein
Keyword(s):  
Parameterized Complexity

On the Parameterized Complexity of Finding Small Unsatisfiable Subsets of CNF Formulas and CSP Instances

2017 ◽  
Vol 18 (3) ◽  
pp. 1-46
Author(s):  
Ronald De Haan ◽  
Iyad Kanj ◽  
Stefan Szeider
Keyword(s):  
Parameterized Complexity ◽  
Cnf Formulas

Parameterized complexity of fair feedback vertex set problem

2021 ◽  
Vol 867 ◽  
pp. 1-12
Author(s):  
Lawqueen Kanesh ◽  
Soumen Maity ◽  
Komal Muluk ◽  
Saket Saurabh
Keyword(s):  
Parameterized Complexity ◽  
Feedback Vertex Set ◽  
Vertex Set ◽  
Feedback Vertex Set Problem

A compendium of parameterized complexity results

1994 ◽  
Vol 25 (3) ◽  
pp. 122-123 ◽  
Author(s):  
Michael T. Hallett ◽  
H. Todd Wareham
Keyword(s):  
Parameterized Complexity ◽  
Complexity Results

scholarly journals Revisiting the parameterized complexity of Maximum-Duo Preservation String Mapping

2020 ◽  
Vol 847 ◽  
pp. 27-38
Author(s):  
Christian Komusiewicz ◽  
Mateus de Oliveira Oliveira ◽  
Meirav Zehavi
Keyword(s):  
Parameterized Complexity

The Book Review Column1

2021 ◽  
Vol 51 (4) ◽  
pp. 4-5
Author(s):  
Frederic Green
Keyword(s):  
Parameterized Complexity ◽  
Property Testing ◽  
The Third ◽  
Geometric Problems ◽  
The Subject

The three books reviewed in this column are about central ideas in algorithms, complexity, and geometry. The third one brings together topics from the first two by applying techniques of both property testing (the subject of the first book) and parameterized complexity (including its more focused incarnation studied in the second book, kernelization) to geometric problems.

scholarly journals Parameterized complexity for the database theorist

2002 ◽  
Vol 31 (4) ◽  
pp. 86-96 ◽  
Author(s):  
Martin Grohe
Keyword(s):  
Parameterized Complexity

Parameterized complexity of the induced subgraph problem in directed graphs

2007 ◽  
Vol 104 (3) ◽  
pp. 79-85 ◽  
Author(s):  
Venkatesh Raman ◽  
Somnath Sikdar
Keyword(s):  
Parameterized Complexity ◽  
Directed Graphs ◽  
Induced Subgraph

scholarly journals On the induced matching problem in hamiltonian bipartite graphs

2021 ◽  
Vol 0 (0) ◽  
Author(s):  
Yinglei Song
Keyword(s):  
Bipartite Graph ◽  
Parameterized Complexity ◽  
Bipartite Graphs ◽  
Matching Problem ◽  
Induced Matching ◽  
Subexponential Time ◽  
Maximum Induced Matching

Abstract In this paper, we study the parameterized complexity of the induced matching problem in hamiltonian bipartite graphs and the inapproximability of the maximum induced matching problem in hamiltonian bipartite graphs. We show that, given a hamiltonian bipartite graph, the induced matching problem is W[1]-hard and cannot be solved in time n o ⁢ ( k ) {n^{o(\sqrt{k})}} , where n is the number of vertices in the graph, unless the 3SAT problem can be solved in subexponential time. In addition, we show that unless NP = P {\operatorname{NP}=\operatorname{P}} , a maximum induced matching in a hamiltonian bipartite graph cannot be approximated within a ratio of n 1 / 4 - ϵ {n^{1/4-\epsilon}} , where n is the number of vertices in the graph.

Sign in / Sign up

Export Citation Format

Share Document