Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Boaz Ben-Moshe
2010 – today
- 2012
[j13]Boaz Ben-Moshe: Geometric heuristics for rural radio maps approximation. J. Heuristics 18(2): 215-237 (2012)- [j12]Boaz Ben-Moshe, Amit Dvir, Michael Segal, Arie Tamir: Centdian Computation in Cactus Graphs. J. Graph Algorithms Appl. 16(2): 199-224 (2012)
- [j11]Eran Shaham, David Sarne, Boaz Ben-Moshe: Sleeved co-clustering of lagged data. Knowl. Inf. Syst. 31(2): 251-279 (2012)
- [j10]Boaz Ben-Moshe, Paz Carmi, Moti Shani, Nir Shvalb: Efficient model for indoor radio paths computation. Simulation Modelling Practice and Theory 29: 163-172 (2012)
- 2011
- [c21]Boaz Ben-Moshe, Elazar Elkin, Harel Levi, Ayal Weissman: Improving Accuracy of GNSS Devices in Urban Canyons. CCCG 2011
- [c20]
- 2010
- [c19]Boaz Ben-Moshe, Paz Carmi, Lilach Chaitman, Matthew J. Katz, Gila Morgenstern, Yael Stein: Direction assignment in wireless networks. CCCG 2010: 39-42
- [c18]
- [c17]Boaz Ben-Moshe, Amit Dvir, Michael Segal, Arie Tamir: Centdian Computation for Sensor Networks. TAMC 2010: 187-198
2000 – 2009
- 2009
- [j9]Amos Beimel, Boaz Ben-Moshe, Yehuda Ben-Shimol, Paz Carmi, Eldad Chai, Itzik Kitroser, Eran Omri: Matrix columns allocation problems. Theor. Comput. Sci. 410(21-23): 2174-2183 (2009)
- 2008
- [j8]Boaz Ben-Moshe, Paz Carmi, Matthew J. Katz: Approximating the Visible Region of a Point on a Terrain. GeoInformatica 12(1): 21-36 (2008)
- [j7]Rong Ge, Martin Ester, Byron J. Gao, Zengjian Hu, Binay K. Bhattacharya, Boaz Ben-Moshe: Joint cluster analysis of attribute data and relationship data: The connected k-center problem, algorithms and applications. TKDD 2(2) (2008)
- 2007
- [j6]Yehuda Ben-Shimol, Boaz Ben-Moshe, Yoav Ben-Yehezkel, Amit Dvir, Michael Segal: Automated antenna positioning algorithms for wireless fixed-access networks. J. Heuristics 13(3): 243-263 (2007)
- [j5]Boaz Ben-Moshe, Matthew J. Katz, Joseph S. B. Mitchell: A Constant-Factor Approximation Algorithm for Optimal 1.5D Terrain Guarding. SIAM J. Comput. 36(6): 1631-1647 (2007)
- [j4]Boaz Ben-Moshe, Binay K. Bhattacharya, Qiaosheng Shi, Arie Tamir: Efficient algorithms for center problems in cactus networks. Theor. Comput. Sci. 378(3): 237-252 (2007)
- [c16]Boaz Ben-Moshe, Binay K. Bhattacharya, Sandip Das, Daya Ram Gaur, Qiaosheng Shi: Computing a planar widest empty alpha-siphon in o(n3) time. CCCG 2007: 33-36
- [c15]Boaz Ben-Moshe, Yefim Dinitz: Fast Additive Constant Approximation Algorithms for the Safe Deposit Boxes Problem with Two and Three Currencies. CCCG 2007: 53-56
- [c14]Boaz Ben-Moshe, Liad Serruya, Ariel Shamir: Image Compression Terrain Simplification. CCCG 2007: 125-128
- [c13]Boaz Ben-Moshe, Matthew J. Katz, Igor Zaslavsky: Distance Preserving Terrain Simplification - An Experimental Study. CCCG 2007: 129-132
- 2006
- [c12]Boaz Ben-Moshe, Binay K. Bhattacharya, Qiaosheng Shi: An Optimal Algorithm for the Continuous/Discrete Weighted 2-Center Problem in Trees. LATIN 2006: 166-177
- [c11]Martin Ester, Rong Ge, Byron J. Gao, Zengjian Hu, Boaz Ben-Moshe: Joint Cluster Analysis of Attribute Data and Relationship Data: the Connected k-Center Problem. SDM 2006
- 2005
- [c10]
- [c9]Boaz Ben-Moshe, Binay K. Bhattacharya, Qiaosheng Shi: Computing the Widest Empty Boomerang. CCCG 2005: 80-83
- [c8]Boaz Ben-Moshe, Binay K. Bhattacharya, Qiaosheng Shi: Farthest Neighbor Voronoi Diagram in the Presence of Rectangular Obstacles. CCCG 2005: 243-246
- [c7]Boaz Ben-Moshe, Binay K. Bhattacharya, Qiaosheng Shi: Efficient Algorithms for the Weighted 2-Center Problem in a Cactus Graph. ISAAC 2005: 693-703
- [c6]Boaz Ben-Moshe, Matthew J. Katz, Joseph S. B. Mitchell: A constant-factor approximation algorithm for optimal terrain guarding. SODA 2005: 515-524
- 2004
- [j3]Boaz Ben-Moshe, Matthew J. Katz, Joseph S. B. Mitchell, Yuval Nir: Visibility preserving terrain simplification-- an experimental study. Comput. Geom. 28(2-3): 175-190 (2004)
- [j2]Boaz Ben-Moshe, Paz Carmi, Matthew J. Katz: Computing all large sums-of-pairs in Rn and the discrete planar two-watchtower problem. Inf. Process. Lett. 89(3): 137-139 (2004)
- [c5]Boaz Ben-Moshe, Paz Carmi, Matthew J. Katz: Approximating the Visible Region of a Point on a Terrain. ALENEX/ANALC 2004: 120-128
- [c4]Boaz Ben-Moshe, Olaf A. Hall-Holt, Matthew J. Katz, Joseph S. B. Mitchell: Computing the visibility graph of points within a polygon. Symposium on Computational Geometry 2004: 27-35
- 2002
- [c3]Boaz Ben-Moshe, Joseph S. B. Mitchell, Matthew J. Katz, Yuval Nir: Visibility preserving terrain simplification: an experimental study. Symposium on Computational Geometry 2002: 303-311
- 2001
- [c2]Boaz Ben-Moshe, Matthew J. Katz, Joseph S. B. Mitchell: Farthest neighbors and center points in the presence of rectangular obstacles. Symposium on Computational Geometry 2001: 164-171
- 2000
- [j1]Boaz Ben-Moshe, Matthew J. Katz, Michael Segal: Obnoxious Facility Location: Complete Service with Minimal Harm. Int. J. Comput. Geometry Appl. 10(6): 581-592 (2000)
1990 – 1999
- 1999
- [c1]Boaz Ben-Moshe, Matthew J. Katz, Michael Segal: Obnoxious facility location: Complete service with minimal harm. CCCG 1999
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2012-12-08 21:05 CET by the dblp team