Pages that link to "Item:Q1771253"
From MaRDI portal
The following pages link to Recognition algorithms for orders of small width and graphs of small Dilworth number (Q1771253):
Displayed 15 items.
- Graph classes with structured neighborhoods and algorithmic applications (Q392023) (← links)
- Haplotyping with missing data via perfect path phylogenies (Q876476) (← links)
- Most balanced minimum cuts (Q968139) (← links)
- On the complexity of SNP block partitioning under the perfect phylogeny model (Q1045048) (← links)
- Another note on Dilworth's decomposition theorem. (Q2249932) (← links)
- On pairwise compatibility graphs having Dilworth number \(k\) (Q2253200) (← links)
- Using decomposition-parameters for QBF: mind the prefix! (Q2304627) (← links)
- A linear-time parameterized algorithm for computing the width of a DAG (Q2672441) (← links)
- Small Resolution Proofs for QBF using Dependency Treewidth (Q3304126) (← links)
- A Path Cover Technique for LCAs in Dags (Q3512461) (← links)
- Isometric Diamond Subgraphs (Q3611874) (← links)
- Model checking existential logic on partially ordered sets (Q4635604) (← links)
- Using Minimum Path Cover to Boost Dynamic Programming on DAGs: Co-linear Chaining Extended (Q5881345) (← links)
- Faster Existential FO Model Checking on Posets (Q5892117) (← links)
- Serial and parallel kernelization of multiple hitting set parameterized by the Dilworth number, implemented on the GPU (Q6078297) (← links)