Search Results - "Paz Carmi"

Parameterized Study of Steiner Tree on Unit Disk Graphs by Bhore, Sujoy, Carmi, Paz, Kolay, Sudeshna, Zehavi, Meirav

“…We study the Steiner Tree problem on unit disk graphs. Given a n vertex unit disk graph G , a subset R ⊆ V ( G ) of t vertices and a positive integer k , the…”
Get full text

Approximating Maximum Diameter-Bounded Subgraph in Unit Disk Graphs by Abu-Affash, A. Karim, Carmi, Paz, Maheshwari, Anil, Morin, Pat, Smid, Michiel, Smorodinsky, Shakhar

“…We consider a well-studied generalization of the maximum clique problem which is defined as follows. Given a graph G on n vertices and a fixed parameter d ≥ 1…”
Get full text

Sensor Network Topology Design and Analysis for Efficient Data Gathering by a Mobile Mule by Yedidsion, Harel, Ashur, Stav, Banik, Aritra, Carmi, Paz, Katz, Matthew J., Segal, Michael

“…In this paper, we study the problem of data gathering in ad-hoc sensor networks using a mobile entity called mule . The mule traverses the children of failed…”
Get full text

On the Minimum Consistent Subset Problem by Biniaz, Ahmad, Cabello, Sergio, Carmi, Paz, De Carufel, Jean-Lou, Maheshwari, Anil, Mehrabi, Saeed, Smid, Michiel

“…Let P be a set of n colored points in the d -dimensional Euclidean space. Introduced by Hart (1968), a consistent subset of P , is a set S ⊆ P such that for…”
Get full text

Bottleneck non-crossing matching in the plane by Karim Abu-Affash, A., Carmi, Paz, Katz, Matthew J., Trabelsi, Yohai

“…Let P be a set of 2n points in the plane, and let MC (resp., MNC) denote a bottleneck matching (resp., a bottleneck non-crossing matching) of P. We study the…”
Get full text

An optimal algorithm for computing angle-constrained spanners by Paz Carmi, Michiel Smid

“…Let S be a set of n points in Rd and let t>1 be a real number. A graph G=(S,E) is called a t-spanner for S, if for any two points p and q in S, the…”
Get full text

On the stretch factor of convex polyhedra whose vertices are (almost) on a sphere by Michiel Smid, Prosenjit Bose, Paz Carmi, Mirela Damian, Jean-Lou De Carufel, Darryl Hill, Anil Maheshwari, Yuyang Liu

“…Let $P$ be a convex polyhedron in $\mathbb{R}^3$. The skeleton of $P$ is the graph whose vertices and edges are the vertices and edges of $P$, respectively. We…”
Get full text

On the stretch factor of convex Delaunay graphs by Prosenjit Bose, Paz Carmi, Sebastien Collette, Michiel Smid

“…Let C be a compact and convex set in the plane that contains the origin in its interior, and let S be a finite set of points in the plane. The Delaunay graph…”
Get full text

Dynamic Euclidean bottleneck matching by Abu-Affash, A. Karim, Bhore, Sujoy, Carmi, Paz

“…A fundamental question in computational geometry is for a set of input points in the Euclidean space, that is subject to discrete changes (insertion/deletion…”
Get full text

Stabbing Pairwise Intersecting Disks by Four Points by Carmi, Paz, Katz, Matthew J., Morin, Pat

“…In their seminal work, Danzer (Stud. Sci. Math. Hungar. 21 (1–2), 111–134 (1986)) and Stachó (Mat. Lapok 32 (1–3), 19–47 (1981–84)) established that every set…”
Get full text

Piercing pairwise intersecting geodesic disks by Bose, Prosenjit, Carmi, Paz, Shermer, Thomas C.

“…Given a simple polygon P on n vertices, nr of which are reflex, and a set D of m pairwise intersecting geodesic disks in P, we show that at most 14 points in P…”
Get full text

A linear-time algorithm for minimum k-hop dominating set of a cactus graph by Abu-Affash, A. Karim, Carmi, Paz, Krasin, Adi

“…Given a graph G=(V,E) and an integer k≥1, a k-hop dominating setD of G is a subset of V, such that, for every vertex v∈V, there exists a node u∈D whose…”
Get full text

Minimizing total interference in asymmetric sensor networks by Abu-Affash, A. Karim, Carmi, Paz, Katz, Matthew J.

“…The problem of computing a connected network with minimum interference is a fundamental problem in wireless sensor networks. Several models of interference…”
Get full text

Piercing Diametral Disks Induced by Edges of Maximum Spanning Trees by Abu-Affash, A. Karim, Carmi, Paz, Maman, Meytal

“…Let $P$ be a set of points in the plane and let $T$ be a maximum-weight spanning tree of $P$.For an edge $(p,q)$, let $D_{pq}$ be the diametral disk induced by…”
Get full text

Piercing pairwise intersecting geodesic disks by five points by Abu-Affash, A. Karim, Carmi, Paz, Maman, Meytal

“…Given a simple polygon P on n vertices and a set D of m pairwise intersecting geodesic disks in P, we show that five points in P are always sufficient to…”
Get full text

δ-Greedy t-spanner by Abu-Affash, A. Karim, Bar-On, Gali, Carmi, Paz

“…We introduce a new geometric spanner, δ-Greedy, whose construction is based on a generalization of the known Path-Greedy and Gap-Greedy spanners. The δ-Greedy…”
Get full text

Bounded-Hop Communication Networks by Carmi, Paz, Chaitman-Yerushalmi, Lilach, Trabelsi, Ohad

“…We study the problem of assigning transmission ranges to radio stations in the plane such that any pair of stations can communicate within a bounded number of…”
Get full text

2\times n$ Grids have Unbounded Anagram-Free Chromatic Number by Bazarghani, Saman, Carmi, Paz, Dujmović, Vida, Morin, Pat

“… We show that anagram-free vertex colouring a $2\times n$ square grid requires a number of colours that increases with $n$. This answers an open question in…”
Get full text

Improved PTASs for convex barrier coverage by Carmi, Paz, Katz, Matthew J., Saban, Rachel, Stein, Yael

“…Let R be a connected and closed region in the plane and let S be a set of n points (representing mobile sensors) in the interior of R. We think of R's boundary…”
Get full text

Computing maximum independent set on outerstring graphs and their relatives by Bose, Prosenjit, Carmi, Paz, Keil, J. Mark, Maheshwari, Anil, Mehrabi, Saeed, Mondal, Debajyoti, Smid, Michiel

“…A graph G with n vertices is called an outerstring graph if it has an intersection representation with a set of n curves inside a disk such that one endpoint…”
Get full text