PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Uno, Takeaki"

Author of the publication

copydeleteadd this publication to your clipboard
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

Sequentially Swapping Colored Tokens on Graphs., , , , , , , , , and . WALCOM, volume 10167 of Lecture Notes in Computer Science, page 435-447. Springer, (2017)On Complexity of Flooding Games on Graphs with Interval Representations., , , , and . TJJCCGG, volume 8296 of Lecture Notes in Computer Science, page 73-84. Springer, (2012)Polynomial Delay and Space Discovery of Connected and Acyclic Sub-hypergraphs in a Hypergraph., , , and . Discovery Science, volume 8140 of Lecture Notes in Computer Science, page 308-323. Springer, (2013)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)Maximal Matching and Path Matching Counting in Polynomial Time for Graphs of Bounded Clique Width., and . TAMC, volume 6648 of Lecture Notes in Computer Science, page 483-494. Springer, (2011)Efficient Algorithms for Airline Problem., , and . TAMC, volume 4484 of Lecture Notes in Computer Science, page 428-439. Springer, (2007)A Polynomial Space and Polynomial Delay Algorithm for Enumeration of Maximal Motifs in a Sequence., and . ISAAC, volume 3827 of Lecture Notes in Computer Science, page 724-737. Springer, (2005)Enumeration of Perfect Sequences of Chordal Graph., , and . ISAAC, volume 5369 of Lecture Notes in Computer Science, page 859-870. Springer, (2008)Efficient Enumeration of Dominating Sets for Sparse Graphs., , , and . ISAAC, volume 123 of LIPIcs, page 8:1-8:13. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, (2018)An efficient polynomial space and polynomial delay algorithm for enumeration of maximal motifs in a sequence., and . J. Comb. Optim., 13 (3): 243-262 (2007)