Graph algorithms and NP-completeness
Graph algorithms and NP-completeness
Increased Throughput for the Testing and Repair of RAMs with Redundancy
IEEE Transactions on Computers
A partial k-arboretum of graphs with bounded treewidth
Theoretical Computer Science
An efficient exact algorithm for constraint bipartite vertex cover
Journal of Algorithms
Fixed Parameter Algorithms for PLANAR DOMINATING SET and Related Problems
SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
Fast Fixed-Parameter Tractable Algorithms for Nontrivial Generalizations of Vertex Cover
WADS '01 Proceedings of the 7th International Workshop on Algorithms and Data Structures
Parameterized Complexity: Exponential Speed-Up for Planar Graph Problems
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Efficient Generation of Triconnected Plane Triangulations
COCOON '01 Proceedings of the 7th Annual International Conference on Computing and Combinatorics
On Constrained Minimum Vertex Covers of Bipartite Graphs: Improved Algorithms
WG '01 Proceedings of the 27th International Workshop on Graph-Theoretic Concepts in Computer Science
Minimum Quartet Inconsistency Is Fixed Parameter Tractable
CPM '01 Proceedings of the 12th Annual Symposium on Combinatorial Pattern Matching
Efficient Spare Allocation for Reconfigurable Arrays
IEEE Design & Test
Upper bounds for vertex cover further improved
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Approximation Algorithms for Some Parameterized Counting Problems
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
Parameterized enumeration, transversals, and imperfect phylogeny reconstruction
Theoretical Computer Science - Parameterized and exact computation
Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization
Journal of Computer and System Sciences
Crown reductions for the Minimum Weighted Vertex Cover problem
Discrete Applied Mathematics
Constraint Bipartite Vertex Cover Simpler Exact Algorithms and Implementations
FAW '08 Proceedings of the 2nd annual international workshop on Frontiers in Algorithmics
ROMAN DOMINATION: a parameterized perspective
International Journal of Computer Mathematics
The union of minimal hitting sets: Parameterized combinatorial bounds and counting
Journal of Discrete Algorithms
The union of minimal hitting sets: parameterized combinatorial bounds and counting
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
The maximum clique enumeration problem: algorithms, applications and implementations
ISBRA'11 Proceedings of the 7th international conference on Bioinformatics research and applications
Enumerate and expand: improved algorithms for connected vertex cover and tree cover
CSR'06 Proceedings of the First international computer science conference on Theory and Applications
Enumerate and expand: new runtime bounds for vertex cover variants
COCOON'06 Proceedings of the 12th annual international conference on Computing and Combinatorics
On the fixed-parameter enumerability of cluster editing
WG'05 Proceedings of the 31st international conference on Graph-Theoretic Concepts in Computer Science
Parameterized counting algorithms for general graph covering problems
WADS'05 Proceedings of the 9th international conference on Algorithms and Data Structures
Constraint bipartite vertex cover: simpler exact algorithms and implementations
Journal of Combinatorial Optimization
EDGE DOMINATING SET: efficient enumeration-based exact algorithms
IWPEC'06 Proceedings of the Second international conference on Parameterized and Exact Computation
On the effective enumerability of NP problems
IWPEC'06 Proceedings of the Second international conference on Parameterized and Exact Computation
The parameterized complexity of enumerating frequent itemsets
IWPEC'06 Proceedings of the Second international conference on Parameterized and Exact Computation
Isolation concepts for enumerating dense subgraphs
COCOON'07 Proceedings of the 13th annual international conference on Computing and Combinatorics
Parameterized top-K algorithms
Theoretical Computer Science
| Hi-index | 0.00 |
We study several versions of parameterized enumeration. The idea is always to have an algorithm which outputs all solutions (in a certain sense) to a given problem instance. Such an algorithm will be analysed from the viewpoint of parameterized complexity. We show how to apply enumeration techniques in a number of examples. In particular, we give a fixed parameter algorithm for the reconfiguration of faulty chips when providing so-called shared and linked spares.