dblp.uni-trier.dewww.dagstuhl.dewww.uni-trier.de

Reuven Bar-Yehuda Home Page Coauthor index pubzone.org

List of publications from the DBLP Bibliography Server - FAQ
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

DBLP keys2011
68Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLReuven Bar-Yehuda, Ann Becker, Dan Geiger: Randomized Algorithms for the Loop Cutset Problem CoRR abs/1106.0225: (2011)
67Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLReuven Bar-Yehuda, Danny Hermelin, Dror Rawitz: Minimum vertex cover in rectangle graphs. Comput. Geom. 44(6-7): 356-364 (2011)
2010
66Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLReuven Bar-Yehuda, Gleb Polevoy, Dror Rawitz: Bandwidth allocation in cellular networks with multiple interferences. DIALM-PODC 2010: 33-42
65Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLReuven Bar-Yehuda, Danny Hermelin, Dror Rawitz: Minimum Vertex Cover in Rectangle Graphs. ESA (1) 2010: 255-266
64Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLReuven Bar-Yehuda, Danny Hermelin, Dror Rawitz: Minimum Vertex Cover in Rectangle Graphs CoRR abs/1001.3332: (2010)
63Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLReuven Bar-Yehuda, Danny Hermelin, Dror Rawitz: An Extension of the Nemhauser--Trotter Theorem to Generalized Vertex Cover with Applications. SIAM J. Discrete Math. 24(1): 287-300 (2010)
62Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLReuven Bar-Yehuda, Guy Flysher, Julián Mestre, Dror Rawitz: Approximation of Partial Capacitated Vertex Cover. SIAM J. Discrete Math. 24(4): 1441-1469 (2010)
2009
61Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLReuven Bar-Yehuda, Danny Hermelin, Dror Rawitz: Extension of the Nemhauser and Trotter Theorem to Generalized Vertex Cover with Applications. WAOA 2009: 13-24
60Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLReuven Bar-Yehuda, Michael Beder, Yuval Cohen, Dror Rawitz: Resource Allocation in Bounded Degree Trees. Algorithmica 54(1): 89-106 (2009)
59Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRon Zohar, Reuven Bar-Yehuda: The maximum weight hierarchy matching problem. Information Fusion 10(2): 198-206 (2009)
2008
58Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Amzallag, Reuven Bar-Yehuda, Danny Raz, Gabriel Scalosub: Cell Selection in 4G Cellular Networks. INFOCOM 2008: 700-708
57Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLReuven Bar-Yehuda, Ido Feldman, Dror Rawitz: Improved Approximation Algorithm for Convex Recoloring of Trees. Theory Comput. Syst. 43(1): 3-18 (2008)
2007
56Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLReuven Bar-Yehuda, Guy Flysher, Julián Mestre, Dror Rawitz: Approximation of Partial Capacitated Vertex Cover. ESA 2007: 335-346
55Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLReuven Bar-Yehuda, Jonathan Laserson: Exploiting locality: approximating sorting buffers. J. Discrete Algorithms 5(4): 729-738 (2007)
2006
54Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLReuven Bar-Yehuda, Michael Beder, Yuval Cohen, Dror Rawitz: Resource Allocation in Bounded Degree Trees. ESA 2006: 64-75
53Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLReuven Bar-Yehuda, Dror Rawitz: A Tale of Two Methods. Essays in Memory of Shimon Even 2006: 196-217
52Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLReuven Bar-Yehuda, Dror Rawitz: Using fractional primal-dual to schedule split intervals with demands. Discrete Optimization 3(4): 275-287 (2006)
51Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLReuven Bar-Yehuda, Irad Yavneh: A Factor-Two Approximation Algorithm for Two-Dimensional Phase Unwrapping. J. Graph Algorithms Appl. 10(2): 123-139 (2006)
50Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLReuven 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
49Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLReuven Bar-Yehuda, Dror Rawitz: Using Fractional Primal-Dual to Schedule Split Intervals with Demands. ESA 2005: 714-725
48Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLReuven Bar-Yehuda, Ido Feldman, Dror Rawitz: Improved Approximation Algorithm for Convex Recoloring of Trees. WAOA 2005: 55-68
47Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLReuven Bar-Yehuda, Jonathan Laserson: Exploiting Locality: Approximating Sorting Buffers. WAOA 2005: 69-81
46Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLReuven 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)
45Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLReuven 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
44Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLReuven 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)
43Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLReuven Bar-Yehuda, Zehavit Kehat: Approximating the dense set-cover problem. J. Comput. Syst. Sci. 69(4): 547-561 (2004)
42Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLReuven Bar-Yehuda, Dror Rawitz: Local ratio with negative weights. Oper. Res. Lett. 32(6): 540-546 (2004)
2003
41Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLReuven 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
40Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLReuven Bar-Yehuda, Magnús M. Halldórsson, Joseph Naor, Hadas Shachnai, Irina Shapira: Scheduling split intervals. SODA 2002: 732-741
39Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLReuven Bar-Yehuda, Dror Rawitz: Approximating Element-Weighted Vertex Deletion Problems for the Complete k-Partite Property. J. Algorithms 42(1): 20-40 (2002)
2001
38Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLReuven Bar-Yehuda, Dror Rawitz: On the Equivalence between the Primal-Dual Schema and the Local-Ratio Technique. RANDOM-APPROX 2001: 24-35
37Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLReuven Bar-Yehuda, Dror Rawitz: Efficient Algorithms for Integer Programs with Two Variables per Constraint. Algorithmica 29(4): 595-609 (2001)
36Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAmotz 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)
35Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLReuven Bar-Yehuda: Using Homogeneous Weights for Approximating the Partial Cover Problem. J. Algorithms 39(2): 137-144 (2001)
34Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLReuven 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
33Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAmotz Bar-Noy, Reuven Bar-Yehuda, Ari Freund, Joseph Naor, Baruch Schieber: A unified approach to approximating resource allocation and scheduling. STOC 2000: 735-744
32Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLReuven Bar-Yehuda: One for the Price of Two: a Unified Approach for Approximating Covering Problems. Algorithmica 27(2): 131-144 (2000)
31Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAnn Becker, Reuven Bar-Yehuda, Dan Geiger: Randomized Algorithms for the Loop Cutset Problem. J. Artif. Intell. Res. (JAIR) 12: 219-234 (2000)
1999
30Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLReuven Bar-Yehuda, Dror Rawitz: Efficient Algorithms for Integer Programs with Two Variables per Constraint. ESA 1999: 116-126
29Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLYohai Makbily, Craig Gotsman, Reuven Bar-Yehuda: Geometric algorithms for message filtering in decentralized virtual environments. SI3D 1999: 39-46
28Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLReuven Bar-Yehuda: Using Homogenous Weights for Approximating the Partial Cover Problem. SODA 1999: 71-75
27Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAnn Becker, Reuven Bar-Yehuda, Dan Geiger: Random Algorithms for the Loop Cutset Problem. UAI 1999: 49-56
1998
26Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLReuven Bar-Yehuda: One for the Price of Two: A Unified Approach for Approximating Covering Problems. APPROX 1998: 49-62
25Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLReuven Bar-Yehuda, Sergio Fogel: Partitioning a Sequence into Few Monotone Subsequences. Acta Inf. 35(5): 421-440 (1998)
24Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLReuven 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
23Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLShmuel Cohen, Gershon Elber, Reuven Bar-Yehuda: Matching of freeform curves. Computer-Aided Design 29(5): 369-378 (1997)
1996
22Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLReuven Bar-Yehuda, Craig Gotsman: Time/Space Tradeoffs for Polygon Mesh Rendering. ACM Trans. Graph. 15(2): 141-152 (1996)
21no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLReuven 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
20Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLReuven 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
19Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLReuven Bar-Yehuda, Sergio Fogel: Variations on Ray Shooting. Algorithmica 11(2): 133-145 (1994)
18no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLReuven Bar-Yehuda, Bernard Chazelle: Triangulating disjoint Jordan chains. Int. J. Comput. Geometry Appl. 4(4): 475-481 (1994)
1993
17no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLReuven Bar-Yehuda, Alon Efrat, Alon Itai: A Simple Algorithm for Maintaining the Center of a Planar Point-set. CCCG 1993: 252-257
16Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLReuven Bar-Yehuda, Benny Chor, Eyal Kushilevitz, Alon Orlitsky: Privacy, additional information and communication. IEEE Transactions on Information Theory 39(6): 1930-1943 (1993)
15Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLReuven Bar-Yehuda, Amos Israeli, Alon Itai: Multiple Communication in Multihop Radio Networks. SIAM J. Comput. 22(4): 875-887 (1993)
14Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLReuven Bar-Yehuda, Tuvi Etzion, Shlomo Moran: Rotating-Table Games and Derivatives of Words. Theor. Comput. Sci. 108(2): 311-329 (1993)
1992
13Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLReuven Bar-Yehuda, Tuvi Etzion: Connections Between two Cycles - a New Design of Dense Processor Interconnection Networks. Discrete Applied Mathematics 37/38: 29-43 (1992)
12Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLReuven 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
11Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLReuven 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
10no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLReuven Bar-Yehuda, Benny Chor, Eyal Kushilevitz: Privacy, Additional Information, and Communication. Structure in Complexity Theory Conference 1990: 55-65
1989
9Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLReuven Bar-Yehuda, Amos Israeli: Multiple Communication in Multi-Hop Radio Networks. PODC 1989: 329-338
8Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLReuven 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
7Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLReuven 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
6Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLReuven Bar-Yehuda, Shay Kutten: Fault Tolerant Distributed Majority Commitment. J. Algorithms 9(4): 568-582 (1988)
1987
5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLReuven 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
4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLReuven Bar-Yehuda, Shay Kutten, Yaron Wolfstahl, Shmuel Zaks: Making Distributed Spanning Tree Algorithms Fault-Resilient. STACS 1987: 432-444
1982
3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLReuven Bar-Yehuda, Shimon Even: On Approximating a Vertex Cover for Planar Graphs STOC 1982: 303-309
2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLReuven Bar-Yehuda, Uzi Vishkin: Complexity of Finding k-Path-Free Dominating Sets in Graphs. Inf. Process. Lett. 14(5): 228-232 (1982)
1981
1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLReuven Bar-Yehuda, Shimon Even: A Linear-Time Approximation Algorithm for the Weighted Vertex Cover Problem. J. Algorithms 2(2): 198-203 (1981)

Coauthor Index

1David Amzallag [58]
2Amotz Bar-Noy [33] [36]
3Ann Becker [27] [31] [68]
4Michael Beder [54] [60]
5E. Ben-Hanoch [21]
6Keren Bendel [44]
7Bernard Chazelle [18]
8Benny Chor [10] [16]
9Shmuel Cohen [23]
10Yuval Cohen [54] [60]
11Alon Efrat [17]
12Gershon Elber [23]
13Tuvi Etzion [13] [14]
14Guy Even [34] [41] [46]
15Shimon Even [1] [3]
16Ido Feldman [48] [57]
17Jack A. Feldman [7]
18Jon Feldman [34]
19Guy Flysher [56] [62]
20Sergio Fogel [19] [25]
21Ari Freund [33] [36] [44]
22Dan Geiger [20] [24] [27] [31] [68]
23Oded Goldreich [5] [8] [11] [12]
24Craig Gotsman [22] [29]
25Magnús M. Halldórsson [40] [50]
26Danny Hermelin [61] [63] [64] [65] [67]
27Amos Israeli [9] [15]
28Alon Itai [5] [8] [11] [12] [15] [17]
29Zehavit Kehat [43]
30Eyal Kushilevitz [10] [16]
31Shay Kutten [4] [6]
32Jonathan Laserson [47] [55]
33Yohai Makbily [29]
34Julián Mestre [56] [62]
35Shlomo Moran [14]
36Joseph Naor (Seffi Naor) [20] [24] [33] [34] [36] [40] [50]
37Alon Orlitsky [16]
38Ron Y. Pinter [7]
39Gleb Polevoy [66]
40Dror Rawitz [30] [37] [38] [39] [42] [44] [45] [48] [49] [52] [53] [54] [56] [57] [60] [61] [62] [63] [64] [65] [66] [67]
41Danny Raz [58]
42Ron M. Roth [20] [24]
43Gabriel Scalosub [58]
44Baruch Schieber [33] [36]
45Hadas Shachnai [40] [50]
46Shimon Shahar (Moni Shahar) [41] [46]
47Irina Shapira [40] [50]
48Uzi Vishkin [2]
49Shmuel Wimer [7]
50Yaron Wolfsthal (Yaron Wolfstahl) [4]
51Irad Yavneh [51]
52Shmuel Zaks [4]
53Ron Zohar [59]

Colors in the list of coauthors

Last update Sun May 27 04:04:01 2012 CET by the DBLP TeamThis material is Open Data Data released under the ODC-BY 1.0 license — See also our legal information page