#### Filter Results:

- Full text PDF available (53)

#### Publication Year

2003

2018

- This year (6)
- Last 5 years (34)
- Last 10 years (73)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Paz Carmi, Matthew J. Katz, Nissan Lev-Tov
- ISAAC
- 2007

Given a set P of points in the plane, and a set D of unit disks of fixed location, the discrete unit disk cover problem is to find a minimum-cardinality subset Dâ€² âŠ† D that covers all points of P .â€¦ (More)

- Paz Carmi, Matthew J. Katz
- Algorithmica
- 2005

We consider the problem of balancing the load among several service-providing facilities, while keeping the total cost low. Let <i>D</i> be the underlying demand region, and let <i>p</i><sub>1</sub>,â€¦ (More)

- Mathieu Couture, Michel Barbeau, Prosenjit Bose, Paz Carmi, Evangelos Kranakis
- Algorithmica
- 2007

We present the first location-oblivious distributed unit disk graph coloring algorithm having a provable performance ratio of three (i.e. the number of colors used by the algorithm is at most threeâ€¦ (More)

- Paz Carmi, Matthew J. Katz
- Algorithmica
- 2004

We study the power-assignment problem in radio networks, where each radio station can transmit in one of two possible power levels, corresponding to two rangesâ€”short and long. We show that thisâ€¦ (More)

- Boaz Ben-Moshe, Paz Carmi, Matthew J. Katz
- ALENEX/ANALC
- 2004

Given a terrain T and a point p on or above it, we wish to compute the region Rp that is visible from p. We present a generic radar-like algorithm for computing an approximation of Rp. The algorithmâ€¦ (More)

Let P be a set of 2n points in the plane, and letMC (resp., MNC) denote a bottleneck matching (resp., a bottleneck non-crossing matching) of P . We study the problem of computing MNC. We first proveâ€¦ (More)

- A. Karim Abu-Affash, Rom Aschner, Paz Carmi, Matthew J. Katz
- SWAT
- 2010

Symmetric disk graphs are often used to model wireless communication networks. Given a set S of n points in R (representing n transceivers) and a transmission range assignment r : S â†’ R, theâ€¦ (More)

- Esther M. Arkin, Aritra Banik, +4 authors Marina Simakov
- CCCG
- 2015

Let P = {C1, C2, . . . , Cn} be a set of color classes, where each color class Ci consists of a set of points. In this paper, we address a family of covering problems, in which one is allowed toâ€¦ (More)

- Binay K. Bhattacharya, Paz Carmi, Yuzhuang Hu, Qiaosheng Shi
- ISAAC
- 2008

- Amos Beimel, Paz Carmi, Kobbi Nissim, Enav Weinreb
- Electronic Colloquium on Computational Complexity
- 2005

Many approximation algorithms have been presented in the last decades for hard search problems. The focus of this paper is on cryptographic applications, where it is desired to design algorithmsâ€¦ (More)