Refreshing results…
On Intervalizing k-Colored Graphs for DNA Physical Mapping
Download from doi.orgParallel algorithms for series parallel graphs
Download from citeseerx.ist.psu.eduRestrictions of Graph Partition Problems. Part I
Download from doi.orgApproximating Treewidth, Pathwidth, Frontsize, and Shortest Elimination Tree
Download from www.researchgate.netParameterized Complexity Analysis in Computational Biology
Download from www.researchgate.netParallel Algorithms with Optimal Speedup for Bounded Treewidth
Download from citeseerx.ist.psu.eduIntervalizing k-colored graphs
Download from dspace.library.uu.nlW[2]-hardness of Precedence Constrained K-processor Scheduling
Download from dspace.library.uu.nlThe parameterized complexity of sequence alignment and consensus
Download from doi.orgA Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
Download from dspace.library.uu.nlEfficient and constructive algorithms for the pathwidth and treewidth of graphs
Download from library.tue.nlMissing publications? Search for publications with a matching author name.