Maximum Flow in (s, t) Planar Networks. - Refael Hassin (Inf. Process. Lett., 1981)

Generalizations of Hoffman's existence theorem for circulations. - Refael Hassin (Networks, 1981)

Minimum cost flow with set-constraints. - Refael Hassin (Networks, 1982)

The minimum cost flow problem: A unifying approach to dual algorithms and a new tree-search algorithm. - Refael Hassin (Math. Program., 1983)

A Dichotomous Search for a Geometric Random Variable. - Refael Hassin (Oper. Res., 1984)

Dichotomous Search for Random Objects on an Interval. - Refael Hassin; Mordechai I. Henig (Math. Oper. Res., 1984)

On multicommodity flows in planar graphs. - Refael Hassin (Networks, 1984)

An Optimal Algorithm for Finding all the Jumps of a Monotone Step-Function. - Refael Hassin; Nimrod Megiddo (J. Algorithms, 1985)

On Shortest Paths in Graphs with Random Weights. - Refael Hassin; Eitan Zemel (Math. Oper. Res., 1985)

An O(n log2 n) Algorithm for Maximum Flow in Undirected Planar Networks. - Refael Hassin; Donald B. Johnson 001 (SIAM J. Comput., 1985)

Multi-terminal maximum flows in node-capacitated networks. - Frieda Granot; Refael Hassin (Discret. Appl. Math., 1986)

A Deterministic Single-Item Inventory Model with Seller Holding Cost and Buyer Holding and Shortage Costs. - Amihai Glazer; Refael Hassin (Oper. Res., 1986)

Equilibrium Arrivals in Queues with Bulk Service at Scheduled Times. - Amihai Glazer; Refael Hassin (Transp. Sci., 1987)

Solution Bases of Multiterminal Cut Problems. - Refael Hassin (Math. Oper. Res., 1988)

Probabilistic Analysis of the Capacitated Transportation Problem. - Refael Hassin; Eitan Zemel (Math. Oper. Res., 1988)

Maximizing Classes of Two-Parameter Objectives Over Matroids. - Refael Hassin; Arie Tamir (Math. Oper. Res., 1989)

Ranking the Best Binary Trees. - Shoshana Anily; Refael Hassin (SIAM J. Comput., 1989)

Simultaneous Solution of Families of Problems. - Refael Hassin (SIGAL International Symposium on Algorithms, 1990)

Multiterminal xcut problems. - Refael Hassin (Ann. Oper. Res., 1991)

Approximation algorithms for hitting objects with straight lines. - Refael Hassin; Nimrod Megiddo (Discret. Appl. Math., 1991)

Exact Computation of Optimal Inventory Policies Over an Unbounded Horizon. - Refael Hassin; Nimrod Megiddo (Math. Oper. Res., 1991)

Improved complexity bounds for location problems on the real line. - Refael Hassin; Arie Tamir (Oper. Res. Lett., 1991)

Approximation Schemes for the Restricted Shortest Path Problem. - Refael Hassin (Math. Oper. Res., 1992)

The swapping problem. - Shoshana Anily; Refael Hassin (Networks, 1992)

Algorithms for the minimum cost circulation problem based on maximizing the mean improvement. - Refael Hassin (Oper. Res. Lett., 1992)

Mean Passage Times and Nearly Uncoupled Markov Chains. - Refael Hassin; Moshe Haviv (SIAM J. Discret. Math., 1992)

Monotonicity and Efficient Computation of Optimal Dichotomous Search. - Refael Hassin; Mordechai I. Henig (Discret. Appl. Math., 1993)

Approximating the Tree and Tour Covers of a Graph. - Esther M. Arkin; Magnús M. Halldórsson; Refael Hassin (Inf. Process. Lett., 1993)

Approximation Algorithms for the Geometric Covering Salesman Problem. - Esther M. Arkin; Refael Hassin (Discret. Appl. Math., 1994)

Maximizing the Number of Unused Colors in the Vertex Coloring Problem. - Refael Hassin; Shlomo Lahav (Inf. Process. Lett., 1994)

Approximations for the Maximum Acyclic Subgraph Problem. - Refael Hassin; Shlomi Rubinstein (Inf. Process. Lett., 1994)

optimal Separable Partitioning in the Plane. - Michal Benelli; Refael Hassin (Discret. Appl. Math., 1995)

On the Minimum Diameter Spanning Tree Problem. - Refael Hassin; Arie Tamir (Inf. Process. Lett., 1995)

Equilibrium strategies for queues with impatient customers. - Refael Hassin; Moshe Haviv (Oper. Res. Lett., 1995)

A Flow Algorithm for Network Synchronization. - Refael Hassin (Oper. Res., 1996)

On Local Search for Weighted k-Set Packing. - Esther M. Arkin; Refael Hassin (ESA, 1997)

Equilibrium Threshold Strategies: The Case of Queues with Priorities. - Refael Hassin; Moshe Haviv (Oper. Res., 1997)

An Approximation Algorithm for Maximum Packing of 3-Edge Paths. - Refael Hassin; Shlomi Rubinstein (Inf. Process. Lett., 1997)

Approximation Algorithms for Min-Max Tree Partition. - Nili Guttmann-Beck; Refael Hassin (J. Algorithms, 1997)

Restricted delivery problems on a network. - Esther M. Arkin; Refael Hassin; Limor Klein (Networks, 1997)

Approximation algorithms for maximum dispersion. - Refael Hassin; Shlomi Rubinstein; Arie Tamir (Oper. Res. Lett., 1997)

The Scheduling of Maintenance Service. - Shoshana Anily; Celia A. Glass; Refael Hassin (Discret. Appl. Math., 1998)

Approximation Algorithms for Minimum Tree Partition. - Nili Guttmann-Beck; Refael Hassin (Discret. Appl. Math., 1998)

Approximation Algorithms for Min-sum p-clustering. - Nili Guttmann-Beck; Refael Hassin (Discret. Appl. Math., 1998)

Graph partitions with minimum degree constraints. - Esther M. Arkin; Refael Hassin (Discret. Math., 1998)

An Approximation Algorithm for the Maximum Traveling Salesman Problem. - Refael Hassin; Shlomi Rubinstein (Inf. Process. Lett., 1998)

On Local Search for Weighted k-Set Packing. - Esther M. Arkin; Refael Hassin (Math. Oper. Res., 1998)

Scheduling maintenance services to three machines. - Shoshana Anily; Celia A. Glass; Refael Hassin (Ann. Oper. Res., 1999)

An approximation algorithm for MAX DICUT with given sizes of parts. - Alexander A. Ageev; Refael Hassin; Maxim Sviridenko (APPROX, 2000)

Approximating the maximum quadratic assignment problem. - Esther M. Arkin; Refael Hassin (SODA, 2000)

Robust Matchings and Maximum Clustering. - Refael Hassin; Shlomi Rubinstein (SWAT, 2000)

Approximation Algorithms for Minimum K-Cut. - Nili Guttmann-Beck; Refael Hassin (Algorithmica, 2000)

Approximation Algorithms with Bounded Performance Guarantees for the Clustered Traveling Salesman Problem. - Nili Guttmann-Beck; Refael Hassin; Samir Khuller; Balaji Raghavachari (Algorithmica, 2000)

Better approximations for max TSP. - Refael Hassin; Shlomi Rubinstein (Inf. Process. Lett., 2000)

Minimum-diameter covering problems. - Esther M. Arkin; Refael Hassin (Networks, 2000)

Approximating the maximum quadratic assignment problem. - Esther M. Arkin; Refael Hassin; Maxim Sviridenko (Inf. Process. Lett., 2001)

Approximation algorithms for maximum linear arrangement. - Refael Hassin; Shlomi Rubinstein (Inf. Process. Lett., 2001)

z-Approximations. - Refael Hassin; Samir Khuller (J. Algorithms, 2001)

A 0.5-Approximation Algorithm for MAX DICUT with Given Sizes of Parts. - Alexander A. Ageev; Refael Hassin; Maxim Sviridenko (SIAM J. Discret. Math., 2001)

Capacitated vertex covering with applications. - Sudipto Guha; Refael Hassin; Samir Khuller; Einat Or (SODA, 2002)

Approximations for Maximum Transportation Problem with Permutable Supply Vector and Other Capacitated Star Packing Problems. - Esther M. Arkin; Refael Hassin; Shlomi Rubinstein; Maxim Sviridenko (SWAT, 2002)

Nash Equilibrium and Subgame Perfection in Observable Queues. - Refael Hassin; Moshe Haviv (Ann. Oper. Res., 2002)

A note on orientations of mixed graphs. - Esther M. Arkin; Refael Hassin (Discret. Appl. Math., 2002)

Increasing digraph arc-connectivity by arc addition, reversal and complement. - Esther M. Arkin; Refael Hassin; Shimon Shahar (Discret. Appl. Math., 2002)

Complexity of finding dense subgraphs. - Yuichi Asahiro; Refael Hassin; Kazuo Iwama (Discret. Appl. Math., 2002)

A 7/8-approximation algorithm for metric Max TSP. - Refael Hassin; Shlomi Rubinstein (Inf. Process. Lett., 2002)

Approximation algorithms for constructing wavelength routing networks. - Refael Hassin; Asaf Levin (Networks, 2002)

Robust Matchings. - Refael Hassin; Shlomi Rubinstein (SIAM J. Discret. Math., 2002)

Differential Approximation for Some Routing Problems. - Cristina Bazgan; Refael Hassin; Jérôme Monnot (CIAC, 2003)

Subgraphs decomposable into two trees and k-edge-connected subgraphs. - Refael Hassin; Asaf Levin (Discret. Appl. Math., 2003)

Lexicographic local search and the p. - Refael Hassin; Asaf Levin; Dana Morad (Eur. J. Oper. Res., 2003)

Capacitated vertex covering. - Sudipto Guha; Refael Hassin; Samir Khuller; Einat Or (J. Algorithms, 2003)

Minimum spanning tree with hop restrictions. - Refael Hassin; Asaf Levin (J. Algorithms, 2003)

Reconstructing edge-disjoint paths. - Michele Conforti; Refael Hassin; R. Ravi 001 (Oper. Res. Lett., 2003)

Approximation algorithms for the metric maximum clustering problem with given cluster sizes. - Refael Hassin; Shlomi Rubinstein (Oper. Res. Lett., 2003)

Approximations for Maximum Transportation with Permutable Supply Vector and Other Capacitated Star Packing Problems. - Esther M. Arkin; Refael Hassin; Shlomi Rubinstein; Maxim Sviridenko (Algorithmica, 2004)

Approximation Algorithms for a Capacitated Network Design Problem. - Refael Hassin; R. Ravi 001; F. Sibel Salman (Algorithmica, 2004)

Minimum restricted diameter spanning trees. - Refael Hassin; Asaf Levin (Discret. Appl. Math., 2004)

Synthesis of 2-Commodity Flow Networks. - Refael Hassin; Asaf Levin (Math. Oper. Res., 2004)

An efficient polynomial time approximation scheme for the constrained minimum spanning tree problem using matroid intersection. - Refael Hassin; Asaf Levin (SIAM J. Comput., 2004)

An Approximation Algorithm for the Minimum Latency Set Cover Problem. - Refael Hassin; Asaf Levin (ESA, 2005)

The Set Cover with Pairs Problem. - Refael Hassin; Danny Segev (FSTTCS, 2005)

The Multi-radius Cover Problem. - Refael Hassin; Danny Segev (WADS, 2005)

Approximation Algorithms for Quickest Spanning Tree Problems. - Refael Hassin; Asaf Levin (Algorithmica, 2005)

Machine scheduling with earliness, tardiness and non-execution penalties. - Refael Hassin; Mati Shani (Comput. Oper. Res., 2005)

Approximation algorithms for some vehicle routing problems. - Cristina Bazgan; Refael Hassin; Jérôme Monnot (Discret. Appl. Math., 2005)

The Number of Solutions Sufficient for Solving a Family of Problems. - Ori Einstein; Refael Hassin (Math. Oper. Res., 2005)

The maximum saving partition problem. - Refael Hassin; Jérôme Monnot (Oper. Res. Lett., 2005)

On the complexity of the k-customer vehicle routing problem. - Refael Hassin; Shlomi Rubinstein (Oper. Res. Lett., 2005)

Equilibrium in Queueing Systems with Complementary Products. - Ari Veltman; Refael Hassin (Queueing Syst. Theory Appl., 2005)

A Better-Than-Greedy Approximation Algorithm for the Minimum Set Cover Problem. - Refael Hassin; Asaf Levin (SIAM J. Comput., 2005)

A Maximum Profit Coverage Algorithm with Application to Small Molecules Cluster Identification. - Refael Hassin; Einat Or (WEA, 2006)

An approximation algorithm for maximum triangle packing. - Refael Hassin; Shlomi Rubinstein (Discret. Appl. Math., 2006)

Erratum to "An approximation algorithm for maximum triangle packing": [Discrete Applied Mathematics 154 (2006) 971-979]. - Refael Hassin; Shlomi Rubinstein (Discret. Appl. Math., 2006)

Optimizing Chemotherapy Scheduling Using Local Search Heuristics. - Zvia Agur; Refael Hassin; Sigal Levy (Oper. Res., 2006)

An improved approximation algorithm for the metric maximum clustering problem with given cluster sizes. - Refael Hassin; Shlomi Rubinstein (Inf. Process. Lett., 2006)

Approximations for minimum and min-max vehicle routing problems. - Esther M. Arkin; Refael Hassin; Asaf Levin (J. Algorithms, 2006)

Who should be given priority in a queue? - Refael Hassin; Moshe Haviv (Oper. Res. Lett., 2006)

The minimum generalized vertex cover problem. - Refael Hassin; Asaf Levin (ACM Trans. Algorithms, 2006)

Robust subgraphs for trees and paths. - Refael Hassin; Danny Segev (ACM Trans. Algorithms, 2006)

Flow trees for vertex-capacitated networks. - Refael Hassin; Asaf Levin (Discret. Appl. Math., 2007)

Approximation algorithms and hardness results for labeled connectivity problems. - Refael Hassin; Jérôme Monnot; Danny Segev (J. Comb. Optim., 2007)

The k-path tree matroid and its applications to survivable network design. - Esther M. Arkin; Refael Hassin (Discret. Optim., 2008)

Scheduling Arrivals to Queues: A Single-Server Model with No-Shows. - Refael Hassin; Sharon Mendel (Manag. Sci., 2008)

Greedy heuristics with regret, with application to the cheapest insertion algorithm for the TSP. - Refael Hassin; Ariel Keinan (Oper. Res. Lett., 2008)

Rounding to an integral program. - Refael Hassin; Danny Segev (Oper. Res. Lett., 2008)

Tractable Cases of Facility Location on a Network with a Linear Reliability Order of Links. - Refael Hassin; R. Ravi 001; F. Sibel Salman (ESA, 2009)

Equilibrium solutions in the observable M/M/1 queue with overtaking. - Jenny Erlichman; Refael Hassin (VALUETOOLS, 2009)

Approximation algorithms for maximum latency and partial cycle cover. - Refael Hassin; Asaf Levin; Shlomi Rubinstein (Discret. Optim., 2009)

The use of relative priorities in optimizing the performance of a queueing system. - Refael Hassin; Justo Puerto; Francisco R. Fernández (Eur. J. Oper. Res., 2009)

Equilibrium customers' choice between FCFS and random servers. - Refael Hassin (Queueing Syst. Theory Appl., 2009)

Approximating the minimum quadratic assignment problems. - Refael Hassin; Asaf Levin; Maxim Sviridenko (ACM Trans. Algorithms, 2009)

The (K, k)-Capacitated Spanning Tree Problem. - Esther M. Arkin; Nili Guttmann-Beck; Refael Hassin (AAIM, 2010)

Multi-Color Pebble Motion on Graphs. - Gilad Goraly; Refael Hassin (Algorithmica, 2010)

The Complexity of Bottleneck Labeled Graph Problems. - Refael Hassin; Jérôme Monnot; Danny Segev (Algorithmica, 2010)

Min sum clustering with penalties. - Refael Hassin; Einat Or (Eur. J. Oper. Res., 2010)

Inducing search by periodic advertising. - Amihai Glazer; Refael Hassin (Inf. Econ. Policy, 2010)

On two restricted ancestors tree problems. - Nili Guttmann-Beck; Refael Hassin (Inf. Process. Lett., 2010)

Minimum diameter and cycle-diameter orientations on planar graphs - Nili Guttmann-Beck; Refael Hassin (CoRR, 2011)

On coloring the arcs of a tournament, covering shortest paths, and reducing the diameter of a graph. - Nili Guttmann-Beck; Refael Hassin (Discret. Optim., 2011)

Strategic Behavior and Social Optimization in Markovian Vacation Queues. - Pengfei Guo; Refael Hassin (Oper. Res., 2011)

Information cascades in a queueing system with parallel servers. - Refael Hassin; Ricky Roet-Green (VALUETOOLS, 2012)

The (K, k)-capacitated spanning tree problem. - Esther M. Arkin; Nili Guttmann-Beck; Refael Hassin (Discret. Optim., 2012)

Strategic behavior and social optimization in Markovian vacation queues: The case of heterogeneous customers. - Pengfei Guo; Refael Hassin (Eur. J. Oper. Res., 2012)

Series-parallel orientations preserving the cycle-radius. - Nili Guttmann-Beck; Refael Hassin (Inf. Process. Lett., 2012)

A local search algorithm for binary maximum 2-path partitioning. - Refael Hassin; Ohad Schneider (Discret. Optim., 2013)

On the advantage of leadership in service pricing competition. - Pengfei Guo; Refael Hassin (Oper. Res. Lett., 2013)

Regulation under partial cooperation: The case of a queueing system. - Gail Gilboa-Freedman; Refael Hassin (Oper. Res. Lett., 2014)

The Price of Anarchy in the Markovian Single Server Queue. - Gail Gilboa-Freedman; Refael Hassin; Yoav Kerner (IEEE Trans. Autom. Control., 2014)

Optimal Control of a Queue With High-Low Delay Announcements: The Significance of the Queue. - Alexandra Koshman-Kaz; Refael Hassin (EAI Endorsed Trans. Energy Web, 2015)

Equilibrium strategies for placing duplicate orders in a single server queue. - Pengfei Guo; Refael Hassin (Oper. Res. Lett., 2015)

Sequential scheduling on identical machines. - Refael Hassin; Uri Yovel (Oper. Res. Lett., 2015)

Strategic Overtaking in a Monopolistic M/M/1 Queue. - Jenny Erlichman; Refael Hassin (IEEE Trans. Autom. Control., 2015)

Self, Social and Monopoly Optimization in Observable Queues. - Refael Hassin; Ran I. Snitkovsky (VALUETOOLS, 2017)

Equilibrium and efficient clustering of arrival times to a queue. - Amihai Glazer; Refael Hassin; Liron Ravner (CoRR, 2017)

The Impact of Inspection Cost on Equilibrium, Revenue, and Social Welfare in a Single-Server Queue. - Refael Hassin; Ricky Roet-Green (Oper. Res., 2017)

Multiple facility location on a network with linear reliability order of edges. - Refael Hassin; R. Ravi 001; F. Sibel Salman (J. Comb. Optim., 2017)

Profit maximization in the M/M/1 queue. - Refael Hassin; Alexandra Koshman-Kaz (Oper. Res. Lett., 2017)

Customer equilibrium in a single-server system with virtual and system queues. - Roei Engel; Refael Hassin (Queueing Syst. Theory Appl., 2017)

Strategic customer behavior in a queueing system with a loss subsystem. - Refael Hassin; Ran I. Snitkovsky (Queueing Syst. Theory Appl., 2017)

On the price of anarchy in a single-server queue with heterogeneous service valuations induced by travel costs. - Refael Hassin; Irit Nowik; Yair Y. Shaki (Eur. J. Oper. Res., 2018)

Cascade equilibrium strategies in a two-server queueing system with inspection cost. - Refael Hassin; Ricky Roet-Green (Eur. J. Oper. Res., 2018)

Operations research applications of dichotomous search. - Refael Hassin; Anna Sarid (Eur. J. Oper. Res., 2018)

A Closed Queueing Network with Strategic Service Differentiation. - Michal Benelli; Refael Hassin (QTNA, 2019)

On Rational Behavior in a Loss System with One Observable Queue and One Unobservable Queue. - Refael Hassin; Jonathan H. P. Milo (QTNA, 2019)

The Approximability of Multiple Facility Location on Directed Networks with Random Arc Failures. - Refael Hassin; R. Ravi 001; F. Sibel Salman; Danny Segev (Algorithmica, 2020)

Social and Monopoly Optimization in Observable Queues. - Refael Hassin; Ran I. Snitkovsky (Oper. Res., 2020)

Strategic behaviour in a tandem queue with alternating server. - Nimrod Dvir; Refael Hassin; Uri Yechiali (Queueing Syst. Theory Appl., 2020)

Inefficiency in stochastic queueing systems with strategic customers. - Souvik Ghosh 002; Refael Hassin (Eur. J. Oper. Res., 2021)

Equilibrium and optimal one-shot delegated search. - Refael Hassin (IISE Trans., 2021)

Self-Selected Task Allocation. - Refael Hassin; Adam Nathaniel (Manuf. Serv. Oper. Manag., 2021)

On Queue-Length Information when Customers Travel to a Queue. - Refael Hassin; Ricky Roet-Green (Manuf. Serv. Oper. Manag., 2021)

Rational joining behavior in a queueing system with abandonments. - Michal Benelli; Refael Hassin (Oper. Res. Lett., 2021)

Greedy Differencing Edge-Contraction heuristic for the Max-Cut problem. - Refael Hassin; Nikita Leshenko (Oper. Res. Lett., 2021)

Integrality in the multinetwork min-cost equal-flow problem. - Refael Hassin; Renata Poznanski (Networks, 2022)

On equilibrium threshold strategies when choosing between observable and unobservable queues. - Nimrod Dvir; Refael Hassin; Moshe Haviv (Oper. Res. Lett., 2022)

Profit maximization and cost balancing in queueing systems. - Refael Hassin (Queueing Syst. Theory Appl., 2022)

Strategic behavior in queues with arrival rate uncertainty. - Refael Hassin; Moshe Haviv; Binyamin Oz (Eur. J. Oper. Res., 2023)

How Advance Sales Can Reduce Profits: When to Buy, When to Sell, and What Price to Charge. - Amihai Glazer; Refael Hassin; Irit Nowik (Manuf. Serv. Oper. Manag., 2023)

Queueing with Negative Network Effects. - Refael Hassin; Isaac Meilijson; Yael Perlman (Manuf. Serv. Oper. Manag., 2023)

On partitioning minimum spanning trees. - Nili Guttmann-Beck; Refael Hassin; Michal Stern (Discret. Appl. Math., 2024)

Pricing heterogeneous products to heterogeneous customers who buy sequentially. - Refael Hassin; Justo Puerto (Ann. Oper. Res., 2024)

A strategic double-ended queuing model for shared transportation. - Yuval Brief; Refael Hassin (Queueing Syst. Theory Appl., 2025)