Twin-Cover: Beyond Vertex Cover in Parameterized Algorithmics (Q2891355): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
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.1007/978-3-642-28050-4_21 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W119394587 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Algorithms for Boxicity / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Kernelization Complexity of Colorful Motifs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3003675 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved upper bounds for vertex cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear time solvable optimization problems on graphs of bounded clique-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: What Makes Equitable Connected Partition Easy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upper and lower bounds for finding connected motifs in vertex-colored graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of some colorful problems parameterized by treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Layout Problems Parameterized by Vertex Cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clique-Width is NP-Complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized complexity of coloring problems: treewidth versus vertex cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Thread Graphs, Linear Rank-Width and Their Algorithmic Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: On parse trees and Myhill-Nerode-type tools for handling graphs of bounded rank-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: A special planar satisfiability problem and a consequence of its NP- completeness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic Meta-theorems for Restrictions of Treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equitable Coloring / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 08:03, 5 July 2024

scientific article
Language Label Description Also known as
English
Twin-Cover: Beyond Vertex Cover in Parameterized Algorithmics
scientific article

    Statements

    Twin-Cover: Beyond Vertex Cover in Parameterized Algorithmics (English)
    0 references
    0 references
    15 June 2012
    0 references

    Identifiers