Artigos com autorizações de acesso público - Guy KortsarzSaiba mais
22 artigos disponíveis publicamente
From gap-eth to fpt-inapproximability: Clique, dominating set, and more
P Chalermsook, M Cygan, G Kortsarz, B Laekhanukit, P Manurangsi, ...
2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS …, 2017
Autorizações: US National Science Foundation, Swedish Research Council, European Commission
The Densest -Subhypergraph Problem
E Chlamtác, M Dinitz, C Konrad, G Kortsarz, G Rabanca
SIAM Journal on Discrete Mathematics 32 (2), 1458-1477, 2018
Autorizações: US National Science Foundation, Icelandic Centre for Research, UK …
Approximating spanners and directed steiner forest: Upper and lower bounds
E Chlamtáč, M Dinitz, G Kortsarz, B Laekhanukit
ACM Transactions on Algorithms (TALG) 16 (3), 1-31, 2020
Autorizações: US National Science Foundation
From gap-exponential time hypothesis to fixed parameter tractable inapproximability: Clique, dominating set, and more
P Chalermsook, M Cygan, G Kortsarz, B Laekhanukit, P Manurangsi, ...
SIAM Journal on Computing 49 (4), 772-810, 2020
Autorizações: US National Science Foundation, Swedish Research Council, European Commission
LP-relaxations for tree augmentation
G Kortsarz, Z Nutov
Discrete Applied Mathematics 239, 94-105, 2018
Autorizações: US National Science Foundation
Bi-covering: covering edges with two small subsets of vertices
A Bhangale, R Gandhi, MT Hajiaghayi, R Khandekar, G Kortsarz
SIAM Journal on Discrete Mathematics 31 (4), 2626-2646, 2017
Autorizações: US National Science Foundation, US Department of Defense
LP-relaxations for tree augmentation
G Kortsarz, Z Nutov
Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2016
Autorizações: US National Science Foundation
A tight algorithm for strongly connected Steiner subgraph on two terminals with demands
R Chitnis, H Esfandiari, MT Hajiaghayi, R Khandekar, G Kortsarz, ...
Algorithmica 77, 1216-1239, 2017
Autorizações: US National Science Foundation, US Department of Defense
Radio aggregation scheduling
R Gandhi, MM Halldórsson, C Konrad, G Kortsarz, H Oh
International Symposium on Algorithms and Experiments for Wireless Sensor …, 2015
Autorizações: Icelandic Centre for Research
A bounded-risk mechanism for the kidney exchange game
H Esfandiari, G Kortsarz
Discrete Applied Mathematics 243, 46-53, 2018
Autorizações: US National Science Foundation
On maximum leaf trees and connections to connected maximum cut problems
R Gandhi, MT Hajiaghayi, G Kortsarz, M Purohit, K Sarpatwar
Information Processing Letters 129, 31-34, 2018
Autorizações: US National Science Foundation, US Department of Defense
On Fixed Cost k-Flow Problems
MT Hajiaghayi, R Khandekar, G Kortsarz, Z Nutov
Theory of Computing Systems 58, 4-18, 2016
Autorizações: US National Science Foundation
On approximating degree-bounded network design problems
X Guo, G Kortsarz, B Laekhanukit, S Li, D Vaz, J Xian
Algorithmica 84 (5), 1252-1278, 2022
Autorizações: US National Science Foundation, National Natural Science Foundation of China …
Improved approximation algorithms for minimum power covering problems
G Calinescu, G Kortsarz, Z Nutov
Theoretical Computer Science 795, 285-300, 2019
Autorizações: US National Science Foundation
Improved Approximation Algorithm for Steiner k-Forest with Nearly Uniform Weights
M Dinitz, G Kortsarz, Z Nutov
ACM Transactions on Algorithms (TALG) 13 (3), 1-16, 2017
Autorizações: US National Science Foundation
Approximating activation edge-cover and facility location problems
G Kortsarz, Z Nutov, E Shalom
Theoretical Computer Science 930, 218-228, 2022
Autorizações: US National Science Foundation
The minimum degree Group Steiner problem
G Kortsarz, Z Nutov
Discrete Applied Mathematics 309, 229-239, 2022
Autorizações: US National Science Foundation
Approximation algorithms for movement repairmen
MT Hajiaghayi, R Khandekar, MR Khani, G Kortsarz
ACM Transactions on Algorithms (TALG) 12 (4), 1-38, 2016
Autorizações: US National Science Foundation
Corrigendum: Improved results for data migration and open shop scheduling
R Gandhi, MM Halldórsson, G Kortsarz, H Shachnai
ACM Transactions on Algorithms (TALG) 9 (4), 1-7, 2013
Autorizações: Icelandic Centre for Research
Improved approximations for relative survivable network design
M Dinitz, A Koranteng, G Kortsarz, Z Nutov
International Workshop on Approximation and Online Algorithms, 190-204, 2023
Autorizações: US National Science Foundation
As informações de publicação e financiamento são determinadas automaticamente por um programa de computador