( en | de | ru )

 

Disambiguation of "Kobayashi, Yusuke"

Author of the publication

copydeleteadd this publication to your clipboard
Max-flow min-cut theorem and faster algorithms in a circular disk failure model.

, and . INFOCOM, page 1635-1643. IEEE, (2014)

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.

Yusuke Sugihara

Yusuke Ohta

Yusuke Asai

Yoshitake Kobayashi

Wakiko Kobayashi

 

Other publications of authors with the same name

Breaking o(n1/2)-approximation algorithms for the edge-disjoint paths problem with congestion two., and . STOC, page 81-88. ACM, (2011)A Weighted Linear Matroid Parity Algorithm., and . CoRR, (2019)Max-flow min-cut theorem and faster algorithms in a circular disk failure model., and . INFOCOM, page 1635-1643. IEEE, (2014)A Strongly Polynomial Time Algorithm for the Maximum Supply Rate Problem on Trees., and . FAW, volume 10823 of Lecture Notes in Computer Science, page 54-67. Springer, (2018)An Improved Fixed-Parameter Algorithm for Max-Cut Parameterized by Crossing Number., , , and . IWOCA, volume 11638 of Lecture Notes in Computer Science, page 327-338. Springer, (2019)EFX Allocations for Indivisible Chores: Matching-Based Approach., , and . SAGT, volume 14238 of Lecture Notes in Computer Science, page 257-270. Springer, (2023)Optimal General Factor Problem and Jump System Intersection.. IPCO, volume 13904 of Lecture Notes in Computer Science, page 291-305. Springer, (2023)Fence patrolling by mobile agents with distinct speeds., and . CoRR, (2014)Minimum-Cost b -Edge Dominating Sets on Trees., , , , and . ISAAC, volume 8889 of Lecture Notes in Computer Science, page 195-207. Springer, (2014)Algorithms for Gerrymandering over Graphs., , , and . AAMAS, page 1413-1421. International Foundation for Autonomous Agents and Multiagent Systems, (2019)