( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Mathematical Structures Underlying Greedy Algorithms.

, и . FCT, том 117 из Lecture Notes in Computer Science, стр. 205-209. Springer, (1981)

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.

Csaba Lovász

Enrico Lovász

László Révész

László Udvari

László Tarnói

 

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

Approximating Clique is Almost NP-Complete (Preliminary Version), , , , и . Proc. 32th FOCS, стр. 2--12. (1991)On integer points in polyhedra: a lower bound., , и . Combinatorica, 12 (2): 135-142 (1992)Large Networks and Graph Limits.. Colloquium Publications American Mathematical Society, (2012)Linear Decision Trees: Volume Estimates and Topological Bounds, , и . STOC, стр. 170-177. ACM, (1992)Vertex Packing Algorithms.. ICALP, том 194 из Lecture Notes in Computer Science, стр. 1-14. Springer, (1985)Semi-matchings for Bipartite Graphs and Load Balancing., , , и . WADS, том 2748 из Lecture Notes in Computer Science, стр. 294-308. Springer, (2003)Lifting Markov Chains to Speed up Mixing., , и . STOC, стр. 275-281. ACM, (1999)Normal hypergraphs and the perfect graph conjecture.. Discret. Math., 2 (3): 253-267 (1972)Matrix Cones, Projection Representations, and Stable Set Polyhedra., и . Polyhedral Combinatorics, том 1 из DIMACS Series in Discrete Mathematics and Theoretical Computer Science, стр. 1-18. DIMACS/AMS, (1990)Approximating Clique is Almost NP-Complete (Preliminary Version), , , , и . FOCS, стр. 2-12. IEEE Computer Society, (1991)