From post

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.

 

Другие публикации лиц с тем же именем

Fence patrolling by mobile agents with distinct speeds., и . CoRR, (2014)Breaking o(n1/2)-approximation algorithms for the edge-disjoint paths problem with congestion two., и . STOC, стр. 81-88. ACM, (2011)Reconfiguration of Maximum-Weight b-Matchings in a Graph., , , , и . COCOON, том 10392 из Lecture Notes in Computer Science, стр. 287-296. Springer, (2017)Algorithms for Gerrymandering over Graphs., , , и . AAMAS, стр. 1413-1421. International Foundation for Autonomous Agents and Multiagent Systems, (2019)A Weighted Linear Matroid Parity Algorithm., и . CoRR, (2019)An FPT Algorithm for Max-Cut Parameterized by Crossing Number., , , и . CoRR, (2019)Max-flow min-cut theorem and faster algorithms in a circular disk failure model., и . INFOCOM, стр. 1635-1643. IEEE, (2014)Minimum-Cost b -Edge Dominating Sets on Trees., , , , и . ISAAC, том 8889 из Lecture Notes in Computer Science, стр. 195-207. Springer, (2014)Fence Patrolling by Mobile Agents with Distinct Speeds., и . ISAAC, том 7676 из Lecture Notes in Computer Science, стр. 598-608. Springer, (2012)A Strongly Polynomial Time Algorithm for the Maximum Supply Rate Problem on Trees., и . FAW, том 10823 из Lecture Notes in Computer Science, стр. 54-67. Springer, (2018)