| 2008 |
|---|
| 58 | EE | David Amzallag,
Reuven Bar-Yehuda,
Danny Raz,
Gabriel Scalosub:
Cell Selection in 4G Cellular Networks.
INFOCOM 2008: 700-708 |
| 57 | EE | Reuven Bar-Yehuda,
Ido Feldman,
Dror Rawitz:
Improved Approximation Algorithm for Convex Recoloring of Trees.
Theory Comput. Syst. 43(1): 3-18 (2008) |
| 2007 |
|---|
| 56 | EE | Reuven Bar-Yehuda,
Guy Flysher,
Julián Mestre,
Dror Rawitz:
Approximation of Partial Capacitated Vertex Cover.
ESA 2007: 335-346 |
| 55 | EE | Reuven Bar-Yehuda,
Jonathan Laserson:
Exploiting locality: approximating sorting buffers.
J. Discrete Algorithms 5(4): 729-738 (2007) |
| 2006 |
|---|
| 54 | EE | Reuven Bar-Yehuda,
Michael Beder,
Yuval Cohen,
Dror Rawitz:
Resource Allocation in Bounded Degree Trees.
ESA 2006: 64-75 |
| 53 | EE | Reuven Bar-Yehuda,
Dror Rawitz:
A Tale of Two Methods.
Essays in Memory of Shimon Even 2006: 196-217 |
| 52 | EE | Reuven Bar-Yehuda,
Dror Rawitz:
Using fractional primal-dual to schedule split intervals with demands.
Discrete Optimization 3(4): 275-287 (2006) |
| 51 | EE | Reuven Bar-Yehuda,
Irad Yavneh:
A Factor-Two Approximation Algorithm for Two-Dimensional Phase Unwrapping.
J. Graph Algorithms Appl. 10(2): 123-139 (2006) |
| 50 | EE | Reuven Bar-Yehuda,
Magnús M. Halldórsson,
Joseph Naor,
Hadas Shachnai,
Irina Shapira:
Scheduling Split Intervals.
SIAM J. Comput. 36(1): 1-15 (2006) |
| 2005 |
|---|
| 49 | EE | Reuven Bar-Yehuda,
Dror Rawitz:
Using Fractional Primal-Dual to Schedule Split Intervals with Demands.
ESA 2005: 714-725 |
| 48 | EE | Reuven Bar-Yehuda,
Ido Feldman,
Dror Rawitz:
Improved Approximation Algorithm for Convex Recoloring of Trees.
WAOA 2005: 55-68 |
| 47 | EE | Reuven Bar-Yehuda,
Jonathan Laserson:
Exploiting Locality: Approximating Sorting Buffers.
WAOA 2005: 69-81 |
| 46 | EE | Reuven Bar-Yehuda,
Guy Even,
Shimon Shahar:
On approximating a geometric prize-collecting traveling salesman problem with time windows.
J. Algorithms 55(1): 76-92 (2005) |
| 45 | EE | Reuven Bar-Yehuda,
Dror Rawitz:
On the Equivalence between the Primal-Dual Schema and the Local Ratio Technique.
SIAM J. Discrete Math. 19(3): 762-797 (2005) |
| 2004 |
|---|
| 44 | EE | Reuven Bar-Yehuda,
Keren Bendel,
Ari Freund,
Dror Rawitz:
Local ratio: A unified framework for approxmation algrithms in memoriam: Shimon Even 1935-2004.
ACM Comput. Surv. 36(4): 422-463 (2004) |
| 43 | EE | Reuven Bar-Yehuda,
Zehavit Kehat:
Approximating the dense set-cover problem.
J. Comput. Syst. Sci. 69(4): 547-561 (2004) |
| 42 | EE | Reuven Bar-Yehuda,
Dror Rawitz:
Local ratio with negative weights.
Oper. Res. Lett. 32(6): 540-546 (2004) |
| 2003 |
|---|
| 41 | EE | Reuven Bar-Yehuda,
Guy Even,
Shimon Shahar:
On Approximating a Geometric Prize-Collecting Traveling Salesman Problem with Time Windows: Extended Abstract.
ESA 2003: 55-66 |
| 2002 |
|---|
| 40 | EE | Reuven Bar-Yehuda,
Magnús M. Halldórsson,
Joseph Naor,
Hadas Shachnai,
Irina Shapira:
Scheduling split intervals.
SODA 2002: 732-741 |
| 39 | EE | Reuven Bar-Yehuda,
Dror Rawitz:
Approximating Element-Weighted Vertex Deletion Problems for the Complete k-Partite Property.
J. Algorithms 42(1): 20-40 (2002) |
| 2001 |
|---|
| 38 | EE | Reuven Bar-Yehuda,
Dror Rawitz:
On the Equivalence between the Primal-Dual Schema and the Local-Ratio Technique.
RANDOM-APPROX 2001: 24-35 |
| 37 | EE | Reuven Bar-Yehuda,
Dror Rawitz:
Efficient Algorithms for Integer Programs with Two Variables per Constraint.
Algorithmica 29(4): 595-609 (2001) |
| 36 | EE | Amotz Bar-Noy,
Reuven Bar-Yehuda,
Ari Freund,
Joseph Naor,
Baruch Schieber:
A unified approach to approximating resource allocation and scheduling.
J. ACM 48(5): 1069-1090 (2001) |
| 35 | | Reuven Bar-Yehuda:
Using Homogeneous Weights for Approximating the Partial Cover Problem.
J. Algorithms 39(2): 137-144 (2001) |
| 34 | EE | Reuven Bar-Yehuda,
Guy Even,
Jon Feldman,
Joseph Naor:
Computing an Optimal Orientation of a Balanced Decomposition Tree for Linear Arrangement Problems.
J. Graph Algorithms Appl. 5(4): (2001) |
| 2000 |
|---|
| 33 | EE | Amotz Bar-Noy,
Reuven Bar-Yehuda,
Ari Freund,
Joseph Naor,
Baruch Schieber:
A unified approach to approximating resource allocation and scheduling.
STOC 2000: 735-744 |
| 32 | EE | Reuven Bar-Yehuda:
One for the Price of Two: a Unified Approach for Approximating Covering Problems.
Algorithmica 27(2): 131-144 (2000) |
| 31 | EE | Ann Becker,
Reuven Bar-Yehuda,
Dan Geiger:
Randomized Algorithms for the Loop Cutset Problem.
J. Artif. Intell. Res. (JAIR) 12: 219-234 (2000) |
| 1999 |
|---|
| 30 | EE | Reuven Bar-Yehuda,
Dror Rawitz:
Efficient Algorithms for Integer Programs with Two Variables per Constraint.
ESA 1999: 116-126 |
| 29 | EE | Yohai Makbily,
Craig Gotsman,
Reuven Bar-Yehuda:
Geometric algorithms for message filtering in decentralized virtual environments.
SI3D 1999: 39-46 |
| 28 | EE | Reuven Bar-Yehuda:
Using Homogenous Weights for Approximating the Partial Cover Problem.
SODA 1999: 71-75 |
| 27 | EE | Ann Becker,
Reuven Bar-Yehuda,
Dan Geiger:
Random Algorithms for the Loop Cutset Problem.
UAI 1999: 49-56 |
| 1998 |
|---|
| 26 | EE | Reuven Bar-Yehuda:
One for the Price of Two: A Unified Approach for Approximating Covering Problems.
APPROX 1998: 49-62 |
| 25 | EE | Reuven Bar-Yehuda,
Sergio Fogel:
Partitioning a Sequence into Few Monotone Subsequences.
Acta Inf. 35(5): 421-440 (1998) |
| 24 | EE | Reuven Bar-Yehuda,
Dan Geiger,
Joseph Naor,
Ron M. Roth:
Approximation Algorithms for the Feedback Vertex Set Problem with Applications to Constraint Satisfaction and Bayesian Inference.
SIAM J. Comput. 27(4): 942-959 (1998) |
| 1997 |
|---|
| 23 | EE | Shmuel Cohen,
Gershon Elber,
Reuven Bar-Yehuda:
Matching of freeform curves.
Computer-Aided Design 29(5): 369-378 (1997) |
| 1996 |
|---|
| 22 | EE | Reuven Bar-Yehuda,
Craig Gotsman:
Time/Space Tradeoffs for Polygon Mesh Rendering.
ACM Trans. Graph. 15(2): 141-152 (1996) |
| 21 | | Reuven Bar-Yehuda,
E. Ben-Hanoch:
A linear time algorithm for covering simple polygons with similar rectangles.
Int. J. Comput. Geometry Appl. 6(1): 79-102 (1996) |
| 1994 |
|---|
| 20 | | Reuven Bar-Yehuda,
Dan Geiger,
Joseph Naor,
Ron M. Roth:
Approximation Algorithms for the Vertex Feedback Set Problem with Applications to Constraint Satisfaction and Bayesian Inference.
SODA 1994: 344-354 |
| 19 | | Reuven Bar-Yehuda,
Sergio Fogel:
Variations on Ray Shooting.
Algorithmica 11(2): 133-145 (1994) |
| 18 | | Reuven Bar-Yehuda,
Bernard Chazelle:
Triangulating disjoint Jordan chains.
Int. J. Comput. Geometry Appl. 4(4): 475-481 (1994) |
| 1993 |
|---|
| 17 | | Reuven Bar-Yehuda,
Alon Efrat,
Alon Itai:
A Simple Algorithm for Maintaining the Center of a Planar Point-set.
CCCG 1993: 252-257 |
| 16 | | Reuven Bar-Yehuda,
Benny Chor,
Eyal Kushilevitz,
Alon Orlitsky:
Privacy, additional information and communication.
IEEE Transactions on Information Theory 39(6): 1930-1943 (1993) |
| 15 | | Reuven Bar-Yehuda,
Amos Israeli,
Alon Itai:
Multiple Communication in Multihop Radio Networks.
SIAM J. Comput. 22(4): 875-887 (1993) |
| 14 | | Reuven Bar-Yehuda,
Tuvi Etzion,
Shlomo Moran:
Rotating-Table Games and Derivatives of Words.
Theor. Comput. Sci. 108(2): 311-329 (1993) |
| 1992 |
|---|
| 13 | EE | Reuven Bar-Yehuda,
Tuvi Etzion:
Connections Between two Cycles - a New Design of Dense Processor Interconnection Networks.
Discrete Applied Mathematics 37/38: 29-43 (1992) |
| 12 | | Reuven Bar-Yehuda,
Oded Goldreich,
Alon Itai:
On the Time-Complexity of Broadcast in Multi-hop Radio Networks: An Exponential Gap Between Determinism and Randomization.
J. Comput. Syst. Sci. 45(1): 104-126 (1992) |
| 1991 |
|---|
| 11 | | Reuven Bar-Yehuda,
Oded Goldreich,
Alon Itai:
Efficient Emulation of Single-Hop Radio Network with Collision Detection on Multi-Hop Radio Network with no Collision Detection.
Distributed Computing 5: 67-71 (1991) |
| 1990 |
|---|
| 10 | | Reuven Bar-Yehuda,
Benny Chor,
Eyal Kushilevitz:
Privacy, Additional Information, and Communication.
Structure in Complexity Theory Conference 1990: 55-65 |
| 1989 |
|---|
| 9 | | Reuven Bar-Yehuda,
Amos Israeli:
Multiple Communication in Multi-Hop Radio Networks.
PODC 1989: 329-338 |
| 8 | | Reuven Bar-Yehuda,
Oded Goldreich,
Alon Itai:
Efficient Emulation of Single-Hop Radio Network with Collision Detection on Multi-Hop Radio Network with no Collision Detection.
WDAG 1989: 24-32 |
| 7 | EE | Reuven Bar-Yehuda,
Jack A. Feldman,
Ron Y. Pinter,
Shmuel Wimer:
Depth-first-search and dynamic programming algorithms for efficient CMOS cell generation.
IEEE Trans. on CAD of Integrated Circuits and Systems 8(7): 737-743 (1989) |
| 1988 |
|---|
| 6 | | Reuven Bar-Yehuda,
Shay Kutten:
Fault Tolerant Distributed Majority Commitment.
J. Algorithms 9(4): 568-582 (1988) |
| 1987 |
|---|
| 5 | | Reuven Bar-Yehuda,
Oded Goldreich,
Alon Itai:
On the Time-Complexity of Broadcast in Radio Networks: An Exponential Gap Between Determinism and Randomization.
PODC 1987: 98-108 |
| 4 | | Reuven Bar-Yehuda,
Shay Kutten,
Yaron Wolfstahl,
Shmuel Zaks:
Making Distributed Spanning Tree Algorithms Fault-Resilient.
STACS 1987: 432-444 |
| 1982 |
|---|
| 3 | | Reuven Bar-Yehuda,
Shimon Even:
On Approximating a Vertex Cover for Planar Graphs
STOC 1982: 303-309 |
| 2 | | Reuven Bar-Yehuda,
Uzi Vishkin:
Complexity of Finding k-Path-Free Dominating Sets in Graphs.
Inf. Process. Lett. 14(5): 228-232 (1982) |
| 1981 |
|---|
| 1 | | Reuven Bar-Yehuda,
Shimon Even:
A Linear-Time Approximation Algorithm for the Weighted Vertex Cover Problem.
J. Algorithms 2(2): 198-203 (1981) |
