The Profile Minimization Problem in Trees
SIAM Journal on Computing
Fixed-parameter tractability of graph modification problems for hereditary properties
Information Processing Letters
SIAM Journal on Discrete Mathematics
Computer Solution of Large Sparse Positive Definite
Computer Solution of Large Sparse Positive Definite
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Certifying algorithms for recognizing interval graphs and permutation graphs
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Ordering Problems Approximated: Single-Processor Scheduling and Interval Graph Completion
ICALP '91 Proceedings of the 18th International Colloquium on Automata, Languages and Programming
Divide-and-conquer approximation algorithms via spreading metrics
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)
Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)
New Approximation Techniques for Some Linear Ordering Problems
SIAM Journal on Computing
Computing minimal triangulations in time O(nα log n) = o(n2.376)
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Fixed-parameter complexity of minimum profile problems
IWPEC'06 Proceedings of the Second international conference on Parameterized and Exact Computation
Parameterized Complexity
Minimum Leaf Out-Branching Problems
AAIM '08 Proceedings of the 4th international conference on Algorithmic Aspects in Information and Management
Characterizing and Computing Minimal Cograph Completions
FAW '08 Proceedings of the 2nd annual international workshop on Frontiers in Algorithmics
Parameterizing above or below guaranteed values
Journal of Computer and System Sciences
Linear-time certifying recognition algorithms and forbidden induced subgraphs
Nordic Journal of Computing
Dynamically maintaining split graphs
Discrete Applied Mathematics
Minimum leaf out-branching and related problems
Theoretical Computer Science
Minimum fill-in and treewidth of split+ke and split+kv graphs
Discrete Applied Mathematics
Characterizing and computing minimal cograph completions
Discrete Applied Mathematics
Minimum fill-in and treewidth of split+ke and split+kv graphs
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Wheel-free deletion is W[2]-hard
IWPEC'08 Proceedings of the 3rd international conference on Parameterized and exact computation
Solving MAX-r-SAT above a tight lower bound
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Subexponential parameterized algorithm for minimum fill-in
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Planar disjoint-paths completion
IPEC'11 Proceedings of the 6th international conference on Parameterized and Exact Computation
Hi-index | 0.00 |
We present an algorithm with runtime O(k(2k)n3 * m) for the following NP-complete problem: Given an arbitrary graph G on n vertices and m edges, can we obtain an interval graph by adding at most k new edges to G? This resolves the long-standing open question, first posed by Kaplan, Shamir and Tarjan, of whether this problem could be solved in time f(k) * n(O(1)).The problem has applications in Physical Mapping of DNA and in Profile Minimization for Sparse Matrix Computations. For the first application, our results show tractability for the case of a small number k of false negative errors, and for the second, a small number k of zero elements in the envelope. Our algorithm performs bounded search among possible ways of adding edges to a graph to obtain an interval graph, and combines this with a greedy algorithm when graphs of a certain structure are reached by the search. The presented result is surprising, as it was not believed that a bounded search tree algorithm would suffice to answer the open question affirmatively.