The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Olivier Goldschmidt: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

Search in 0.001secs, Finished in 0.002secs
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
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002