Pages that link to "Item:Q1001898"

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

Displaying 50 items.

• Parameterized complexity dichotomy for \textsc{Steiner Multicut} (Q295637) (← links)
• On the parameterised complexity of string morphism problems (Q315525) (← links)
• \(\mathrm{H}\)-index manipulation by merging articles: models, theory, and experiments (Q329039) (← links)
• The parameterised complexity of list problems on graphs of bounded treewidth (Q342709) (← links)
• The parameterized complexity of local search for TSP, more refined (Q378245) (← links)
• Increasing the minimum degree of a graph by contractions (Q385061) (← links)
• Parameterized complexity of Min-power multicast problems in wireless ad hoc networks (Q388087) (← links)
• Incremental list coloring of graphs, parameterized by conservation (Q391091) (← links)
• Kernel bounds for path and cycle problems (Q392032) (← links)
• Optimization problems in dotted interval graphs (Q400519) (← links)
• Parameterized complexity of finding small degree-constrained subgraphs (Q414424) (← links)
• Editing graphs to satisfy degree constraints: a parameterized approach (Q414866) (← links)
• Enumerating homomorphisms (Q414933) (← links)
• Parameterized complexity of the weighted independent set problem beyond graphs of bounded clique number (Q450563) (← links)
• Paths of bounded length and their cuts: parameterized complexity and algorithms (Q456699) (← links)
• Treewidth governs the complexity of target set selection (Q456700) (← links)
• Parameterized complexity of three edge contraction problems with degree constraints (Q471188) (← links)
• Parameterized complexity of induced graph matching on claw-free graphs (Q487013) (← links)
• On the parameterized complexity of computing balanced partitions in graphs (Q493645) (← links)
• Minimizing Rosenthal potential in multicast games (Q493648) (← links)
• On the parameterized complexity of finding separators with non-hereditary properties (Q494799) (← links)
• Campaign management under approval-driven voting rules (Q513294) (← links)
• Parameterized complexity of critical node cuts (Q517024) (← links)
• The complexity of finding effectors (Q519899) (← links)
• On the parameterized complexity of some optimization problems related to multiple-interval graphs (Q606990) (← links)
• On the complexity of some colorful problems parameterized by treewidth (Q627124) (← links)
• Editing graphs into disjoint unions of dense clusters (Q652530) (← links)
• Parameterized complexity in multiple-interval graphs: domination, partition, separation, irredundancy (Q690460) (← links)
• Parameterizing by the number of numbers (Q692894) (← links)
• Shortest color-spanning intervals (Q896153) (← links)
• The challenges of unbounded treewidth in parameterised subgraph counting problems (Q897601) (← links)
• Constant ratio fixed-parameter approximation of the edge multicut problem (Q990949) (← links)
• The many facets of upper domination (Q1704853) (← links)
• The P3 infection time is W[1]-hard parameterized by the treewidth (Q1705656) (← links)
• Parameterized complexity of theory of mind reasoning in dynamic epistemic logic (Q1711514) (← links)
• The parameterized complexity of the rainbow subgraph problem (Q1736640) (← links)
• Finding supported paths in heterogeneous networks (Q1736715) (← links)
• The complexity of dominating set in geometric intersection graphs (Q1737591) (← links)
• On the complexity of finding and counting solution-free sets of integers (Q1752464) (← links)
• The parameterized complexity of finding secluded solutions to some classical optimization problems on graphs (Q1756342) (← links)
• Multivariate complexity analysis of Swap Bribery (Q1759677) (← links)
• New algorithms for maximum disjoint paths based on tree-likeness (Q1785205) (← links)
• The parameterized complexity of some minimum label problems (Q1959420) (← links)
• Towards a dichotomy for the possible winner problem in elections based on scoring rules (Q1959429) (← links)
• Finding temporal paths under waiting time constraints (Q1979453) (← links)
• Minimum diameter color-spanning sets revisited (Q2010932) (← links)
• Succinct monotone circuit certification: planarity and parameterized complexity (Q2019496) (← links)
• Efficiently enumerating hitting sets of hypergraphs arising in data profiling (Q2051864) (← links)
• Upper and lower degree-constrained graph orientation with minimum penalty (Q2062132) (← links)
• Parameterized complexity of two-interval pattern problem (Q2067621) (← links)