Pages that link to "Item:Q1001898"

The following pages link to On the parameterized complexity of multiple-interval graph problems (Q1001898):

Displaying 50 items.

• Kernel Bounds for Path and Cycle Problems (Q2891344) (← links)
• k-Gap Interval Graphs (Q2894479) (← links)
• Vertex Cover Reconfiguration and Beyond (Q2942651) (← links)
• Parameterized Algorithms for the Independent Set Problem in Some Hereditary Graph Classes (Q3000488) (← links)
• The Min-Power Multicast Problems in Wireless Ad Hoc Networks: A Parameterized View (Q3004665) (← links)
• Multivariate Complexity Analysis of Swap Bribery (Q3058696) (← links)
• Towards a Dichotomy of Finding Possible Winners in Elections Based on Scoring Rules (Q3182918) (← links)
• Designing FPT Algorithms for Cut Problems Using Randomized Contractions (Q3187169) (← links)
• Consensus Patterns (Probably) Has no EPTAS (Q3452789) (← links)
• Structural Parameterizations of the Mixed Chinese Postman Problem (Q3452829) (← links)
• The Parameterized Complexity of the Rectangle Stabbing Problem and Its Variants (Q3507345) (← links)
• Parameterized Complexity of Stabbing Rectangles and Squares in the Plane (Q3605506) (← links)
• Planar Capacitated Dominating Set Is W[1]-Hard (Q3656850) (← links)
• Paths of Bounded Length and Their Cuts: Parameterized Complexity and Algorithms (Q3656863) (← links)
• Deferred-query: An efficient approach for some problems on interval graphs (Q4262690) (← links)
• On the Fixed-Parameter Tractability of Some Matching Problems Under the Color-Spanning Model (Q4632199) (← links)
• Hitting and Piercing Rectangles Induced by a Point Set (Q4925240) (← links)
• (Q5005155) (← links)
• New Results on Directed Edge Dominating Set (Q5005171) (← links)
• (Q5009468) (← links)
• (Q5009483) (← links)
• (Q5009486) (← links)
• (Q5009589) (← links)
• (Q5009615) (← links)
• (Q5015396) (← links)
• Parameterized Complexity of $$(A,\ell )$$-Path Packing (Q5041178) (← links)
• A Parameterized Perspective on Attacking and Defending Elections (Q5041198) (← links)
• Tandem Duplications, Segmental Duplications and Deletions, and Their Applications (Q5042229) (← links)
• On Treewidth and Stable Marriage: Parameterized Algorithms and Hardness Results (Complete Characterization) (Q5062116) (← links)
• Connecting the dots (with minimum crossings) (Q5088932) (← links)
• (Q5090497) (← links)
• On the Parameterized Complexity of [1,j]-Domination Problems (Q5090974) (← links)
• Learning Bayesian Networks Under Sparsity Constraints: A Parameterized Complexity Analysis (Q5094064) (← links)
• Grundy Distinguishes Treewidth from Pathwidth (Q5096586) (← links)
• The Dominating Set Problem in Geometric Intersection Graphs (Q5111873) (← links)
• Graph Motif Problems Parameterized by Dual (Q5119384) (← links)
• Solving Partition Problems Almost Always Requires Pushing Many Vertices Around (Q5220192) (← links)
• Assessing the Computational Complexity of Multi-layer Subgraph Detection (Q5283362) (← links)
• Perfect domination and small cycles (Q5367522) (← links)
• Parameterized Complexity of Directed Steiner Network with Respect to Shared Vertices and Arcs (Q5384532) (← links)
• On the Parameterized Complexity for Token Jumping on Graphs (Q5410654) (← links)
• (Q5874480) (← links)
• When can graph hyperbolicity be computed in linear time? (Q5915992) (← links)
• On Weisfeiler-Leman invariance: subgraph counts and related graph properties (Q5918849) (← links)
• The complexity of tree partitioning (Q5918926) (← links)
• On the tractability of covering a graph with 2-clubs (Q5925691) (← links)
• Hardness results for stable exchange problems (Q5965780) (← links)
• Temporal interval cliques and independent sets (Q6039892) (← links)
• (Q6065468) (← links)
• Parameterized algorithms and data reduction for the short secluded <i>s</i>‐<i>t</i>‐path problem (Q6068532) (← links)