| 2003 |
|---|
| 11 | EE | Olivier Goldschmidt,
Alexandre Laugier,
Eli V. Olinick:
SONET/SDH Ring Assignment with Capacity Constraints.
Discrete Applied Mathematics 129(1): 99-128 (2003) |
| 10 | EE | Olivier Goldschmidt,
Dorit S. Hochbaum,
Asaf Levin,
Eli V. Olinick:
The SONET edge-partition problem.
Networks 41(1): 13-23 (2003) |
| 1997 |
|---|
| 9 | EE | Olivier Goldschmidt,
Dorit S. Hochbaum:
k-edge Subgraph Problems.
Discrete Applied Mathematics 74(2): 159-169 (1997) |
| 8 | | Gang Yu,
Olivier Goldschmidt:
Local Optimality and Its Application on Independent Sets for k-claw Free Graphs.
J. Comb. Optim. 1(2): 151-164 (1997) |
| 7 | EE | Michel Burlet,
Olivier Goldschmidt:
A new and improved algorithm for the 3-cut problem.
Oper. Res. Lett. 21(5): 225-227 (1997) |
| 1996 |
|---|
| 6 | EE | Michael F. Argüello,
Thomas A. Feo,
Olivier Goldschmidt:
Randomized methods for the number partitioning problem.
Computers & OR 23(2): 103-111 (1996) |
| 5 | EE | Olivier Goldschmidt,
Dorit S. Hochbaum,
Cor A. J. Hurkens,
Gang Yu:
Approximation Algorithms for the k-Clique Covering Problem.
SIAM J. Discrete Math. 9(3): 492-509 (1996) |
| 1993 |
|---|
| 4 | | Olivier Goldschmidt,
Dorit S. Hochbaum,
Gang Yu:
A Modified Greedy Heuristic for the Set Covering Problem with Improved Worst Case Bound.
Inf. Process. Lett. 48(6): 305-310 (1993) |
| 1990 |
|---|
| 3 | | Olivier Goldschmidt,
Dorit S. Hochbaum:
A Fast Perfect-Matching Algorithm in Random Graphs.
SIAM J. Discrete Math. 3(1): 48-57 (1990) |
| 2 | | Olivier Goldschmidt,
Dorit S. Hochbaum:
Asymptotically Optimal Linear Algorithm for the Minimum k-Cut in a Random Graph.
SIAM J. Discrete Math. 3(1): 58-73 (1990) |
| 1988 |
|---|
| 1 | | Olivier Goldschmidt,
Dorit S. Hochbaum:
Polynomial Algorithm for the k-Cut Problem
FOCS 1988: 444-451 |
