( en | de | ru )

 

Disambiguation of "Kortsarz, Guy"

Author of the publication

copydeleteadd this publication to your clipboard
From Gap-ETH to FPT-Inapproximability: Clique, Dominating Set, and More.

, , , , , , and . FOCS, page 743-754. IEEE Computer Society, (2017)

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.

Thomas Guyet

Olga Guyot

Irene Guy

Bodo Guyet

Karl Guyot

 

Other publications of authors with the same name

Bounded Degree Group Steiner Tree Problems., and . CoRR, (2019)Bi-Covering: Covering Edges with Two Small Subsets of Vertices., , , , and . SIAM J. Discret. Math., 31 (4): 2626-2646 (2017)Polylogarithmic Additive Inapproximability of the Radio Broadcast Problem., and . SIAM J. Discret. Math., 19 (4): 881-899 (2005)An Improved Approximation of the Achromatic Number on Bipartite Graphs., and . SIAM J. Discret. Math., 21 (2): 361-373 (2007)Prize-collecting steiner network problems., , , and . ACM Trans. Algorithms, 9 (1): 2:1-2:13 (2012)Asymmetric k-center is log* n-hard to approximate., , , , , , and . J. ACM, 52 (4): 538-551 (2005)Approximation algorithm for k-node connected subgraphs via critical graphs., and . STOC, page 138-145. ACM, (2004)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)Approximation Algorithms for Minimum Time Broadcast., and . ISTCS, volume 601 of Lecture Notes in Computer Science, page 67-78. Springer, (1992)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)