# A Subexponential Parameterized Algorithm for Proper Interval Completion

@article{Bliznets2014ASP,
title={A Subexponential Parameterized Algorithm for Proper Interval Completion},
author={Ivan Bliznets and F. Fomin and Marcin Pilipczuk and Michal Pilipczuk},
journal={ArXiv},
year={2014},
volume={abs/1402.3472}
}
In the Proper Interval Completion problem we are given a graph G and an integer k, and the task is to turn G using at most k edge additions into a proper interval graph, i.e., a graph admitting an intersection model of equal-length intervals on a line. The study of Proper Interval Completion from the viewpoint of parameterized complexity has been initiated by Kaplan, Shamir and Tarjan [FOCS 1994; SIAM J. Comput. 1999], who showed an algorithm for the problem working in \(\mathcal{O}(16^k\cdot… Expand
29 Citations

#### References

SHOWING 1-10 OF 36 REFERENCES