# A Subexponential Parameterized Algorithm for Proper Interval Completion

@inproceedings{Bliznets2014ASP,
title={A Subexponential Parameterized Algorithm for Proper Interval Completion},
author={Ivan A. Bliznets and F. Fomin and Marcin Pilipczuk and Michal Pilipczuk},
booktitle={Embedded Systems and Applications},
year={2014}
}
• Published in
Embedded Systems and…
13 February 2014
• Mathematics, Computer Science

## References

SHOWING 1-10 OF 36 REFERENCES

### Subexponential Parameterized Algorithm for Interval Completion

• Mathematics, Computer Science
SODA
• 2016
The first subexponential parameterized algorithm solving Interval Completion in time kO(√k)nO(1) is given, adding IntervalCompletion to a very small list of parameterized graph modification problems solvable in subexp exponential time.

### Exploring Subexponential Parameterized Complexity of Completion Problems

• Mathematics
STACS
• 2014
It is proved that completions into several well studied classes of graphs without long induced cycles also admit parameterized subexponential time algorithms.

### Fast Fast

• Mathematics, Computer Science
ICALP
• 2009
This work presents a randomized subexponential time, polynomial space parameterized algorithm for the k -Weighted Feedback Arc Set in Tournaments (k -FAST ) problem and is the first non-trivial subexp exponential time parameterized algorithms outside the framework of bidimensionality.

### Interval Completion Is Fixed Parameter Tractable

• Computer Science
SIAM J. Comput.
• 2009
An algorithm with runtime O(k^{2k}n^3m) that 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.

### Tractability of Parameterized Completion Problems on Chordal, Strongly Chordal, and Proper Interval Graphs

• Computer Science, Mathematics
SIAM J. Comput.
• 1999
The parameterized complexity of three NP-hard graph completion problems, motivated by molecular biology, is studied and it is shown that the parameterized version of the strongly chordal graph completion problem is FPT by giving an O(ck m log n)-time algorithm for it.

### Subexponential parameterized algorithm for minimum fill-in

• Mathematics
SODA
• 2012
This work gives the first subexponential parameterizedv algorithm solving Minimum Fill-in in time and substantially lowers the complexity of the problem.

### Polynomial kernels for Proper Interval Completion and related problems

• Mathematics
FCT
• 2011
It is proved that a related problem, the so-called Bipartite Chain Deletion problem admits a kernel with O(k2) vertices, completing a previous result of Guo.

### Faster Parameterized Algorithms for Deletion to Split Graphs

• Mathematics, Computer Science
Algorithmica
• 2013
A systematic study of parameterized complexity of the problem of deleting the minimum number of vertices or edges from a given input graph so that the resulting graph is split and an efficient fixed-parameter algorithms and polynomial sized kernels are given.

### Subexponential parameterized algorithms on bounded-genus graphs and H-minor-free graphs

• Mathematics
JACM
• 2005
We introduce a new framework for designing fixed-parameter algorithms with subexponential running time---2O(&kradic;) nO(1). Our results apply to a broad family of graph problems, called

### Subexponential parameterized algorithms on graphs of bounded-genus and H-minor-free graphs

• Mathematics, Computer Science
SODA '04
• 2004
A new framework for designing fixed-parameter algorithms with subexponential running time and a general approach for developing algorithms on H-minor-free graphs, based on structural results about Robertson & Seymour's graph-minors work are introduced.