DOCSLIB.ORG
Explore
Sign Up
Log In
Upload
Search
Home
» Tags
» Parameterized complexity
Parameterized complexity
Fixed-Parameter Tractability Marko Samer and Stefan Szeider
Introduction to Parameterized Complexity
Exploiting C-Closure in Kernelization Algorithms for Graph Problems
Lower Bounds Based on the Exponential Time Hypothesis
12. Exponential Time Hypothesis COMP6741: Parameterized and Exact Computation
On Miniaturized Problems in Parameterized Complexity Theory
Exact Complexity and Satisfiability
Parameterized Approximation of Dominating Set Problems
Fixed-Parameter Tractability and Parameterized Complexity, Applied to Problems from Computational Social Choice — Mathematical Programming Glossary Supplement —
Implications of the Exponential Time Hypothesis
On the Parameterized Complexity of [1, J]-Domination Problems
Lecture Beyond Planar Graphs 1 Overview 2 Preliminaries
An Introduction to Parameterized Complexity and Algorithms Part 2 65
Parameterized Complexity of Optimal Planning: a Detailed Map
Parameterized Complexity of Safe Set⋆
Parameterized Reductions
Parameterized Complexity of Independence and Domination on Geometric Graphs
New Methods in Parameterized Algorithms and Complexity
Top View
Introduction + Bidimensionality Theory
Geometric Separation and Exact Solutions for the Parameterized Independent Set Problem on Disk Graphs {Extended Abstract)
The Parameterized Complexity of Counting Problems
Scribe Notes for ”Parameterized Complexity of Problems in Coalition Resource Games”
Parameterized Complexity and Approximation Algorithms
Solving Minones-2-Sat As Fast As Vertex Cover
The Exponential Time Hypothesis and the Parameterized Clique Problem
Bidimensionality and Parameterized Algorithms∗
Parameterized Complexity, Postive Techniques, Kernelization
Almost 2-SAT Is Fixed-Parameter Tractable (Extended Abstract)
October 21, 2014 1 Overview 2 Exponential Time Hypothesis
Exponential Speed- up for Planar Graph Problems
Parameterized Complexity of Finding Subgraphs with Hereditary Properties?
Bidimensionality and Kernels Name: Daniel Lokshtanov1 Affil./Addr
On the Parameterized Complexity of Approximating Dominating Set
Geometric Separation and Exact Solutions for the Parameterized Independent Set Problem on Disk Graphs
Fun with Parameterized Complexity
Planar Capacitated Dominating Set Is W[1]-Hard
Sebastian Ordyniak Introduction
Beyond Bidimensionality: Parameterized Subexponential Algorithms on Directed Graphs
Tight Lower Bounds for Certain Parameterized NP-Hard Problems
A Multistage View on 2-Satisfiability
The Parameterized Complexity of Global Constraints∗
Phase Transitions and Complexity of Weighted Satisfiability and Other
Faster Exact Algorithms for Hard Problems: a Parameterized Point Of
Parameterized Distributed Complexity Theory: a Logical Approach
Parameterized Complexity of 1-Planarity Arxiv:1304.5591V1 [Cs
Parameterized Complexity
Kernelization – Preprocessing with a Guarantee (For the 60Th Birthday of Prof
Parameterized Complexity
On Hardness of Approximating the Parameterized Clique Problem
Complexity and Approximability of Parameterized MAX-Csps
Parameterized Complexity - an Overview
Parameterized Complexity Classes Beyond Para-NP
Exponential Time Complexity of the Permanent and the Tutte Polynomial∗
A Parameterized Complexity Tutorial
1 Final Notes on K-Path 2 Parameterized Complexity
Parameterized Complexity of Safe Set
Parameterized Complexity of 1-Planarity
Bidimensionality and Parameterized Algorithms∗
Parameterized Algorithms for the Matrix Completion Problem
On the Space Complexity of Parameterized Problems∗
Parameterized Complexity Theory – Hardness
Parameterized Complexity Theory and Its Applications to Social Choice
On the Parameterized Complexity of Clique Elimination Distance Akanksha Agrawal Indian Institute of Technology Madras, Chennai, India
[email protected]
M
The Computational Complexity Column by V