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.

 

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

A (1+ε)-Embedding of Low Highway Dimension Graphs into Bounded Treewidth Graphs., , , и . ICALP (1), том 9134 из Lecture Notes in Computer Science, стр. 469-480. Springer, (2015)The Simplex Method is Strongly Polynomial for Deterministic Markov Decision Processes., и . Math. Oper. Res., 40 (4): 859-868 (2015)A (1+ε)-Embedding of Low Highway Dimension Graphs into Bounded Treewidth Graphs., , , и . SIAM J. Comput., 47 (4): 1667-1704 (2018)Online Submodular Welfare Maximization: Greedy is Optimal., , и . SODA, стр. 1216-1225. SIAM, (2013)Liquidity in Credit Networks: A Little Trust Goes a Long Way., , , и . NetEcon, стр. 1:1. USENIX Association, (2010)The simplex method is strongly polynomial for deterministic Markov decision processes., и . SODA, стр. 1465-1473. SIAM, (2013)Linear Programming-based Approximation Algorithms for Multi-Vehicle Minimum Latency Problems (Extended Abstract)., и . SODA, стр. 512-531. SIAM, (2015)A 1.1GHz 12μA/Mb-Leakage SRAM Design in 65nm Ultra-Low-Power CMOS with Integrated Leakage Reduction for Mobile Applications., , , , , , , , , и 6 other автор(ы). ISSCC, стр. 324-606. IEEE, (2007)Linear programming-based approximation algorithms for multi-vehicle minimum latency problems, и . Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, стр. 512--531. SIAM, (2014)Combinatorial Algorithms for Rooted Prize-Collecting Walks and Applications to Orienteering and Minimum-Latency Problems., , , и . IPCO, том 13265 из Lecture Notes in Computer Science, стр. 195-209. Springer, (2022)