The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Refael Hassin: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  87. The (K, k)-Capacitated Spanning Tree Problem. [Citation Graph (, )][DBLP]


  88. Tractable Cases of Facility Location on a Network with a Linear Reliability Order of Links. [Citation Graph (, )][DBLP]


  89. The Complexity of Bottleneck Labeled Graph Problems. [Citation Graph (, )][DBLP]


  90. Approximation algorithms for hitting objects with straight lines. [Citation Graph (, )][DBLP]


Search in 0.261secs, Finished in 0.264secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002