Lilach Chaitman-Yerushalmi

Publication Activity (10 Years)

Years Active: 2012-2019
Publications (10 Years): 3

Top Topics

Network Simplex Algorithm

Communication Networks

Top Venues

J. Discrete Algorithms

Publications

Paz Carmi, Lilach Chaitman-Yerushalmi, Bat-Chen Ozeri
Minimizing the sum of distances to a server in a constraint network. Comput. Geom. 80 (2019)
Greg Aloupis, Paz Carmi, Lilach Chaitman-Yerushalmi, Matthew J. Katz, Stefan Langerman
Bottleneck detour tree of points on a path. Comput. Geom. 79 (2019)
Paz Carmi, Lilach Chaitman-Yerushalmi, Ohad Trabelsi
Bounded-Hop Communication Networks. Algorithmica 80 (11) (2018)
Paz Carmi, Lilach Chaitman-Yerushalmi
On the Minimum Cost Range Assignment Problem. CoRR (2015)
Paz Carmi, Lilach Chaitman-Yerushalmi
On the Minimum Cost Range Assignment Problem. ISAAC (2015)
Paz Carmi, Lilach Chaitman-Yerushalmi, Ohad Trabelsi
On the Bounded-Hop Range Assignment Problem. WADS (2015)
Paz Carmi, Lilach Chaitman-Yerushalmi
Minimum weight Euclidean t-spanner is NP-hard. J. Discrete Algorithms 22 (2013)
Prosenjit Bose, Paz Carmi, Lilach Chaitman-Yerushalmi, Sébastien Collette, Matthew J. Katz, Stefan Langerman
Stable Roommates Spanner. Comput. Geom. 46 (2) (2013)
Paz Carmi, Lilach Chaitman-Yerushalmi
Unexplored Steiner Ratios in Geometric Networks. COCOON (2012)
Prosenjit Bose, Paz Carmi, Lilach Chaitman-Yerushalmi
On bounded degree plane strong geometric spanners. J. Discrete Algorithms 15 (2012)
Paz Carmi, Lilach Chaitman-Yerushalmi
Minimum Weight Euclidean t-spanner is NP-Hard CoRR (2012)