The following pages link to Paz Carmi (Q390162):
Displaying 50 items.
- Bottleneck non-crossing matching in the plane (Q390164) (← links)
- Minimum weight Euclidean \(t\)-spanner is NP-hard (Q396666) (← links)
- The MST of symmetric disk graphs is light (Q425622) (← links)
- On bounded degree plane strong geometric spanners (Q450575) (← links)
- Spiderman graph: visibility in urban regions (Q482349) (← links)
- Switching to directional antennas with constant increase in radius and hop distance (Q517801) (← links)
- Location-oblivious distributed unit disk graph coloring (Q534767) (← links)
- On a family of strong geometric spanners that admit local routing strategies (Q551501) (← links)
- Spanners of additively weighted point sets (Q635742) (← links)
- Connectivity guarantees for wireless networks with directional antennas (Q654284) (← links)
- A generalized Winternitz theorem (Q657008) (← links)
- Bottleneck detour tree of points on a path (Q670710) (← links)
- Stable roommates spanner (Q691764) (← links)
- \( \delta \)-greedy \(t\)-spanner (Q824327) (← links)
- Minimum-cost load-balancing partitions (Q834581) (← links)
- Power assignment in radio networks with two power levels (Q870460) (← links)
- Compatible connectivity augmentation of planar disconnected graphs (Q894688) (← links)
- Approximating the bottleneck plane perfect matching of a point set (Q904112) (← links)
- Geometric spanners with small chromatic number (Q955227) (← links)
- A linear-space algorithm for distance preserving graph embedding (Q1005326) (← links)
- Distinct distances in graph drawings (Q1010836) (← links)
- Matrix columns allocation problems (Q1019735) (← links)
- Computing all large sums-of-pairs in \(\mathbb R^n\) and the discrete planar two-watchtower problem (Q1029066) (← links)
- Anagram-free chromatic number is not pathwidth-bounded (Q1627156) (← links)
- Bottleneck bichromatic full Steiner trees (Q1628678) (← links)
- Dual power assignment via second Hamiltonian cycle (Q1686228) (← links)
- Locating battery charging stations to facilitate almost shortest paths (Q1720301) (← links)
- Bounded-hop communication networks (Q1755730) (← links)
- Geographic quorum system approximations (Q1774150) (← links)
- Selecting and covering colored points (Q1801049) (← links)
- On the power of the semi-separated pair decomposition (Q1947974) (← links)
- Computing the greedy spanner in near-quadratic time (Q1957650) (← links)
- Sensor network topology design and analysis for efficient data gathering by a mobile mule (Q2006940) (← links)
- Geodesic obstacle representation of graphs (Q2096390) (← links)
- Piercing pairwise intersecting geodesic disks by five points (Q2096392) (← links)
- A linear-time algorithm for minimum \(k\)-hop dominating set of a cactus graph (Q2166266) (← links)
- \(2\times n\) grids have unbounded anagram-free chromatic number (Q2170797) (← links)
- Piercing pairwise intersecting geodesic disks (Q2230402) (← links)
- Bottleneck Steiner tree with bounded number of Steiner vertices (Q2253907) (← links)
- Minimizing the sum of distances to a server in a constraint network (Q2330034) (← links)
- Monochromatic plane matchings in bicolored point set (Q2338213) (← links)
- Bounding the locality of distributed routing algorithms (Q2375823) (← links)
- \(\delta\)-greedy \(t\)-spanner (Q2405280) (← links)
- The minimum-area spanning tree problem (Q2432736) (← links)
- The Euclidean bottleneck Steiner path problem and other applications of \((\alpha ,\beta )\)-pair decomposition (Q2441579) (← links)
- Polynomial-time approximation schemes for piercing and covering with applications in wireless networks (Q2477196) (← links)
- On the Fermat-Weber center of a convex object (Q2571212) (← links)
- Approximating maximum diameter-bounded subgraph in unit disk graphs (Q2665266) (← links)
- Parameterized study of Steiner tree on unit disk graphs (Q2700383) (← links)
- Bottleneck Non-crossing Matching in the Plane (Q2912824) (← links)
