Lilach Chaitman-Yerushalmi

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