Pages that link to "Item:Q1001898"
From MaRDI portal
The following pages link to On the parameterized complexity of multiple-interval graph problems (Q1001898):
Displaying 50 items.
- Parameterized complexity of two-interval pattern problem (Q2067621) (← links)
- Exact multi-covering problems with geometric sets (Q2075389) (← links)
- CNF satisfiability in a subspace and related problems (Q2093572) (← links)
- Parameterized complexity of \((A,\ell)\)-path packing (Q2118381) (← links)
- Length-bounded cuts: proper interval graphs and structural parameters (Q2119399) (← links)
- Graph modification for edge-coloured and signed graph homomorphism problems: parameterized and classical complexity (Q2134740) (← links)
- Parameterized complexity of finding subgraphs with hereditary properties on hereditary graph classes (Q2140500) (← links)
- On the \(k\)-colored rainbow sets in fixed dimensions (Q2150582) (← links)
- Parameterized complexity of minimum membership dominating set (Q2154108) (← links)
- Parameterized complexity of fair deletion problems (Q2174554) (← links)
- On independent set in \(B_1\)-EPG graphs (Q2174555) (← links)
- Parameterized complexity of happy coloring problems (Q2192381) (← links)
- On the tractability of optimization problems on \(H\)-graphs (Q2196605) (← links)
- Parameterized dynamic cluster editing (Q2223691) (← links)
- Dispersing and grouping points on planar segments (Q2232600) (← links)
- Succinct certification of monotone circuits (Q2232601) (← links)
- Constant thresholds can make target set selection tractable (Q2254488) (← links)
- The parameterised complexity of counting connected subgraphs and graph motifs (Q2256721) (← links)
- On the parameterized complexity of \([1,j]\)-domination problems (Q2283043) (← links)
- Mim-width. II. The feedback vertex set problem (Q2285053) (← links)
- Subset feedback vertex set on graphs of bounded independent set size (Q2304562) (← links)
- Stable matchings with covering constraints: a complete computational trichotomy (Q2309466) (← links)
- On some matching problems under the color-spanning model (Q2319899) (← links)
- Parameterized complexity of voter control in multi-peaked elections (Q2322697) (← links)
- The parameterized complexity of the minimum shared edges problem (Q2323342) (← links)
- Inductive \(k\)-independent graphs and \(c\)-colorable subgraphs in scheduling: a review (Q2327955) (← links)
- Mim-width. III. Graph powers and generalized distance domination problems (Q2333800) (← links)
- On structural parameterizations for the 2-club problem (Q2341718) (← links)
- A completeness theory for polynomial (Turing) kernelization (Q2343083) (← links)
- Pure Nash equilibria in graphical games and treewidth (Q2343086) (← links)
- A refined complexity analysis of degree anonymization in graphs (Q2347809) (← links)
- Approximability and parameterized complexity of multicover by \(c\)-intervals (Q2348702) (← links)
- The maximum clique problem in multiple interval graphs (Q2350898) (← links)
- Possible winner problems on partial tournaments: a parameterized study (Q2359793) (← links)
- Parameterized complexity of the MinCCA problem on graphs of bounded decomposability (Q2399617) (← links)
- Parameterized complexity of secluded connectivity problems (Q2408560) (← links)
- Tractability, hardness, and kernelization lower bound for and/or graph solution (Q2410230) (← links)
- The parameterized complexity of stabbing rectangles (Q2428672) (← links)
- Parameterized domination in circle graphs (Q2441539) (← links)
- Parameterized complexity of Eulerian deletion problems (Q2441593) (← links)
- On the complexity of the selective graph coloring problem in some special classes of graphs (Q2453167) (← links)
- A multistage view on 2-satisfiability (Q2692727) (← links)
- Reconfiguration of cliques in a graph (Q2700609) (← links)
- The complexity of routing problems in forbidden-transition graphs and edge-colored graphs (Q2701383) (← links)
- Algorithmic Aspects of Upper Domination: A Parameterised Perspective (Q2830063) (← links)
- Some hard families of parameterized counting problems (Q2832302) (← links)
- Multi-parameter Complexity Analysis for Constrained Size Graph Problems: Using Greediness for Parameterization (Q2867073) (← links)
- On Multiway Cut Parameterized above Lower Bounds (Q2891333) (← links)
- Parameterized Complexity in Multiple-Interval Graphs: Domination (Q2891335) (← links)
- Increasing the Minimum Degree of a Graph by Contractions (Q2891338) (← links)
