( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Tight Competitive Analyses of Online Car-Sharing Problems.

, , , и . ISAAC, том 212 из LIPIcs, стр. 50:1-50:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (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.

Kazuo Inoue

Kazuo Okohira

Kazuo Yajima

Kazuo Araki

Kazuo OÌ no

 

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

Online Independent Sets., , , и . COCOON, том 1858 из Lecture Notes in Computer Science, стр. 202-209. Springer, (2000)Separating Oblivious and Non-oblivious BPs., , и . COCOON, том 2108 из Lecture Notes in Computer Science, стр. 28-38. Springer, (2001)Avoiding Routing Loops on the Internet., , , и . SIROCCO, том 13 из Proceedings in Informatics, стр. 197-210. Carleton Scientific, (2002)Worst-Case Upper Bounds for kSAT (Column: Algorithmics).. Bulletin of the EATCS, (2004)Exponential Lower Bounds for the Tree-Like Hajós Calculus., и . Inf. Process. Lett., 54 (5): 289-294 (1995)Correction: Pareto Optimization or Cascaded Weighted Sum: A Comparison of Concepts. Algorithms 2014, 7, 166-185.. Algorithms, 7 (2): 188 (2014)Max-stretch Reduction for Tree Spanners., , и . WADS, том 3608 из Lecture Notes in Computer Science, стр. 122-133. Springer, (2005)A (2-c*(1/sqrt(N)))-Approximation Algorithm for the Stable Marriage Problem., , и . ISAAC, том 3827 из Lecture Notes in Computer Science, стр. 902-914. Springer, (2005)Negation-Limited Complexity of Parity and Inverters., , и . ISAAC, том 4288 из Lecture Notes in Computer Science, стр. 223-232. Springer, (2006)An Improved Exact Algorithm for Cubic Graph TSP., и . COCOON, том 4598 из Lecture Notes in Computer Science, стр. 108-117. Springer, (2007)