- CSB - MetaPress - Google - Bing - Yahoo
 | 2012 | |
|---|---|---|
| j88 |      | Esther M. Arkin, Nili Guttmann-Beck, Refael Hassin: The (K, k)-capacitated spanning tree problem. Discrete Optimization 9(4): 258-266 (2012) |
| j87 | | Pengfei Guo, Refael Hassin: Strategic behavior and social optimization in Markovian vacation queues: The case of heterogeneous customers. European Journal of Operational Research 222(2): 278-286 (2012) |
| j86 | | Nili Guttmann-Beck, Refael Hassin: Series-parallel orientations preserving the cycle-radius. Inf. Process. Lett. 112(4): 153-160 (2012) |
| c30 | | Refael Hassin, Ricky Roet-Green: Information cascades in a queueing system with parallel servers. VALUETOOLS 2012: 31-37 |
| 2011 | ||
| j85 | | Nili Guttmann-Beck, Refael Hassin: On coloring the arcs of a tournament, covering shortest paths, and reducing the diameter of a graph. Discrete Optimization 8(2): 302-314 (2011) |
| j84 | | Pengfei Guo, Refael Hassin: Strategic Behavior and Social Optimization in Markovian Vacation Queues. Operations Research 59(4): 986-997 (2011) |
| i1 | | Nili Guttmann-Beck, Refael Hassin: Minimum diameter and cycle-diameter orientations on planar graphs. CoRR abs/1105.4770 (2011) |
| 2010 | ||
| j83 | | Refael Hassin, Jérôme Monnot, Danny Segev: The Complexity of Bottleneck Labeled Graph Problems. Algorithmica 58(2): 245-262 (2010) |
| j82 | | Gilad Goraly, Refael Hassin: Multi-Color Pebble Motion on Graphs. Algorithmica 58(3): 610-636 (2010) |
| j81 | | Refael Hassin, Einat Or: Min sum clustering with penalties. European Journal of Operational Research 206(3): 547-554 (2010) |
| j80 | | Amihai Glazer, Refael Hassin: Inducing search by periodic advertising. Information Economics and Policy 22(3): 276-286 (2010) |
| j79 | | Nili Guttmann-Beck, Refael Hassin: On two restricted ancestors tree problems. Inf. Process. Lett. 110(14-15): 570-575 (2010) |
| c29 | | Esther M. Arkin, Nili Guttmann-Beck, Refael Hassin: The (K, k)-Capacitated Spanning Tree Problem. AAIM 2010: 25-34 |
| 2009 | ||
| j78 | | Refael Hassin, Asaf Levin, Shlomi Rubinstein: Approximation algorithms for maximum latency and partial cycle cover. Discrete Optimization 6(2): 197-205 (2009) |
| j77 | | 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) |
| j76 | | Refael Hassin: Equilibrium customers' choice between FCFS and random servers. Queueing Syst. 62(3): 243-254 (2009) |
| j75 | | Refael Hassin, Asaf Levin, Maxim Sviridenko: Approximating the minimum quadratic assignment problems. ACM Transactions on Algorithms 6(1) (2009) |
| c28 | | Refael Hassin, R. Ravi, F. Sibel Salman: Tractable Cases of Facility Location on a Network with a Linear Reliability Order of Links. ESA 2009: 275-276 |
| c27 | | Jenny Erlichman, Refael Hassin: Equilibrium solutions in the observable M/M/1 queue with overtaking. VALUETOOLS 2009: 64 |
| 2008 | ||
| j74 | | Esther M. Arkin, Refael Hassin: The k-path tree matroid and its applications to survivable network design. Discrete Optimization 5(2): 314-322 (2008) |
| j73 | | Refael Hassin, Sharon Mendel: Scheduling Arrivals to Queues: A Single-Server Model with No-Shows. Management Science 54(3): 565-572 (2008) |
| j72 | | 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) |
| j71 | | |
| 2007 | ||
| j70 | | Refael Hassin, Asaf Levin: Flow trees for vertex-capacitated networks. Discrete Applied Mathematics 155(4): 572-578 (2007) |
| j69 | | 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) |
| c26 | | Refael Hassin, Jérôme Monnot, Danny Segev: The Complexity of Bottleneck Labeled Graph Problems. WG 2007: 328-340 |
| 2006 | ||
| j68 | | Refael Hassin, Shlomi Rubinstein: An approximation algorithm for maximum triangle packing. Discrete Applied Mathematics 154(6): 971-979 (2006) |
| j67 | | 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) |
| j66 | | Zvia Agur, Refael Hassin, Sigal Levy: Optimizing Chemotherapy Scheduling Using Local Search Heuristics. Operations Research 54(5): 829-846 (2006) |
| j65 | | 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) |
| j64 | | Esther M. Arkin, Refael Hassin, Asaf Levin: Approximations for minimum and min-max vehicle routing problems. J. Algorithms 59(1): 1-18 (2006) |
| j63 | | Refael Hassin, Moshe Haviv: Who should be given priority in a queue? Oper. Res. Lett. 34(2): 191-198 (2006) |
| j62 | | Refael Hassin, Asaf Levin: The minimum generalized vertex cover problem. ACM Transactions on Algorithms 2(1): 66-78 (2006) |
| j61 | | Refael Hassin, Danny Segev: Robust subgraphs for trees and paths. ACM Transactions on Algorithms 2(2): 263-281 (2006) |
| c25 | | Refael Hassin, Jérôme Monnot, Danny Segev: Approximation Algorithms and Hardness Results for Labeled Connectivity Problems. MFCS 2006: 480-491 |
| c24 | | |
| 2005 | ||
| j60 | | Refael Hassin, Mati Shani: Machine scheduling with earliness, tardiness and non-execution penalties. Computers & OR 32: 683-705 (2005) |
| j59 | | Cristina Bazgan, Refael Hassin, Jérôme Monnot: Approximation algorithms for some vehicle routing problems. Discrete Applied Mathematics 146(1): 27-42 (2005) |
| j58 | | Ori Einstein, Refael Hassin: The Number of Solutions Sufficient for Solving a Family of Problems. Math. Oper. Res. 30(4): 880-896 (2005) |
| j57 | | Refael Hassin, Shlomi Rubinstein: On the complexity of the k-customer vehicle routing problem. Oper. Res. Lett. 33(1): 71-76 (2005) |
| j56 | | Refael Hassin, Jérôme Monnot: The maximum saving partition problem. Oper. Res. Lett. 33(3): 242-248 (2005) |
| j55 | | Ari Veltman, Refael Hassin: Equilibrium in Queueing Systems with Complementary Products. Queueing Syst. 50(2-3): 325-342 (2005) |
| j54 | | Refael Hassin, Asaf Levin: A Better-Than-Greedy Approximation Algorithm for the Minimum Set Cover Problem. SIAM J. Comput. 35(1): 189-200 (2005) |
| c23 | | |
| c22 | | Refael Hassin, Asaf Levin: An Approximation Algorithm for the Minimum Latency Set Cover Problem. ESA 2005: 726-733 |
| c21 | | |
| c20 | | |
| c19 | | |
| 2004 | ||
| j53 | | 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) |
| j52 | | Refael Hassin, Asaf Levin: Approximation Algorithms for Quickest Spanning Tree Problems. Algorithmica 41(1): 43-52 (2004) |
| j51 | | Refael Hassin, Asaf Levin: Minimum restricted diameter spanning trees. Discrete Applied Mathematics 137(3): 343-357 (2004) |
| j50 | | Refael Hassin, Asaf Levin: Synthesis of 2-Commodity Flow Networks. Math. Oper. Res. 29(2): 280-288 (2004) |
| j49 | | 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) |
| c18 | | Refael Hassin, Asaf Levin: Approximation Algorithms for Quickest Spanning Tree Problems. ESA 2004: 395-402 |
| c17 | | Refael Hassin, Shlomi Rubinstein: An Approximation Algorithm for Maximum Triangle Packing. ESA 2004: 403-413 |
| c16 | | |
| 2003 | ||
| j48 | | Refael Hassin, R. Ravi, F. Sibel Salman: Approximation Algorithms for a Capacitated Network Design Problem. Algorithmica 38(3): 417-431 (2003) |
| j47 | | Refael Hassin, Asaf Levin: Subgraphs decomposable into two trees and k-edge-connected subgraphs. Discrete Applied Mathematics 126(2-3): 181-195 (2003) |
| j46 | | Refael Hassin, Asaf Levin, Dana Morad: Lexicographic local search and the p. European Journal of Operational Research 151(2): 265-279 (2003) |
| j45 | | Refael Hassin, Asaf Levin: Minimum spanning tree with hop restrictions. J. Algorithms 48(1): 220-238 (2003) |
| j44 | | Sudipto Guha, Refael Hassin, Samir Khuller, Einat Or: Capacitated vertex covering. J. Algorithms 48(1): 257-270 (2003) |
| j43 | | Refael Hassin, Shlomi Rubinstein: Approximation algorithms for the metric maximum clustering problem with given cluster sizes. Oper. Res. Lett. 31(3): 179-184 (2003) |
| j42 | | Michele Conforti, Refael Hassin, R. Ravi: Reconstructing edge-disjoint paths. Oper. Res. Lett. 31(3): 273-276 (2003) |
| c15 | | Cristina Bazgan, Refael Hassin, Jérôme Monnot: Differential Approximation for Some Routing Problems. CIAC 2003: 277-288 |
| c14 | | |
| 2002 | ||
| j41 | | Refael Hassin, Moshe Haviv: Nash Equilibrium and Subgame Perfection in Observable Queues. Annals OR 113(1-4): 15-26 (2002) |
| j40 | | Esther M. Arkin, Refael Hassin: A note on orientations of mixed graphs. Discrete Applied Mathematics 116(3): 271-278 (2002) |
| j39 | | Yuichi Asahiro, Refael Hassin, Kazuo Iwama: Complexity of finding dense subgraphs. Discrete Applied Mathematics 121(1-3): 15-26 (2002) |
| j38 | | 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) |
| j37 | | Refael Hassin, Shlomi Rubinstein: A 7/8-approximation algorithm for metric Max TSP. Inf. Process. Lett. 81(5): 247-251 (2002) |
| j36 | | Refael Hassin, Asaf Levin: Approximation algorithms for constructing wavelength routing networks. Networks 40(1): 32-37 (2002) |
| j35 | | |
| c13 | | |
| c12 | | Sudipto Guha, Refael Hassin, Samir Khuller, Einat Or: Capacitated vertex covering with applications. SODA 2002: 858-865 |
| c11 | | 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 |
| 2001 | ||
| j34 | | Esther M. Arkin, Refael Hassin, Maxim Sviridenko: Approximating the maximum quadratic assignment problem. Inf. Process. Lett. 77(1): 13-16 (2001) |
| j33 | | Refael Hassin, Shlomi Rubinstein: Approximation algorithms for maximum linear arrangement. Inf. Process. Lett. 80(4): 171-177 (2001) |
| j32 | | |
| j31 | | 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) |
| c10 | | |
| c9 | | Refael Hassin, Shlomi Rubinstein: A 7/8-Approximation Algorithm for Metric Max TSP. WADS 2001: 205-209 |
| 2000 | ||
| j30 | | Nili Guttmann-Beck, Refael Hassin: Approximation Algorithms for Minimum K-Cut. Algorithmica 27(2): 198-207 (2000) |
| j29 | | 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) |
| j28 | | Refael Hassin, Shlomi Rubinstein: Better approximations for max TSP. Inf. Process. Lett. 75(4): 181-186 (2000) |
| j27 | | |
| c8 | | Alexander A. Ageev, Refael Hassin, Maxim Sviridenko: An approximation algorithm for MAX DICUT with given sizes of parts. APPROX 2000: 34-41 |
| c7 | | Refael Hassin, R. Ravi, F. Sibel Salman: Approximation algorithms for a capacitated network design problem. APPROX 2000: 167-176 |
| c6 | | Esther M. Arkin, Refael Hassin: Approximating the maximum quadratic assignment problem. SODA 2000: 889-890 |
| c5 | | Refael Hassin, Shlomi Rubinstein: Approximation Algorithms for Maximum Linear Arrangement. SWAT 2000: 231-236 |
| c4 | | |
| 1998 | ||
| j26 | | Shoshana Anily, Celia A. Glass, Refael Hassin: The Scheduling of Maintenance Service. Discrete Applied Mathematics 82(1-3): 27-42 (1998) |
| j25 | | Nili Guttmann-Beck, Refael Hassin: Approximation Algorithms for Minimum Tree Partition. Discrete Applied Mathematics 87(1-3): 117-137 (1998) |
| j24 | | Nili Guttmann-Beck, Refael Hassin: Approximation Algorithms for Min-sum p-clustering. Discrete Applied Mathematics 89(1-3): 125-142 (1998) |
| j23 | | Esther M. Arkin, Refael Hassin: Graph partitions with minimum degree constraints. Discrete Mathematics 190(1-3): 55-65 (1998) |
| j22 | | Refael Hassin, Shlomi Rubinstein: An Approximation Algorithm for the Maximum Traveling Salesman Problem. Inf. Process. Lett. 67(3): 125-130 (1998) |
| c3 | | 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 |
| 1997 | ||
| j21 | | Refael Hassin, Shlomi Rubinstein: An Approximation Algorithm for Maximum Packing of 3-Edge Paths. Inf. Process. Lett. 63(2): 63-67 (1997) |
| j20 | | Nili Guttmann-Beck, Refael Hassin: Approximation Algorithms for Min-Max Tree Partition. J. Algorithms 24(2): 266-286 (1997) |
| j19 | | Esther M. Arkin, Refael Hassin, Limor Klein: Restricted delivery problems on a network. Networks 29(4): 205-216 (1997) |
| j18 | | Refael Hassin, Shlomi Rubinstein, Arie Tamir: Approximation algorithms for maximum dispersion. Oper. Res. Lett. 21(3): 133-137 (1997) |
| c2 | | |
| 1995 | ||
| j17 | | Michal Benelli, Refael Hassin: optimal Separable Partitioning in the Plane. Discrete Applied Mathematics 59(3): 215-224 (1995) |
| j16 | | Refael Hassin, Arie Tamir: On the Minimum Diameter Spanning Tree Problem. Inf. Process. Lett. 53(2): 109-111 (1995) |
| 1994 | ||
| j15 | | Esther M. Arkin, Refael Hassin: Approximation Algorithms for the Geometric Covering Salesman Problem. Discrete Applied Mathematics 55(3): 197-218 (1994) |
| j14 | | Refael Hassin, Shlomi Rubinstein: Approximations for the Maximum Acyclic Subgraph Problem. Inf. Process. Lett. 51(3): 133-140 (1994) |
| j13 | | Refael Hassin, Shlomo Lahav: Maximizing the Number of Unused Colors in the Vertex Coloring Problem. Inf. Process. Lett. 52(2): 87-90 (1994) |
| 1993 | ||
| j12 | | Refael Hassin, Mordechai I. Henig: Monotonicity and Efficient Computation of Optimal Dichotomous Search. Discrete Applied Mathematics 46(3): 221-234 (1993) |
| j11 | | 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 | ||
| j10 | | |
| j9 | | Refael Hassin, Moshe Haviv: Mean Passage Times and Nearly Uncoupled Markov Chains. SIAM J. Discrete Math. 5(3): 386-397 (1992) |
| 1991 | ||
| j8 | | Refael Hassin, Nimrod Megiddo: Approximation algorithms for hitting objects with straight lines. Discrete Applied Mathematics 30(1): 29-42 (1991) |
| 1990 | ||
| c1 | | Refael Hassin: Simultaneous Solution of Families of Problems. SIGAL International Symposium on Algorithms 1990: 288-299 |
| 1989 | ||
| j7 | | |
| 1985 | ||
| j6 | | Refael Hassin, Nimrod Megiddo: An Optimal Algorithm for Finding all the Jumps of a Monotone Step-Function. J. Algorithms 6(2): 265-274 (1985) |
| j5 | | Refael Hassin, Donald B. Johnson: An O(n log2 n) Algorithm for Maximum Flow in Undirected Planar Networks. SIAM J. Comput. 14(3): 612-624 (1985) |
| 1984 | ||
| j4 | | |
| 1982 | ||
| j3 | | |
| 1981 | ||
| j2 | | |
| j1 | | Refael Hassin: Generalizations of Hoffman's existence theorem for circulations. Networks 11(3): 243-254 (1981) |
Colors in the list of coauthors
Last update Wed May 22 12:03:59 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page