---
author:
- 'Ivan Bliznets [^1]'
- 'Fedor V. Fomin [^2]'
- 'Marcin Pilipczuk [^3]'
- 'Michał Pilipczuk [^4]'
bibliography:
- '../completion.bib'
title: |
    A subexponential parameterized algorithm for\
    <span style="font-variant:small-caps;">Interval Completion</span>[^5]
---

Introduction {#sec:intro}
============

Preliminaries {#sec:prelims}
=============

Overview of the algorithm {#sec:overview}
=========================

Modules and neighborhood classes {#sec:neighbors}
================================

Listing potential maximal cliques and sections {#sec:pmc}
==============================================

Guessing fill-in edges with fixed endpoint {#sec:fill-in}
==========================================

Small-separation lemma {#sec:left-right}
======================

Dynamic programming {#sec:dp}
===================

Conclusions {#sec:conc}
===========

Appendix {#sec:boring .unnumbered}
========

[^1]: St. Petersburg Academic University of the Russian Academy of Sciences, Russia, `ivanbliznets@tut.by`.

[^2]: Department of Informatics, University of Bergen, Norway, `fomin@ii.uib.no`.

[^3]: Department of Computer Science, University of Warwick, United Kingdom, `M.Pilipczuk@dcs.warwick.ac.uk`.

[^4]: Faculty of Mathematics, Computer Science, and Mechanics, University of Warsaw, Poland, `michal.pilipczuk@mimuw.edu.pl`.

[^5]: The research leading to these results has received funding from the European Research Council under the European Union’s Seventh Framework Programme (FP/2007-2013) / ERC Grant Agreement n. 267959
