A Subexponential Parameterized Algorithm for Proper Interval Completion (Q5899484): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / Wikidata QID @@
+Q60488386
@@ Property / Wikidata QID: Q60488386 / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1137/140988565
@@ Property / full work available at URL: https://doi.org/10.1137/140988565 / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2234496216
@@ Property / OpenAlex ID: W2234496216 / rank @@
+Normal rank
@@ Property / cites work @@
+Fast FAST
@@ Property / cites work: Fast FAST / rank @@
+Normal rank
@@ Property / cites work @@
+Polynomial kernels for proper interval completion and related problems
+Normal rank
@@ Property / cites work @@
+A Subexponential Parameterized Algorithm for Proper Interval Completion
+Normal rank
@@ Property / cites work @@
+Fixed-parameter tractability of graph modification problems for hereditary properties
+Normal rank
@@ Property / cites work @@
+Subexponential parameterized algorithms on bounded-genus graphs and             <i>H</i>             -minor-free graphs
+Normal rank
@@ Property / cites work @@
+Q2965491
@@ Property / cites work: Q2965491 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2721963
@@ Property / cites work: Q2721963 / rank @@
+Normal rank
@@ Property / cites work @@
+Subexponential Parameterized Algorithm for Minimum Fill-In
+Normal rank
@@ Property / cites work @@
+Faster parameterized algorithms for deletion to split graphs
+Normal rank
@@ Property / cites work @@
+Q3328583
@@ Property / cites work: Q3328583 / rank @@
+Normal rank
@@ Property / cites work @@
+Which problems have strongly exponential complexity?
+Normal rank
@@ Property / cites work @@
+Tractability of Parameterized Completion Problems on Chordal, Strongly Chordal, and Proper Interval Graphs
+Normal rank
@@ Property / cites work @@
+Two edge modification problems without polynomial kernels
+Normal rank
@@ Property / cites work @@
+An effective branching strategy based on structural relationship among multiple forbidden induced subgraphs
+Normal rank
@@ Property / cites work @@
+Optimal greedy algorithms for indifference graphs
@@ Property / cites work: Optimal greedy algorithms for indifference graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q5588432
@@ Property / cites work: Q5588432 / rank @@
+Normal rank
@@ Property / cites work @@
+Interval Completion Is Fixed Parameter Tractable
@@ Property / cites work: Interval Completion Is Fixed Parameter Tractable / rank @@
+Normal rank
@@ Property / cites work @@
+Computing the Minimum Fill-In is NP-Complete
@@ Property / cites work: Computing the Minimum Fill-In is NP-Complete / rank @@
+Normal rank
@@ Property / DBLP publication ID @@
+journals/siamdm/BliznetsFPP15
@@ Property / DBLP publication ID: journals/siamdm/BliznetsFPP15 / rank @@
+Normal rank