The following pages link to Shmuel Zaks (Q248937):
Displayed 50 items.
- On the Complexity of Approximation and Online Scheduling Problems with Applications to Optical Networks (Q2827800) (← links)
- On the Complexity of the Regenerator Location Problem - Treewidth and Other Parameters (Q2848912) (← links)
- Graphs of Edge-Intersecting Non-splitting Paths in a Tree: Towards Hole Representations (Q2864295) (← links)
- Profit Maximization in Flex-Grid All-Optical Networks (Q2868649) (← links)
- Opportunistic Information Dissemination in Mobile Ad-Hoc Networks: Adaptiveness vs. Obliviousness and Randomization vs. Determinism (Q2894474) (← links)
- Online Optimization of Busy Time on Parallel Machines (Q2898056) (← links)
- Flexible Bandwidth Assignment with Application to Optical Networks (Q2922648) (← links)
- A New Intersection Model and Improved Algorithms for Tolerance Graphs (Q3058531) (← links)
- On the Intersection of Tolerance and Cocomparability Graphs (Q3060736) (← links)
- The recognition of tolerance and bounded tolerance graphs. (Q3113782) (← links)
- The Recognition of Tolerance and Bounded Tolerance Graphs (Q3115865) (← links)
- Optimal Distributed Algorithms for Sorting and Ranking (Q3219776) (← links)
- Fair derivations in context-free grammars (Q3319786) (← links)
- (Q3338269) (← links)
- Traffic Grooming: Combinatorial Results and Practical Resolutions (Q3404459) (← links)
- On-Line Maximum Matching in Complete Multipartite Graphs with Implications to the Minimum ADM Problem on a Star Topology (Q3408178) (← links)
- A combinatorial characterization of the distributed 1-solvable tasks (Q3485850) (← links)
- On the Performance of Beauquier and Debas’ Self-stabilizing Algorithm for Mutual Exclusion (Q3511401) (← links)
- Approximating the Traffic Grooming Problem in Tree and Star Networks (Q3522952) (← links)
- Optimal On-Line Colorings for Minimizing the Number of ADMs in Optical Networks (Q3523227) (← links)
- On Minimizing the Number of ADMs in a General Topology Optical Network (Q3524325) (← links)
- A Self-stabilizing Algorithm with Tight Bounds for Mutual Exclusion on a Ring (Q3540221) (← links)
- Traffic Grooming in Star Networks via Matching Techniques (Q3569115) (← links)
- Placing Regenerators in Optical Networks to Satisfy Multiple Sets of Requests (Q3587450) (← links)
- Opportunistic Information Dissemination in Mobile Ad-hoc Networks: The Profit of Global Synchrony (Q3588315) (← links)
- (Q3753476) (← links)
- The Optimality of Distributive Constructions of Minimum Weight and Degree Restricted Spanning Trees in a Complete Network of Processors (Q3769980) (← links)
- (Q3785907) (← links)
- (Q3790622) (← links)
- Minimum-diameter cyclic arrangements in mapping data-flow graphs onto VLSI arrays (Q3809272) (← links)
- (Q3814791) (← links)
- (Q3912031) (← links)
- (Q4028117) (← links)
- Optimal Linear Broadcast (Q4033770) (← links)
- (Q4232889) (← links)
- (Q4259983) (← links)
- (Q4262693) (← links)
- (Q4281639) (← links)
- A new characterization of tree medians with applications to distributed sorting (Q4291482) (← links)
- (Q4373680) (← links)
- (Q4503936) (← links)
- (Q4536347) (← links)
- Graphs of Edge-Intersecting and Non-Splitting One Bend Paths in a Grid (Q4558956) (← links)
- (Q4560224) (← links)
- A complete characterization of the path layout construction problem for ATM networks with given hop count and load (Q4571983) (← links)
- Optimal bounds for the change-making problem (Q4630257) (← links)
- (Q4744284) (← links)
- (Q4791666) (← links)
- On the Online Coalition Structure Generation Problem (Q5026232) (← links)
- Approximation algorithms for maximum weight <i>k</i>-coverings of graphs by packings (Q5063275) (← links)