( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Steiner tree reoptimization in graphs with sharpened triangle inequality.

, , , , , и . J. Discrete Algorithms, (2012)

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.

Juraj Kukolja

Juraj Kukolja

Juraj Böhm

Juraj Koza

Juraj Mészáro

 

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

On the Power of One-Way Synchronized Alternating Machines with Small Space., , , , , и . Int. J. Found. Comput. Sci., 3 (1): 65-79 (1992)Knowing All Optimal Solutions Does Not Help for TSP Reoptimization., , и . Computation, Cooperation, and Life, том 6610 из Lecture Notes in Computer Science, стр. 7-15. Springer, (2011)Improved Approximations for Hard Optimization Problems via Problem Instance Classification., , и . Rainbow of Computer Science, том 6570 из Lecture Notes in Computer Science, стр. 3-19. Springer, (2011)Algorithmics - Is There Hope for a Unified Theory?. CSR, том 6072 из Lecture Notes in Computer Science, стр. 181-194. Springer, (2010)On the Power of Laconic Advice in Communication Complexity., и . SOFSEM, том 9587 из Lecture Notes in Computer Science, стр. 161-170. Springer, (2016)Some Hierarchies for the Communication Complexity Measures of Cooperating Grammar Systems., , и . MFCS, том 711 из Lecture Notes in Computer Science, стр. 495-505. Springer, (1993)Tradeoffs between Nondeterminism and Complexity for Communication Protocols and Branching Programs., и . STACS, том 1770 из Lecture Notes in Computer Science, стр. 145-156. Springer, (2000)The Computer Science Way of Thinking in Human History and Consequences for the Design of Computer Science Curricula., и . ISSEP, том 10696 из Lecture Notes in Computer Science, стр. 3-11. Springer, (2017)Efficient Algorithms for the Spoonerism Problem., , , , и . FUN, том 4475 из Lecture Notes in Computer Science, стр. 78-92. Springer, (2007)Nonlinear Lower Bounds on the Number of Processors of Circuits with Sublinear Separators (Extended Abstract).. FCT, том 529 из Lecture Notes in Computer Science, стр. 240-247. Springer, (1991)