( en | de | ru )

 

Disambiguation of "Kortsarz, Guy"

Author of the publication

copydeleteadd this publication to your clipboard
Approximating Minimum-Power Degree and Connectivity Problems.

, , , and . LATIN, volume 4957 of Lecture Notes in Computer Science, page 423-435. Springer, (2008)

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. You can also use the button next to the name to display some publications already assigned to the person.

Olga Guyot

Thomas Guyet

Karl Guyot

Peter Guyot

Irene Guy

 

Other publications of authors with the same name

On the Advantage of Overlapping Clusters for Minimizing Conductance., , and . Algorithmica, 69 (4): 844-863 (2014)Approximating Shallow-Light Trees (Extended Abstract)., and . SODA, page 103-110. ACM/SIAM, (1997)Prize-collecting steiner network problems., , , and . ACM Trans. Algorithms, 9 (1): 2:1-2:13 (2012)Sum Multicoloring of Graphs., , , , and . J. Algorithms, 37 (2): 422-450 (2000)Approximation algorithm for k-node connected subgraphs via critical graphs., and . STOC, page 138-145. ACM, (2004)An Improved Approximation of the Achromatic Number on Bipartite Graphs., and . SIAM J. Discret. Math., 21 (2): 361-373 (2007)Approximation Algorithms for Minimum Time Broadcast., and . ISTCS, volume 601 of Lecture Notes in Computer Science, page 67-78. Springer, (1992)Min Sum Edge Coloring in Multigraphs Via Configuration LP., , and . IPCO, volume 5035 of Lecture Notes in Computer Science, page 359-373. Springer, (2008)On Set Expansion Problems and the Small Set Expansion Conjecture., and . WG, volume 8747 of Lecture Notes in Computer Science, page 189-200. Springer, (2014)Improved Bounds for Sum Multicoloring and Scheduling Dependent Jobs with Minsum Criteria., , , and . WAOA, volume 3351 of Lecture Notes in Computer Science, page 68-82. Springer, (2004)