The following publications are possibly variants of this publication:
- Subexponential Parameterized Algorithm for Interval CompletionIvan Bliznets, Fedor V. Fomin, Marcin Pilipczuk, Michal Pilipczuk. TALG, 14(3), 2018. [doi]
- A Subexponential Parameterized Algorithm for Proper Interval CompletionIvan Bliznets, Fedor V. Fomin, Marcin Pilipczuk, Michal Pilipczuk. esa 2014: 173-184 [doi]
- A Subexponential Parameterized Algorithm for Proper Interval CompletionIvan Bliznets, Fedor V. Fomin, Marcin Pilipczuk, Michal Pilipczuk. siamdm, 29(4):1961-1987, 2015. [doi]
- Subexponential Parameterized AlgorithmsFrederic Dorn, Fedor V. Fomin, Dimitrios M. Thilikos. icalp 2007: 15-27 [doi]
- Subexponential parameterized algorithmsFrederic Dorn, Fedor V. Fomin, Dimitrios M. Thilikos. csr, 2(1):29-39, 2008. [doi]
- Exploring Subexponential Parameterized Complexity of Completion ProblemsPål Grønås Drange, Fedor V. Fomin, Michal Pilipczuk, Yngve Villanger. STACS 2014: 288-299 [doi]
- Subexponential parameterized algorithm for minimum fill-inFedor V. Fomin, Yngve Villanger. soda 2012: 1737-1746 [doi]
- Subexponential Parameterized Algorithm for Minimum Fill-InFedor V. Fomin, Yngve Villanger. SICOMP, 42(6):2197-2216, 2013. [doi]
- Subexponential Parameterized Algorithms and Kernelization on Almost Chordal GraphsFedor V. Fomin, Petr A. Golovach. esa 2020: [doi]