Guy Even
Guy Even
Verified email at - Homepage
Cited by
Cited by
Approximating minimum feedback sets and multicuts in directed graphs
G Even, J Naor, B Schieber, M Sudan
Algorithmica 20 (2), 151-174, 1998
Divide-and-conquer approximation algorithms via spreading metrics
G Even, JS Naor, S Rao, B Schieber
Journal of the ACM (JACM) 47 (4), 585-616, 2000
Conflict-free colorings of simple geometric regions with applications to frequency assignment in cellular networks
G Even, Z Lotker, D Ron, S Smorodinsky
SIAM Journal on Computing 33 (1), 94-136, 2003
Observability of Boolean networks: A graph-theoretic approach
D Laschov, M Margaliot, G Even
Automatica 49 (8), 2351-2362, 2013
Delay-optimized implementation of IEEE floating-point addition
PM Seidel, G Even
Computers, IEEE Transactions on 53 (2), 97-113, 2004
Fast approximate graph partitioning algorithms
G Even, J Naor, S Rao, B Schieber
SIAM Journal on Computing 28 (6), 2187-2214, 1999
A comparison of three rounding algorithms for IEEE floating-point multiplication
G Even, PM Seidel
Computers, IEEE Transactions on 49 (7), 638-650, 2000
Hitting sets when the VC-dimension is small
G Even, D Rawitz, SM Shahar
Information Processing Letters 95 (2), 358-362, 2005
Min-max tree covers of graphs
G Even, N Garg, J Konemann, R Ravi, A Sinha
Operations Research Letters 32 (4), 309-315, 2004
Lower bounds for sampling algorithms for estimating the average
R Canetti, G Even, O Goldreich
Information Processing Letters 53 (1), 17-25, 1995
Approximations of general independent distributions
G Even, O Goldreich, M Luby, N Nisan, B Veličkovic
Proceedings of the twenty-fourth annual ACM symposium on Theory of computing …, 1992
Scheduling with conflicts: online and offline algorithms
G Even, MM Halldórsson, L Kaplan, D Ron
Journal of scheduling 12 (2), 199-224, 2009
A greedy approximation algorithm for the group Steiner problem
C Chekuri, G Even, G Kortsarz
Discrete Applied Mathematics 154 (1), 15-34, 2006
Set connectivity problems in undirected graphs and the directed steiner network problem
C Chekuri, G Even, A Gupta, D Segev
ACM Transactions on Algorithms (TALG) 7 (2), 1-17, 2011
A dual precision IEEE floating-point multiplier
G Even, SM Mueller, PM Seidel
Integration, the VLSI journal 29 (2), 167-180, 2000
On approximating a geometric prize-collecting traveling salesman problem with time windows
R Bar-Yehuda, G Even, SM Shahar
Journal of Algorithms 55 (1), 76-92, 2005
Approximating minimum feedback sets and multi-cuts in directed graphs: Extended summary
G Even, J Naor, B Schieber, M Sudan
Integer Programming and Combinatorial Optimization: 4th International IPCO …, 1995
Competitive and deterministic embeddings of virtual networks
G Even, M Medina, G Schaffrath, S Schmid
Theoretical Computer Science 496, 184-194, 2013
Improved approximations of crossings in graph drawings and VLSI layout areas
G Even, S Guha, B Schieber
SIAM Journal on Computing 32 (1), 231-252, 2002
An 8-approximation algorithm for the subset feedback vertex set problem
G Even, JS Naor, L Zosin
SIAM Journal on Computing 30, 1231, 2000
The system can't perform the operation now. Try again later.
Articles 1–20