Author of the publication

Almost linear time algorithms for minsum k-sink problems on dynamic flow path networks.

, , , and . Theor. Comput. Sci., (2021)

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.

 

Other publications of authors with the same name

Minsum k-sink problem on path networks., , , , and . Theor. Comput. Sci., (2020)Extended Formulations for Sparsity Matroids., , , , and . CoRR, (2014)Polynomial-time approximability of the k-Sink Location problem., , , and . CoRR, (2015)Minsum k-Sink Problem on Path Networks., , , , and . CoRR, (2018)Online graph exploration algorithms for cycles and trees by multiple searchers., , , and . J. Comb. Optim., 28 (2): 480-495 (2014)Covering Points in the Plane by k-Tours: Towards a Polynomial Time Approximation Scheme for General k., , , and . STOC, page 275-283. ACM, (1997)Continuous Folding of Regular Dodecahedra., , , , and . JCDCGG, volume 9943 of Lecture Notes in Computer Science, page 120-131. Springer, (2015)Geometric p-Center Problems with Centers Constrained to Two Lines., , , , , and . JCDCGG, volume 9943 of Lecture Notes in Computer Science, page 24-36. Springer, (2015)A Study of the LMT-Skeleton., , and . ISAAC, volume 1178 of Lecture Notes in Computer Science, page 256-265. Springer, (1996)On the Infinitesimal Rigidity of Bar-and-Slider Frameworks., and . ISAAC, volume 5878 of Lecture Notes in Computer Science, page 524-533. Springer, (2009)