On the parameterized complexity of some optimization problems related to multiple-interval graphs (Q606990): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 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.1016/j.tcs.2010.09.001 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1993342383 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree loop graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonoverlapping local alignments (weighted independent sets of axis-parallel rectangles) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling Split Intervals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards a Dichotomy of Finding Possible Winners in Elections Based on Scoring Rules / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar Capacitated Dominating Set Is W[1]-Hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximal Strip Recovery Problem with Gaps: Hardness and Approximation Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2934605 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On recovering syntenic blocks from comparative maps / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the 2-interval pattern problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Parameterized Complexity of the Rectangle Stabbing Problem and Its Variants / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Complexity of Stabbing Rectangles and Squares in the Plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4393480 / rank
 
Normal rank
Property / cites work
 
Property / cites work: What Makes Equitable Connected Partition Easy / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the parameterized complexity of multiple-interval graph problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Restrictions of Balanced 2-Interval Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paths of Bounded Length and Their Cuts: Parameterized Complexity and Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic graph theory and perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extremal values of the interval number of a graph, II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extremal Values of the Interval Number of a Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3838186 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inapproximability of Maximal Strip Recovery: II / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Parameterized Complexity of Some Optimization Problems Related to Multiple-Interval Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognizing d-Interval Graphs and d-Track Interval Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Determining DNA sequence similarity using maximum independent set algorithms for interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constant ratio fixed-parameter approximation of the edge multicut problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On double and multiple interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the computational complexity of 2-interval pattern matching problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Tractability of Maximal Strip Recovery / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognizing graphs with fixed interval number is NP-complete / rank
 
Normal rank

Latest revision as of 11:28, 3 July 2024

scientific article
Language Label Description Also known as
English
On the parameterized complexity of some optimization problems related to multiple-interval graphs
scientific article

    Statements

    On the parameterized complexity of some optimization problems related to multiple-interval graphs (English)
    0 references
    19 November 2010
    0 references
    computational complexity
    0 references
    geometric intersection graph
    0 references
    bioinformatics
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references