Author of the publication

Partitioning a Weighted Tree into Subtrees with Weights in a Given Range.

, , , , and . Algorithmica, 62 (3-4): 823-841 (2012)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

No persons found for author name Uno, Takeaki
add a person with the name Uno, Takeaki
 

Other publications of authors with the same name

A Linear Time Algorithm for Finding a k-Tree Core., and . J. Algorithms, 23 (2): 281-290 (1997)An iterated local search algorithm for the vehicle routing problem with convex time penalty functions., , , , , and . Discrete Applied Mathematics, 156 (11): 2050-2069 (2008)Transforming spanning trees: A lower bound., , , and . Comput. Geom., 42 (8): 724-730 (2009)Probabilistic Prediction of Student Affect from Hand Gestures., , , and . ARCS, page 58-63. ISRST, (2008)Efficient algorithms for dualizing large-scale hypergraphs., and . ALENEX, page 1-13. SIAM, (2013)Optimization algorithm for k-anonymization of datasets with low information loss., and . Int. J. Inf. Sec., 17 (6): 631-644 (2018)Counting the number of independent sets in chordal graphs., , and . J. Discrete Algorithms, 6 (2): 229-242 (2008)Enumeration of condition-dependent dense modules in protein interaction networks., , , , and . Bioinformatics, 25 (7): 933-940 (2009)A Polynomial Delay Algorithm for Enumerating Minimal Dominating Sets in Chordal Graphs., , , , and . CoRR, (2014)Hardness Results and an Exact Exponential Algorithm for the Spanning Tree Congestion Problem., , , and . TAMC, volume 6648 of Lecture Notes in Computer Science, page 452-462. Springer, (2011)