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

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

Latest revision as of 05:31, 13 November 2024

scientific article; zbMATH DE number 6502408
Language Label Description Also known as
English
A Subexponential Parameterized Algorithm for Proper Interval Completion
scientific article; zbMATH DE number 6502408

    Statements

    A Subexponential Parameterized Algorithm for Proper Interval Completion (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    30 October 2015
    0 references
    fixed-parameter tractability
    0 references
    proper interval graphs
    0 references
    proper interval completion
    0 references
    subexponential algorithm
    0 references

    Identifiers