Triangulating 3-colored graphs
SIAM Journal on Discrete Mathematics
Chordal completions of planar graphs
Journal of Combinatorial Theory Series B
Journal of Algorithms
Fixed-parameter tractability of graph modification problems for hereditary properties
Information Processing Letters
Constructing evolutionary trees in the presence of polymorphic characters
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
On treewidth and minimum fill-in of asteroidal triple-free graphs
Ordal'94 Selected papers from the conference on Orders, algorithms and applications
A polynomial approximation algorithm for the minimum fill-in problem
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
On the Desirability of Acyclic Database Schemes
Journal of the ACM (JACM)
Theoretical Computer Science
Listing all potential maximal cliques of a graph
Theoretical Computer Science
Which problems have strongly exponential complexity?
Journal of Computer and System Sciences
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Treewidth and Minimum Fill-in: Grouping the Minimal Separators
SIAM Journal on Computing
A Polynomial Approximation Algorithm for the Minimum Fill-In Problem
SIAM Journal on Computing
Triangulation of Bayesian Networks: A Relational Database Perspective
TSCTC '02 Proceedings of the Third International Conference on Rough Sets and Current Trends in Computing
Two Strikes Against Perfect Phylogeny
ICALP '92 Proceedings of the 19th International Colloquium on Automata, Languages and Programming
Subexponential parameterized algorithms on bounded-genus graphs and H-minor-free graphs
Journal of the ACM (JACM)
Computing Minimal Triangulations in Time O(n\alpha \log n) = o(n2.376)
SIAM Journal on Discrete Mathematics
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
Direct Methods for Sparse Linear Systems (Fundamentals of Algorithms 2)
Direct Methods for Sparse Linear Systems (Fundamentals of Algorithms 2)
Interval completion with few edges
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Nestedness and segmented nestedness
Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining
SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science
Exact Algorithms for Treewidth and Minimum Fill-In
SIAM Journal on Computing
Treewidth Computation and Extremal Combinatorics
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part I
Approximating the Minimum Chain Completion problem
Information Processing Letters
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
A Deterministic Subexponential Algorithm for Solving Parity Games
SIAM Journal on Computing
Interval Completion Is Fixed Parameter Tractable
SIAM Journal on Computing
Exact Exponential Algorithms
Faster Parameterized Algorithms for Minimum Fill-in
Algorithmica
Parameterized Complexity
What's next? future directions in parameterized complexity
The Multivariate Algorithmic Revolution and Beyond
Faster parameterized algorithms for deletion to split graphs
SWAT'12 Proceedings of the 13th Scandinavian conference on Algorithm Theory
Reducing problems in unrooted tree compatibility to restricted triangulations of intersection graphs
WABI'12 Proceedings of the 12th international conference on Algorithms in Bioinformatics
| Hi-index | 0.00 |
The Minimum Fill-in problem is to decide if a graph can be triangulated by adding at most k edges. Kaplan, Shamir, and Tarjan [FOCS 1994] have shown that the problem is solvable in time O(2O(k) + k2nm) on graphs with n vertices and m edges and thus is fixed parameter tractable. Here, we give the first subexponential parameterizedv algorithm solving Minimum Fill-in in time [EQUATION]. This substantially lowers the complexity of the problem. Techniques developed for Minimum Fill-in can be used to obtain subexponential parameterized algorithms for several related problems including Minimum Chain Completion, Chordal Graph Sandwich, and Triangulating Colored Graph.