An efficient algorithm for the length-constrained heaviest path problem on a tree

Efficient algorithms for locating the length-constrained heaviest segments with applications to biomolecular sequence analysis

Journal of Computer and System Sciences - Computational biology 2002

Efficient Algorithms for Locating the Length-Constrained Heaviest Segments, with Applications to Biomolecular Sequence Analysis

MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science

Finding a longest nonnegative path in a constant degree tree

Information Processing Letters

Finding a maximum-density path in a tree under the weight and length constraints

Information Processing Letters

Using spine decompositions to efficiently solve the length-constrained heaviest path problem for trees

Information Processing Letters

Algorithms for finding the weight-constrained k longest paths in a tree and the length-constrained k maximum-sum segments of a sequence

Theoretical Computer Science

An improved algorithm for finding a length-constrained maximum-density subtree in a tree

Information Processing Letters

An optimal algorithm for the maximum-density path in a tree

Information Processing Letters

Finding a longest nonnegative path in a constant degree tree

Information Processing Letters

The weight-constrained maximum-density subtree problem and related problems in trees

The Journal of Supercomputing

The density maximization problem in graphs

COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics

Finding a weight-constrained maximum-density subtree in a tree

ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation

Note: Finding a length-constrained maximum-sum or maximum-density subtree and its application to logistics

Discrete Optimization

The density maximization problem in graphs

Journal of Combinatorial Optimization