Sciweavers

94 search results - page 11 / 19
» Packing d-degenerate graphs
Sort
View
ESA
2004
Springer
103views Algorithms» more  ESA 2004»
14 years 24 days ago
Faster Fixed-Parameter Tractable Algorithms for Matching and Packing Problems
Abstract. We obtain faster algorithms for problems such as rdimensional matching, r-set packing, graph packing, and graph edge packing when the size k of the solution is considered...
Michael R. Fellows, Christian Knauer, Naomi Nishim...
BMCBI
2010
86views more  BMCBI 2010»
13 years 7 months ago
Protein binding hot spots and the residue-residue pairing preference: a water exclusion perspective
Background: A protein binding hot spot is a small cluster of residues tightly packed at the center of the interface between two interacting proteins. Though a hot spot constitutes...
Qian Liu, Jinyan Li
STOC
2004
ACM
73views Algorithms» more  STOC 2004»
14 years 7 months ago
Spectral partitioning, eigenvalue bounds, and circle packings for graphs of bounded genus
In this paper, we address two longstanding questions about finding good separators in graphs of bounded genus and degree:
Jonathan A. Kelner
RECOMB
2004
Springer
14 years 7 months ago
Mining protein family specific residue packing patterns from protein structure graphs
Finding recurring residue packing patterns, or spatial motifs, that characterize protein structural families is an important problem in bioinformatics. To this end, we apply a nov...
Jun Huan, Wei Wang 0010, Deepak Bandyopadhyay, Jac...