The following pages link to David Peleg (Q244948):
Displayed 50 items.
- Secluded connectivity problems (Q1679225) (← links)
- The topology of wireless communication on a line (Q1698733) (← links)
- Improved approximation algorithms for weighted 2-path partitions (Q1706113) (← links)
- Realizability of graph specifications: characterizations and algorithms (Q1713877) (← links)
- Distance labeling schemes for well-separated graph classes (Q1765518) (← links)
- Virtual path layouts optimizing total hop count on ATM tree networks (Q1775020) (← links)
- Faster exact solutions for some NP-hard problems. (Q1853491) (← links)
- Distributed probabilistic polling and applications to proportionate agreement (Q1854483) (← links)
- Directed virtual path layouts in ATM networks (Q1870524) (← links)
- Deterministic resource discovery in distributed networks (Q1879187) (← links)
- A note on optimal time broadcast in faulty hypercubes (Q1892869) (← links)
- On the maximum density of 0-1 matrices with no forbidden rectangles (Q1893179) (← links)
- The complexity of reconfiguring network models (Q1898112) (← links)
- The availability of quorum systems (Q1908347) (← links)
- Scheduling jobs using common resources (Q1917080) (← links)
- Relaxed spanners for directed disk graphs (Q1939674) (← links)
- A note on exact distance labeling (Q1944109) (← links)
- Faster communication in known topology radio networks (Q1954206) (← links)
- Nonuniform SINR+Voronoi diagrams are effectively uniform (Q2043011) (← links)
- Relaxed and approximate graph realizations (Q2115836) (← links)
- Mixed preferential attachment model: homophily and minorities in social networks (Q2139688) (← links)
- Vertex-weighted graphs: realizable and unrealizable domains (Q2154111) (← links)
- The generalized microscopic image reconstruction problem (Q2172424) (← links)
- Fault tolerant approximate BFS structures with additive stretch (Q2211352) (← links)
- Robust fault tolerant uncapacitated facility location (Q2250439) (← links)
- Randomized distributed decision (Q2256969) (← links)
- More on looping vs. repeating in dynamic logic (Q2265813) (← links)
- Vertex-weighted realizations of graphs (Q2286737) (← links)
- Message lower bounds via efficient network synchronization (Q2292919) (← links)
- Graph profile realizations and applications to social networks (Q2327517) (← links)
- Truth tellers and liars with fewer questions (Q2342617) (← links)
- Fault tolerant additive and \((\mu, \alpha)\)-spanners (Q2344775) (← links)
- Distance-dependent distributed directories (Q2365761) (← links)
- Proof labeling schemes (Q2377139) (← links)
- Broadcasting in UDG radio networks with unknown topology (Q2377263) (← links)
- Approximation algorithm for hotlink assignment in the greedy model (Q2383606) (← links)
- Distributed distance computation and routing with small messages (Q2422769) (← links)
- On approximating the \(d\)-girth of a graph (Q2444552) (← links)
- Labeling schemes for weighted dynamic trees (Q2464140) (← links)
- The hardness of approximating spanner problems (Q2464336) (← links)
- Polynomial time approximation schemes for base station coverage with minimum total radii (Q2484959) (← links)
- Informative labeling schemes for graphs (Q2566038) (← links)
- Graph exploration by a finite automaton (Q2575752) (← links)
- On vertex-weighted realizations of acyclic and general graphs (Q2672574) (← links)
- Hotelling games in fault-prone settings (Q2672575) (← links)
- On vertex-weighted graph realizations (Q2692719) (← links)
- A Near-Tight Lower Bound on the Time Complexity of Distributed Minimum-Weight Spanning Tree Construction (Q2706118) (← links)
- The Wakeup Problem in Synchronous Broadcast Systems (Q2719162) (← links)
- (Q2721981) (← links)
- (Q2728855) (← links)