 R. Hassin
Generalizations of Hoffman's existence theorem for circulations
Networks
11(1981), 243254.
 R. Hassin
Maximum
flow in (s,t
) planar networks
Information Processing
Letters
13 (1981), 107.
 R. Hassin
On
maximizing functions by Fibonacci search
The Fibonacci Quarterly
19 (1981), 347351.
 R. Hassin
Minimum
cost flow with set constraints
Networks
12 (1982), 121.
 A.
Glazer and R. Hassin
On the economics of subscriptions
European Economic Review 19 (1982), 343356.
 R. Hassin and Z. Lieber
Optimal consumption with a stochastic income stream and
two interest rates
Southern Economic Journal
49 (1982), 482493.
 A.
Glazer
and R. Hassin
The economics of cheating in the taxi market
Transportation Research,
17A (1983), 2531.
** What fare is fair? **
 R. Hassin
The minimum cost flow problem: A unifying approach to existing
algorithms and a new tree search algorithm
Mathematical Programming,
25 (1983), 228239.
 A.
Glazer and R. Hassin
?/M/1: On the equilibrium distribution of customer arrivals
European Journal of
Operational Research
13 (1983), 146150.
 R. Hassin
A dichotomous search for a geometric random variable
Operations Research
32 (1984), 432439.
 R. Hassin and M.
Henig
A dichotomous search for random objects on an interval
Mathematics of Operations
Research,
9 (1984), 301308.
 R. Hassin
On multicommodity flows in planar graphs
Networks
14 (1984), 225235.
 R. Hassin and D.B. Johnson
An O(nlog^{2}n)
algorithm for maximum flow in undirected planar
networks
SIAM Journal on Computing
14 (1985), 612624.
 R. Hassin and N. Megiddo
An optimal algorithm for finding all the jumps of a monotone
stepfunction
Journal of Algorithms
6 (1985), 265274.
 R. Hassin and E.
Zemel
On shortest paths in graphs with random weights
Mathematics of Operations
Research
10 (1985), 557564.
Also: A computing scheme for network problems with random edge lengths
Stochastics in
Combinatorial Optimization,
G. Andreatta, F. Mason, P. Serafini (Eds.), (1987), 228232.
 R. Hassin
On the optimality of first come last served queues
Econometrica
53 (1985), 201202.
** The thirst to go first **
**
The first one now will later be last **
**
Are you being served? **
 A.
Glazer and R. Hassin
Stable priority purchasing in queues
Operations Research Letters
4 (1986), 285288.
 R. Hassin
Consumer information in markets with random product quality:
the case of queues and balking
Econometrica
54 (1986), 11851195.
 R. Hassin and A.
Tamir
Efficient algorithms for optimization and selection on
seriesparallel graphs
SIAM Journal on Algebraic
and Discrete Methods
7
(1986), 379389.

F. Granot and R. Hassin
Multiterminal maximum flows in nodecapacitated networks
Discrete Applied Mathematics
13 (1986), 157167.
 R. Hassin and M.
Henig
Control of arrivals and departures in a statedependent inputoutput
system
Operations Research Letters
5 (1986), 3336.
 A.
Glazer and R. Hassin
A deterministic single item inventory model with seller
holding cost and buyer holding and shortage costs
Operations Research
34 (1986), 613618.
 A.
Glazer and R. Hassin
Equilibrium arrivals in queues with bulk service at scheduled times
Transportation Science
21 (1987), 273278.
 R. Hassin and E.
Zemel
Probabilistic analysis of the capacitated transportation problem
Mathematics of Operations
Research
13 (1988), 8089.
 R. Hassin
Solution bases of multiterminal cut problems
Mathematics of Operations
Research
13 (1988), 535542.
 A.
Glazer and R. Hassin
Optimal contests
Economic Inquiry
26 (1988), 133143.
Also in :
40 Years of Research on Rent Seeking 1: Theory of Rent
Seeking,
R. D. Congleton, A. L. Hillman, and K. A. Konrad (Eds.), (2008),
589599.
 R. Hassin and A.
Tamir
Maximizing classes of two parameter objectives over matroids
Mathematics of Operations
Research
14 (1989), 362375.
 R. Hassin and
N. Megiddo
On orientations and shortest paths
Linear Algebra and Its
Applications
114/115(1989), 589602.
 S. Anily
and R. Hassin
Ranking the best binary trees
SIAM Journal on Computing
18 (1989), 882892.
 R. Hassin
An algorithm for computing maximum solution bases
Operations Research Letters
9 (1990), 315318.
overview: SIGAL 1990, LNCS 450, 288299.
 A.
Glazer and R. Hassin
Optimal sales to users who hold inventory
Economics Letters
34 (1990),
215220.
 R. Hassin and
N. Megiddo
Approximation algorithms for hitting objects by straight lines
Discrete Applied Mathematics
30 (1991), 2942.
 R. Hassin and
N. Megiddo
Exact computation of optimal inventory policies over an
unbounded horizon
Mathematics of Operations
Research
16 (1991), 534546.
 R. Hassin
Multiterminal
xcut problems
Annals of Operations
Research
33 (1991), 215225.
 Refael Hassin and
Arie Tamir
Improved complexity bounds for location problems on the real line
Operations Research Letters
10 (1991), 395402.
 R. Hassin
Approximation schemes for the restricted shortest path problem
Mathematics of Operations
Research
17
(1992), 3642.
 R. Hassin and R.
Hotovly
Asymptotic analysis of dichotomous search with search and
travel costs
European Journal of
Operational Research
58 (1992), 7889.
 R. Hassin and M.
Haviv
Mean
passage times and nearly uncoupled Markov chains
SIAM Journal on Discrete
Mathematics
5 (1992), 386397.
 R. Hassin and A.
Tamir
Minimal length curves that are not embedded in an open planar set: The
problem of a lost swimmer with a
compass
SIAM Journal on Control and
Optimization
30 (1992), 695703.

S. Anily and R. Hassin
The swapping problem
Networks
22 (1992), 419433.
 R. Hassin
Algorithms for the minimum cost circulation problem based on
maximizing the mean improvement
Operations Research Letters
12 (1992), 227233.
 R. Hassin and M.
Henig
Monotonicity and efficient computation of optimal dichotomous search
Discrete Applied Mathematics
46 (1993),
221234.
 E. Arkin,
M.
Halldorsson, and R. Hassin
Approximating the tree and tour covers of a graph
Information Processing
Letters
47 (1993), 275282.
 E. Arkin
and R. Hassin
Approximation algorithms for the geometric covering salesman
problem
Discrete Applied Mathematics
55 (1994),
197218.
 R. Hassin and M.
Haviv
Equilibrium strategies and the value of information in a two line
queueing system with partial jockeying
Communications in
Statistics  Stochastic Models
10 (1994), 415436.
 R. Hassin and S. Rubinstein
Approximations for the maximum acyclic subgraph problem
Information Processing
Letters
51 (1994), 133140.
 R. Hassin and S. Lahav
Maximizing the number of unused colors in the vertex coloring
problem
Information Processing
Letters
52 (1994),
8790.
 R. Hassin and A.
Tamir
On the minimum diameter spanning tree problem
Information Processing
Letters
53 (1995), 109111.
 R. Hassin
Decentralized regulation of a queue
Management Science
41 (1995), 163173.
 R. Hassin and M.
Haviv
Equilibrium strategies for queues with impatient customers
Operations Research Letters
17
(1995), 4145.
 M. Benelli and R. Hassin
Optimal separable partitioning in the plane
Discrete Applied Mathematics
59 (1995), 215224.
 R. Hassin and M.
Haviv
On optimal and equilibrium retrial rates in a queueing system
Probability in the
Engineering and Informational Sciences
10
(1996), 223227.
Also: Proceedings of The 13th National Conference of the Australian
Society for Operations
Research (1995), 197224.
 R. Hassin
A flow algorithm for network synchronization
Operations Research
44 (1996), 570579.
 R. Hassin
On
the advantage of being the first server
Management Science
42 (1996), 618623.
 R. Hassin and M.
Haviv
Equilibrium threshold strategies: The case of queues
with priorities
Operations Research
45
(1997), 966973.
 N.
GuttmannBeck and R. Hassin
Approximation algorithms for minmax tree partition
Journal of Algorithms
24 (1997), 266286.
 E. Arkin,
R. Hassin, and L. Klein
Restricted delivery problems on a network
Networks
29(1997), 205216.
 R. Hassin and S. Rubinstein
An approximation algorithm for maximum packing of 3edge paths
Information Processing
Letters
63 (1997), 6367.
 R. Hassin, S. Rubinstein
and A. Tamir
Approximation algorithms for maximum dispersion
Operations Research Letters
21 (1997), 133137.
 A.
Glazer and R. Hassin
Government failures in evaluating policy
Public Choice
94 (1998), 105115.

S. Anily, C.A.
Glass and R. Hassin
The scheduling of maintenance service
Discrete Applied Mathematics
82 (1998), 2742.
 A.
Glazer and R. Hassin
Optimal allocation of quotas
Economics Letters
58 (1998), 5561.
 E. Arkin
and R. Hassin
On local search for weighted packing problems
Mathematics of Operations
Research
23 (1998), 640648.
Also: Proceedings of ESA 1997, LNCS
1284, 1322.
 E. Arkin
and R. Hassin
Graph partitions with minimum degree constraints
Discrete Mathematics
190 (1998), 5565.
 N.
GuttmannBeck and R. Hassin
Approximation algorithms for minimum tree partition
Discrete Applied Mathematics
87 (1998), 117137.
 N.
GuttmannBeck and R. Hassin
Approximation algorithms for minsum pclustering
Discrete Applied Mathematics
89 (1998), 125142.
 R. Hassin and S. Rubinstein
An approximation algorithm for the maximum traveling salesman
problem
Information Processing
Letters
67 (1998),
125130.

S. Anily,
C.A. Glass, and R. Hassin
Scheduling maintenance service to three machines
Annals of Operations
Research
86 (1999), 375391.
 A.
Glazer and R. Hassin
Sequential rent seeking
Public Choice
102 (2000), 219228.
 R. Hassin and S. Rubinstein
Better approximations for Max TSP
Information Processing
Letters
75 (2000), 181186.
 N.
GuttmannBeck and R. Hassin
Approximation algorithms for minimum Kcut
Algorithmica
27 (2000), 198207.
 N.
GuttmannBeck, R. Hassin,
S. Khuller,
and B.
Raghavachari
Approximation
algorithms with bounded performance guarantees for
the clustered traveling salesman problem
Algorithmica
28 (2000), 422437.
Also: Proceedings of FSTTCS 1998, LNCS 1530
617.
 E. Arkin
and R. Hassin
Minimum diameter covering problems
Networks
36 (2000), 147155.
 E. Arkin,
R. Hassin and
M. Sviridenko
Approximating the maximum quadratic assignment problem
Information Processing
Letters
77 (2001), 1316.
Also: Proceedings of the 11th Annual ACMSIAM Symposium on Discrete
Algorithms (SODA 2000),
889890.

A. Ageev, R. Hassin and
M. Sviridenko
An 0.5approximation algorithm for the MAX DICUT with Given Sides of
Parts
SIAM Journal on Discrete
Mathematics 14
(2001), 246255.
Also : Proceedings of APPROX 2000, LNCS 1463,
3441.
 R. Hassin and S. Rubinstein
Approximation algorithms for maximum linear arrangement
Information Processing
Letters 80
(2001), 171177.
Also: Proceedings of SWAT 2000, LNCS 1851,
231236.
 A.
Glazer and R. Hassin
The calculus of stonewalling
Journal of Theoretical
Politics 13
(2001), 413424.
 E. Arkin
and R. Hassin
Orientations of mixed graphs
Discrete Applied Mathematics
116
(2001), 313320.
 R. Hassin and S.
Khuller
zapproximations
Journal of Algorithms
41,
(2001) 429442.
 R. Hassin and S. Rubinstein
A 7/8approximation algorithm for metric Max TSP
Information Processing
Letters 81
(2002), 247251.
Also: Proceedings of WADS 2001, LNCS
2125, 205209.

B. Chen,
R. Hassin,
and M. Tzur
Allocation of bandwidth and storage
IIE Transactions
34 (2002), 501507.

Y. Asahiro, R. Hassin, and K.
Iwama
Complexity of finding dense subgraphs
Discrete Applied Mathematics
121 (2002), 1526.
 E. Arkin,
R. Hassin, and S. Shachar
Increasing digraph connectivity by arc addition, reversal and
complement
Discrete Applied Mathematics
122 (2002),
1322.
 R. Hassin and M.
Haviv
Nash equilibrium and subgame perfection in observable queues
Annals of Operations
Research
113 (2002), 1526.
 R. Hassin and A.
Levin
Approximation algorithms for constructing wavelength routing networks
Networks
40 (2002),
3237.
 R. Hassin and S. Rubinstein
Robust matchings
SIAM Journal on Discrete
Mathematics
15 (2002),
530537.
Also: Proceedings of SWAT 2000, LNCS
1851 , 251258.
 R. Hassin and A.
Levin
Subgraphs decomposable into two trees and kedgeconnected
graphs
Discrete Applied Mathematics
126 (2003), 181195.
 R. Hassin and S. Rubinstein
Approximation algorithms for the metric maximum clustering problem with
given cluster sizes
Operations Research Letters
31 (2003),
179184.
 M.
Conforti, R. Hassin, and
R. Ravi
Reconstructing flow paths
Operations Research Letters
31
(2003), 273276.
 R. Hassin and A.
Levin
Minimum spanning tree with hop restrictions
Journal of Algorithm
48 (2003), 220238.
 S. Guha,
R. Hassin, S. Khuller,
and E. Or
Capacitated
vertex covering with applications
Journal of Algorithms
48 (2003), 257270.
Also: Proceedings of the 13th Annual ACMSIAM
Symposium on Discrete Algorithms (SODA 2002), 858865.
 R. Hassin,
R. Ravi, and F. S.
Salman
Approximation algorithms for the network design problem with a
single cable type
Algorithmica
38 (2003),
417431.
Also: Proceedings of APPROX 2000, LNCS
1913, 167176.
 R. Hassin, A.
Levin and D. Morad
Lexicographic local search and the pcenter
problem
European Journal of
Operational Research
151 (2003), 265279.
 R. Hassin and A.
Levin
Minimum restricted diameter spanning trees
Discrete Applied Mathematics
137 (2004),
Also: Proceedings of APPROX 2002, LNCS 2462,
175184.
 R. Hassin and A.
Levin
Synthesis of 2commodity flow networks
Mathematics of Operations
Research 29
(2004), 280288.
 R. Hassin and A.
Levin
An efficient polynomial time approximation scheme for the
constrained minimum spanning tree problem using matroid intersection
SIAM Journal on Computing
33
(2004), 261268.
 E. Arkin,
R. Hassin,
S. Rubinstein
and
M. Sviridenko
Approximations for maximum transportation problem with permutable
supply vector and other capacitated star packing problems
Algorithmica
39 (2004), 175187.
Also: Proceedings of SWAT 2002, LNCS 2368, 280287.
 R. Hassin and S. Rubinstein
On the complexity of the vehicle routing problem
Operations Research Letters
33
(2004), 7176.
 R. Hassin and M. Shani
Machine scheduling with earliness, tardiness and nonexecution penalties
Computers and Operations
Research 32
(2005),
683705.
 C. Bazgan,
R. Hassin, and
J. Monnot
Approximation algorithms for some routing problems
Discrete Applied Mathematics 146 (2005), 2742.
Also: CIAC 2003, LNCS 2653, 277288.
 R. Hassin and
J. Monnot
The maximum saving partition problem
Operations Research Letters 33 (2005), 242248.
 R. Hassin and
A. Levin
Approximation algorithms for quickest spanning tree problems
Algorithmica 41 (2005), 4352.
Also: Proceedings of ESA 2004, LNCS 3221, 403413.
 A. Veltman
and R. Hassin
Equilibrium in queueing systems with complementary products
Queueing Systems 50 (2005), 325342.

O. Einstein
and R. Hassin
The number of solutions sufficient for solving a family of problems
Mathematics of Operations Research 30 (2005), 880896.
 R. Hassin and
A. Levin
A betterthangreedy approximation algorithm for the minimum set cover
problem
SIAM Journal on Computing 35 (2005), 189200.
 E. Arkin,
R. Hassin, and
A. Levin
Approximation algorithms for minimum and minmax vehicle routing
Journal of Algorithms 59 (2006), 118.
 R. Hassin and
M. Haviv
Who should be given priority in a queue?
Operations Research Letters 34 (2006), 191198.
 R. Hassin and
D. Segev
Robust subgraphs for trees and paths
ACM Transactions on Algorithms 2 (2006), 263281.
Also: Proceedings of SWAT 2004, LNCS 3111, 5163.
 R. Hassin and
A. Levin
The minimum generalized vertex cover problem
ACM Transactions on Algorithms 2 (2006), 6678.
Also: Proceedings of ESA 2003, LNCS 2832, 289300.

Z. Agur, R. Hassin and
S. Levy
Optimizing chemotherapy scheduling using local search heuristics
Operations Research. 54 (2006), 829846.
 R. Hassin and S. Rubinstein
An improved approximation algorithm for the metric maximum clustering
problem with given cluster sizes
Information Processing Letters 98 (2006), 9295.
 R. Hassin and
S. Rubinstein
An approximation algorithm for maximum triangle packing
Discrete Applied Mathematics 154 (2006), 971979.
Erratum:
Discrete Applied Mathematics 154 (2006), 2620.
Also: Proceedings of ESA 2004, LNCS 3221, 395402.
 R. Hassin
Information and uncertainty in a queueing system
Probability in the Engineering and Informational Sciences 21 (2007), 361380.
 R. Hassin and
A. Levin
Flow trees for vertexcapacitated networks
Discrete Applied Mathematics 155 (2007), 572578.
 R. Hassin,
J. Monnot
and
D. Segev
Approximation algorithms and hardness results for labeled
connectivity problems
Journal of Combinatorial Optimization 14 (2007), 437453.
Also: Proceedings of MFCS 2006, LNCS 4162 480491.
 E. Arkin
and R. Hassin
The kpath tree matroid and its application to survivable
network design
Journal of Combinatorial Optimization. Special Issue in
Memory of George Dantzig. 5 (2008), 314322.
 R. Hassin and A. Keinan,
Greedy heuristics with regret, with application to
the cheapest insertion algorithm for the TSP
Operations Research Letters 36 (2008), 243246.
 R. Hassin and
D. Segev
Rounding to an Integral Program
Operations Research Letters 36 (2008), 321326.
Also: WEA 2005, LNCS 3503, 4454.
 R. Hassin and S. Mendel
Scheduling arrivals to queues: a model with noshows
Management Science 54 (2008), 565572.

R. Hassin,
J. Puerto and
Francisco R. Fernandez
The use of relative priorities in optimizing the performance of a
queueing system
European Journal of Operational Research 193 (2009), 476483.
 R. Hassin,
A. Levin
and S. Rubinstein
Approximation algorithms for maximum latency and partial cycle cover
Discrete Optimization 6 (2009), 197205.
Also: ESA 2005, LNCS 3669 726733.
 R. Hassin
Equilibrium customers choice between FCFS and Random servers
Queueing Systems 62 (2009), 243254.
** Queuing is bad for your bottom line **
** Wie wir alle schneller shoppen könnten **
 R. Hassin,
A. Levin
and
M. Sviridenko
Approximating the minimum quadratic assignment problems
ACM
Transactions on Algorithms 6 (2009), 197205.

N.
GuttmannBeck and R. Hassin
On two restricted ancestors tree problems
Information Processing Letters 110 (2010), 570575.
 R. Hassin,
J. Monnot,
and
D. Segev
The complexity of bottleneck labeled graph problems
Algorithmica 58 (2010), 245262.
Also: WG 2007, LNCS 4769, 328340.
 A.
Glazer and R. Hassin
Inducing search by periodic advertising
Information Economics and Policy 22 (2010), 276286.
 R. Hassin and E. Or
Min sum clustering with penalties
European Journal of Operational Research 206 (2010), 547554.
Also: ESA 2005, LNCS 3669 167178.
 R. Hassin and
G. Goraly
Multicolor pebble motion on graphs
Algorithmica 58 (2010) 610636.
 R. Hassin and Y. Kleiner
Equilibrium and optimal arrival patterns to a server with opening and
closing times
IIE Transactions 43 (2011) 164175.
** Is earlybird queueing a good idea? **
 P.
Guo and R. Hassin
Strategic behavior and social optimization in Markovian vacation
queues
Operations Research 59 (2011) 986997.
 N.
GuttmannBeck and R. Hassin
On coloring the arcs of a tournament, covering shortest paths, and
reducing the diameter of a graph
Discrete Optimization 8 (2011) 302314.
 N.
GuttmannBeck> and R. Hassin
Seriesparallel orientations preserving the cycleradius
Information Processing Letters 112 (2012) 153160.
 P. Guo
and R. Hassin
Strategic behavior and social optimization in Markovian vacation
queues: the case of heterogeneous customers
European Journal of Operational Research (2012) 278286.
 E. Arkin,
N.
GuttmannBeck and R. Hassin,
The (K,k)Capacitated Spanning Tree Problem
Discrete Optimization 9 (2012) 258266.
Also: AAIM 2005, LNCS 6124 2534.
 P. Guo
and R. Hassin
On the advantage of leadership in service pricing competition
Operations Research Letters 41 (2013) 397402.
 S. Anily
and R. Hassin
Pricing, replenishment, and timing of selling in a market
with heterogeneous customers
International Journal of Production Economics 145 (2013) 672682.

R. Hassin and O. Schneider
A local search algorithm for binary maximum 2path partitioning
Discrete Optimization 10 (2013) 333360.

G. GilboaFreedman,
R. Hassin, and Y. Kerner
The price of anarchy in the Markovian single server queue
IEEE Transactions on Automatic Control 59 (2014) 455459.

G. GilboaFreedman
and R. Hassin
Regulation under partial cooperation: the case of a queueing system
Operations Research Letters 42 (2014) 217221.
 J. Erlichman and R. Hassin
Strategic overtaking in a monopolistic observable M/M/1 queue
IEEE Transacions on Automatic Control 60 (2015) 21892194.
Thesis (full) version
Also: VALUETOOLS 2009.
 R. Hassin Y. Shaki, and U. Yovel
Optimal servicecapacity allocation in a loss system
Naval Research Logistics 62 (2015) 8197.
 Jian Chen,
Shuo Huang, R. Hassin, and Nan Zhang,
Two backorder compensation
mechanisms in inventory systems with impatient customers
Production and Operations Management
24 (2015) 16401656.
 P. Guo
and R. Hassin
Equilibrium strategies for placing duplicate orders in
a single server queue
Operations Research Letters 43 (2015) 343348.
 R. Hassin and U. Yovel
Sequential scheduling on identical machines
Operations Research Letters 43 (2015) 530533.

G. GilboaFreedman
and R. Hassin
When Markov chains meet: a continuous time model of network evolution
Statistics and Probability Letters 116 (2016) 131138.

R. RoetGreen
and R. Hassin
The impact of inspection cost on equilibrium, revenue, and social welfare
in a single server queue
Operations Research 65 (2017) 804820.
Early version was titled: Equilibrium in a two dimensional queueing game:
when inspecting the queue is costly
 R. Hassin and Ran Snitkovsky
Strategic customer behavior in a queueing system with a
loss subsystem
Queueing Systems 86 (2017) 361387.
 R. Hassin, and A. Koshman
Profit maximization in the M/M/1 queue
Operations Research Letters 45 (2017) 436441.
Also: VALUETOOLS 2014.
 R. Engel and R. Hassin
Customer equilibrium in a singleserver system with virtual and
system queues
Queueing Systems 87 (2017) 161180.
 R. Hassin,
R. Ravi
and
F. S. Salman
Multiple facility location on a network with linear reliability
order of edges
Journal of Combinatorial Optimization 34 (2017)
931955.
Early versions: Proceedings of INOC 2009; Proceedings of ESA 2009,
LNCS 5757,
275276.
 R. Hassin and A. Sarid
Operations research applications of dichotomous search
European Journal of Operational Research
265 (2018) 795812.
 R. Hassin,
I. Nowik,
and
Y.Y. Shaki
On the price of anarchy in a single server queue with
heterogenous service valuations induced by travel costs
European Journal of Operational Research.
 A. Glazer,
R. Hassin and
L. Ravner
A strategic model of job arrivals to a single machine with
earliness and tardiness penalties
IISE Transactions.
50 (2018) 265278.

R. RoetGreen
and R. Hassin
Cascade equilibrium strategies in a twoserver queueing system with
inspection cost
European Journal of Operational Research.
Also: Information cascades in a queueing system with parallel
servers, VALUETOOLS 2012.
Submitted for publication
 R. Hassin and
L. Ravner
Delayminimizing capacity allocation in an infinite
server queueing system.
 R. Hassin,
R. Ravi,
F. S. Salman, and
D. Segev
The approximability of multiple facility location with random arc
failures.

L. Debo,
R. Hassin,
and S.
Veeraraghavan
Should customer waiting costs be compensated?

R. Hassin.
Equilibrium and optimal oneshot delegated search.
Other reports
 E.
Altman and R. Hassin
Nonthreshold equilibrium for customers joining an
M/G/1
queue
Proceedings of the 10th
International Symposium of Dynamic Games and Applications, 2002.
 R. Hassin and
D. Segev
The multiradius cover problem
WADS 2005, LNCS 3608 2435.
 R. Hassin and
D. Segev
The set cover with pairs problem
FSTTCS 2005, LNCS 3821 164176.
 R. Hassin and A.
Levin
An approximation algorithm for the minimum latency set cover problem
ESA 2005.
 R. Hassin and E. Or
A maximum profit coverage algorithm with application to small
molecules cluster identification
WEA 2006, LNCS 4007 265276.

N. GuttmannBeck and R.
Hassin
Minimum diameter and cyclediameter orientations in planar graphs
 I. Elem, , R. Hassin, and
J. Monnot
The minimum Gc cut problem
 A.
Glazer R. Hassin, and
I. Milchtaich
Timedifferentiated monopolies