| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Reuven Bar-Yehuda, Ann Becker, Dan Geiger |
Randomized Algorithms for the Loop Cutset Problem  |
CoRR  |
2011 |
DBLP BibTeX RDF |
|
| 1 | Reuven Bar-Yehuda, Danny Hermelin, Dror Rawitz |
Minimum vertex cover in rectangle graphs.  |
Comput. Geom.  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Reuven Bar-Yehuda, Danny Hermelin, Dror Rawitz |
Minimum Vertex Cover in Rectangle Graphs  |
CoRR  |
2010 |
DBLP BibTeX RDF |
|
| 1 | Reuven Bar-Yehuda, Guy Flysher, Julián Mestre, Dror Rawitz |
Approximation of Partial Capacitated Vertex Cover.  |
SIAM J. Discrete Math.  |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Reuven Bar-Yehuda, Danny Hermelin, Dror Rawitz |
An Extension of the Nemhauser--Trotter Theorem to Generalized Vertex Cover with Applications.  |
SIAM J. Discrete Math.  |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Reuven Bar-Yehuda, Danny Hermelin, Dror Rawitz |
Minimum Vertex Cover in Rectangle Graphs.  |
ESA  |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Reuven Bar-Yehuda, Gleb Polevoy, Dror Rawitz |
Bandwidth allocation in cellular networks with multiple interferences.  |
DIALM-PODC  |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Reuven Bar-Yehuda, Michael Beder, Yuval Cohen, Dror Rawitz |
Resource Allocation in Bounded Degree Trees.  |
Algorithmica  |
2009 |
DBLP DOI BibTeX RDF |
Bounded degree trees, Scheduling, Approximation algorithms, Bandwidth allocation, Storage allocation |
| 1 | Ron Zohar, Reuven Bar-Yehuda |
The maximum weight hierarchy matching problem.  |
Information Fusion  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Reuven Bar-Yehuda, Danny Hermelin, Dror Rawitz |
Extension of the Nemhauser and Trotter Theorem to Generalized Vertex Cover with Applications.  |
WAOA  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Reuven Bar-Yehuda, Ido Feldman, Dror Rawitz |
Improved Approximation Algorithm for Convex Recoloring of Trees.  |
Theory Comput. Syst.  |
2008 |
DBLP DOI BibTeX RDF |
Convex recoloring, Approximation algorithms, Phylogenetic trees, Local ratio |
| 1 | David Amzallag, Reuven Bar-Yehuda, Danny Raz, Gabriel Scalosub |
Cell Selection in 4G Cellular Networks.  |
INFOCOM  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Reuven Bar-Yehuda, Jonathan Laserson |
Exploiting locality: approximating sorting buffers.  |
J. Discrete Algorithms  |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Reuven Bar-Yehuda, Guy Flysher, Julián Mestre, Dror Rawitz |
Approximation of Partial Capacitated Vertex Cover.  |
ESA  |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Reuven Bar-Yehuda, Dror Rawitz |
Using fractional primal-dual to schedule split intervals with demands.  |
Discrete Optimization  |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Reuven Bar-Yehuda, Magnús M. Halldórsson, Joseph Naor, Hadas Shachnai, Irina Shapira |
Scheduling Split Intervals.  |
SIAM J. Comput.  |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Reuven Bar-Yehuda, Irad Yavneh |
A Factor-Two Approximation Algorithm for Two-Dimensional Phase Unwrapping.  |
J. Graph Algorithms Appl.  |
2006 |
DBLP BibTeX RDF |
|
| 1 | Reuven Bar-Yehuda, Michael Beder, Yuval Cohen, Dror Rawitz |
Resource Allocation in Bounded Degree Trees.  |
ESA  |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Reuven Bar-Yehuda, Dror Rawitz |
A Tale of Two Methods.  |
Essays in Memory of Shimon Even  |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Reuven Bar-Yehuda, Guy Even, Shimon Shahar |
On approximating a geometric prize-collecting traveling salesman problem with time windows.  |
J. Algorithms  |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Reuven Bar-Yehuda, Dror Rawitz |
On the Equivalence between the Primal-Dual Schema and the Local Ratio Technique.  |
SIAM J. Discrete Math.  |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Reuven Bar-Yehuda, Dror Rawitz |
Using Fractional Primal-Dual to Schedule Split Intervals with Demands.  |
ESA  |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Reuven Bar-Yehuda, Jonathan Laserson |
Exploiting Locality: Approximating Sorting Buffers.  |
WAOA  |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Reuven Bar-Yehuda, Ido Feldman, Dror Rawitz |
Improved Approximation Algorithm for Convex Recoloring of Trees.  |
WAOA  |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Reuven Bar-Yehuda, Dror Rawitz |
Local ratio with negative weights.  |
Oper. Res. Lett.  |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | 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.  |
2004 |
DBLP DOI BibTeX RDF |
fractional local ratio, local ratio technique, Approximation algorithms |
| 1 | Reuven Bar-Yehuda, Zehavit Kehat |
Approximating the dense set-cover problem.  |
J. Comput. Syst. Sci.  |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Reuven Bar-Yehuda, Guy Even, Shimon Shahar |
On Approximating a Geometric Prize-Collecting Traveling Salesman Problem with Time Windows: Extended Abstract.  |
ESA  |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Reuven Bar-Yehuda, Dror Rawitz |
Approximating Element-Weighted Vertex Deletion Problems for the Complete k-Partite Property.  |
J. Algorithms  |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Reuven Bar-Yehuda, Magnús M. Halldórsson, Joseph Naor, Hadas Shachnai, Irina Shapira |
Scheduling split intervals.  |
SODA  |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Reuven Bar-Yehuda, Dror Rawitz |
Efficient Algorithms for Integer Programs with Two Variables per Constraint.  |
Algorithmica  |
2001 |
DBLP DOI BibTeX RDF |
Well-separated pairs, Fault-tolerance, Computational geometry, Spanners |
| 1 | Reuven Bar-Yehuda |
Using Homogeneous Weights for Approximating the Partial Cover Problem.  |
J. Algorithms  |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Amotz Bar-Noy, Reuven Bar-Yehuda, Ari Freund, Joseph Naor, Baruch Schieber |
A unified approach to approximating resource allocation and scheduling.  |
J. ACM  |
2001 |
DBLP DOI BibTeX RDF |
Approximation algorithms for NP-hard problems, scheduling, resource allocation, dynamic storage allocation, general caching |
| 1 | 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.  |
2001 |
DBLP BibTeX RDF |
|
| 1 | Reuven Bar-Yehuda, Dror Rawitz |
On the Equivalence between the Primal-Dual Schema and the Local-Ratio Technique.  |
RANDOM-APPROX  |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Reuven Bar-Yehuda |
One for the Price of Two: a Unified Approach for Approximating Covering Problems.  |
Algorithmica  |
2000 |
DBLP DOI BibTeX RDF |
Generalized Steiner Forest, Randomized approximations, Approximation algorithm, Set Cover, Vertex Cover, Covering problems, Primal-dual, Local ratio, Feedback Vertex Set |
| 1 | Ann Becker, Reuven Bar-Yehuda, Dan Geiger |
Randomized Algorithms for the Loop Cutset Problem.  |
J. Artif. Intell. Res. (JAIR)  |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Amotz Bar-Noy, Reuven Bar-Yehuda, Ari Freund, Joseph Naor, Baruch Schieber |
A unified approach to approximating resource allocation and scheduling.  |
STOC  |
2000 |
DBLP DOI BibTeX RDF |
interval scheduling, scheduling with release times and deadlines, scheduling, resource allocation, bandwidth allocation, interval graphs |
| 1 | Reuven Bar-Yehuda, Dror Rawitz |
Efficient Algorithms for Integer Programs with Two Variables per Constraint.  |
ESA  |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Reuven Bar-Yehuda |
Using Homogenous Weights for Approximating the Partial Cover Problem.  |
SODA  |
1999 |
DBLP DOI BibTeX RDF |
approximation algorithm, set cover, vertex cover, knapsack, covering problems, local ratio, partial covering |
| 1 | Yohai Makbily, Craig Gotsman, Reuven Bar-Yehuda |
Geometric algorithms for message filtering in decentralized virtual environments.  |
SI3D  |
1999 |
DBLP DOI BibTeX RDF |
distributed systems, virtual reality, message filtering |
| 1 | Ann Becker, Reuven Bar-Yehuda, Dan Geiger |
Random Algorithms for the Loop Cutset Problem.  |
UAI  |
1999 |
DBLP BibTeX RDF |
|
| 1 | Reuven Bar-Yehuda, Sergio Fogel |
Partitioning a Sequence into Few Monotone Subsequences.  |
Acta Inf.  |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | 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.  |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Reuven Bar-Yehuda |
One for the Price of Two: A Unified Approach for Approximating Covering Problems.  |
APPROX  |
1998 |
DBLP DOI BibTeX RDF |
Generalized Steiner Forest, Randomized Approximations, Approximation Algorithm, Set Cover, Vertex Cover, Covering Problems, Local Ratio, Feedback Vertex Set |
| 1 | Shmuel Cohen, Gershon Elber, Reuven Bar-Yehuda |
Matching of freeform curves.  |
Computer-Aided Design  |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Reuven Bar-Yehuda, Craig Gotsman |
Time/Space Tradeoffs for Polygon Mesh Rendering.  |
ACM Trans. Graph.  |
1996 |
DBLP DOI BibTeX RDF |
rendering, polygons, graphics pipeline |
| 1 | Reuven Bar-Yehuda, E. Ben-Hanoch |
A linear time algorithm for covering simple polygons with similar rectangles.  |
Int. J. Comput. Geometry Appl.  |
1996 |
DBLP BibTeX RDF |
|
| 1 | Reuven Bar-Yehuda, Sergio Fogel |
Variations on Ray Shooting.  |
Algorithmica  |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Reuven Bar-Yehuda, Bernard Chazelle |
Triangulating disjoint Jordan chains.  |
Int. J. Comput. Geometry Appl.  |
1994 |
DBLP BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | Reuven Bar-Yehuda, Tuvi Etzion, Shlomo Moran |
Rotating-Table Games and Derivatives of Words.  |
Theor. Comput. Sci.  |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Reuven Bar-Yehuda, Amos Israeli, Alon Itai |
Multiple Communication in Multihop Radio Networks.  |
SIAM J. Comput.  |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Reuven Bar-Yehuda, Benny Chor, Eyal Kushilevitz, Alon Orlitsky |
Privacy, additional information and communication.  |
IEEE Transactions on Information Theory  |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Reuven Bar-Yehuda, Alon Efrat, Alon Itai |
A Simple Algorithm for Maintaining the Center of a Planar Point-set.  |
CCCG  |
1993 |
DBLP BibTeX RDF |
|
| 1 | Reuven Bar-Yehuda, Tuvi Etzion |
Connections Between two Cycles - a New Design of Dense Processor Interconnection Networks.  |
Discrete Applied Mathematics  |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | 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.  |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | 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  |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Reuven Bar-Yehuda, Benny Chor, Eyal Kushilevitz |
Privacy, Additional Information, and Communication.  |
Structure in Complexity Theory Conference  |
1990 |
DBLP BibTeX RDF |
|
| 1 | 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  |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | Reuven Bar-Yehuda, Amos Israeli |
Multiple Communication in Multi-Hop Radio Networks.  |
PODC  |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Reuven Bar-Yehuda, Shay Kutten |
Fault Tolerant Distributed Majority Commitment.  |
J. Algorithms  |
1988 |
DBLP DOI BibTeX RDF |
|
| 1 | Reuven Bar-Yehuda, Shay Kutten, Yaron Wolfstahl, Shmuel Zaks |
Making Distributed Spanning Tree Algorithms Fault-Resilient.  |
STACS  |
1987 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | Reuven Bar-Yehuda, Uzi Vishkin |
Complexity of Finding k-Path-Free Dominating Sets in Graphs.  |
Inf. Process. Lett.  |
1982 |
DBLP DOI BibTeX RDF |
|
| 1 | Reuven Bar-Yehuda, Shimon Even |
On Approximating a Vertex Cover for Planar Graphs  |
STOC  |
1982 |
DBLP DOI BibTeX RDF |
|
| 1 | Reuven Bar-Yehuda, Shimon Even |
A Linear-Time Approximation Algorithm for the Weighted Vertex Cover Problem.  |
J. Algorithms  |
1981 |
DBLP DOI BibTeX RDF |
|