 | 2012 |
| 12 |  | Nili Guttmann-Beck,
Refael Hassin:
Series-parallel orientations preserving the cycle-radius.
Inf. Process. Lett. 112(4): 153-160 (2012) |
| 2011 |
| 11 |  | Nili Guttmann-Beck,
Refael Hassin:
Minimum diameter and cycle-diameter orientations on planar graphs
CoRR abs/1105.4770: (2011) |
| 10 |  | 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) |
| 2010 |
| 9 |  | Esther M. Arkin,
Nili Guttmann-Beck,
Refael Hassin:
The (K, k)-Capacitated Spanning Tree Problem.
AAIM 2010: 25-34 |
| 8 |  | Nili Guttmann-Beck,
Refael Hassin:
On two restricted ancestors tree problems.
Inf. Process. Lett. 110(14-15): 570-575 (2010) |
| 7 |  | Amir Beck,
Aharon Ben-Tal,
Nili Guttmann-Beck,
Luba Tetruashvili:
The CoMirror algorithm for solving nonsmooth constrained convex problems.
Oper. Res. Lett. 38(6): 493-498 (2010) |
| 2000 |
| 6 |  | Nili Guttmann-Beck,
Refael Hassin:
Approximation Algorithms for Minimum K-Cut.
Algorithmica 27(2): 198-207 (2000) |
| 5 |  | 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) |
| 1998 |
| 4 |  | 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 |
| 3 |  | Nili Guttmann-Beck,
Refael Hassin:
Approximation Algorithms for Minimum Tree Partition.
Discrete Applied Mathematics 87(1-3): 117-137 (1998) |
| 2 |  | Nili Guttmann-Beck,
Refael Hassin:
Approximation Algorithms for Min-sum p-clustering.
Discrete Applied Mathematics 89(1-3): 125-142 (1998) |
| 1997 |
| 1 |  | Nili Guttmann-Beck,
Refael Hassin:
Approximation Algorithms for Min-Max Tree Partition.
J. Algorithms 24(2): 266-286 (1997) |