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 14 items.
- Parameterized complexity of minimum membership dominating set (Q6090540) (← links)
- Recognizing when a preference system is close to admitting a master list (Q6091175) (← links)
- k-Efficient domination: Algorithmic perspective (Q6115759) (← links)
- Computing a minimum subset feedback vertex set on chordal graphs parameterized by leafage (Q6119835) (← links)
- Recognizing when a preference system is close to admitting a master list (Q6124592) (← links)
- An FPT algorithm for node-disjoint subtrees problems parameterized by treewidth (Q6201339) (← links)
- A graph-theoretic barcode ordering model for linked-reads (Q6487642) (← links)
- The multicolored graph realization problem (Q6558680) (← links)
- On the parameterized complexity of interval scheduling with eligible machine sets (Q6564614) (← links)
- Parameterized problems complete for nondeterministic FPT time and logarithmic space (Q6614886) (← links)
- The complexity of computing optimum labelings for temporal connectivity (Q6615311) (← links)
- Cluster editing for multi-layer and temporal graphs (Q6635696) (← links)
- Recognizing unit multiple interval graphs is hard (Q6648267) (← links)
- The parameterized complexity of the survivable network design problem (Q6655676) (← links)