| No. | Title | Author | Year |
|---|---|---|---|
| 1 | Making a Network Orchard by Adding Leaves | van Iersel, Leo et al. | 2023 |
| 2 | An FPT-Algorithm for Longest Common Subsequence Parameterized by the Maximum Number of Deletions | Bulteau, Laurent et al. | 2022 |
| 3 | Embedding Phylogenetic Trees in Networks of Low Treewidth | van Iersel, Leo et al. | 2022 |
| 4 | On the Workflow Satisfiability Problem with Class-independent Constraints | Crampton, Jason et al. | 2015 |
| 5 | Parameterized and Approximation Algorithms for the Load Coloring Problem | Barbero, Florian et al. | 2015 |
| 6 | Polynomial Kernels for lambda-extendible Properties Parameterized Above the Poljak-Turzik Bound | Crowston, Robert et al. | 2013 |
| 7 | Directed Acyclic Subgraph Problem Parameterized above the Poljak-Turzik Bound | Crowston, Robert et al. | 2012 |
| 8 | Simultaneously Satisfying Linear Equations Over F_2: MaxLin2 and Max-r-Lin2 Parameterized Above Average | Crowston, Robert et al. | 2011 |
| Current Page : | |
| Number of result pages: | 1 |
| Number of documents: | 8 |