| 2009 |
|---|
| 95 | EE | Refael Hassin,
Asaf Levin,
Shlomi Rubinstein:
Approximation algorithms for maximum latency and partial cycle cover.
Discrete Optimization 6(2): 197-205 (2009) |
| 94 | EE | Refael Hassin,
Justo Puerto,
Francisco R. Fernández:
The use of relative priorities in optimizing the performance of a queueing system.
European Journal of Operational Research 193(2): 476-483 (2009) |
| 2008 |
|---|
| 93 | EE | Esther M. Arkin,
Refael Hassin:
The k-path tree matroid and its applications to survivable network design.
Discrete Optimization 5(2): 314-322 (2008) |
| 92 | EE | Refael Hassin,
Ariel Keinan:
Greedy heuristics with regret, with application to the cheapest insertion algorithm for the TSP.
Oper. Res. Lett. 36(2): 243-246 (2008) |
| 91 | EE | Refael Hassin,
Danny Segev:
Rounding to an integral program.
Oper. Res. Lett. 36(3): 321-326 (2008) |
| 2007 |
|---|
| 90 | EE | Refael Hassin,
Jérôme Monnot,
Danny Segev:
The Complexity of Bottleneck Labeled Graph Problems.
WG 2007: 328-340 |
| 89 | EE | Refael Hassin,
Asaf Levin:
Flow trees for vertex-capacitated networks.
Discrete Applied Mathematics 155(4): 572-578 (2007) |
| 88 | EE | Refael Hassin,
Jérôme Monnot,
Danny Segev:
Approximation algorithms and hardness results for labeled connectivity problems.
J. Comb. Optim. 14(4): 437-453 (2007) |
| 2006 |
|---|
| 87 | EE | Refael Hassin,
Jérôme Monnot,
Danny Segev:
Approximation Algorithms and Hardness Results for Labeled Connectivity Problems.
MFCS 2006: 480-491 |
| 86 | EE | Refael Hassin,
Einat Or:
A Maximum Profit Coverage Algorithm with Application to Small Molecules Cluster Identification.
WEA 2006: 265-276 |
| 85 | EE | Refael Hassin,
Asaf Levin:
The minimum generalized vertex cover problem.
ACM Transactions on Algorithms 2(1): 66-78 (2006) |
| 84 | EE | Refael Hassin,
Danny Segev:
Robust subgraphs for trees and paths.
ACM Transactions on Algorithms 2(2): 263-281 (2006) |
| 83 | EE | Refael Hassin,
Shlomi Rubinstein:
Erratum to "An approximation algorithm for maximum triangle packing": [Discrete Applied Mathematics 154 (2006) 971-979].
Discrete Applied Mathematics 154(18): 2620 (2006) |
| 82 | EE | Refael Hassin,
Shlomi Rubinstein:
An approximation algorithm for maximum triangle packing.
Discrete Applied Mathematics 154(6): 971-979 (2006) |
| 81 | EE | Refael Hassin,
Shlomi Rubinstein:
An improved approximation algorithm for the metric maximum clustering problem with given cluster sizes.
Inf. Process. Lett. 98(3): 92-95 (2006) |
| 80 | EE | Esther M. Arkin,
Refael Hassin,
Asaf Levin:
Approximations for minimum and min-max vehicle routing problems.
J. Algorithms 59(1): 1-18 (2006) |
| 79 | EE | Refael Hassin,
Moshe Haviv:
Who should be given priority in a queue?
Oper. Res. Lett. 34(2): 191-198 (2006) |
| 2005 |
|---|
| 78 | EE | Refael Hassin,
Einat Or:
Min Sum Clustering with Penalties.
ESA 2005: 167-178 |
| 77 | EE | Refael Hassin,
Asaf Levin:
An Approximation Algorithm for the Minimum Latency Set Cover Problem.
ESA 2005: 726-733 |
| 76 | EE | Refael Hassin,
Danny Segev:
The Set Cover with Pairs Problem.
FSTTCS 2005: 164-176 |
| 75 | EE | Refael Hassin,
Danny Segev:
The Multi-radius Cover Problem.
WADS 2005: 24-35 |
| 74 | EE | Refael Hassin,
Danny Segev:
Rounding to an Integral Program.
WEA 2005: 44-54 |
| 73 | EE | Refael Hassin,
Mati Shani:
Machine scheduling with earliness, tardiness and non-execution penalties.
Computers & OR 32: 683-705 (2005) |
| 72 | EE | Cristina Bazgan,
Refael Hassin,
Jérôme Monnot:
Approximation algorithms for some vehicle routing problems.
Discrete Applied Mathematics 146(1): 27-42 (2005) |
| 71 | EE | Refael Hassin,
Shlomi Rubinstein:
On the complexity of the k-customer vehicle routing problem.
Oper. Res. Lett. 33(1): 71-76 (2005) |
| 70 | EE | Refael Hassin,
Jérôme Monnot:
The maximum saving partition problem.
Oper. Res. Lett. 33(3): 242-248 (2005) |
| 69 | EE | Ari Veltman,
Refael Hassin:
Equilibrium in Queueing Systems with Complementary Products.
Queueing Syst. 50(2-3): 325-342 (2005) |
| 68 | EE | Refael Hassin,
Asaf Levin:
A Better-Than-Greedy Approximation Algorithm for the Minimum Set Cover Problem.
SIAM J. Comput. 35(1): 189-200 (2005) |
| 2004 |
|---|
| 67 | EE | Refael Hassin,
Asaf Levin:
Approximation Algorithms for Quickest Spanning Tree Problems.
ESA 2004: 395-402 |
| 66 | EE | Refael Hassin,
Shlomi Rubinstein:
An Approximation Algorithm for Maximum Triangle Packing.
ESA 2004: 403-413 |
| 65 | EE | Refael Hassin,
Danny Segev:
Robust Subgraphs for Trees and Paths.
SWAT 2004: 51-63 |
| 64 | EE | Esther M. Arkin,
Refael Hassin,
Shlomi Rubinstein,
Maxim Sviridenko:
Approximations for Maximum Transportation with Permutable Supply Vector and Other Capacitated Star Packing Problems.
Algorithmica 39(2): 175-187 (2004) |
| 63 | EE | Refael Hassin,
Asaf Levin:
Approximation Algorithms for Quickest Spanning Tree Problems.
Algorithmica 41(1): 43-52 (2004) |
| 62 | EE | Refael Hassin,
Asaf Levin:
Minimum restricted diameter spanning trees.
Discrete Applied Mathematics 137(3): 343-357 (2004) |
| 61 | EE | Refael Hassin,
Asaf Levin:
Synthesis of 2-Commodity Flow Networks.
Math. Oper. Res. 29(2): 280-288 (2004) |
| 60 | EE | Refael Hassin,
Asaf Levin:
An efficient polynomial time approximation scheme for the constrained minimum spanning tree problem using matroid intersection.
SIAM J. Comput. 33(2): 261-268 (2004) |
| 2003 |
|---|
| 59 | EE | Cristina Bazgan,
Refael Hassin,
Jérôme Monnot:
Differential Approximation for Some Routing Problems.
CIAC 2003: 277-288 |
| 58 | EE | Refael Hassin,
Asaf Levin:
The Minimum Generalized Vertex Cover Problem.
ESA 2003: 289-300 |
| 57 | EE | Refael Hassin,
R. Ravi,
F. Sibel Salman:
Approximation Algorithms for a Capacitated Network Design Problem.
Algorithmica 38(3): 417-431 (2003) |
| 56 | | Refael Hassin,
Asaf Levin:
Subgraphs decomposable into two trees and k-edge-connected subgraphs.
Discrete Applied Mathematics 126(2-3): 181-195 (2003) |
| 55 | EE | Refael Hassin,
Asaf Levin,
Dana Morad:
Lexicographic local search and the p.
European Journal of Operational Research 151(2): 265-279 (2003) |
| 54 | EE | Refael Hassin,
Asaf Levin:
Minimum spanning tree with hop restrictions.
J. Algorithms 48(1): 220-238 (2003) |
| 53 | EE | Sudipto Guha,
Refael Hassin,
Samir Khuller,
Einat Or:
Capacitated vertex covering.
J. Algorithms 48(1): 257-270 (2003) |
| 52 | EE | Refael Hassin,
Shlomi Rubinstein:
Approximation algorithms for the metric maximum clustering problem with given cluster sizes.
Oper. Res. Lett. 31(3): 179-184 (2003) |
| 51 | EE | Michele Conforti,
Refael Hassin,
R. Ravi:
Reconstructing edge-disjoint paths.
Oper. Res. Lett. 31(3): 273-276 (2003) |
| 2002 |
|---|
| 50 | EE | Refael Hassin,
Asaf Levin:
Minimum Restricted Diameter Spanning Trees.
APPROX 2002: 175-184 |
| 49 | EE | Sudipto Guha,
Refael Hassin,
Samir Khuller,
Einat Or:
Capacitated vertex covering with applications.
SODA 2002: 858-865 |
| 48 | EE | Esther M. Arkin,
Refael Hassin,
Shlomi Rubinstein,
Maxim Sviridenko:
Approximations for Maximum Transportation Problem with Permutable Supply Vector and Other Capacitated Star Packing Problems.
SWAT 2002: 280-287 |
| 47 | EE | Refael Hassin,
Moshe Haviv:
Nash Equilibrium and Subgame Perfection in Observable Queues.
Annals OR 113(1-4): 15-26 (2002) |
| 46 | | Esther M. Arkin,
Refael Hassin:
A note on orientations of mixed graphs.
Discrete Applied Mathematics 116(3): 271-278 (2002) |
| 45 | | Yuichi Asahiro,
Refael Hassin,
Kazuo Iwama:
Complexity of finding dense subgraphs.
Discrete Applied Mathematics 121(1-3): 15-26 (2002) |
| 44 | | Esther M. Arkin,
Refael Hassin,
Shimon Shahar:
Increasing digraph arc-connectivity by arc addition, reversal and complement.
Discrete Applied Mathematics 122(1-3): 13-22 (2002) |
| 43 | EE | Refael Hassin,
Shlomi Rubinstein:
A 7/8-approximation algorithm for metric Max TSP.
Inf. Process. Lett. 81(5): 247-251 (2002) |
| 42 | EE | Refael Hassin,
Asaf Levin:
Approximation algorithms for constructing wavelength routing networks.
Networks 40(1): 32-37 (2002) |
| 41 | EE | Refael Hassin,
Shlomi Rubinstein:
Robust Matchings.
SIAM J. Discrete Math. 15(4): 530-537 (2002) |
| 2001 |
|---|
| 40 | EE | Refael Hassin,
Asaf Levin:
Synthesis of 2-Commodity Flow Networks.
IPCO 2001: 226-235 |
| 39 | EE | Refael Hassin,
Shlomi Rubinstein:
A 7/8-Approximation Algorithm for Metric Max TSP.
WADS 2001: 205-209 |
| 38 | EE | Esther M. Arkin,
Refael Hassin,
Maxim Sviridenko:
Approximating the maximum quadratic assignment problem.
Inf. Process. Lett. 77(1): 13-16 (2001) |
| 37 | EE | Refael Hassin,
Shlomi Rubinstein:
Approximation algorithms for maximum linear arrangement.
Inf. Process. Lett. 80(4): 171-177 (2001) |
| 36 | EE | Refael Hassin,
Samir Khuller:
z-Approximations.
J. Algorithms 41(2): 429-442 (2001) |
| 35 | EE | Alexander A. Ageev,
Refael Hassin,
Maxim Sviridenko:
A 0.5-Approximation Algorithm for MAX DICUT with Given Sizes of Parts.
SIAM J. Discrete Math. 14(2): 246-255 (2001) |
| 2000 |
|---|
| 34 | EE | Refael Hassin,
R. Ravi,
F. Sibel Salman:
Approximation algorithms for a capacitated network design problem.
APPROX 2000: 167-176 |
| 33 | EE | Alexander A. Ageev,
Refael Hassin,
Maxim Sviridenko:
An approximation algorithm for MAX DICUT with given sizes of parts.
APPROX 2000: 34-41 |
| 32 | EE | Esther M. Arkin,
Refael Hassin:
Approximating the maximum quadratic assignment problem.
SODA 2000: 889-890 |
| 31 | EE | Refael Hassin,
Shlomi Rubinstein:
Approximation Algorithms for Maximum Linear Arrangement.
SWAT 2000: 231-236 |
| 30 | EE | Refael Hassin,
Shlomi Rubinstein:
Robust Matchings and Maximum Clustering.
SWAT 2000: 251-258 |
| 29 | EE | Nili Guttmann-Beck,
Refael Hassin:
Approximation Algorithms for Minimum K-Cut.
Algorithmica 27(2): 198-207 (2000) |
| 28 | EE | Nili Guttmann-Beck,
Refael Hassin,
Samir Khuller,
Balaji Raghavachari:
Approximation Algorithms with Bounded Performance Guarantees for the Clustered Traveling Salesman Problem.
Algorithmica 28(4): 422-437 (2000) |
| 27 | EE | Refael Hassin,
Shlomi Rubinstein:
Better approximations for max TSP.
Inf. Process. Lett. 75(4): 181-186 (2000) |
| 26 | EE | Esther M. Arkin,
Refael Hassin:
Minimum-diameter covering problems.
Networks 36(3): 147-155 (2000) |
| 1998 |
|---|
| 25 | | Nili Guttmann-Beck,
Refael Hassin,
Samir Khuller,
Balaji Raghavachari:
Approximation Algorithms with Bounded Performance Guarantees for the Clustered Traveling Salesman Problem.
FSTTCS 1998: 6-17 |
| 24 | EE | Shoshana Anily,
Celia A. Glass,
Refael Hassin:
The Scheduling of Maintenance Service.
Discrete Applied Mathematics 82(1-3): 27-42 (1998) |
| 23 | EE | Nili Guttmann-Beck,
Refael Hassin:
Approximation Algorithms for Minimum Tree Partition.
Discrete Applied Mathematics 87(1-3): 117-137 (1998) |
| 22 | EE | Nili Guttmann-Beck,
Refael Hassin:
Approximation Algorithms for Min-sum p-clustering.
Discrete Applied Mathematics 89(1-3): 125-142 (1998) |
| 21 | EE | Esther M. Arkin,
Refael Hassin:
Graph partitions with minimum degree constraints.
Discrete Mathematics 190(1-3): 55-65 (1998) |
| 20 | EE | Refael Hassin,
Shlomi Rubinstein:
An Approximation Algorithm for the Maximum Traveling Salesman Problem.
Inf. Process. Lett. 67(3): 125-130 (1998) |
| 1997 |
|---|
| 19 | | Esther M. Arkin,
Refael Hassin:
On Local Search for Weighted k-Set Packing.
ESA 1997: 13-22 |
| 18 | EE | Refael Hassin,
Shlomi Rubinstein:
An Approximation Algorithm for Maximum Packing of 3-Edge Paths.
Inf. Process. Lett. 63(2): 63-67 (1997) |
| 17 | | Nili Guttmann-Beck,
Refael Hassin:
Approximation Algorithms for Min-Max Tree Partition.
J. Algorithms 24(2): 266-286 (1997) |
| 16 | EE | Esther M. Arkin,
Refael Hassin,
Limor Klein:
Restricted delivery problems on a network.
Networks 29(4): 205-216 (1997) |
| 15 | EE | Refael Hassin,
Shlomi Rubinstein,
Arie Tamir:
Approximation algorithms for maximum dispersion.
Oper. Res. Lett. 21(3): 133-137 (1997) |
| 1995 |
|---|
| 14 | EE | Michal Benelli,
Refael Hassin:
optimal Separable Partitioning in the Plane.
Discrete Applied Mathematics 59(3): 215-224 (1995) |
| 13 | EE | Refael Hassin,
Arie Tamir:
On the Minimum Diameter Spanning Tree Problem.
Inf. Process. Lett. 53(2): 109-111 (1995) |
| 1994 |
|---|
| 12 | EE | Esther M. Arkin,
Refael Hassin:
Approximation Algorithms for the Geometric Covering Salesman Problem.
Discrete Applied Mathematics 55(3): 197-218 (1994) |
| 11 | | Refael Hassin,
Shlomi Rubinstein:
Approximations for the Maximum Acyclic Subgraph Problem.
Inf. Process. Lett. 51(3): 133-140 (1994) |
| 10 | | Refael Hassin,
Shlomo Lahav:
Maximizing the Number of Unused Colors in the Vertex Coloring Problem.
Inf. Process. Lett. 52(2): 87-90 (1994) |
| 1993 |
|---|
| 9 | EE | Refael Hassin,
Mordechai I. Henig:
Monotonicity and Efficient Computation of Optimal Dichotomous Search.
Discrete Applied Mathematics 46(3): 221-234 (1993) |
| 8 | | Esther M. Arkin,
Magnús M. Halldórsson,
Refael Hassin:
Approximating the Tree and Tour Covers of a Graph.
Inf. Process. Lett. 47(6): 275-282 (1993) |
| 1992 |
|---|
| 7 | | Refael Hassin,
Moshe Haviv:
Mean Passage Times and Nearly Uncoupled Markov Chains.
SIAM J. Discrete Math. 5(3): 386-397 (1992) |
| 1991 |
|---|
| 6 | EE | Refael Hassin,
Nimrod Megiddo:
Approximation algorithms for hitting objects with straight lines.
Discrete Applied Mathematics 30(1): 29-42 (1991) |
| 1990 |
|---|
| 5 | | Refael Hassin:
Simultaneous Solution of Families of Problems.
SIGAL International Symposium on Algorithms 1990: 288-299 |
| 1989 |
|---|
| 4 | | Shoshana Anily,
Refael Hassin:
Ranking the Best Binary Trees.
SIAM J. Comput. 18(5): 882-892 (1989) |
| 1985 |
|---|
| 3 | | Refael Hassin,
Nimrod Megiddo:
An Optimal Algorithm for Finding all the Jumps of a Monotone Step-Function.
J. Algorithms 6(2): 265-274 (1985) |
| 2 | | Refael Hassin,
Donald B. Johnson:
An O(n log² n) Algorithm for Maximum Flow in Undirected Planar Networks.
SIAM J. Comput. 14(3): 612-624 (1985) |
| 1981 |
|---|
| 1 | | Refael Hassin:
Maximum Flow in (s, t) Planar Networks.
Inf. Process. Lett. 13(3): 107 (1981) |
