Improved kernel results for some FPT problems based on simple observations (Q507431): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q1599636
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Jian'er Chen / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2016.06.012 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2425261484 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Crown structures for vertex cover kernelization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Color-coding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge-contraction problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized computational complexity of Dodgson and Young elections / rank
 
Normal rank
Property / cites work
 
Property / cites work: (Meta) Kernelization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Contractibility and NP-completeness / 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: Cluster editing: kernelization based on edge cuts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Domination Problems in Nowhere-Dense Classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4393480 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Parametrized Complexity of Some Fundamental Problems in Coding Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching and weighted \(P_2\)-packing: algorithms and kernels / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomized parameterized algorithms for \(P_2\)-packing and co-path packing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved parameterized algorithms for minimum link-length rectilinear spanning path problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized algorithmics for linear arrangement problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bidimensionality and Geometric Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Complexity for Domination Problems on Degenerate Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-parameter complexity in AI and nonmonotonic reasoning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph-modeled data clustering: Exact algorithms for clique generation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connectivity Is Not a Limit for Kernelization: Planar Connected Dominating Set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Contracting graphs to paths and trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity and parameterized algorithms for cograph editing / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear kernel for a planar connected dominating set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved linear problem kernel for planar connected dominating set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chordal deletion is fixed-parameter tractable / rank
 
Normal rank
Property / cites work
 
Property / cites work: The kernelization complexity of connected domination in graphs with (no) small cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Short cycles make \(W\)-hard problems hard: FPT algorithms for \(W\)-hard problems in graphs with no short cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding odd cycle transversals. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized complexity of control and bribery for \(d\)-approval elections / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar graph vertex partition for linear problem kernels / rank
 
Normal rank
Property / cites work
 
Property / cites work: A practical exact algorithm for the individual haplotyping problem MEC/GI / rank
 
Normal rank
Property / cites work
 
Property / cites work: Radiation hybrid map construction problem parameterized / rank
 
Normal rank

Latest revision as of 09:55, 13 July 2024

scientific article
Language Label Description Also known as
English
Improved kernel results for some FPT problems based on simple observations
scientific article

    Statements

    Improved kernel results for some FPT problems based on simple observations (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    6 February 2017
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    fixed-parameter tractability
    0 references
    NP-hard
    0 references
    kernelization
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references