A theory of diagnosis from first principles
Artificial Intelligence
On generating all maximal independent sets
Information Processing Letters
SIAM Journal on Computing
Identifying the Minimal Transversals of a Hypergraph and Related Problems
SIAM Journal on Computing
On the complexity of dualization of monotone disjunctive normal forms
Journal of Algorithms
A Fast Algorithm for the Computation and Enumeration of Perfect Phylogenies
SIAM Journal on Computing
New methods for 3-SAT decision and worst-case analysis
Theoretical Computer Science
Reconstructing the evolutionary history of natural languages
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Vertex cover: further observations and further improvements
Journal of Algorithms
Hypergraph Transversal Computation and Related Problems in Logic and AI
JELIA '02 Proceedings of the European Conference on Logics in Artificial Intelligence
COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
Minimum Quartet Inconsistency Is Fixed Parameter Tractable
CPM '01 Proceedings of the 12th Annual Symposium on Combinatorial Pattern Matching
Two Strikes Against Perfect Phylogeny
ICALP '92 Proceedings of the 19th International Colloquium on Automata, Languages and Programming
On the Generality of Phylogenies from Incomplete Directed Characters
SWAT '02 Proceedings of the 8th Scandinavian Workshop on Algorithm Theory
A Polynomial-Time Algorithm for Near-Perfect Phylogeny
SIAM Journal on Computing
An efficient fixed-parameter algorithm for 3-hitting set
Journal of Discrete Algorithms
Perfect phylogeny and haplotype assignment
RECOMB '04 Proceedings of the eighth annual international conference on Resaerch in computational molecular biology
Exact algorithms for finding minimum transversals in rank-3 hypergraphs
Journal of Algorithms
Upper bounds for vertex cover further improved
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Parameterized Complexity
Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization
Journal of Computer and System Sciences
Invitation to data reduction and problem kernelization
ACM SIGACT News
On the fixed-parameter tractability of the equivalence test of monotone normal forms
Information Processing Letters
Computational aspects of monotone dualization: A brief survey
Discrete Applied Mathematics
Lower bounds for three algorithms for transversal hypergraph generation
Discrete Applied Mathematics
Vertex and edge covers with clustering properties: Complexity and algorithms
Journal of Discrete Algorithms
Isolation concepts for efficiently enumerating dense subgraphs
Theoretical Computer Science
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
Lower bounds for three algorithms for the transversal hypergraph generation
WG'07 Proceedings of the 33rd international conference on Graph-theoretic concepts in computer science
Competitive group testing and learning hidden vertex covers with minimum adaptivity
FCT'09 Proceedings of the 17th international conference on Fundamentals of computation theory
Some fixed-parameter tractable classes of hypergraph duality and related problems
IWPEC'08 Proceedings of the 3rd international conference on Parameterized and exact computation
Fixed-parameter tractable generalizations of cluster editing
CIAC'06 Proceedings of the 6th Italian conference on Algorithms and Complexity
On the fixed-parameter enumerability of cluster editing
WG'05 Proceedings of the 31st international conference on Graph-Theoretic Concepts in Computer Science
IPEC'11 Proceedings of the 6th international conference on Parameterized and Exact Computation
Parameterized reductions and algorithms for a graph editing problem that generalizes vertex cover
Theoretical Computer Science
Estimating entity importance via counting set covers
Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining
Efficient parameterized preprocessing for cluster editing
FCT'07 Proceedings of the 16th international conference on Fundamentals of Computation Theory
Isolation concepts for enumerating dense subgraphs
COCOON'07 Proceedings of the 13th annual international conference on Computing and Combinatorics
A polynomial kernel for proper interval vertex deletion
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
Theoretical Computer Science
| Hi-index | 0.00 |
We study parameterized enumeration problems where we are interested in all solutions of limited size rather than just some solution of minimum cardinality. (Actually, we have to enumerate the inclusion-minimal solutions in order to get fixed-parameter tractable (FPT) results.) Two novel concepts are the notion of a full kernel that contains all small solutions and implicit enumeration of solutions in form of compressed descriptions. In particular, we study combinatorial and computational bounds for the transversal hypergraph (vertex covers in graphs is a special case), restricted to hyperedges with at most k elements. As an example, we apply the results and further special-purpose techniques to almost-perfect phylogeny reconstruction, a problem in computational biology.