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.

 

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

Reconstructing Polyatomic Structures from Discrete X-Rays: NP-Completeness Proof for Three Atoms., и . MFCS, том 1450 из Lecture Notes in Computer Science, стр. 185-193. Springer, (1998)Faster Algorithms for k-Medians in Trees., , , , и . MFCS, том 2747 из Lecture Notes in Computer Science, стр. 218-227. Springer, (2003)Saturating Flows in Networks., , и . FCT, том 278 из Lecture Notes in Computer Science, стр. 82-91. Springer, (1987)Together or Separate? Algorithmic Aggregation Problems.. FCT, том 8070 из Lecture Notes in Computer Science, стр. 1. Springer, (2013)Nondeterminism Is Essential for Two-Way Counter Machines.. MFCS, том 176 из Lecture Notes in Computer Science, стр. 240-244. Springer, (1984)LP-rounding algorithms for the fault-tolerant facility placement problem., и . J. Discrete Algorithms, (2015)On Huang and Wong's algorithm for generalized binary split trees., , , и . Acta Informatica, 59 (6): 687-708 (2022)A ϕ-competitive algorithm for collecting items with increasing weights from a dynamic queue., , , , , , и . Theor. Comput. Sci., (2013)Analysis of the Harmonic Algorithm for Three Servers., и . STACS, том 2607 из Lecture Notes in Computer Science, стр. 247-259. Springer, (2003)Online Competitive Algorithms for Maximizing Weighted Throughput of Unit Jobs., , , , , , , и . STACS, том 2996 из Lecture Notes in Computer Science, стр. 187-198. Springer, (2004)