The following pages link to Refael Hassin (Q233539):
Displaying 34 items.
- (Q4778555) (← links)
- Approximation algorithms for constructing wavelength routing networks (Q4785217) (← links)
- Robust Matchings (Q4785699) (← links)
- (Q4805048) (← links)
- (Q4829023) (← links)
- Decentralized Regulation of a Queue (Q4838081) (← links)
- (Q4952714) (← links)
- Delay-Minimizing Capacity Allocation in an Infinite Server-Queueing System (Q5113890) (← links)
- Optimal service‐capacity allocation in a loss system (Q5249461) (← links)
- A Maximum Profit Coverage Algorithm with Application to Small Molecules Cluster Identification (Q5307549) (← links)
- Algorithm Theory - SWAT 2004 (Q5315402) (← links)
- The Number of Solutions Sufficient for Solving a Family of Problems (Q5387953) (← links)
- Algorithms and Data Structures (Q5394235) (← links)
- INFORMATION AND UNCERTAINTY IN A QUEUING SYSTEM (Q5422216) (← links)
- Algorithms – ESA 2004 (Q5464597) (← links)
- Algorithms – ESA 2004 (Q5464598) (← links)
- Algorithms – ESA 2005 (Q5475829) (← links)
- Algorithms – ESA 2005 (Q5475880) (← links)
- On Optimal and Equilibrium Retrial Rates in a Queueing System (Q5485366) (← links)
- Approximations for minimum and min-max vehicle routing problems (Q5491457) (← links)
- A Flow Algorithm for Network Synchronization (Q5689780) (← links)
- A Better-Than-Greedy Approximation Algorithm for the Minimum Set Cover Problem (Q5700576) (← links)
- Synthesis of 2-Commodity Flow Networks (Q5704172) (← links)
- Experimental and Efficient Algorithms (Q5710071) (← links)
- Approximation Algorithms and Hardness Results for Labeled Connectivity Problems (Q5756701) (← links)
- A Simple Markovian Spreading Process with Mobile Agents (Q5856671) (← links)
- Algorithms - ESA 2003 (Q5897254) (← links)
- FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science (Q5897767) (← links)
- A note on orientations of mixed graphs (Q5957358) (← links)
- The complexity of bottleneck labeled graph problems (Q5961969) (← links)
- Integrality in the multinetwork min‐cost equal‐flow problem (Q6064158) (← links)
- Strategic behavior in queues with arrival rate uncertainty (Q6167748) (← links)
- On partitioning minimum spanning trees (Q6633521) (← links)
- Pricing heterogeneous products to heterogeneous customers who buy sequentially (Q6638856) (← links)