Shmuel Zaks
Affiliations: | University of Illinois, Urbana-Champaign, Urbana-Champaign, IL |
Google:
"Shmuel Zaks"
BETA: Related publications
See more...
Publications
You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect. |
Shalom M, Wong PWH, Zaks S. (2020) Profit Maximization in Flex-Grid All-Optical Networks Theory of Computing Systems \/ Mathematical Systems Theory. 64: 311-326 |
Shachnai H, Voloshin A, Zaks S. (2018) Flexible bandwidth assignment with application to optical networks Journal of Scheduling. 21: 327-336 |
Boyaci A, Ekim T, Shalom M, et al. (2017) Graphs of Edge-Intersecting and Non-Splitting One Bend Paths in a Grid Discrete Mathematics & Theoretical Computer Science. 19 |
Shachnai H, Voloshin A, Zaks S. (2017) Optimizing bandwidth allocation in elastic optical networks with application to scheduling Journal of Discrete Algorithms. 45: 1-13 |
Verma K, Rizzo G, Anta AF, et al. (2017) Energy-optimal collaborative file distribution in wired networks Peer-to-Peer Networking and Applications. 10: 925-944 |
Mertzios GB, Shalom M, Wong PWH, et al. (2017) Online Regenerator Placement Theory of Computing Systems \/ Mathematical Systems Theory. 61: 739-754 |
Sciancalepore V, Mancuso V, Banchs A, et al. (2016) Enhanced Content Update Dissemination Through D2D in 5G Cellular Networks Ieee Transactions On Wireless Communications. 15: 7517-7530 |
Gözüpek D, Shachnai H, Shalom M, et al. (2016) Constructing minimum changeover cost arborescenses in bounded treewidth graphs Theoretical Computer Science. 621: 22-36 |
Boyacı A, Ekim T, Shalom M, et al. (2016) Graphs of edge-intersecting and non-splitting paths Theoretical Computer Science. 629: 40-50 |
Hartstein I, Shalom M, Zaks S. (2016) On the complexity of the regenerator location problem treewidth and other parameters Discrete Applied Mathematics. 199: 199-225 |