A Subexponential Parameterized Algorithm for Proper Interval Completion

DOI10.1007/978-3-662-44777-2_15zbMath1330.68101arXiv1402.3472OpenAlexW1881622208WikidataQ56267427 ScholiaQ56267427MaRDI QIDQ5891808

Fedor V. Fomin, Marcin Pilipczuk, Michał Pilipczuk, Ivan A. Bliznets

Publication date: 8 October 2014

Published in: Algorithms - ESA 2014 (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1402.3472

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph algorithms (graph-theoretic aspects) (05C85) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (max. 100)

Paths to Trees and Cacti ⋮ A Subexponential Parameterized Algorithm for Proper Interval Completion ⋮ Polynomial Kernelization for Removing Induced Claws and Diamonds ⋮ Exploring the Subexponential Complexity of Completion Problems

This page was built for publication: A Subexponential Parameterized Algorithm for Proper Interval Completion