( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Improved approximations of crossings in graph drawings.

, , и . STOC, стр. 296-305. ACM, (2000)

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.

Baruch Baruch

Bernhard Baruch

Wolfgang Baruch

Otto Baruch

Rudolf Baruch

 

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

Approximating Minimum Subset Feedback Sets in Undirected Graphs with Applications., , , и . ISTCS, стр. 78-88. IEEE Computer Society, (1996)Slowing Sequential Algorithms for Obtaining Fast Distributed and Parallel Algorithms: Maximum Matchings., и . PODC, стр. 282-292. ACM, (1986)The Preemptive Resource Allocation Problem., , и . FSTTCS, том 150 из LIPIcs, стр. 26:1-26:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Improved selection in totally monotone arrays., , , и . Int. J. Comput. Geom. Appl., 3 (2): 115-132 (1993)Efficient Minimum Cost Matching and Transportation Using the Quadrangle Inequality., , , , и . J. Algorithms, 19 (1): 116-143 (1995)Finding the Edge Connectivity of Directed Graphs., и . J. Algorithms, 10 (1): 76-85 (1989)Throughput maximization of real-time scheduling with batching., , , , , и . SODA, стр. 742-751. ACM/SIAM, (2002)Improved Selection on Totally Monotone Arrays., , и . FSTTCS, том 560 из Lecture Notes in Computer Science, стр. 347-359. Springer, (1991)Competitive Paging with Locality of Reference., , , и . J. Comput. Syst. Sci., 50 (2): 244-258 (1995)Lower Bounds on the Depth of Monotone Arithmetic Computations., и . J. Complex., 15 (1): 17-29 (1999)