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